article

Implications of autonomy for the expressiveness of policy routing

Authors:

Hari BalakrishnanAuthors Info & Claims

ACM SIGCOMM Computer Communication Review, Volume 35, Issue 4

Pages 25 - 36

https://doi.org/10.1145/1090191.1080096

Published: 22 August 2005 Publication History

Abstract

Thousands of competing autonomous systems must cooperate with each other to provide global Internet connectivity. Each autonomous system (AS) encodes various economic, business, and performance decisions in its routing policy. The current interdomain routing system enables each AS to express policy using rankings that determine how each router inthe AS chooses among different routes to a destination, and filters that determine which routes are hidden from each neighboring AS. Because the Internet is composed of many independent, competing networks, the interdomain routing system should provide autonomy, allowing network operators to set their rankings independently, and to have no constraints on allowed filters. This paper studies routing protocol stability under these conditions. We first demonstrate that certain rankings that are commonly used in practice may not ensure routing stability. We then prove that, when providers can set rankings and filters autonomously, guaranteeing that the routing system will converge to a stable path assignment essentially requires ASes to rank routes based on AS-path lengths. We discuss the implications of these results for the future of interdomain routing.

References

[1]

Alaettinoglu, C., et al. Routing policy specification language (RPSL). RFC 2622, June 1999.

Digital Library

[2]

Private communication with Randy Bush, May 2004.

[3]

Feamster, N., and Balakrishnan, H. Detecting BGP Configuration Faults with Static Analysis. In Proc. 2nd Symposium on Networked Systems Design and Implementation (Boston, MA, May 2005), pp. 49--56.

Digital Library

[4]

Feamster, N., Borkenhagen, J., and Rexford, J. Guidelines for interdomain traffic engineering. Computer Communications Review 33, 5 (October 2003), 19--30.

Digital Library

[5]

Feamster, N., Johari, R., and Balakrishnan, H. Stable policy routing with provider independence. Tech. Rep. MIT-LCS-TR-981, Massachusetts Institute of Technology, February 2005.

[6]

Feigenbaum, J., Sami, R., and Shenker, S. Mechanism design for policy routing. In ACM Symposium on Principles of Distributed Computing (2004), pp. 11--20.

Digital Library

[7]

Gao, L., Griffin, T. G., and Rexford, J. Inherently safe backup routing with BGP. In Proc. IEEE INFOCOM (Anchorage, AK, April 2001), pp. 547--556.

[8]

Gao, L., and Rexford, J. Stable Internet routing without global coordination. IEEE/ACM Trans. Networking 9, 6 (December 2001), 681--692.

Digital Library

[9]

Govindan, R., Alaettinoglu, C., Eddy, G., Kessens, D., Kumar, S., and Lee, W. An architecture for stable, analyzable Internet routing. IEEE Network Magazine 13, 1 (January/February 1999), 29--35.

Digital Library

[10]

Govindan, R., Alaettinoglu, C., Varadhan, K., and Estrin, D. Route servers for inter-domain routing. Computer Networks and ISDN Systems 30 (1998), 1157--1174.

Digital Library

[11]

Griffin, T., Jaggard, A., and Ramachandran, V. Design principles of policy languages for path vector protocols. In Proc. ACM SIGCOMM (Karlsruhe, Germany, August 2003), pp. 61--72.

Digital Library

[12]

Griffin, T., Shepherd, F. B., and Wilfong, G. The stable paths problem and interdomain routing. IEEE/ACM Trans. Networking 10, 1 (2002), 232--243.

Digital Library

[13]

Griffin, T., and Wilfong, G. A safe path vector protocol. In Proc. IEEE INFOCOM (March 2000), pp. 490--499.

[14]

Jaggard, A. D., and Ramachandran, V. Robustness of class-based path vector systems. In Proc. International Conference on Network Protocols (November 2004), pp. 84--93.

Digital Library

[15]

Machiraju, S., and Katz, R. Verifying global invariants in multi-provider distributed systems. In Proc. SIGCOMM Workshop on Hot Topics in Networking (HotNets) (November 2004), pp. 149--154.

[16]

Rekhter, Y., and Li, T. A Border Gateway Protocol. RFC 1771, March 1995.

Digital Library

[17]

Sobrinho, J. L. Network routing with path vector protocols: Theory and applications. In Proc. ACM SIGCOMM (Karlsruhe, Germany, August 2003), pp. 49--60.

Digital Library

[18]

Varadhan, K., Govindan, R., and Estrin, D. Persistent route oscillations in inter-domain routing. Tech. Rep. 96-631, USC/ISI, February 1996.

Cited By

Wang AJia LZhou WRen YLoo BRexford JNigam VScedrov ATalcott C(2012)FSRIEEE/ACM Transactions on Networking10.1109/TNET.2012.218792420:6(1814-1827)Online publication date: 1-Dec-2012
https://dl.acm.org/doi/10.1109/TNET.2012.2187924
Levin HSchapira MZohar A(2011)Interdomain Routing and GamesSIAM Journal on Computing10.1137/08073401740:6(1892-1912)Online publication date: 1-Dec-2011
https://dl.acm.org/doi/10.1137/080734017
Cittadini LDi Battista GRimondini MVissicchio S(2011)Wheel + ring = reelIEEE/ACM Transactions on Networking10.1109/TNET.2011.210679819:4(1085-1096)Online publication date: 1-Aug-2011
https://dl.acm.org/doi/10.1109/TNET.2011.2106798
Show More Cited By

