Flexible Traffic Engineering: When OpenFlow Meets Multi-Protocol IP-Forwarding

Li, Suoheng; Shao, Yan; Ma, Shoujiang; Xue, Nana; Li, Shengru; Hu, Daoyun; Zhu, Zuqing

doi:10.1109/lcomm.2014.2349991

Cited by 15 publications

(6 citation statements)

References 6 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…A different approach is followed by Li et al [156], in which congestion minimisation is directly handled by applying a CSPF algorithm. They propose to use OpenFlow border routers in order to connect IPv4 and IPv6 islands in an efficient manner.…”

Section: B Openflowmentioning

confidence: 99%

“…Bin et al [132] Wang et al [133] Jiang et al [134] Chen et al [136] Li et al [136] Luo et al [137] Tarnaras et al [138] Zhong et al [139] Jeong et al [140] Yoon et al [141] OpenFlow Jain et al [143] Hong et al [144] Van deer Pol et al [145] Mendiola et al [146] ESNet [16] Bredel et al [147] Das et al [149] Das et al [148] Agarwal et al [150] Koerner et al [151] Gharbaoui et al [152] Wang et al [153] Huang et al [154] Braun et al [155] Li et al [156] Tso et al [157] Trestian et al [158] Kassler et al [159] Phemius et al [160] Nguyen et al [161] Pisa et al [162] Iyer et al [193] Durner et al [194] Lazaris et al [195] Kuzniar et al [196] Rotsos et al [197] I2RS Huang et al [100] Sgambelluri et al [165] BGP-LS / PCEP…”

Section: Forcesmentioning

confidence: 99%

See 1 more Smart Citation

A Survey on the Contributions of Software-Defined Networking to Traffic Engineering

Mendiola

Astorga

Jacob

et al. 2017

IEEE Commun. Surv. Tutorials

159

View full text Add to dashboard Cite

Since the appearance of OpenFlow back in 2008, Software-Defined Networking (SDN) has gained momentum. Although there are some discrepancies between the standards developing organisations working with SDN about what SDN is and how it is defined, they all outline Traffic Engineering (TE) as a key application. One of the most common objectives of TE is the congestion minimisation, where techniques such as traffic splitting among multiple paths or advanced reservation systems are used. In such a scenario, this manuscript surveys the role of a comprehensive list of SDN protocols in TE solutions, in order to assess how these protocols can benefit TE. The SDN protocols have been categorised using the SDN architecture proposed by the Open Networking Foundation (ONF), which differentiates among Data-Controller Plane Interfaces, Application-Controller Plane Interfaces and Management Interfaces, in order to state how the interface type in which they operate influences TE. In addition, the impact of the SDN protocols on TE has been evaluated by comparing them with the Path Computation Element (PCE)based architecture. The PCE-based architecture has been selected to measure the impact of SDN on TE because it is the most novel TE architecture until the date, and because it already defines a set of metrics to measure the performance of TE solutions. We conclude that using the three types of interfaces simultaneously will result in more powerful and enhanced TE solutions, since they benefit TE in complementary ways.

show abstract

Section: B Openflowmentioning

confidence: 99%

Section: Forcesmentioning

confidence: 99%

A Survey on the Contributions of Software-Defined Networking to Traffic Engineering

Mendiola

Astorga

Jacob

et al. 2017

IEEE Commun. Surv. Tutorials

159

View full text Add to dashboard Cite

show abstract

“…Some previous works [6], [7] present an OpenFlow-based architecture to achieve this challenge, but they only focus on the convergence of packet and circuit networks. Other works tackle the traffic engineering problem in SDNs but they circumscribe it to a single layer [8] or to the IPv4/IPv6 migration [9]. However, an important problem to solve remains the path computation process in a multi-layer context.…”

Section: Introductionmentioning

confidence: 99%

Algorithmic and Complexity Aspects of Path Computation in Multi-Layer Networks

Lamali

Fergani

Cohen

2018

IEEE/ACM Trans. Networking

View full text Add to dashboard Cite

Carrier-grade networks comprise several layers where different protocols coexist. Nowadays, most of these networks have different control planes to manage routing on different layers, leading to a suboptimal use of the network resources and to additional operational costs. However, some routers are able to encapsulate, decapsulate, and convert protocols, and act as a liaison between these layers. A unified control plane would be useful to optimize the use of the network resources and to automate the routing configurations. Software-Defined Networking based architectures, offer an opportunity to design such a control plane. One of the most important problems to deal with in this design is the path computation process. Classical path computation algorithms cannot resolve the problem as they do not take into account encapsulations and conversions of protocols. In this paper, we propose algorithms to solve this problem, and we study several cases. If there is no bandwidth constraint, we propose a polynomial algorithm that compute the optimal path. We also give lower and upper bounds on the optimal path length. On the other hand, we show that the problem is NPhard if there is a bandwidth constraint (or other Quality of Service parameters), even if there is only two protocols and in a symmetric graph. We study the complexity and the scalability of our algorithms and evaluate their performances on real and random topologies. The results show that they are faster than the previous ones proposed in the literature. These algorithms can also have important applications in automatic tunneling.

show abstract

“…Some previous works [4], [5] present an OpenFlow-based architecture to achieve this challenge, but they only focus on the convergence of packet and circuit networks. Other works tackle the traffic engineering problem in SDNs but circumscribe it on a single layer [6] or in the IPv4/IPv6 migration context [7]. However, an important problem to solve remains the path computation process in a multi-layer context.…”

Section: Introductionmentioning

confidence: 99%

Path computation in multi-layer networks: Complexity and algorithms

Lamali

Fergani

Cohen

et al. 2016

IEEE INFOCOM 2016 - The 35th Annual IEEE International Conference on Computer Communications

View full text Add to dashboard Cite

Abstract-Carrier-grade networks comprise several layers where different protocols coexist. Nowadays, most of these networks have different control planes to manage routing on different layers, leading to a suboptimal use of the network resources and additional operational costs. However, some routers are able to encapsulate, decapsulate and convert protocols and act as a liaison between these layers. A unified control plane would be useful to optimize the use of the network resources and automate the routing configurations. Software-Defined Networking (SDN) based architectures, such as OpenFlow, offer a chance to design such a control plane. One of the most important problems to deal with in this design is the path computation process. Classical path computation algorithms cannot resolve the problem as they do not take into account encapsulations and conversions of protocols. In this paper, we propose algorithms to solve this problem and study several cases: Path computation without bandwidth constraint, under bandwidth constraint and under other Quality of Service constraints. We study the complexity and the scalability of our algorithms and evaluate their performances on real topologies. The results show that they outperform the previous ones proposed in the literature.

show abstract

Flexible Traffic Engineering: When OpenFlow Meets Multi-Protocol IP-Forwarding

Cited by 15 publications

References 6 publications

A Survey on the Contributions of Software-Defined Networking to Traffic Engineering

A Survey on the Contributions of Software-Defined Networking to Traffic Engineering

Algorithmic and Complexity Aspects of Path Computation in Multi-Layer Networks

Path computation in multi-layer networks: Complexity and algorithms

Contact Info

Product

Resources

About