Constant Congestion Routing of Symmetric Demands in Planar Directed Graphs.
Chandra ChekuriAlina EneMarcin PilipczukPublished in: ICALP (2016)
Keyphrases
- directed graph
- dynamic routing
- random walk
- packet transmission
- single point
- routing problem
- service requirements
- routing algorithm
- routing decisions
- directed acyclic graph
- routing protocol
- graph structure
- network topology
- maximum flow
- undirected graph
- ad hoc networks
- link failure
- network reliability
- ip networks
- load balancing
- travel time
- web graph
- shortest path
- network topologies
- congestion control
- web pages
- special case