research-article

Routing on Multiple Optimality Criteria

Authors:

João Luís Sobrinho and

Miguel Alves FerreiraAuthors Info & Claims

SIGCOMM '20: Proceedings of the Annual conference of the ACM Special Interest Group on Data Communication on the applications, technologies, architectures, and protocols for computer communication

July 2020

Pages 211 - 225

https://doi.org/10.1145/3387514.3405864

Published: 30 July 2020 Publication History

Abstract

Standard vectoring protocols, such as EIGRP, BGP, DSDV, or Babel, only route on optimal paths when the total order on path attributes that substantiates optimality is consistent with the extension operation that calculates path attributes from link attributes, leaving out many optimality criteria of practical interest. We present a solution to this problem and, more generally, to the problem of routing on multiple optimality criteria. A key idea is the derivation of a partial order on path attributes that is consistent with the extension operation and respects every optimality criterion of a designated collection of such criteria. We design new vectoring protocols that compute on partial orders, with every node capable of electing multiple attributes per destination rather than a single attribute as in standard vectoring protocols. Our evaluation over publicly available network topologies and attributes shows that the proposed protocols converge fast and enable optimal path routing concurrently for many optimality criteria with only a few elected attributes at each node per destination. We further show how predicating computations on partial orders allows incorporation of service chain constraints on optimal path routing.

Supplementary Material

MP4 File (3387514.3405864.mp4)

Routing on Multiple Optimality Criteria - SIGCOMM presentation

Download
496.98 MB

References

[1]

Rachit Agarwal, Virajith Jalaparti, Matthew Caesar, and P. Brighten Godfrey. 2010. Guaranteeing BGP Stability with a Few Extra Paths. In Proc. of the IEEE International Conference on Distributed Computing Systems. 221--230.

[2]

Toufik Ahmed, Ahmed Mehaoua, Raouf Boutaba, and Youssef Iraqi. 2005. Adaptive Packet Video Streaming over IP Networks: a Cross-layer approach. IEEE Journal on Selected Areas in Communications 23, 2 (2005), 385--401.

Digital Library

[3]

Christopher L. Barrett, Riko Jacob, and Madhav V. Marathe. 2000. Formal-Language-Constrained Path Problems. SIAM J. Comput. 30, 3 (2000), 809--837.

Digital Library

[4]

Ryan Beckett, Ratul Mahajan, Todd Millstein, Jitendra Padhye, and David Walker. 2016. Don't Mind the Gap: Bridging Network-wide Objectives and Device-level Configurations. In Proc. ACM SIGCOMM. 328--341.

Digital Library

[5]

James Brumbaugh-Smith and Donald Shier. 1989. An Empirical Investigation of Some Bicriterion Shortest Path Algorithms. European Journal of Operational Research 43, 2 (1989), 216--224.

[6]

Zizhong Cao, Murali Kodialam, and T. V. Lakshman. 2014. Traffic Steering in Software Defined Networks: Planning and Online Routing. In Proc. of the ACM SIGCOMM Workshop on Distributed Cloud Computing. 65--70.

[7]

Bernard Carré. 1979. Graphs and Networks. Clarendon Press, Oxford, UK. ISBN 0-19-8596-22-7.

[8]

Girish P. Chandranmenon and George Varghese. 1996. Trading Packet Headers for Packet Processing. IEEE/ACM Transactions on Networking 4, 2(1996), 141--152.

Digital Library

[9]

Yen L. Chen and Yeo H. Chin. 1990. The Quickest Path Problem. Computers & Operation Research 17 (1990), 153--161.

Digital Library

[10]

Sumi Choi, Jonathan Turner, and Tilman Wolf. 2001. Configuring Sessions in Programmable Networks. In Proc. IEEE INFOCOM. 60--66.

[11]

Juliusz Chroboczek. 2011. The Babel Routing Protocol. RFC 6126.

[12]

Thomas Cormen, Charles Leiserson, Ronald Rivest, and Clifford Stein. 2009. Introduction to Algorithms (third ed.). MIT Press, Cambridge, MA. ISBN 978-0262033848.

[13]

Ashley Flavel and Matthew Roughan. 2009. Stable and Flexible iBGP. In Proc. ACM SIGCOMM. 183--194.

Digital Library

[14]

