Article

Free access

On selfish routing in internet-like environments

Authors:

Yang Richard Yang,

Scott ShenkerAuthors Info & Claims

SIGCOMM '03: Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications

August 2003

Pages 151 - 162

https://doi.org/10.1145/863955.863974

Published: 25 August 2003 Publication History

Abstract

A recent trend in routing research is to avoid inefficiencies in network-level routing by allowing hosts to either choose routes themselves (e.g., source routing) or use overlay routing networks (e.g., Detour or RON). Such approaches result in selfish routing, because routing decisions are no longer based on system-wide criteria but are instead designed to optimize host-based or overlay-based metrics. A series of theoretical results showing that selfish routing can result in suboptimal system behavior have cast doubts on this approach. In this paper, we use a game-theoretic approach to investigate the performance of selfish routing in Internet-like environments. We focus on intra-domain network environments and use realistic topologies and traffic demands in our simulations. We show that in contrast to theoretical worst cases, selfish routing achieves close to optimal average latency in such environments. However, such performance benefit comes at the expense of significantly increased congestion on certain links. Moreover, the adaptive nature of selfish overlays can significantly reduce the effectiveness of traffic engineering by making network traffic less predictable.

References

[1]

R. K. Ahuja, T. L. Magnanti, and J. B. Orlin. Network Flows: Theory, Algorithms, and Applications. Prentice Hall, Upper Saddle River, New Jersey, 1993.

Digital Library

[2]

A. Akella, S. Seshan, R. Karp, and S. Shenker. Selfish behavior and stability of the Internet: A game-theoretic analysis of TCP. In Proceedings of ACM SIGCOMM '02, Pittsburgh, PA, Aug. 2002.

Digital Library

[3]

E. Altman, R. E. Azouzi, and A. Vyacheslav. Non-cooperative routing in loss networks. In Proceedings of Performance '02, Rome, Italy, Sept. 2002.

Digital Library

[4]

E. Altman, T. Boulogne, R. E. Azouzi, and T. Jimenez. A survey on networking games. Telecommunication Systems, Nov. 2000.

[5]

D. G. Andersen, H. Balakrishnan, M. F. Kaashoek, and R. Morris. Resilient overlay networks. In Proceedings of SOSP '01, Banff, Canada, Oct. 2001.

Digital Library

[6]

D. O. Awduche. MPLS and traffic engineering in IP networks. IEEE Communication Magazine, pages 42--47, Dec. 1999.

Digital Library

[7]

T. Boulogne, E. Altman, O. Pourtallier, and H. Kameda. Mixed equilibrium for multiclass routing games. IEEE Transactions on Automatic Control, 47(6):903--916, Jun. 2002.

[8]

I. Castineyra, N. Chiappa, and M. Steenstrup. The Nimrod Routing Architecture, RFC 1992, Aug. 1996.

Digital Library

[9]

A. Chen, D.-H. Lee, and R. Javakrishnan. Computational study of state-of-the-art path-based traffic assignment algorithms. Mathematics and Computers in Simulation, pages 509--518, 2002.

Digital Library

[10]

A. Collins. The Detour framework for packet rerouting. PhD Qualifying Examination, Nov. 1998.

[11]

M. Faloutsos, P. Faloutsos, and C. Faloutsos. On power-law relationships of the Internet topology. In Proceedings of ACM SIGCOMM '99, Cambridge, MA, Aug. 1999.

Digital Library

[12]

A. Feldmann, A. Greenberg, C. Lund, N. Reingold, and J. Rexford. Deriving traffic demands for operational IP networks: Methodology and experience. IEEE/ACM Transactions on Networking, Jun. 2001.

Digital Library

[13]

M. Florian and D. Hearn. Network Routing, chapter 6, Network equilibrium models and algorithms. Elsevier Science, 1995.

[14]

B. Fortz, J. Rexford, and M. Thorup. Traffic engineering with traditional IP routing protocols. IEEE Comm. Magazine, Oct. 2002.

