Hardness of routing with congestion in directed graphs.
Julia ChuzhoyVenkatesan GuruswamiSanjeev KhannaKunal TalwarPublished in: STOC (2007)
Keyphrases
- directed graph
- dynamic routing
- packet transmission
- random walk
- routing decisions
- routing problem
- routing algorithm
- travel time
- network topology
- routing protocol
- np hard
- strongly connected
- directed acyclic graph
- maximum flow
- computational complexity
- phase transition
- np complete
- ip networks
- undirected graph
- graph structure
- web graph
- learning algorithm
- traffic congestion
- special case
- worst case
- heavy traffic
- graph structures
- network topologies
- packet loss
- traffic engineering
- link failure
- structured data
- disjoint paths
- ad hoc networks