Igor Ganichev, Bin Dai, Philip B. Godfrey, and Scott Schenker. 2010. YAMR: Yet Another Multipath Routing Protocol. ACM SIGCOMM Computer Communications Review 5 (October 2010), 13--19.

Digital Library

[15]

Michel Gondran and Michel Minoux. 2008. Graphes, Dioides, and Semirings. Springer. ISBN 978-0-387-75449-9.

[16]

Mohamed G. Gouda and Marco Schneider. 2003. Maximizable Routing Metrics. IEEE/ACM Transactions on Networking 11, 4 (2003).

Digital Library

[17]

Timothy G. Griffin. 2010. The Stratified Shortest-paths Problem. In Proc. International Conference on Comunication Systems and Networks. 268--277.

[18]

Timothy G. Griffin and João L. Sobrinho. 2005. Metarouting. In Proc. ACM SIGCOMM. 1--12.

[19]

Pierre Hansen. 1980. Bicriterion Path Problems. In Multiple Criteria Decision Making Theory and Application, Gunter Fandel and Tomas Gal (Eds.). Springer Verlag, 109--127.

[20]

Egbert Harzheim. 2005. Ordered Sets. Springer. ISBN 0-387-24219-8.

[21]

Kuo-Feng Hsu, Ryan Beckett, Ang Chen, Jennifer Rexford, Praveen Tammana, and David Walker. 2020. Contra: A Programmable System for Performance-Aware Routing. In Proc. USENIX NSDI.

[22]

Nate Kushman, Srikanth Kandula, Dina Katabi, and Bruce M. Maggs. 2007. R-BGP: Staying Connected in a Connected World. In Proc. USENIX NSDI.

[23]

Craig Labovitz, Abha Ahuja, Abhijit Bose, and Farnam Jahanian. 2001. Delayed Internet Routing Convergence. IEEE/ACM Transactions on Networking 9, 3 (2001), 293--306.

Digital Library

[24]

L. Lamport. 1982. An assertional correctness proof of a distributed algorithm. Science of Computer Programming 2, 3 (1982), 175--206.

[25]

Thomas Lengauer and Dirk Theune. 1991. Efficient Algorithms for Path Problems with General Cost Criteria. In Proc. International Colloquium on Automata, Languages and Programming. 314--326.

[26]

Harry Lewis and Christos Papadimitriou. 1998. Elements of the Theory of Computation (second ed.). Prentice-Hall. ISBN 0132624788.

[27]

Yong Liao, Lixin Gao, Roch Guérin, and Zhi-Li Zhang. 2008. Reliable Interdomain Routing Through Multiple Complementary Routing Processes. In Proc. ACM CoNEXT.

Digital Library

[28]

Ernesto Martins. 1984. On a Multicriteria Shortest Path Problem. European Journal of Operational Research 16, 2 (1984), 236--245.

[29]

Edgar C. Molero, Stefano Vissicchio, and Laurent Vanbever. 2018. Hardware-Accelerated Network Control Planes. In Proc. ACM Workshop on Hot Topics in Networks. 120--126.

Digital Library

[30]

Charles E. Perkins and Pravin Bhagwat. 1994. Highly Dynamic Destination-Sequenced Distance-Vector Routing (DSDV) for Mobile Computers. In Proc. ACM SIGCOMM. 234--244.

[31]

Paul Quinn and Thomas D. Nadeau. 2015. Problem Statement for Service Function Chaining. (2015). RFC 7498.

[32]

Mark Reitblatt, Marco Canini, Arjun Guha, and Nate Foster. 2013. FatTire: Declarative Fault Tolerance for Software-defined Networks. In Proc. of the ACM SIGCOMM Workshop on Hot Topics in Software Defined Networking. ACM, 109--114.

Digital Library

[33]

Yakov Rekhter, T. Li, and S. Hares. 2006. A Border Gateway Protocol 4 (BGP-4). RFC 4271.

[34]

Donnie Savage, James Ng, Steven Moore, Donald Slice, Peter Paluch, and Russ White. 2016. Cisco's Enhanced Interior Gateway Routing Protocol (EIGRP). RFC 7868.

[35]

João L. Sobrinho. 2002. Algebra and Algorithms for QoS Path Computation and Hop-by-hop Routing in the Internet. IEEE/ACM Transactions on Networking 10, 4 (2002).

