Chain Routing: A new routing framework for the Internet based on complete orders
P. David Arjona-Villica\~na, Costas C. Constantinou, Alexander S., Stepanenko

TL;DR
This paper introduces Chain Routing, a novel framework for Internet routing at the Autonomous System level that leverages complete orders to improve stability, avoid loops, and facilitate traffic engineering.
Contribution
It proposes using complete orders as the core topological unit for routing, enhancing stability and enabling new traffic management capabilities.
Findings
Eliminates persistent route oscillations
Prevents transient routing loops
Potentially more reliable and stable than BGP
Abstract
A new framework to perform routing at the Autonomous System level is proposed in this paper. This mechanism, called Chain Routing, uses complete orders as its main topological unit. Since complete orders are acyclic digraphs that possess a known topology, it is possible to define an acyclic structure to route packets between a group of Autonomous Systems. The adoption of complete orders also allows easy identification and avoidance of persistent route oscillations, eliminates the possibility of developing transient loops in paths, and provides a structure that facilitates the implementation of traffic engineering. Moreover, by combining Chain Routing with other mechanisms that implement complete orders in time, we suggest that it is possible to design a new routing protocol which could be more reliable and stable than BGP's current implementation. Although Chain Routing will require an…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsInterconnection Networks and Systems · Mobile Ad Hoc Networks · Network Traffic and Congestion Control
