Stronger Bounds on Braess's Paradox and the Maximum Latency of Selfish Routing.
Henry C. LinTim RoughgardenÉva TardosAsher WalkoverPublished in: SIAM J. Discret. Math. (2011)
Keyphrases
- upper bound
- lower bound
- low latency
- packet forwarding
- load balance
- worst case
- routing problem
- network topology
- ad hoc networks
- resource allocation
- data transfer
- wireless ad hoc networks
- error bounds
- shortest path
- nash equilibrium
- travel distance
- confidence bounds
- upper and lower bounds
- lower and upper bounds
- data sets
- routing protocol
- response time
- cooperative