Digital Library

[36]

João L. Sobrinho. 2005. An Algebraic Theory of Dynamic Network Routing. IEEE/ACM Transactions on Networking 13, 5 (2005).

Digital Library

[37]

João L. Sobrinho. 2019. Fundamental Differences Among Vectoring Routing Protocols on Non-Isotonic Metrics. IEEE Networking Letters 1, 3 (2019).

[38]

Robert Soulé, Basu Shrutarshi, Parisa J. Marandi, Fernando Pedone, Robert Kleinberg, Emin Gun Sirer, and Nate Foster. 2014. Merlin: A Language for Provisioning Network Resources. In Proc. CoNEXT. 213--226.

Digital Library

[39]

Neil Spring, Ratul Mahajan, David Wetherall, and Thomas Anderson. 2004. Measuring ISP Topologies with Rocketfuel. IEEE/ACM Transactions on Networking 12, 1 (February 2004), 2--16.

Digital Library

[40]

Virginie Van den Schrieck, Pierre Francois, and Olivier Bonaventure. 2010. BGP Add-paths: the Scaling Performance Tradeoffs. IEEE Journal on Selected Areas in Communications 28, 8 (2010), 1299--1307.

Digital Library

[41]

Feng Wang and Lixin Gao. 2008. A Backup Route Aware Routing Protocol---Fast Recovery From Transient Routing Failures. In Proc. IEEE INFOCOM. 2333--2341.

[42]

Yi Wang, Michael Schapira, and Jennifer Rexford. 2009. Neighbor-specific BGP: More Flexible Routing Policies While Improving Global Stability. In Proc. ACM SIGMETRICS. 217--228.

Digital Library

[43]

Zheng Wang and Jon Crowcroft. 1996. Quality-of-Service Routing for Supporting Multimedia Applications. IEEE Journal on Selected Areas in Communications 14, 7 (September 1996), 1228--1234.

[44]

Wen Xu and Jennifer Rexford. 2006. MIRO: Multi-path Interdomain Routing. In Proc. ACM SIGCOMM. 171--182.

Digital Library

[45]

Yaling Yang and Jun Wang. 2008. Design Guidelines for Routing Metrics in Multihop Wireless Networks. In Proc. IEEE INFOCOM. 1615--1623.

Cited By

Craveirinha JClímaco JGirão-Silva RPascoal M(2024)Multiobjective Path Problems and Algorithms in Telecommunication Network Design—Overview and TrendsAlgorithms10.3390/a1706022217:6(222)Online publication date: 22-May-2024
https://doi.org/10.3390/a17060222
Daggitt MGriffin T(2024)Formally Verified Convergence of Policy-Rich DBF Routing ProtocolsIEEE/ACM Transactions on Networking10.1109/TNET.2023.332633632:2(1645-1660)Online publication date: Apr-2024
https://doi.org/10.1109/TNET.2023.3326336
Cong PZhang YWang LWang WGong XYang TLi DXu K(2023)DIT and Beyond: Interdomain Routing With Intradomain Awareness for IIoTIEEE Internet of Things Journal10.1109/JIOT.2023.329350010:23(20602-20616)Online publication date: 1-Dec-2023
https://doi.org/10.1109/JIOT.2023.3293500
Show More Cited By

Index Terms

Routing on Multiple Optimality Criteria
1. Networks
  1. Network performance evaluation
    1. Network simulations
  2. Network protocols
    1. Network layer protocols
      1. Routing protocols

Recommendations

Interconnecting routing instances

Many operators run more than one routing instance-- more than one routing protocol, or more than one instance of a given routing protocol--in their networks. Route election and route redistribution are mechanisms introduced by router vendors to ...
Read More
Multidimensional Routing Protocol in Human-Associated Delay-Tolerant Networks

Human-associated delay-tolerant networks (HDTNs) are new networks where mobile devices are associated with humans and can be viewed from multiple dimensions including geographic and social aspects. The combination of these different dimensions enables ...
Read More
A theory for the connectivity discovered by routing protocols

Route-vector protocols, such as the Border Gateway Protocol (BGP), have nodes elect and exchange routes in order to discover paths over which to send traffic. We ask the following: What is the minimum number of links whose failure prevents a route-...
Read More

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

