Switching White Papers
How Bad Is Selfish Routing?
Overview This paper considers the problem of routing traffic to optimize the performance of a congested network. A network, a rate of traffic between each pair of nodes, and a latency function for each edge specifying the time needed to traverse the edge given its congestion is given; the objective is to route traffic such that the sum of all travel times - the total latency - is minimized. In many settings, it may be expensive or impossible to regulate network traffic so as to implement an optimal assignment of routes. In the absence of regulation by some central authority, it assumes that each network user routes its traffic on the minimum-latency path available to it, given the network congestion caused by the other users.
| Publisher | Stanford University | File Format | |
|---|---|---|---|
| Date Published | December 2001 | ||
| Format | White Papers | ||
| Topics | |||
-
Did you find this white paper useful?
White Paper RSS
Download
Register