Digital Library

[15]

B. Fortz and M. Thorup. Internet traffic engineering by optimizing OSPF weights. In Proceedings of IEEE INFOCOM '00, Tel Aviv, Israel, Mar. 2000.

[16]

E. Friedman. Selfish routing on data networks isn't too bad: Genericity, TCP, and OSPF. Working paper. Available from http://www.orie.cornell.edu/~friedman/papers.html, Oct. 2002.

[17]

L. Gao. On inferring autonomous system relationships in the Internet. IEEE/ACM Transactions on Networking, 9(6), Dec. 2001.

Digital Library

[18]

D. Gross and C. Harris. Fundamentals of Queueing Theory. John Wiley, 3rd edition, 1998.

Digital Library

[19]

C. M. Harris, P. H. Brill, and M. J. Fischer. Internet-type queues with power-tailed interarrival times and computational methods for their analysis. INFORMS Journal on Computing, pages 261--271, 2000.

Digital Library

[20]

S. Iyer, S. Bhattacharyya, N. Taft, and C. Diot. An approach to alleviate link overload as observed on an IP backbone. In Proccedings of IEEE INFOCOM '03, San Francisco, CA, Apr. 2003.

[21]

Y. A. Korilis, A. A. Lazar, and A. Orda. Architecting noncooperative networks. IEEE Journal of Selected Areas in Communications, 13(7):1241--1251, Sept. 1995.

Digital Library

[22]

E. Koutsoupias and C. Papadimitriou. Worst-case equilibria. In Proceedings of the 16th Annual Symposium on Theoretical Aspects of Computer Science, pages 404--413, 1999.

Digital Library

[23]

J. B. Krawczyk and S. Berridge. Relaxation algorithms in finding Nash equilibria. In Computational Economics from Economics Working Paper Archive at WUSTL, Jul. 1997.

[24]

lp_solve. ftp://ftp.ics.ele.tue.nl/pub/lp_solve/.

[25]

A. Medina, A. Lakhina, I. Matta, and J. Byers. BRITE: Boston University representative Internet topology generator. Available from http://www.cs.bu.edu/brite.

[26]

Multiprotocol label switching (MPLS). http://www.ietf.org/html.charters/mpls-charter.html.

[27]

The network simulator: ns-2. http://www.isi.edu/nsnam/ns/.

[28]

Open shortest path first (OSPF). http://www.ietf.org/html.charters/ospf-charter.html.

[29]

M. Patriksson. Algorithms for computing traffic equilibria. In Networks and Spatial Economics. 2003. http://www.cs.chalmers.se/~mipat/LATEX/NSE.ps.

[30]

T. Roughgarden. Selfish Routing. PhD thesis, Cornell University, May 2002.

Digital Library

[31]

T. Roughgarden and E. Tardos. How bad is selfish routing? Journal of ACM, 49(2):236--259, 2002.

Digital Library

[32]

S. Savage, T. Anderson, A. Aggarwal, D. Becker, N. Cardwell, A. Collins, E. Hoffman, J. Snell, A. Vahdat, G. Voelker, and J. Zahorjan. Detour: a case for informed Internet routing and transport. In IEEE Micro, volume 19(1), pages 50--59, Jan. 1999.

Digital Library

[33]

S. Savage, A. Collins, E. Hoffman, J. Snell, and T. Anderson. The end-to-end effects of Internet path selection. In Proceedings of ACM SIGCOMM '99, pages 289--299, Cambridge, MA, Aug. 1999.

Digital Library

[34]

Y. Sheffi. Urban Transportation Networks: Equilibrium Analysis with Mathematical Programming Methods. Prentice-Hall, 1985.

[35]

S. Shenker. Making greedy work in networks: A game-theoretic analysis of switch service discipline. IEEE/ACM Transactions on Networking, 3, 1995.

Digital Library

[36]