SIGCOMM '20: Proceedings of the Annual conference of the ACM Special Interest Group on Data Communication on the applications, technologies, architectures, and protocols for computer communication

July 2020

814 pages

ISBN:9781450379557

DOI:10.1145/3387514

Copyright © 2020 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

SIGCOMM: ACM Special Interest Group on Data Communication

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 30 July 2020

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Research-article
Research
Refereed limited

Conference

SIGCOMM '20

Sponsor:

SIGCOMM

SIGCOMM '20: Annual conference of the ACM Special Interest Group on Data Communication on the applications, technologies, architectures, and protocols for computer communication

August 10 - 14, 2020

Virtual Event, USA

Acceptance Rates

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

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

16
Total Citations
View Citations
3,339
Total Downloads

Downloads (Last 12 months)392
Downloads (Last 6 weeks)19

Other Metrics

View Author Metrics

Citations

Cited By

Craveirinha JClímaco JGirão-Silva RPascoal M(2024)Multiobjective Path Problems and Algorithms in Telecommunication Network Design—Overview and TrendsAlgorithms10.3390/a1706022217:6(222)Online publication date: 22-May-2024
https://doi.org/10.3390/a17060222
Daggitt MGriffin T(2024)Formally Verified Convergence of Policy-Rich DBF Routing ProtocolsIEEE/ACM Transactions on Networking10.1109/TNET.2023.332633632:2(1645-1660)Online publication date: Apr-2024
https://doi.org/10.1109/TNET.2023.3326336
Cong PZhang YWang LWang WGong XYang TLi DXu K(2023)DIT and Beyond: Interdomain Routing With Intradomain Awareness for IIoTIEEE Internet of Things Journal10.1109/JIOT.2023.329350010:23(20602-20616)Online publication date: 1-Dec-2023
https://doi.org/10.1109/JIOT.2023.3293500
Lu JZhang PLiu Y(2023)A Vector Routing Protocol for Computing and Network Convergence in Digital Grid Scenario2023 7th International Conference on Computer, Software and Modeling (ICCSM)10.1109/ICCSM60247.2023.00015(30-36)Online publication date: 21-Jul-2023
https://doi.org/10.1109/ICCSM60247.2023.00015
Santos SMonteiro FCoutinho BOmar Y(2023)Shortest Path Finding in Quantum Networks With Quasi-Linear ComplexityIEEE Access10.1109/ACCESS.2023.323799711(7180-7194)Online publication date: 2023
https://doi.org/10.1109/ACCESS.2023.3237997
Gomes TMartins LCraveirinha JMedhi D(2023)Two Algorithms for the k-Widest Path ProblemJournal of Network and Systems Management10.1007/s10922-023-09738-z31:3Online publication date: 26-Jun-2023
https://dl.acm.org/doi/10.1007/s10922-023-09738-z
Sobrinho JFerreira M(2022)From Non-Optimal Routing Protocols to Routing on Multiple Optimality CriteriaIEEE/ACM Transactions on Networking10.1109/TNET.2022.3191808(1-14)Online publication date: 2022
https://doi.org/10.1109/TNET.2022.3191808
Ren BGuo DYuan YTang GWang WFu X(2022)Optimal Deployment of SRv6 to Enable Network Interconnection ServiceIEEE/ACM Transactions on Networking10.1109/TNET.2021.310595930:1(120-133)Online publication date: Feb-2022
https://doi.org/10.1109/TNET.2021.3105959
Garcia-Luna-Aceves JSmith BSamson J(2022)QoS Routing Using Dominant-Distance Vectors2022 IEEE/ACM 30th International Symposium on Quality of Service (IWQoS)10.1109/IWQoS54832.2022.9812900(1-10)Online publication date: 10-Jun-2022
https://doi.org/10.1109/IWQoS54832.2022.9812900
Mouhoub NLamali MMagoni D(2022)Semiring Algebraic Structure for Metarouting with Automatic Tunneling2022 IEEE 30th International Conference on Network Protocols (ICNP)10.1109/ICNP55882.2022.9940413(1-6)Online publication date: 30-Oct-2022
https://doi.org/10.1109/ICNP55882.2022.9940413
Show More Cited By

View Options

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

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Media

Figures

Other

Tables

View Table of Contents