Index Terms

Implications of autonomy for the expressiveness of policy routing
1. Networks

Recommendations

Implications of autonomy for the expressiveness of policy routing
SIGCOMM '05: Proceedings of the 2005 conference on Applications, technologies, architectures, and protocols for computer communications

Thousands of competing autonomous systems must cooperate with each other to provide global Internet connectivity. Each autonomous system (AS) encodes various economic, business, and performance decisions in its routing policy. The current interdomain ...
Implications of autonomy for the expressiveness of policy routing

Thousands of competing autonomous systems must cooperate with each other to provide global Internet connectivity. Each autonomous system (AS) encodes various economic, business, and performance decisions in its routing policy. The current interdomain ...
Neighbor-specific BGP: more flexible routing policies while improving global stability
SIGMETRICS '09

The Border Gateway Protocol (BGP) offers network administrators considerable flexibility in controlling how traffic flows through their networks. However, the interaction between routing policies in different Autonomous Systems (ASes) can lead to ...

Comments

Information & Contributors

Information

Published In

cover image ACM SIGCOMM Computer Communication Review

ACM SIGCOMM Computer Communication Review Volume 35, Issue 4

Proceedings of the 2005 conference on Applications, technologies, architectures, and protocols for computer communications

October 2005

324 pages

ISSN:0146-4833

DOI:10.1145/1090191

Issue’s Table of Contents

SIGCOMM '05: Proceedings of the 2005 conference on Applications, technologies, architectures, and protocols for computer communications
August 2005
350 pages
ISBN:1595930094
DOI:10.1145/1080091
General Chair:
Roch Guerin
University of Pennsylvania
,
Program Chairs:
Ramesh Govindan
University of Southern California
,
Greg Minshall
Unaffiliated

Copyright © 2005 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]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 22 August 2005

Published in SIGCOMM-CCR Volume 35, Issue 4

Check for updates

Author Tags

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

40
Total Citations
View Citations
513
Total Downloads

Downloads (Last 12 months)44
Downloads (Last 6 weeks)11

Reflects downloads up to 08 Feb 2025

Other Metrics

View Author Metrics

Citations

Cited By

Wang AJia LZhou WRen YLoo BRexford JNigam VScedrov ATalcott C(2012)FSRIEEE/ACM Transactions on Networking10.1109/TNET.2012.218792420:6(1814-1827)Online publication date: 1-Dec-2012
https://dl.acm.org/doi/10.1109/TNET.2012.2187924
Levin HSchapira MZohar A(2011)Interdomain Routing and GamesSIAM Journal on Computing10.1137/08073401740:6(1892-1912)Online publication date: 1-Dec-2011
https://dl.acm.org/doi/10.1137/080734017
Cittadini LDi Battista GRimondini MVissicchio S(2011)Wheel + ring = reelIEEE/ACM Transactions on Networking10.1109/TNET.2011.210679819:4(1085-1096)Online publication date: 1-Aug-2011
https://dl.acm.org/doi/10.1109/TNET.2011.2106798
Wong EShmatikov V(2011)Get off my prefix! the need for dynamic, gerontocratic policies in inter-domain routingProceedings of the 2011 IEEE/IFIP 41st International Conference on Dependable Systems&Networks10.1109/DSN.2011.5958222(233-244)Online publication date: 27-Jun-2011
https://dl.acm.org/doi/10.1109/DSN.2011.5958222
Li QXu MWu JLee PChiu D(2011)Toward a practical approach for BGP stability with root cause checkJournal of Parallel and Distributed Computing10.1016/j.jpdc.2011.04.00971:8(1098-1110)Online publication date: 1-Aug-2011
https://dl.acm.org/doi/10.1016/j.jpdc.2011.04.009
Yan HOliveira RBurnett KMatthews DZhang LMassey D(2009)BGPmonProceedings of the 2009 Cybersecurity Applications & Technology Conference for Homeland Security10.1109/CATCH.2009.28(212-223)Online publication date: 3-Mar-2009
https://dl.acm.org/doi/10.1109/CATCH.2009.28
Levin HSchapira MZohar ALadner RDwork C(2008)Interdomain routing and gamesProceedings of the fortieth annual ACM symposium on Theory of computing10.1145/1374376.1374388(57-66)Online publication date: 17-May-2008
https://dl.acm.org/doi/10.1145/1374376.1374388
Jaggard ARamachandran V(2005)Toward the design of robust interdomain routing protocolsIEEE Network: The Magazine of Global Internetworking10.1109/MNET.2005.154171919:6(35-41)Online publication date: 1-Nov-2005
https://dl.acm.org/doi/10.1109/MNET.2005.1541719
Singh VChayko MInamdar RFloegel D(2020)Female librarians and male computer programmers? Gender bias in occupational images on digital media platformsJournal of the Association for Information Science and Technology10.1002/asi.2433571:11(1281-1294)Online publication date: 21-Oct-2020
https://dl.acm.org/doi/10.1002/asi.24335
Wang ATalcott CGurney ALoo BScedrov A(2012)Reduction-based formal analysis of BGP instancesProceedings of the 18th international conference on Tools and Algorithms for the Construction and Analysis of Systems10.1007/978-3-642-28756-5_20(283-298)Online publication date: 24-Mar-2012
https://dl.acm.org/doi/10.1007/978-3-642-28756-5_20
Show More Cited By

View Options

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

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Figures

Tables

Media

View Issue’s Table of Contents