2013 21st IEEE International Conference on Network Protocols (ICNP) 2013
DOI: 10.1109/icnp.2013.6733608
|View full text |Cite
|
Sign up to set email alerts
|

On the forwarding paths produced by Internet routing algorithms

Abstract: Most Internet routing protocols have one of two algorithms lurking at their core -either Dijkstra's algorithm in the case of link-state protocols or a distributed Bellman-Ford algorithm in the case of distance-vector or path-vector protocols. When computing simple shortest paths these protocols can be modified to utilize all best paths with a combination of nexthop sets and Equal Cost Multi-Path (ECMP) forwarding. We show that this picture breaks down even for simple modifications to the shortest path metric. … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
4
0

Year Published

2015
2015
2023
2023

Publication Types

Select...
5
2

Relationship

0
7

Authors

Journals

citations
Cited by 7 publications
(4 citation statements)
references
References 27 publications
0
4
0
Order By: Relevance
“…For example, this approach allowed to define a "scoped" product to model the combined metric of iBGP and eBGP. In [4], [5], [6], the authors proposed a lexicographic product to combine several Quality of Service metrics to obtain a single composite metric. They also showed which properties are required to guarantee optimal global and local solutions when using the lexicographic products.…”
Section: Related Workmentioning
confidence: 99%
“…For example, this approach allowed to define a "scoped" product to model the combined metric of iBGP and eBGP. In [4], [5], [6], the authors proposed a lexicographic product to combine several Quality of Service metrics to obtain a single composite metric. They also showed which properties are required to guarantee optimal global and local solutions when using the lexicographic products.…”
Section: Related Workmentioning
confidence: 99%
“…Proactive behavior is the transmission of rules by the controller before the router receives the associated packets. Several solutions have been developed based on the back-pressure algorithm adapted for data networks that are very sensitive to latency and especially QoS [15] [16].…”
Section: Proactive Approachmentioning
confidence: 99%
“…Algebras have also been proposed in meta-routing (Dynerowicz and Griffin, 2013), to provably choose paths that optimise various path-metrics. But, these algebras do not support specification of node properties such as traffic transitivity.…”
Section: Traffic Measurement Policiesmentioning
confidence: 99%
“…We developed the following right iteration algorithm 2 to compute A * , inspired by algorithms in metarouting (Dynerowicz and Griffin, 2013). In doing so, we allow the node property: traffic transitivity, to be explicitly specified via a zone-transitivity matrix T .…”
Section: Computation Of All Firewall-pathsmentioning
confidence: 99%