Article

Free access

On the benefits and feasibility of incentive based routing infrastructure

Authors:

John WroclawskiAuthors Info & Claims

PINS '04: Proceedings of the ACM SIGCOMM workshop on Practice and theory of incentives in networked systems

Pages 197 - 204

https://doi.org/10.1145/1016527.1016533

Published: 03 September 2004 Publication History

Abstract

Routing on the Internet today is as much about money as it is traffic. The business relationships of an ISP largely dictate its routing policy and drive the work of its engineers. In today's routing mechanism, this leads to a number of well-known pathologies. This structure is further challenged by the emergence of user-directed routing.This paper explores these challenges and argues for the introduction of explicit incentives (prices) into the routing fabric of the Internet. We argue that doing so addresses limitations of the current system that are significant today and will only be exacerbated by user-directed routing. To support this claim, we describe the benefits and properties of incentive-based routing frameworks and demonstrate how such frameworks can be applied to a number of routing architectures, including BGP.

References

[1]

Lixin Gao and Jennifer Rexford. Stable internet routing without global coordination. In Measurement and Modeling of Computer Systems, 2000.]]

Digital Library

[2]

David D. Clark, John Wroclawski, Karen R. Sollinis, and Robert Braden. Tussle in cyberspace: Defining tomorrow's internet. In ACM SIGCOMM 2002, Pittsburgh, PA, August 2002.]]

Digital Library

[3]

R. Teixeira, A. Shaikh, T. G. Griffin, and J. Rexford. Dynamics of Hot-Potato Routing in IP Networks. In Proc. ACM SIGMETRICS, 2004.]]

Digital Library

[4]

Stefan Savage, Andy Collins, Eric Hoffman, John Snell, and Thomas E. Anderson. The end-to-end effects of internet path selection. In SIGCOMM, pages 289--299, 1999.]]

Digital Library

[5]

Nick Feamster. Practical verification techniques for wide-area routing. SIGCOMM Comput. Commun. Rev., 34(1):87--92, 2004.]]

Digital Library

[6]

A. M. Odlyzko. Pricing and architecture of the internet: Historical perspectives from telecommunications and transportation. http://www.dtc.umn.edu/~odlyzko/doc/pricing.architecture.pdf.]]

[7]

Tobias Oetiker. Mrtg: The multi router traffic grapher. In Proceedings of the 12th Conference on Systems Administration, pages 141--148. USENIX Association, 1998.]]

Digital Library

[8]

Akamai technologies homepage. http://www.akmai.com/.]]

[9]

D. Andersen, H. Balakrishnan, F. Kaashoek, and R. Morris. Resilient overlay networks. In Proceedings of the 18th ACM Symposium on Operating Systems Principles (SOSP), 2001.]]

Digital Library

[10]

David D. Clark. Policy routing in Internet protocols. RFC 1102, Internet Engineering Task Force, May 1989. ftp://ftp.ietf.org/rfc/rfc1102.txt.]]

Digital Library

[11]

Xiaowei Yang. Nira: a new Internet routing architecture. SIGCOMM Comput. Commun. Rev., 33(4):301--312, 2003.]]

Digital Library

[12]

Alex C. Snoeren and Barath Raghavan. Decoupling policy from mechanism in internet routing. SIGCOMM Comput. Commun. Rev., 34(1):81--86, 2004.]]

Digital Library

[13]

Akamai glitch causes web traffic disruption. http://biz.yahoo.com/rc/040524/tech_akamai_outage_2.html.]]

[14]

Lixin Gao, Timothy Griffin, and Jennifer Rexford. Inherently safe backup routing with BGP. In INFOCOM, pages 547--556, 2001.]]

[15]

An architecture for differentiated services. http://www.ietf.org/rfc/rfc2475.txt.]]

[16]

Interpret the destination class usage mib. http://www.juniper.net/techpubs/software/junos/junos56/swconfig56-net-mgmt/h%]]

[17]

J. Feigenbaum, C. Papadimitriou, R. Sami, and S. Shenker. A BGP-based mechanism for lowest-cost routing. In Proceedings of the 2002 ACM Symposium on Principles of Distributed Computing, pages 173--182, New York, NY, July 2002.]]

Digital Library

[18]

L. Subramanian, S. Agarwal, J. Rexford, and R. Katz. Characterizing the internet hierarchy from multiple vantage points, 2001.]]

[19]

Tim Roughgarden and Èva Tardos. How bad is selfish routing? J. ACM, 49(2):236--259, 2002.]]

Digital Library

[20]

Ramesh Johari Rjohari. Routing and peering in a competitive internet. citeseer.ist.psu.edu/572286.html.]]

[21]

Christos H. Papadimitriou. Algorithms, games, and the Internet. Lecture Notes in Computer Science, 2076, 2001.]]

Digital Library

Cited By

Zhang YWang YPei DYuan J(2014)Multi-AS cooperative incoming traffic engineering in a transit-edge separate internetComputer Networks: The International Journal of Computer and Telecommunications Networking10.1016/j.comnet.2014.07.01573:C(112-127)Online publication date: 14-Nov-2014
https://dl.acm.org/doi/10.1016/j.comnet.2014.07.015
Laskowski PChuang JDahlin MVojnovic M(2010)Innovations and upgrades in virtualized network architecturesProceedings of the 2010 Workshop on Economics of Networks, Systems, and Computation10.1145/1879082.1879091(1-11)Online publication date: 3-Oct-2010
https://dl.acm.org/doi/10.1145/1879082.1879091
Kannan GHuang YBhatti SMerchant SDesai U(2009)A Cross Layer Routing Protocol for Multihop Cellular NetworksWireless Personal Communications: An International Journal10.1007/s11277-009-9751-y51:3(427-447)Online publication date: 1-Nov-2009
https://dl.acm.org/doi/10.1007/s11277-009-9751-y
Show More Cited By

