article

Metarouting

Authors:

Timothy G. Griffin and

Joäo Luís SobrinhoAuthors Info & Claims

ACM SIGCOMM Computer Communication Review, Volume 35, Issue 4

Pages 1 - 12

https://doi.org/10.1145/1090191.1080094

Published: 22 August 2005 Publication History

Abstract

There is a shortage of routing protocols that meet the needs of network engineers. This has led to BGP being pressed into service as an IGP, despite its lack of convergence guarantees. The development, standardization, and deployment of routing protocols, or even minor changes to existing protocols, are very difficult tasks. We present an approach called Metarouting that defines routing protocols using a high-level and declarative language. Once an interpreter for a metarouting language is implemented on a router, a network operator would have the freedom to implement and use any routing protocol definable in the language. We enforce a clean separation of protocol mechanisms (link-state, path-vector, adjacency maintenance, and so on) from routing policy (how routes are described and compared). The Routing Algebra framework of Sobrinho [25] is used as the theoretical basis for routing policy languages. We define the Routing Algebra Meta-Language (RAML) that allows for the construction of a large family of routing algebras and has the key property that correctness conditions --- guarantees of convergence with respect to the chosen mechanisms --- can be derived automatically for each expression defining a new routing algebra.

References

[1]

R. Callon. Use of OSI IS--IS for Routing in TCP/IP and Dual Environments. RFC1195, December 1990.]]

Digital Library

[2]

Bernard Carré. Graphs and Networks. Oxford University Press, 1979.]]

[3]

Dan Decasper, Zubin Dittia, Guru Parulkar, and Bernhard Plattner. Router plugins: a software architecture for next generation routers. SIGCOMM Comput. Commun. Rev., 28(4):229--240, 1998.]]

Digital Library

[4]

E. W. Dijkstra. A Note on Two Problems in Connexion with Graphs. Numerische Mathematik 1, pages 269--271, 1959.]]

[5]

Forces. IETF Forwarding and Control Element Separation working group.]]

[6]

Lixin Gao and Jennifer Rexford. Stable internet routing without global coordination. IEEE/ACM Transactions on Networking, pages 681--692, December 2001.]]

Digital Library

[7]

M. Gondran and M. Minoux. Graphs and Algorithms. Wiley, 1984.]]

Digital Library

[8]

Timothy Griffin, Aaron D. Jaggard, and Vijay Ramachandran. Design principles of policy languages for path vector protocols. In Proc. ACM SIGCOMM, September 2003.]]

Digital Library

[9]

Timothy G. Griffin, Lixin Gao, and Jennifer Rexford. Inherently safe backup routing with BGP. In Proc. IEEE INFOCOM, April 2001.]]

[10]

Timothy G. Griffin and Geoff Huston. BGP Wedgies, June 2005. Internet Draft (work in progress).]]

[11]

Sam Halabi and Danny McPherson. Internet Routing Architectures. Cisco Press, second edition, 2001.]]

Digital Library

[12]

Mark Handley, Eddie Kohler, Atanu Ghosh, Orion Hodson, and Pavlin Radoslavov. Designing extensible IP router software. In 2nd USENIX Symposium on Networked Systems Design and Implementation (NSDI), 2005. see also www.xorp.org+.]]

Digital Library

[13]

C. Hendrick. Routing information protocol. RFC 1058, 1988.]]

Digital Library

[14]

Eddie Kohler, Robert Morris, Benjie Chen, John Jannotti, and M. Frans Kaashoek. The click modular router. ACM Transactions on Computer Systems, 18(3):263--297, 2000.]]

Digital Library

[15]

K.Varadhan, R. Govindan, and D. Estrin. Persistent route oscillations in inter-domain routing. Computer Networks, 32:1--16, 2000.]]

[16]

Charles Lynn, Joanne Mikkelson, and Karen Seo. Secure BGP (S-BGP). draft-clynn-s-bgp-protocol-00a.txt. work in progress.]]

[17]

Andreu Mas-Colell, Michael D. Whinston, and Jerry R. Green. Microeconomic Theory. Oxford University Press, 1995.]]

[18]

D. McPherson, V. Gill, D. Walton, and A. Retana. RFC3345: BGP persistent route oscillation condition, 2002.]]

Digital Library

[19]

Mehryar Mohri. Semiring frameworks and algorithms for shortest-distance problems. J. Autom. Lang. Comb., 7(3):321--350, 2002.]]

[20]

J. Moy. OSPF version 2. RFC 2328, 1998.]]

[21]

John Moy. OSPF: Anatomy of an Internet Routing Protocol. Addison-Wesley, 1998.]]

Digital Library

[22]

Craig Partridge, Alex C. Snoeren, W. Timothy Strayer, Beverly Schwartz, Matthew Condell, and Isidro Castineyra. Fire: Flexible intra-as routing environment. IEEE Journal on Selected Areas in Communications (J-SAC), 19(3), 2001. A preliminary version appeared in SIGCOMM 2000.]]

[23]

Albaro Retana, Russ White, and Don Slice. EIGRP for IP. Addison-Wesley, 1998.]]

[24]

Joao Luis Sobrinho. Algebra and algorithms for QoS path computation and hop-by-hop. IEEE/ACM Transactions on Networking, 10(4):541--550, August 2002.]]

Digital Library

[25]

Joao Luis Sobrinho. Network routing with path vector protocols: Theory and applications. In Proc. ACM SIGCOMM, September 2003.]]

Digital Library

[26]

