Unicast QoS Routing Algorithms for SDN: A Comprehensive Survey and Performance Evaluation

Guck, Jochen W.; Bemten, Amaury Van; Reisslein, Martin; Kellerer, Wolfgang

doi:10.1109/comst.2017.2749760

Cited by 145 publications

(117 citation statements)

References 206 publications

Supporting

Mentioning

101

Contrasting

Unclassified

Order By: Relevance

“…Without considering the specified nodes, the optimal CSP (highlighted in red) is A-B-D-F with a cost of 6. This path can be found by traditional optimal CSP algorithms [7]. Considering the specified nodes, the optimal CSP (shown in green) is A-B-C-E-F with a cost of 10.…”

Section: A Motivation: Routing Through Service Function Chainsmentioning

confidence: 99%

“…Considering the specified nodes, the optimal CSP (shown in green) is A-B-C-E-F with a cost of 10. While the definition of the OSNE of the CSP problem is straightforward, traditional CSP algorithms [7] are not able to solve this extension and alternative solutions are hence needed.…”

Section: A Motivation: Routing Through Service Function Chainsmentioning

confidence: 99%

“…The CSP problem has been thoroughly investigated in the literature and a wide range of algorithms have been proposed [3], [7]. However, unlike for the SP problem, the adaptation of CSP algorithms for visiting a set of ordered specified nodes is not straightforward.…”

Section: Description Of Larac-snmentioning

confidence: 99%

“…1) The State-of-the-Art LARAC Algorithm: The CSP problem being NP-complete [1], a wide range of heuristics have been proposed [7]. Among these, the LARAC heuristic [6], [8] generally achieves the best trade-off between runtime and optimality gap [7].…”

Section: Description Of Larac-snmentioning

confidence: 99%

“…Among these, the LARAC heuristic [6], [8] generally achieves the best trade-off between runtime and optimality gap [7]. The LARAC algorithm is based on the Lagrange relaxation technique, which allows to solve a constrained problem by removing some of the constraints and by introducing them in the optimization objective [24].…”

Section: Description Of Larac-snmentioning

confidence: 99%

See 4 more Smart Citations

LARAC-SN and Mole in the Hole: Enabling Routing through Service Function Chains

Bemten

Guck

Vizarreta

et al. 2018

2018 4th IEEE Conference on Network Softwarization and Workshops (NetSoft)

Self Cite

View full text Add to dashboard Cite

Abstract-With the emergence of Software-Defined Networking (SDN) and Network Function Virtualization (NFV), the problem of centralized routing through intermediate specified nodes (for which several candidates can be defined) has become an important issue. Indeed, an SDN controller routing flows through Service Function Chains (SFCs) has to efficiently solve this problem to achieve the online provisioning of routing requests and the online placement of Virtual Network Functions (VNFs). In this paper, we propose two algorithms for solving this problem. First, we propose LARAC for specified nodes (LARAC-SN), a fast and close to optimal algorithm for finding the constrained shortest path (CSP) visiting an ordered set of specified nodes. Second, we propose Mole in the Hole (MITH), a graph transformation algorithm which can force any state-of-the-art routing algorithm to visit an ordered set of specified nodes. While LARAC-SN is bounded to the specific CSP problem and can only handle one candidate per specified node, MITH can be used for any routing problem and can deal with several candidates per specified node. Through evaluations, we show that LARAC-SN is fast and close to optimal (its optimality gap stays lower than 1.62% in average) and that MITH has the potential of reaching optimality for any problem, but at the cost of a higher runtime.

show abstract

Section: A Motivation: Routing Through Service Function Chainsmentioning

confidence: 99%

Section: A Motivation: Routing Through Service Function Chainsmentioning

confidence: 99%

Section: Description Of Larac-snmentioning

confidence: 99%

Section: Description Of Larac-snmentioning

confidence: 99%

Section: Description Of Larac-snmentioning

confidence: 99%

See 3 more Smart Citations

LARAC-SN and Mole in the Hole: Enabling Routing through Service Function Chains

Bemten

Guck

Vizarreta

et al. 2018

2018 4th IEEE Conference on Network Softwarization and Workshops (NetSoft)

Self Cite

View full text Add to dashboard Cite

show abstract

Estimation of Computation Time for Software‐Defined Networking‐Based Data Traffic Offloading System in Heterogeneous Network

Abayagunawardhana¹,

Halgamuge²,

Jayasekara³

2022

Wireless Communication Security

View full text Add to dashboard Cite

QoS‐based routing scheme in software‐defined networks using fuzzy analytic hierarchy process

Rezaei

Ghaffari

2023

Concurrency and Computation

View full text Add to dashboard Cite

Summary Recently, with the rapid development of the Internet of Things (IoT) and its real‐time applications, the network is required to guarantee the differential quality of service (QoS) requirements of the various data flows (telemedicine, video, and live streaming) of various IoT services. Software‐defined network (SDN) as emerging network technology separates the control logic from data planes of networks and is a promising technique to guarantee the QoS requirements of different services. In SDN, the controller has global visibility of the whole network devices such as switches and routers. Hence, controllers can dynamically optimize QoS requirements and resources of the network. On the other hand, providing a QoS‐aware routing scheme is an important challenge. Hence, in this paper by capitalizing on the fuzzy analytic hierarchy process (AHP), a new QoS‐aware routing method is proposed in SDNs. The proposed scheme considers the combination of different QoS criteria such as bandwidth, route length, reliability, and bit error rate for selecting an appropriate route between sender and receiver nodes. The simulation results indicated that the proposed method improves throughput and end‐to‐end delay. Comparison with other routing algorithms shows that the proposed method performs better load balancing under different network topologies.

show abstract

Unicast QoS Routing Algorithms for SDN: A Comprehensive Survey and Performance Evaluation

Cited by 145 publications

References 206 publications

LARAC-SN and Mole in the Hole: Enabling Routing through Service Function Chains

LARAC-SN and Mole in the Hole: Enabling Routing through Service Function Chains

Estimation of Computation Time for Software‐Defined Networking‐Based Data Traffic Offloading System in Heterogeneous Network

QoS‐based routing scheme in software‐defined networks using fuzzy analytic hierarchy process

Contact Info

Product

Resources

About