Index Terms

On the benefits and feasibility of incentive based routing infrastructure
1. Networks
  1. Network protocols
    1. Network layer protocols
      1. Routing protocols

Recommendations

Incentive-compatible interdomain routing
EC '06: Proceedings of the 7th ACM conference on Electronic commerce

The routing of traffic between Internet domains, or Autonomous Systems (ASes), a task known as interdomain routing, is currently handled by the Border Gateway Protocol (BGP) [17]. Using BGP, autonomous systems can apply semantically rich routing ...
Incentive-compatible interdomain routing

The routing of traffic between Internet domains, or Autonomous Systems (ASes), a task known as interdomain routing, is currently handled by the Border Gateway Protocol (BGP, Rekhter and Li in RFC 4271 of the Internet Engineering Task Force, 2006). Using ...
Incentive-aware routing in DTNs
ICNP '08: Proceedings of the 2008 IEEE International Conference on Network Protocols

Disruption tolerant networks (DTNs) are a class of networks in which no contemporaneous path may exist between the source and destination at a given time. In such a network, routing takes place with the help of relay nodes and in a store-and-forward ...

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

PINS '04: Proceedings of the ACM SIGCOMM workshop on Practice and theory of incentives in networked systems

September 2004

326 pages

ISBN:158113942X

DOI:10.1145/1016527

Program Chairs:
Dina Katabi
Massachusetts Institute of Technology
,
Rahul Sami
Massachusetts Institute of Technology

Copyright © 2004 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: 03 September 2004

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Conference

SIGCOMM04

Sponsor:

SIGCOMM04: ACM SIGCOMM 2004 Conference

September 3, 2004

Oregon, Portland, USA

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

17
Total Citations
View Citations
450
Total Downloads

Downloads (Last 12 months)39
Downloads (Last 6 weeks)9

Reflects downloads up to 11 Aug 2024

Other Metrics

View Author Metrics

Citations

Cited By

Zhang YWang YPei DYuan J(2014)Multi-AS cooperative incoming traffic engineering in a transit-edge separate internetComputer Networks: The International Journal of Computer and Telecommunications Networking10.1016/j.comnet.2014.07.01573:C(112-127)Online publication date: 14-Nov-2014
https://dl.acm.org/doi/10.1016/j.comnet.2014.07.015
Laskowski PChuang JDahlin MVojnovic M(2010)Innovations and upgrades in virtualized network architecturesProceedings of the 2010 Workshop on Economics of Networks, Systems, and Computation10.1145/1879082.1879091(1-11)Online publication date: 3-Oct-2010
https://dl.acm.org/doi/10.1145/1879082.1879091
Kannan GHuang YBhatti SMerchant SDesai U(2009)A Cross Layer Routing Protocol for Multihop Cellular NetworksWireless Personal Communications: An International Journal10.1007/s11277-009-9751-y51:3(427-447)Online publication date: 1-Nov-2009
https://dl.acm.org/doi/10.1007/s11277-009-9751-y
Mahajan RZhang MPoole LPai V(2008)Uncovering performance differences among backbone ISPs with NetdiffProceedings of the 5th USENIX Symposium on Networked Systems Design and Implementation10.5555/1387589.1387604(205-218)Online publication date: 16-Apr-2008
https://dl.acm.org/doi/10.5555/1387589.1387604
Valancius VFeamster NJohari RVazirani VAzcorra Ade Veciana GRoss KTassiulas L(2008)MINTProceedings of the 2008 ACM CoNEXT Conference10.1145/1544012.1544082(1-6)Online publication date: 9-Dec-2008
https://dl.acm.org/doi/10.1145/1544012.1544082
Laskowski PJohnson BChuang JFeigenbaum JYang Y(2008)User-directed routingProceedings of the 3rd international workshop on Economics of networked systems10.1145/1403027.1403029(1-6)Online publication date: 22-Aug-2008
https://dl.acm.org/doi/10.1145/1403027.1403029
Mahajan RWetherall DAnderson T(2007)Mutually controlled routing with independent ISPsProceedings of the 4th USENIX conference on Networked systems design & implementation10.5555/1973430.1973456(26-26)Online publication date: 11-Apr-2007
https://dl.acm.org/doi/10.5555/1973430.1973456
Ray SSlutzki GZhang Z(2007)Incentive-Driven P2P Anonymity SystemProceedings of the 2007 International Conference on Parallel Processing10.1109/ICPP.2007.50Online publication date: 10-Sep-2007
https://dl.acm.org/doi/10.1109/ICPP.2007.50
Di Cairano-Gilfedder CGhanea-Hercock RSrinivasan S(2007)Can Autonomic and Strategic Routing Benefit Internet Autonomous Systems?2007 IEEE International Conference on Communications10.1109/ICC.2007.331(1991-1996)Online publication date: Jun-2007
https://doi.org/10.1109/ICC.2007.331
Laskowski PChuang JRizzo LAnderson TMcKeown N(2006)Network monitors and contracting systemsProceedings of the 2006 conference on Applications, technologies, architectures, and protocols for computer communications10.1145/1159913.1159935(183-194)Online publication date: 11-Sep-2006
https://dl.acm.org/doi/10.1145/1159913.1159935
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