Cisco Systems. Endless BGP convergence problem in Cisco IOS software releases. Field Note, October 10 2001, http://www.cisco.com/warp/public/770/ fn12942.html.]]

[27]

Russ White, Danny McPherson, and Srihari Sangli. Practical BGP. Addison Wesley, 2005.]]

Digital Library

[28]

Randy Zhang and Micah Bartell. BGP Design and Implementation. Cisco Press, 2003.]]

Digital Library

Cited By

Thijm TBeckett RGupta AWalker D(2024)Kirigami, the Verifiable Art of Network CuttingIEEE/ACM Transactions on Networking10.1109/TNET.2024.336037132:3(2447-2462)Online publication date: Jun-2024
https://doi.org/10.1109/TNET.2024.3360371
Mouhoub NMoloney MMagoni D(2024)Metarouting with automatic tunneling in multilayer networksJournal of Network and Computer Applications10.1016/j.jnca.2024.103929(103929)Online publication date: Jun-2024
https://doi.org/10.1016/j.jnca.2024.103929
Thijm TBeckett RGupta AWalker D(2022)Kirigami, the Verifiable Art of Network Cutting2022 IEEE 30th International Conference on Network Protocols (ICNP)10.1109/ICNP55882.2022.9940333(1-12)Online publication date: 30-Oct-2022
https://doi.org/10.1109/ICNP55882.2022.9940333
Show More Cited By

Index Terms

Metarouting
1. Hardware
  1. Communication hardware, interfaces and storage
2. Networks

Recommendations

Metarouting
SIGCOMM '05: Proceedings of the 2005 conference on Applications, technologies, architectures, and protocols for computer communications

There is a shortage of routing protocols that meet the needs of network engineers. This has led to BGP being pressed into service as an IGP, despite its lack of convergence guarantees. The development, standardization, and deployment of routing ...
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
The Blocking Option in Routing Protocols
SRDS '09: Proceedings of the 2009 28th IEEE International Symposium on Reliable Distributed Systems

Routing protocols are designed under the assumption that each node in a network should be able to reach (i.e. send or forward packets to) every other node in the network. Unfortunately, adopting this assumption in a routing protocol does allow adversary ...
Read More

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

143
Total Citations
View Citations
1,074
Total Downloads

Downloads (Last 12 months)59
Downloads (Last 6 weeks)8

Other Metrics

View Author Metrics

Citations

Cited By

Thijm TBeckett RGupta AWalker D(2024)Kirigami, the Verifiable Art of Network CuttingIEEE/ACM Transactions on Networking10.1109/TNET.2024.336037132:3(2447-2462)Online publication date: Jun-2024
https://doi.org/10.1109/TNET.2024.3360371
Mouhoub NMoloney MMagoni D(2024)Metarouting with automatic tunneling in multilayer networksJournal of Network and Computer Applications10.1016/j.jnca.2024.103929(103929)Online publication date: Jun-2024
https://doi.org/10.1016/j.jnca.2024.103929
Thijm TBeckett RGupta AWalker D(2022)Kirigami, the Verifiable Art of Network Cutting2022 IEEE 30th International Conference on Network Protocols (ICNP)10.1109/ICNP55882.2022.9940333(1-12)Online publication date: 30-Oct-2022
https://doi.org/10.1109/ICNP55882.2022.9940333
Abhashkumar AGember-Jacobson AAkella ABhagwan RPorter G(2020)TiramisuProceedings of the 17th Usenix Conference on Networked Systems Design and Implementation10.5555/3388242.3388257(201-220)Online publication date: 25-Feb-2020
https://dl.acm.org/doi/10.5555/3388242.3388257
Ranathunga DRoughan MNguyen H(2020)Verifiable Policy-Defined Networking using MetagraphsIEEE Transactions on Dependable and Secure Computing10.1109/TDSC.2020.2974727(1-1)Online publication date: 2020
https://doi.org/10.1109/TDSC.2020.2974727
Xiang QZhang JGao KLim YLe FLi GYang Y(2020)Toward Optimal Software-Defined Interdomain RoutingIEEE INFOCOM 2020 - IEEE Conference on Computer Communications10.1109/INFOCOM41043.2020.9155486(1529-1538)Online publication date: Jul-2020
https://doi.org/10.1109/INFOCOM41043.2020.9155486
Pan YGao SYang W(2020)Enhanced Logical Representations of a Real Network Based on an Algebraic ModelIEEE Access10.1109/ACCESS.2020.29942378(100509-100520)Online publication date: 2020
https://doi.org/10.1109/ACCESS.2020.2994237
Wirtgen TDenos CConinck QJadin MBonaventure O(2019)The Case for Pluginized Routing Protocols2019 IEEE 27th International Conference on Network Protocols (ICNP)10.1109/ICNP.2019.8888065(1-12)Online publication date: Oct-2019
https://doi.org/10.1109/ICNP.2019.8888065
Beckett RGupta AMahajan RWalker DGorinsky STapolcai J(2018)Control plane compressionProceedings of the 2018 Conference of the ACM Special Interest Group on Data Communication10.1145/3230543.3230583(476-489)Online publication date: 7-Aug-2018
https://dl.acm.org/doi/10.1145/3230543.3230583
Gao SShrivastava SOgan KXin YBaldin I(2018)Evaluating Path Query Mechanisms as a Foundation for SDN Network Control2018 4th IEEE Conference on Network Softwarization and Workshops (NetSoft)10.1109/NETSOFT.2018.8460116(28-36)Online publication date: Jun-2018
https://doi.org/10.1109/NETSOFT.2018.8460116
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 Issue’s Table of Contents