N. Spring, R. Mahajan, and D. Wetherall. Measuring ISP topologies with Rocketfuel. In Proceedings of ACM SIGCOMM '02, Pittsburgh, PA, Aug. 2002.

Digital Library

[37]

J. W. Stewart. BGP4: Inter-Domain Routing in the Internet. Addison Wesley, 1998.

Digital Library

[38]

L. Subrmanian, S. Agarwal, J. Rexford, and R. Katz. Characterizing the Internet hierarchy from multiple vantage points. In Proceedings of IEEE INFOCOM '02, New York, NY, June 2002.

[39]

H. Tangmunarunkit, R. Govindan, S. Jamin, S. Shenker, and W. Willinger. Network topology generators: Degree-based vs. structural. In Proceedings of ACM SIGCOMM '02, Pittsburgh, PA, Aug. 2002.

Digital Library

[40]

H. Tangmunarunkit, R. Govindan, S. Shenker, and D. Estrin. The impact of routing policy on Internet paths. In Proceedings of IEEE INFOCOM '01, Anchorage, AK, Apr. 2001.

[41]

S. Uryas'ev and R. Y. Rubinstein. On relaxation algorithms in computation of noncooperative equilibria. IEEE Transactions on Automatic Control, 39(6):1263--1267, Jun. 1995.

[42]

X. Xiao, A. Hannan, B. Bailey, and L. Ni. Traffic engineering with MPLS in the Internet. IEEE Network Magazine, Mar. 2000.

Digital Library

[43]

E. Zegura, M. Ammar, Z. Fei, and S. Bhattacharjee. Application-layer anycasting: A server selection architecture and use in a replicated web service. IEEE/ACM Transactions on Networking, 8(4), Aug. 2000.

Digital Library

[44]

Y. Zhang, M. Roughan, N. Duffield, and A. Greenberg. Fast accurate computation of large-scale IP traffic matrices from link loads. In Proceedings of ACM SIGMETRICS '03, Jun. 2003.

Digital Library

Cited By

Mancuso VBadia LCastagno PSereno MAjmone Marsan M(2024)Effectiveness of distributed stateless network server selection under strict latency constraintsComputer Networks10.1016/j.comnet.2024.110558(110558)Online publication date: Jun-2024
https://doi.org/10.1016/j.comnet.2024.110558
Scherrer SLegner MPerrig ASchmid S(2021)An axiomatic perspective on the performance effects of end-host path selectionPerformance Evaluation10.1016/j.peva.2021.102233151(102233)Online publication date: Nov-2021
https://doi.org/10.1016/j.peva.2021.102233
Zhang YLi GXiong CLei YHuang WHan YWalid AYang YZhang Z(2020)MoWIEProceedings of the Workshop on Network Application Integration/CoDesign10.1145/3405672.3409489(20-27)Online publication date: 14-Aug-2020
https://dl.acm.org/doi/10.1145/3405672.3409489
Show More Cited By

Index Terms

On selfish routing in internet-like environments
1. Networks
  1. Network protocols
    1. Transport protocols
  2. Network types
    1. Public Internet

Recommendations

On selfish routing in internet-like environments

A recent trend in routing research is to avoid inefficiencies in network-level routing by allowing hosts to either choose routes themselves (e.g., source routing) or use overlay routing networks (e.g., Detour or RON). Such approaches result in selfish ...
Read More
How much can taxes help selfish routing?
EC '03: Proceedings of the 4th ACM conference on Electronic commerce

We study economic incentives for influencing selfish behavior in networks. We consider a model of selfish routing in which the latency experienced by network traffic on an edge of the network is a function of the edge congestion, and network users are ...
Read More
Stackelberg Strategies for Selfish Routing in General Multicommodity Networks

A natural generalization of the selfish routing setting arises when some of the users obey a central coordinating authority, while the rest act selfishly. Such behavior can be modeled by dividing the users into an α fraction that are routed according to ...
Read More

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

SIGCOMM '03: Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications

August 2003

432 pages

ISBN:1581137354

DOI:10.1145/863955

