Routing on Multiple Optimality Criteria

  title={Routing on Multiple Optimality Criteria},
  author={Jo{\~a}o Lu{\'i}s Sobrinho and Miguel Alves Ferreira},
  journal={Proceedings of the Annual conference of the ACM Special Interest Group on Data Communication on the applications, technologies, architectures, and protocols for computer communication},
  • J. L. Sobrinho, Miguel Alves Ferreira
  • Published 30 July 2020
  • Computer Science
  • Proceedings of the Annual conference of the ACM Special Interest Group on Data Communication on the applications, technologies, architectures, and protocols for computer communication
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… 

Figures and Tables from this paper

Routing on Multiple Optimality Criteria: Theory and Protocols
This work designs new routing protocols that compute on partial orders and have each node elect a set of attributes, rather than a single attribute, as standard vectoring protocols do, and shows that the protocols devised require only a few elected attributes per destination and converge fast.
Formally Verified Convergence of Policy-Rich DBF Routing Protocols
A new algebraic model for abstract routing problems which has fewer primitives than previous models and can represent more expressive policy languages and is also the first to allow concurrent reasoning about distance-vector and path-vector protocols.
Optimal Deployment of SRv6 to Enable Network Interconnection Service
This paper study the problem of SRv6 incremental deployment to provide a more balanced interconnection service from a traffic engineering view and proposes two greedy methods considering short-term and long-term impacts with reinforcement learning, namely GSI and GLI.
Exploiting Path Diversity to Increase System Performance in Mega-constellations
A Multi-routing-plane based Flow Scheduling Strategy (MFSS) is proposed, which can make full use of path diversity to solve simplification of path selection and solve the high-dynamics problem through cooperation between satellites and the terrestrial networks.
On Braess's paradox and routing algorithms
This paper shows the novel issue of how the addition of resources can lead to a decrease in data network performance while using certain routing algorithm (ie, shortest widest path—used for quality‐of‐service routing, quickest path, geographic routing, quality‐ of‐service energy‐aware routing), without even considering congestion.
An Axiomatic Perspective on the Performance Effects of End-Host Path Selection
MAMRL: Exploiting Multi-agent Meta Reinforcement Learning in WAN Traffic Engineering
This work develops and evaluates a model-free approach, applying multi-agent meta reinforcement learning (MAMRL) that can determine the next-hop of each packet to get it delivered to its destination with minimum time overall and presents a novel meta-learning-based framework, MAMRL, for enabling quick adaptation to topology changes.
Colibri: a cooperative lightweight inter-domain bandwidth-reservation infrastructure
This paper presents an architecture achieving guaranteed bandwidth properties for global inter-domain network traffic, based on a distributed server infrastructure, while the data plane enables efficient packet forwarding on per-flow stateless routers.
A deep reinforcement learning-based multi-optimality routing scheme for dynamic IoT networks


An algebraic theory of dynamic network routing
  • J. L. Sobrinho
  • Computer Science
    IEEE/ACM Transactions on Networking
  • 2005
A non-classic algebraic theory is developed for investigating the convergence properties of dynamic routing protocols and shows that routing protocols can be made to converge to shortest and widest paths, but that the composite metric of Internet Gateway Routing Protocol (IGRP) does not lead to optimal paths.
Algebra and algorithms for QoS path computation and hop-by-hop routing in the internet
It is concluded that shortest-widest paths can neither be computed with a generalized Dijkstra's algorithm nor can packets be routed hop-by-hop over those paths.
The Routing Algebra Meta-Language (RAML) is defined that allows for the construction of a large family of routing algebras and has the key property that correctness conditions can be derived automatically for each expression defining a new routing algebra.
Reliable interdomain routing through multiple complementary routing processes
This paper applies to inter-domain routing a common concept in the design of highly reliable systems, namely, the use of redundancy, which is introduced in a manner that maximizes compatibility with the existing BGP protocol.
Neighbor-specific BGP: more flexible routing policies while improving global stability
Surprisingly, it is proved that the much more flexible NS-BGP is guaranteed to be stable under much less restrictive conditions on how routers "rank" the candidate routes, and can be deployed by individual ASes independently without changes to the BGP message format or collaboration from neighboring ASes.
Maximizable routing metrics
This paper gives a formal definition of routing metrics and identifies two important properties: boundedness and monotonicity that are both necessary and sufficient for a routing metric to be maximizable in any network.
BGP Add-Paths: The Scaling/Performance Tradeoffs
It is shown that these modes differently fulfill the needs of Add-Paths applications such as fast recovery upon failure and MED oscillation avoidance, and that the costs and benefits bound with these modes depend on the connectivity of the AS where it is deployed.
Highly dynamic Destination-Sequenced Distance-Vector routing (DSDV) for mobile computers
This paper investigates modifications to the basic Bellman-Ford routing mechanisms, as specified by RIP, to make it suitable for a dynamic and self-starting network mechanism as is required by users wishing to utilize ad hoc networks.
Guaranteeing BGP Stability with a Few Extra Paths
This paper designs an algorithm, Stable Path(s) Assignment (SPA), that provably detects persistent oscillations and eliminates these oscillations by assigning multiple paths to some ASes in the network, and proposes multipath routing to find a better trade-off between AS policy autonomy and system stability.
Fundamental Differences Among Vectoring Routing Protocols on Non-Isotonic Metrics
It is shown that non-restarting vectoring protocols, such as RIP, EIGRP, and BGP, route correctly, along paths that can be characterized as the best possible subject to a destination-based forwarding strategy; whereas, contrastingly, restarting vectored protocols,such as DSDV and a mode of operation of Babel, do not route correctly.