skip to main content
10.1145/3469393.3469395acmotherconferencesArticle/Chapter ViewAbstractPublication PagescommConference Proceedingsconference-collections
research-article
Public Access

Flexible Routing with Policy Exchange

Published: 01 February 2022 Publication History

Abstract

BGP and its alternatives alike, struggle with distributed policy making in the absence of a central authority: BGP prioritizes independence of the participating networks (e.g., ASes), imposes zero coordination, but has to tolerate inflexible policies each network can express. On the other hand, BGP alternatives (source routing, for example), through coordination, trade independence for flexibility, but only achieve flexibility partially. This paper asks, to achieve flexible routing, what is the fitting adjustment between network independence and coordination? To answer this question, we propose a simple principle that the sole end to interfere with the flexibility of a participating network is to prevent harms — decreasing the level of flexibility — to others. As an instantiation of this principle, we introduce the concept of policy exchange that dynamically adjusts independently set policies on the fly, and develop a preliminary implementation with conditional table, a strong knowledge representation system that allows us to distribute and manipulate policies with the usual SQL-like operators. Our preliminary experiments on realistic network topology and synthetic policies are encouraging.

References

[1]
1989. Policy requirements for inter Administrative Domain routing. RFC 1125. https://doi.org/10.17487/RFC1125
[2]
1989. Policy routing in Internet protocols. RFC 1102. https://doi.org/10.17487/RFC1102
[3]
Serge Abiteboul, Richard Hull, and Victor Vianu (Eds.). 1995. Foundations of Databases: The Logical Level (1st ed.). Addison-Wesley Longman Publishing Co., Inc., Boston, MA, USA.
[4]
Serge Abiteboul, Paris Kanellakis, and Gosta Grahne. 1987. On the Representation and Querying of Sets of Possible Worlds. In Proceedings of the 1987 ACM SIGMOD International Conference on Management of Data (San Francisco, California, USA) (SIGMOD ’87). Association for Computing Machinery, New York, NY, USA, 34–48. https://doi.org/10.1145/38713.38724
[5]
S. Agarwal, Chen-Nee Chuah, and R. H. Katz. 2003. OPCA: robust interdomain policy routing and traffic control. In 2003 IEEE Conference onOpen Architectures and Network Programming.55–64.
[6]
Katerina Argyraki and David R. Cheriton. 2004. Loose Source Routing as a Mechanism for Traffic Policies. In Proceedings of the ACM SIGCOMM Workshop on Future Directions in Network Architecture (Portland, Oregon, USA) (FDNA ’04). Association for Computing Machinery, New York, NY, USA, 57–64. https://doi.org/10.1145/1016707.1016718
[7]
Anindya Basu, Chih-Hao Luke Ong, April Rasala, F. Bruce Shepherd, and Gordon Wilfong. 2002. Route oscillations in I-BGP with route reflection. In Proceedings of the 2002 conference on Applications, technologies, architectures, and protocols for computer communications (Pittsburgh, Pennsylvania, USA) (SIGCOMM ’02). ACM, New York, NY, USA, 235–247. https://doi.org/10.1145/633025.633048
[8]
Hans-Werner Braun. 1989. Models of policy based routing. RFC 1104. https://doi.org/10.17487/RFC1104
[9]
M. Caesar and J. Rexford. 2005. BGP Routing Policies in ISP Networks. Netwrk. Mag. of Global Internetwkg. 19, 6 (Nov. 2005), 5–11. https://doi.org/10.1109/MNET.2005.1541715
[10]
Xu Chen, Z. Morley Mao, and Jacobus van der Merwe. 2007. Towards Automated Network Management: Network Operations Using Dynamic Views. In Proceedings of the 2007 SIGCOMM Workshop on Internet Network Management (Kyoto, Japan) (INM ’07). ACM, New York, NY, USA, 242–247. https://doi.org/10.1145/1321753.1321757
[11]
Tyson Condie, Joseph M. Hellerstein, Petros Maniatis, Sean Rhea, and Timothy Roscoe. 2005. Finally, a use for componentized transport protocols. In In HotNets IV.
[12]
Deborah Estrin and Martha Steenstrup. 1991. Inter Domain Policy Routing: Overview of Architecture and Protocols. SIGCOMM Comput. Commun. Rev. 21, 1 (Jan. 1991), 71–78. https://doi.org/10.1145/116030.116036
[13]
Nick Feamster, Ramesh Johari, and Hari Balakrishnan. 2007. Implications of Autonomy for the Expressiveness of Policy Routing. IEEE/ACM Trans. Netw. 15, 6 (Dec. 2007), 1266–1279. https://doi.org/10.1109/TNET.2007.896531
[14]
Igor Ganichev, Bin Dai, P. Brighten Godfrey, and Scott Shenker. 2010. YAMR: Yet Another Multipath Routing Protocol. SIGCOMM Comput. Commun. Rev. 40, 5 (Oct. 2010), 13–19. https://doi.org/10.1145/1880153.1880156
[15]
Lixin Gao and Jennifer Rexford. 2000. Stable Internet routing without global coordination. In ACM SIGMETRICS.
[16]
P. Brighten Godfrey, Igor Ganichev, Scott Shenker, and Ion Stoica. 2009. Pathlet routing. In ACM SIGCOMM.
[17]
Timothy G. Griffin, F. Bruce Shepherd, and Gordon Wilfong. 2002. The Stable Paths Problem and Interdomain Routing. IEEE Trans. on Networking 10 (2002), 232–243.
[18]
Timothy G. Griffin and Gordon Wilfong. 1999. An Analysis of BGP Convergence Properties. In SIGCOMM.
[19]
Geoff Huston. 2001. Commentary on Inter-Domain Routing in the Internet. RFC 3221. https://doi.org/10.17487/RFC3221
[20]
Tomasz Imieliundefinedski and Witold Lipski. 1984. Incomplete Information in Relational Databases. J. ACM 31, 4 (Sept. 1984), 761–791. https://doi.org/10.1145/1634.1886
[21]
H. Tahilramani Kaur, S. Kalyanaraman, A. Weiss, S. Kanwar, and A. Gandhi. 2003. BANANAS: An Evolutionary Framework for Explicit and Multipath Routing in the Internet. In Proceedings of the ACM SIGCOMM Workshop on Future Directions in Network Architecture(Karlsruhe, Germany) (FDNA ’03). Association for Computing Machinery, New York, NY, USA, 277–288. https://doi.org/10.1145/944759.944766
[22]
Tony Li, Ravi Chandra, and Paul S. Traina. 1996. BGP Communities Attribute. RFC 1997. https://doi.org/10.17487/RFC1997
[23]
Zhenbin Li, Liang Ou, Yujia Luo, Sujian Lu, Huaimo Chen, Shunwan Zhuang, and Haibo Wang. 2020. BGP Extensions for Routing Policy Distribution (RPD). Internet-Draft draft-ietf-idr-rpd-05. Internet Engineering Task Force. https://datatracker.ietf.org/doc/html/draft-ietf-idr-rpd-05 Work in Progress.
[24]
Changbin Liu, Boon Thau Loo, and Yun Mao. 2011. Declarative Automated Cloud Resource Orchestration. In Proceedings of the 2Nd ACM Symposium on Cloud Computing (Cascais, Portugal) (SOCC ’11). ACM, New York, NY, USA, Article 26, 8 pages. https://doi.org/10.1145/2038916.2038942
[25]
Changbin Liu, Lu Ren, Boon Thau Loo, Yun Mao, and Prithwish Basu. 2012. Cologne: A Declarative Distributed Constraint Optimization Platform. Proc. VLDB Endow. 5, 8 (April 2012), 752–763. https://doi.org/10.14778/2212351.2212357
[26]
Boon Thau Loo, Tyson Condie, Minos Garofalakis, David E. Gay, Joseph M. Hellerstein, Petros Maniatis, Raghu Ramakrishnan, Timothy Roscoe, and Ion Stoica. 2006. Declarative Networking: Language, Execution and Optimization. In Proceedings of the 2006 ACM SIGMOD International Conference on Management of Data (Chicago, IL, USA) (SIGMOD ’06). ACM, New York, NY, USA, 97–108. https://doi.org/10.1145/1142473.1142485
[27]
Boon Thau Loo, Joseph M. Hellerstein, Ion Stoica, and Raghu Ramakrishnan. 2005. Declarative Routing: Extensible Routing with Declarative Queries(SIGCOMM ’05). ACM, 12 pages. https://doi.org/10.1145/1080091.1080126
[28]
Ratul Mahajan, David Wetherall, and Thomas Anderson. 2007. Mutually controlled routing with independent ISPs. In NSDI.
[29]
Yun Mao, Boon Thau Loo, Zachary Ives, and Jonathan M. Smith. 2008. MOSAIC: Unified Declarative Platform for Dynamic Overlay Composition. In Proceedings of the 2008 ACM CoNEXT Conference (Madrid, Spain) (CoNEXT ’08). ACM, New York, NY, USA, Article 5, 12 pages. https://doi.org/10.1145/1544012.1544017
[30]
D. McPherson, V. Gill, D. Walton, and A. Retana. RFC 3345, 2002. Border Gateway Protocol (BGP) Persistent Route Oscillation Condition. (RFC 3345, 2002).
[31]
Danny R. McPherson and Vijay Gill. 2006. BGP MULTI_EXIT_DISC (MED) Considerations. RFC 4451. https://doi.org/10.17487/RFC4451
[32]
B. Quoitin, C. Pelsser, L. Swinnen, O. Bonaventure, and S. Uhlig. 2003. Interdomain Traffic Engineering with BGP. Comm. Mag. 41, 5 (May 2003), 122–128. https://doi.org/10.1109/MCOM.2003.1200112
[33]
Yakov Rekhter, Steven Hotz, and Dr. Deborah Estrin. 1992. A Unified Approach to Inter-Domain Routing. RFC 1322. https://doi.org/10.17487/RFC1322
[34]
Y. Rekhter, T Li, and S Hares. 2006. A Border Gateway Protocol 4 (BGP-4). RFC 4271. RFC Editor. http://www.rfc-editor.org/rfc/rfc4271.txt
[35]
Arun Seehra, Jad Naous, Michael Walfish, David Mazières, Antonio Nicolosi, and Scott Shenker. 2009. A Policy Framework for the Future Internet. In In Proc. HotNets.
[36]
Martha E. Steenstrup. 1993. An Architecture for Inter-Domain Policy Routing. RFC 1478. https://doi.org/10.17487/RFC1478
[37]
Kannan Varadhan, Ramesh Govindan, and Deborah Estrin. 2000. Persistent route oscillations in inter-domain routing. Computer Networks 32, 1 (2000), 1 – 16. https://doi.org/10.1016/S1389-1286(99)00108-5
[38]
Wen Xu and Jennifer Rexford. 2006. MIRO: Multi-path interdomain routing. In ACM SIGCOMM.
[39]
Xiaowei Yang, David Clark, and Arthur W. Berger. 2007. NIRA: a new inter-domain routing architecture. IEEE/ACM Trans. Netw. 15, 4 (2007).
[40]
Dapeng Zhu, Mark Gritter, and David R. Cheriton. 2003. Feedback Based Routing. SIGCOMM Comput. Commun. Rev. 33, 1 (Jan. 2003), 71–76. https://doi.org/10.1145/774763.774774

Recommendations

Comments

Information & Contributors

Information

Published In

cover image ACM Other conferences
APNet '21: Proceedings of the 5th Asia-Pacific Workshop on Networking
June 2021
79 pages
ISBN:9781450385879
DOI:10.1145/3469393
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: 01 February 2022

Permissions

Request permissions for this article.

Check for updates

Author Tags

  1. Policy exchange
  2. conditional tables
  3. interdomain routing
  4. knowledge representation

Qualifiers

  • Research-article
  • Research
  • Refereed limited

Funding Sources

  • NSF

Conference

APNet 2021
APNet 2021: 5th Asia-Pacific Workshop on Networking
June 24 - 25, 2021
Shenzhen, China, China

Acceptance Rates

Overall Acceptance Rate 50 of 118 submissions, 42%

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • 0
    Total Citations
  • 242
    Total Downloads
  • Downloads (Last 12 months)150
  • Downloads (Last 6 weeks)15
Reflects downloads up to 14 Feb 2025

Other Metrics

Citations

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

HTML Format

View this article in HTML Format.

HTML Format

Login options

Figures

Tables

Media

Share

Share

Share this Publication link

Share on social media