Wardrop Equilibria and Price of Stability for Bottleneck Games with Splittable Traffic
- 715 Downloads
We look at the scenario of having to route a continuous rate of traffic from a source node to a sink node in a network, where the objective is to maximize throughput. This is of interest, e.g., for providers of streaming content in communication networks. The overall path latency, which was relevant in other non-cooperative network routing games such as the classic Wardrop model, is of lesser concern here.
To that end, we define bottleneck games with splittable traffic where the throughput on a path is inversely proportional to the maximum latency of an edge on that very path—the bottleneck latency. Therefore, we define a Wardrop equilibrium as a traffic distribution where this bottleneck latency is at minimum on all used paths. As a measure for the overall system well-being—called social cost—we take the weighted sum of the bottleneck latencies of all paths.
Our main findings are as follows: First, we prove social cost of Wardrop equilibria on series parallel graphs to be unique. Even more, for any graph whose subgraph induced by all simple start-destination paths is not series parallel, there exist games having equilibria with different social cost. For the price of stability, we give an independence result with regard to the network topology. Finally, our main result is giving a new exact price of stability for Wardrop/bottleneck games on parallel links with M/M/1 latency functions. This result is at the same time the exact price of stability for bottleneck games on general graphs.
KeywordsNash Equilibrium Social Cost Sink Node Latency Function Maximum Latency
Unable to display preview. Download preview PDF.
- 2.Anshelevich, E., Dasgupta, A., Kleinberg, J., Roughgarden, T., Tardos, É., Wexler, T.: The Price of Stability for Network Design with Fair Cost Allocation. In: Proc. of the 45th Annual Symposium on Foundations of Computer Science (FOCS 2004) (2004)Google Scholar
- 3.Banner, R., Orda, A.: Bottleneck Routing Games in Communication Networks. In: Proc. of the 25th Conference on Computer Communications (INFOCOM 2006) (to appear, 2006)Google Scholar
- 4.Beckmann, M., McGuire, C.B., Winsten, C.B.: Studies in the Economics of Transportation. Yale University Press (1956)Google Scholar
- 5.Bertsekas, D., Gallager, R.: Data Networks. Prentice-Hall, Englewood Cliffs (1987)Google Scholar
- 8.Cole, R., Dodis, Y., Roughgarden, T.: Bottleneck Links, Variable Demand, and the Tragedy of the Commons. In: Proc. of the 17th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2006), pp. 668–677 (2006)Google Scholar
- 9.Correa, J.R., Schulz, A.S., Stier-Moses, N.E.: Computational Complexity, Fairness, and the Price of Anarchy of the Maximum Latency Problem. In: Bienstock, D., Nemhauser, G.L. (eds.) IPCO 2004. LNCS, vol. 3064, pp. 59–73. Springer, Heidelberg (2004); An extended version will appear in Operations ResearchCrossRefGoogle Scholar
- 10.Czumaj, A., Krysta, P., Vöcking, B.: Selfish Traffic Allocation for Server Farms. In: Proc. of the 34th Annual ACM Symposium on Theory of Computing (STOC 2002), pp. 287–296 (2002)Google Scholar
- 11.Gairing, M., Lücking, T., Monien, B., Tiemann, K.: Nash Equilibria, the Price of Anarchy and the Fully Mixed Nash Equilibrium Conjecture. In: Caires, L., Italiano, G.F., Monteiro, L., Palamidessi, C., Yung, M. (eds.) ICALP 2005. LNCS, vol. 3580, pp. 51–65. Springer, Heidelberg (2005)CrossRefGoogle Scholar
- 12.Kleinrock, L.: Queueing Systems, vol. 1: Theory. Wiley-Interscience, Chichester (1975)Google Scholar
- 18.Robertazzi, T.G.: Computer Networks and Systems: Queuing Theory and Performance Evaluation. Springer, Heidelberg (2000)Google Scholar
- 20.Roughgarden, T.: The Maximum Latency of Selfish Routing. In: Proc. of the 15th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2004), pp. 980–981 (2004)Google Scholar
- 21.Roughgarden, T.: Selfish Routing and the Price of Anarchy. MIT Press, Cambridge (2005)Google Scholar
- 24.Schwarz, M.: Telecommunication Networks: Protocols, Modeling and Analysis. Addison-Wesley, Reading (1987)Google Scholar
- 25.Wardrop, J.G.: Some Theoretical Aspects of Road Traffic Research. In: Proc. of the Institute of Civil Engineers, Pt. II, vol. 1, pp. 325–378 (1952)Google Scholar