Competitive routing in networks with polynomial costs.
Eitan AltmanTamer BasarTania JiménezNahum ShimkinPublished in: IEEE Trans. Autom. Control. (2002)
Keyphrases
- network topologies
- dynamic routing
- wireless ad hoc networks
- traffic engineering
- packet forwarding
- vapnik chervonenkis dimension
- routing problem
- network nodes
- social networks
- mobile wireless
- link failure
- path selection
- total cost
- packet switching
- internet protocol
- network design
- network analysis
- ad hoc networks
- routing protocol
- interconnection networks
- community structure
- complex networks
- network structure
- packet delivery
- node density
- shortest path