2016
DOI: 10.1145/3027947.3027948
|View full text |Cite
|
Sign up to set email alerts
|

Recursive SDN for Carrier Networks

Abstract: Control planes for global carrier networks should be programmable (so that new functionality can be easily introduced) and scalable (so they can handle the numerical scale and geographic scope of these networks). Neither traditional control planes nor new SDN-based control planes meet both of these goals. In this paper, we propose a framework for recursive routing computations that combines the best of SDN (programmability) and traditional networks (scalability through hierarchy) to achieve these two desired p… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
10
0

Year Published

2017
2017
2024
2024

Publication Types

Select...
8
1

Relationship

0
9

Authors

Journals

citations
Cited by 18 publications
(10 citation statements)
references
References 24 publications
0
10
0
Order By: Relevance
“…Although this algorithm was not applied in an SDN architecture, it provided a new reference direction for subsequent routing optimization algorithms. Lin et al [ 21 ] introduced multi-layer SDN QoS-aware adaptive routing, combining the work of Hassas [ 22 ] and McCauley [ 23 ], introducing a distributed control plane architecture, and achieving a reliable SDN infrastructure with minimal signal latency. Rischke et al [ 24 ] proposed the QR-SDN algorithm to create multiple paths between source and destination addresses, maintaining flow integrity using Q-Learning, and employing the softmax function as an exploration-exploitation strategy.…”
Section: Related Workmentioning
confidence: 99%
“…Although this algorithm was not applied in an SDN architecture, it provided a new reference direction for subsequent routing optimization algorithms. Lin et al [ 21 ] introduced multi-layer SDN QoS-aware adaptive routing, combining the work of Hassas [ 22 ] and McCauley [ 23 ], introducing a distributed control plane architecture, and achieving a reliable SDN infrastructure with minimal signal latency. Rischke et al [ 24 ] proposed the QR-SDN algorithm to create multiple paths between source and destination addresses, maintaining flow integrity using Q-Learning, and employing the softmax function as an exploration-exploitation strategy.…”
Section: Related Workmentioning
confidence: 99%
“…A recursive building block known as a logical xBar, which is a programmable entity that can switch packets between ports, and a logical server, which manages forwarding tables and control plane computations, are used to create a centralized hierarchical control plane [326].…”
Section: Control Modelsmentioning
confidence: 99%
“…To simulate realistic SDNs, we use the Rocketfuel topologies [34], which are used in many recent publications on SDN such as [5], [6], [35], [36], [37], [38] as well as fat-tree topologies [39] that are typically used in data-center networks. We present the results based on the Rocketfuel topology AS1239 with 1944 links and 315 nodes, for a capacity of 12 for every link and results from an 8-ary fat-tree with 1280 links and 256 server nodes and a link capacity of 25.…”
Section: Evaluation a Test Environmentmentioning
confidence: 99%