General Chairs:
Anja Feldmann
TU Munich
,
Martina Zitterbart
University of Karlsruhe
,
Program Chairs:
Jon Crowcroft
University of Cambridge
,
David Wetherall
University of Washington

Copyright © 2003 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 25 August 2003

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Article

Conference

SIGCOMM03

Sponsor:

SIGCOMM03: Applications, Technologies, Architectures, and Protocols for Computer Communications

August 25 - 29, 2003

Karlsruhe, Germany

Acceptance Rates

SIGCOMM '03 Paper Acceptance Rate 34 of 319 submissions, 11%;

Overall Acceptance Rate 554 of 3,547 submissions, 16%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

177
Total Citations
View Citations
1,762
Total Downloads

Downloads (Last 12 months)75
Downloads (Last 6 weeks)12

Other Metrics

View Author Metrics

Citations

Cited By

Mancuso VBadia LCastagno PSereno MAjmone Marsan M(2024)Effectiveness of distributed stateless network server selection under strict latency constraintsComputer Networks10.1016/j.comnet.2024.110558(110558)Online publication date: Jun-2024
https://doi.org/10.1016/j.comnet.2024.110558
Scherrer SLegner MPerrig ASchmid S(2021)An axiomatic perspective on the performance effects of end-host path selectionPerformance Evaluation10.1016/j.peva.2021.102233151(102233)Online publication date: Nov-2021
https://doi.org/10.1016/j.peva.2021.102233
Zhang YLi GXiong CLei YHuang WHan YWalid AYang YZhang Z(2020)MoWIEProceedings of the Workshop on Network Application Integration/CoDesign10.1145/3405672.3409489(20-27)Online publication date: 14-Aug-2020
https://dl.acm.org/doi/10.1145/3405672.3409489
Scherrer SLegner MPerrig ASchmid S(2020)Incentivizing stable path selection in future Internet architecturesPerformance Evaluation10.1016/j.peva.2020.102137144(102137)Online publication date: Dec-2020
https://doi.org/10.1016/j.peva.2020.102137
Scherrer SPerrig ASchmid S(2020)The Value of Information in Selfish RoutingStructural Information and Communication Complexity10.1007/978-3-030-54921-3_21(366-384)Online publication date: 28-Jul-2020
https://doi.org/10.1007/978-3-030-54921-3_21
Wang JZhuang ZQi QLi TLiao J(2019)Deep reinforcement learning-based cooperative interactions among heterogeneous vehicular networksApplied Soft Computing10.1016/j.asoc.2019.105557(105557)Online publication date: Jun-2019
https://doi.org/10.1016/j.asoc.2019.105557
Wang JQi QGong JLiao J(2018)Mitigating the Oscillations Between Service Routing and SDN Traffic EngineeringIEEE Systems Journal10.1109/JSYST.2018.280589812:4(3426-3437)Online publication date: Dec-2018
https://doi.org/10.1109/JSYST.2018.2805898
Ijaz HWelzl MJamil B(2018)A survey and comparison on overlay‐underlay mapping techniques in peer‐to‐peer overlay networksInternational Journal of Communication Systems10.1002/dac.387232:3Online publication date: 21-Dec-2018
https://doi.org/10.1002/dac.3872
Kotronis VNomikos GManassakis LMavrommatis DDimitropoulos XUhlig SMaennel O(2017)Shortcuts through colocation facilitiesProceedings of the 2017 Internet Measurement Conference10.1145/3131365.3131388(470-476)Online publication date: 1-Nov-2017
https://dl.acm.org/doi/10.1145/3131365.3131388
Cui ZLiao JWang JQi QWang J(2016)An Approach to Improve the Cooperation between Heterogeneous SDN Overlays2016 IEEE 41st Conference on Local Computer Networks (LCN)10.1109/LCN.2016.51(236-239)Online publication date: Nov-2016
https://doi.org/10.1109/LCN.2016.51
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

Media

Figures

Other

Tables

View Table of Contents