2020
DOI: 10.1016/j.comnet.2019.106975
|View full text |Cite
|
Sign up to set email alerts
|

KeySFC: Traffic steering using strict source routing for dynamic and efficient network orchestration

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
13
0
6

Year Published

2020
2020
2024
2024

Publication Types

Select...
5
1
1

Relationship

1
6

Authors

Journals

citations
Cited by 22 publications
(19 citation statements)
references
References 18 publications
0
13
0
6
Order By: Relevance
“…KeySet relies on a residual system to quickly calculate routing paths. A further elaboration of this concept, KeySFC [26], uses simple label-based SR in edge software switches to classify, encapsulate, forward, and decapsulate flows, along with core table-less switches that forward packets based on simple modulo operations over the labels. Finally, [25] proposes an algorithmic-based SR forwarding making use of a high-performance forwarding mechanism based on XOR operations.…”
Section: Related Workmentioning
confidence: 99%
“…KeySet relies on a residual system to quickly calculate routing paths. A further elaboration of this concept, KeySFC [26], uses simple label-based SR in edge software switches to classify, encapsulate, forward, and decapsulate flows, along with core table-less switches that forward packets based on simple modulo operations over the labels. Finally, [25] proposes an algorithmic-based SR forwarding making use of a high-performance forwarding mechanism based on XOR operations.…”
Section: Related Workmentioning
confidence: 99%
“…At this moment the encapsulation information is checked again to find the address of the next SF and this loop proceeds until the chain terminates, when the packet is decapsulated and delivered to destination. However, there are fundamental problems in this approach that compromise efficient network orchestration: (i) the commonly adopted underlying routing mechanisms cannot represent all the possible paths between two endpoints due to limited capacity of switch forwarding tables [Jyothi et al 2015]; (ii) as they are based on per-hop table lookup, the overhead to dynamically change a path is high, because it may involve modifications in all the nodes in the path [Dominicini et al 2020]; and (iii) traffic engineering decisions are made in a decoupled way considering placement, chaining, and routing [Quinn et al 2018]. On the other hand, emerging networking architectures and equipment are allowing for softwarization of DCNs and flexible dataplane programmability at line rate, both at the switch and the network interfaces, opening up unprecedented opportunities for the development of innovative networking solutions [McCauley et al 2019].…”
Section: Problem and Motivationmentioning
confidence: 99%
“…• Algorithmic forwarding can replace forwarding tables in the design of scalable SFC solutions. Differently from table-based methods, it defines the output port using a fixed logic based on information about the current and destination nodes [Dominicini et al 2020], and can reduce the number of forwarding states. • Strict source routing (SSR) allows to specify any underlay path between SFs and design agile, and expressive SFC solutions.…”
Section: Hypotheses Proposal and Contributionsmentioning
confidence: 99%
See 2 more Smart Citations