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

Bemten, Amaury Van; Guck, Jochen W.; Vizarreta, Petra; Machuca, Carmen Mas; Kellerer, Wolfgang

doi:10.1109/netsoft.2018.8460128

Cited by 4 publications

(12 citation statements)

References 23 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Although the problem is hard on general network topologies if capacity constraints have to be fulfilled along the links for data plane traffic, in [29] the authors characterize the families of graphs for which polynomial-time algorithms exist. In [30] a Lagrangerelaxation technique was applied for the constrained shortest path problem, i.e., find shortest paths visiting nodes in a specific order. However, the proposed methods cannot guarantee link-disjointness of different segments of the paths; thus, cannot be used for resilient routing.…”

Section: Function Chain Routing Algorithmsmentioning

confidence: 99%

Resilient Control Plane Design for Virtual Software Defined Networks

Babarczi

2021

IEEE Trans. Netw. Serv. Manage.

View full text Add to dashboard Cite

Control plane survivability in virtual softwaredefined networks (vSDN) -where multiple tenants share the same physical infrastructure -is even more critical than in normal SDN networks. A reliable communication channel from the switches through the network hypervisor to the virtual controller is inevitable in order to avoid state inconsistencies, tenant isolation and security issues on the virtual switches. Although reliable controller placement and control plane design was thoroughly investigated in SDNs, there was a lack of attention for resilient hypervisor placement and control path design for vSDNs. Therefore, in this paper we make a two-fold contribution towards a survivable vSDN control plane. First, we propose an approximation algorithm for (hypervisor) placement which -in contrast with traditional approaches which minimize the average latency to the hypervisors as an objective function -focuses on finding the appropriate number of hypervisor instances to satisfy the control path length constraints declared in the service level agreements, leaving enough options open for self-driving network designs and intelligent algorithms. Second, we propose a general dynamic program that calculates minimum length paths traversing specific type of nodes in a given order, and apply it to find control paths from the virtual controller of the slice to the virtual switches traversing the corresponding hypervisor location. We conduct thorough simulations on real-world topologies to demonstrate the effectiveness of our approaches in no failure and single link failure scenarios.

show abstract

Section: Function Chain Routing Algorithmsmentioning

confidence: 99%

Resilient Control Plane Design for Virtual Software Defined Networks

Babarczi

2021

IEEE Trans. Netw. Serv. Manage.

View full text Add to dashboard Cite

show abstract

“…We use such a rate to the processing limitation of the experimental QoS traffic flows between two nodes, from 1 and 10, with rates alternate between 18 and 300 kbps. In the non-QoS traffic flows between other network nodes with rates uniformly distributed within the interval [18,300] kbps. We used the iperf tool to generate such traffic.…”

Section: Experiments Setupmentioning

confidence: 99%

“…However, and instead of calling only Dijkstra, it calls LARAC recursively with the required constraint. Similarly, Van Bemten et al 18 modified Dijkstra used within LARAC to get a route passes through a specific set of nodes (i.e., Service Function Chain). However, the computation of λ and the stop condition left the same as in the original LARAC.…”

Section: Related Workmentioning

confidence: 99%

“…Egilmez and Tekalp 16 and Liang and Shen 17 used LARAC to find routes for QoS video traffic (i.e., for video streaming). Also, Van Bemten et al 18 used LARAC for QoS support in SDN and Network Function Virtualization (NFV). They adapt LARAC to route flows through Service Function Chain in which the returned path should traverse a given set of nodes (i.e., Virtual Network Functions) and maintain the required QoS constraints in the SDN network.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Bootstrapped LARAC algorithm for fast delay‐sensitive QoS provisioning in SDN networks

BinSahaq

Sheltami

Mahmoud

2021

Int J Communication

View full text Add to dashboard Cite

In today's networks, QoS provisioning becomes a major concern for service providers due to the massive increase in connected devices (e.g., mobile devices, servers, and Things), traffic in between, and the diverse service requirements (e.g., delay and bandwidth). Software-Defined Networking (SDN) promises solution for such issues with its central network control flexibility compared to traditional networking; nonetheless, a design of a fast and QoS guaranteeing routing algorithm is still needed. Delay Constrained Least Cost (DCLC) is a well-known NP-hard problem. LAgrange Relaxation-based Aggregated Cost (LARAC) algorithm is a Dijkstra-based QoS-aware algorithm and one of many heuristic algorithms proposed in the literature to solve the DCLC problem.Despite its outstanding performance over other algorithms in SDN, it still needs improvement. In this article, we present a modified version of LARAC, called MODLARAC, to improve the solution feasibility search state by exploiting LAR-AC's lower-bound paths before the approximation process start. Also, we modify its stop condition to avoid extra non-useful Dijkstra calls. We implement and evaluate MODLARAC using a realistic ISP network topology using Mininet and controlled by Floodlight SDN controller. We then compare MODLARAC against the original LARAC and BiLAD algorithms. The obtained results showed improvement up to 20% reduction in Dijkstra calls count compared to original LARAC and BiLAD algorithms without a significant increase in path's cost or delay metrics. It reached only 3% increase in path cost and 7% in path delay in its worst case with a safe distance of 11% lower than the delay demand.

show abstract

“…In the first subproblem, we rank the PMs in the network according to their centrality and the requested VNF types in the SFC. Thereafter, we employ a Delay-Constrained Least-Cost (DCLC) shortestpath algorithm to find the path between the selected VNFs in the previous step using a routing heuristic proposed in our previous work [19]. As an important feature, our routing algorithm is able to efficiently split the end-to-end delay budget between subsequent VNFs in an SFC.…”

Section: Introductionmentioning

confidence: 99%