Abstract
This work is motivated by the observation that traffic in large networks like the Internet is not controlled by a central authority but rather by a large number of selfish agents interacting in a distributed manner. Game theory predicts that selfish behaviour in such a system leads to a Nash equilibrium, but it does not, in general, explain, how such an equilibrium can be reached. We focus on this dynamic aspect.
In the first part of this survey, we develop a dynamic model of selfish, adaptive behaviour in routing networks. We show how and under which conditions such behaviour can give rise to a stable state and analyse the convergence time. Based on these results we design a distributed algorithm to compute approximate equlibria.
In the second part, we build upon the theory developed so far in order to design an online traffic engineering protocol which proceeds by adapting route weights on the time scale of seconds. We show that our protocol converges quickly and significantly improves network performance.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Ackermann, H., Röglin, H., Vöcking, B.: On the impact of combinatorial structure on congestion games. In: Proc. 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS), pp. 613–622 (2006)
Awerbuch, B., Azar, Y., Epstein, A.: The price of routing unsplittable flow. In: Proc. 37th Annual ACM Symposium on Theory of Computing, STOC (2005)
Awerbuch, B., Khandekar, R., Rao, S.: Distributed algorithms for multicommodity flow problems via approximate steepest descent framework. In: Proc. 18th Annual ACM–SIAM Symposium on Discrete Algorithms, SODA (2007)
Awerbuch, B., Kleinberg, R.D.: Adaptive routing with end-to-end feedback: Distributed learning and geometric approaches. In: Proc. 36th Annual ACM Symposium on Theory of Computing (STOC), pp. 45–53 (2004)
Balon, S., Lepropre, J., Monfort, G.: TOTEM—TOolbox for Traffic Engineering Methods, http://totem.run.montefiore.ulg.ac.be/
Beckmann, M., McGuire, C.B., Winsten, C.B.: Studies in the Economics of Transportation. Yale University Press (1956)
Berenbrink, P., Friedetzky, T., Goldberg, L.A., Goldberg, P., Hu, Z., Martin, R.: Distributed selfish load balancing. In: Proc. 17th Annual ACM–SIAM Symposium on Discrete Algorithms, SODA (2006)
Bertsekas, D.P., Tsitsiklis, J.N.: Parallel and Distributed Computing: Numerical Methods. Athena Scientific (1989)
Blum, A., Even-Dar, E., Ligett, K.: Routing without regret: On convergence to Nash equilibria of regret-minimizing algorithms in routing games. In: Proc. 25th Annual ACM Symposium on Principles of Distributed Computing (PODC), Denver, Colorado, USA, July 2006, pp. 45–52. ACM, New York (2006)
Cao, J., Nyberg, C.: An approximate analysis of load balancing using stale state information for servers in parallel. In: Proc. 2nd IASTED International Conference on Communications Internet and Information Technology (November 2003)
Cao, Z., Wang, Z., Zegura, E.W.: Performance of hashing-based schemes for Internet load balancing. In: Proc. IEEE INFOCOM Conference (2000)
Christodoulou, G., Koutsoupias, E.: The price of anarchy of finite congestion games. In: Proc. 37th Annual ACM Symposium on Theory of Computing, STOC (2005)
Cole, R., Dodis, Y., Roughgarden, T.: How much can taxes help selfish routing? In: Proc. 4th ACM Conference on Electronic Commerce, pp. 98–107 (2003)
Cominetti, R., Correa, J.R., Moses, N.E.S.: Network games with atomic players. In: Bugliesi, M., Preneel, B., Sassone, V., Wegener, I. (eds.) ICALP 2006. LNCS, vol. 4051, pp. 525–536. Springer, Heidelberg (2006)
Dreger, H., Feldmann, A., Mai, M., Paxson, V., Sommer, R.: Dynamic application-layer protocol analysis for network intrusion detection. In: Proc.15th Usenix Security Symposium (2006)
Even-Dar, E., Mansour, Y.: Fast convergence of selfish rerouting. In: Proc. 16th Annual ACM–SIAM Symposium on Discrete Algorithms (SODA), pp. 772–781 (2005)
Fabrikant, A., Papadimitriou, C., Talwar, K.: The complexity of pure Nash equilibria. In: Proc. 36th Annual ACM Symposium on Theory of Computing (STOC), pp. 604–612 (2004)
Fischer, S., Kammenhuber, N., Feldmann, A.: ReplEx—dynamic traffic engineering based on Wardrop routing policies. In: Proc. CoNext, Lisboa, Portugal (2006)
Fischer, S., Olbrich, L., Vöcking, B.: Approximating Wardrop equilibria with finitely many agents. In: Pelc, A. (ed.) DISC 2007. LNCS, vol. 4731, pp. 238–252. Springer, Heidelberg (2007)
Fischer, S., Räcke, H., Vöcking, B.: Fast convergence to Wardrop equilibria by adaptive sampling methods. In: Proc. 38th Annual ACM Symposium on Theory of Computing (STOC), Seattle, WA, USA, May 2006, pp. 653–662. ACM, New York (2006)
Fischer, S., Vöcking, B.: On the evolution of selfish routing. In: Albers, S., Radzik, T. (eds.) ESA 2004. LNCS, vol. 3221, pp. 323–334. Springer, Heidelberg (2004)
Fischer, S., Vöcking, B.: Adaptive routing with stale information. In: Proc. 24th Annual ACM Symposium on Principles of Distributed Computing (PODC), Las Vegas, NV, USA, pp. 276–283. ACM, New York (2005)
Fleischer, L.: Linear tolls suffice: New bounds and algorithms for tolls in single source networks. In: Díaz, J., Karhumäki, J., Lepistö, A., Sannella, D. (eds.) ICALP 2004. LNCS, vol. 3142, pp. 544–554. Springer, Heidelberg (2004)
Fortz, B., Rexford, J., Thorup, M.: Traffic engineering with traditional IP routing protocols. IEEE Communication Magazine, 118–124 (2002)
Fortz, B., Thorup, M.: Internet traffic engineering by optimizing OSPF weights. In: Proc. IEEE INFOCOM Conference (2000)
Fortz, B., Thorup, M.: Optimizing OSPF/IS-IS weights in a changing world. IEEE Journal on Selected Areas in Communications 20(4) (2002)
Haurie, A.B., Marcotte, P.: On the relationship between Nash-Cournot and Wardrop equilibria. Networks 15, 295–308 (1985)
Hayrapetyan, A., Tardos, É., Wexler, T.: The effect of collusion in congestion games. In: Proc. 38th Annual ACM Symposium on Theory of Computing (STOC), pp. 89–98 (2006)
Kammenhuber, N.: Traffic Adaptive Routing. Ph.D thesis, Technische Universität München (2008)
Khanna, A., Zinky, J.: The revised ARPANET routing metric. In: Proc. ACM SIGCOMM Conference (1989)
Khanna, A., Zinky, J.A.: The revised ARPANET routing metric. In: Proc. ACM SIGCOMM Conference on Applications, Technologies, Architectures, and Protocols for Computer Communication (SIGCOMM), September 1998, pp. 45–56. ACM, New York (1998)
Kurose, J.F., Ross, K.W.: Computer Networking, a top down approach featuring the Internet, 3rd edn. Addison-Wesley Longman, Amsterdam (2004)
Laor, M., Gendel, L.: The effect of packet reordering in a backbone link on application throughput. IEEE Network (September/October 2002)
Mitzenmacher, M.: How useful is old information? IEEE Transactions on Parallel and Distributed Systems 11(1), 6–20 (2000)
Park, K., Willinger, W. (eds.): Self-Similar Network Traffic and Performance Evaluation. Wiley-Interscience, Hoboken (2000)
Rexford, J.: Route optimization in IP networks. In: Handbook of Optimization in Telecommunications. Kluwer Academic Publishers, Dordrecht (2005)
Rosenthal, R.W.: A class of games possessing pure-strategy Nash equilibria. International Journal of Game Theory 2, 65–67 (1973)
Roughan, M., Thorup, M., Zhang, Y.: Traffic engineering with estimated traffic matrices. In: Proc. ACM Measurement Conference (2003)
Roughgarden, T.: Stackelberg scheduling strategies. In: Proc. 33rd Annual ACM Symposium on Theory of Computing (STOC), pp. 104–113 (2001)
Roughgarden, T.: The price of anarchy is independent of the network topology. Journal of Computer and System Sciences 67(2), 341–367 (2003)
Roughgarden, T.: The maximum latency of selfish routing. In: Proc. 15th Annual ACM–SIAM Symposium on Discrete Algorithms (SODA), pp. 973–974 (2005)
Roughgarden, T., Tardos, É.: How bad is selfish routing? Journal of the ACM 49(2), 236–259 (2002)
Savage, S., Collins, A., Hoffman, E., Snell, J., Anderson, T.E.: The end-to-end effects of internet path selection. In: Proc. ACM SIGCOMM Conference on Applications, Technologies, Architectures, and Protocols for Computer Communication (SIGCOMM), Boston, MA, pp. 289–299 (1999)
Spring, N., Mahajan, R., Wetherall, D.: Measuring ISP topologies with Rocketfuel. In: Proc. ACM SIGCOMM Conference on Applications, Technologies, Architectures, and Protocols for Computer Communication (SIGCOMM), Pittsburgh, PA, USA, August 2002, pp. 133–145. ACM, New York (2002)
Teixeira, R., Duffield, N., Rexford, J., Roughan, M.: Traffic matrix reloaded: Impact of routing changes. In: Proc. Passive and Active Measurement (2005)
Wang, H., Xie, H., Qiu, L., Yang, Y.R., Zhang, Y., Greenberg, A.: COPE: Traffic engineering in dynamic networks. In: Proc. ACM SIGCOMM Conference (2006)
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)
Xiao, X., Hannan, A., Bailey, B., Ni, L.: Traffic engineering with MPLS in the Internet. IEEE Network Magazine (March 2000)
Zhang, C., Ge, Z., Kurose, J., Liu, Y., Towsley, D.: Optimal routing with multiple traffic matrices: Tradeoff between average case and worst case performance. In: Proc. 13th International Conference on Network Protocols, ICNP (2005)
Zhang, Y., Roughan, M., Lund, C., Donoho, D.: An information-theoretic approach to traffic matrix estimation. In: Proc. ACM SIGCOMM Conference (2003)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Feldmann, A., Fischer, S., Kammenhuber, N., Vöcking, B. (2009). Management of Variable Data Streams in Networks. In: Lerner, J., Wagner, D., Zweig, K.A. (eds) Algorithmics of Large and Complex Networks. Lecture Notes in Computer Science, vol 5515. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-02094-0_13
Download citation
DOI: https://doi.org/10.1007/978-3-642-02094-0_13
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-02093-3
Online ISBN: 978-3-642-02094-0
eBook Packages: Computer ScienceComputer Science (R0)