Joint Server Selection and SFC Routing for Anycast in NFV-enabled SDNs

Anycast mechanism has been used as a fundamental technology in many fields, with multiple servers providing the same service. Each request does not care which server it is served by. For security and performance reasons, requests must meet the requirements of service function chain (SFC) in network function virtualization (NFV) enabled networks. Though the routing of SFC has been widely studied, most of these works focus on unicast, which does not involve server selection, and cannot be applied directly for anycast. If we simply combine the traditional anycast algorithms and SFC unicast routing algorithms, it will overload the links and servers. Since overloaded links and servers will reduce the quality of services, it is important to balance the load of links and servers. In this work, we focus on designing an SFC routing mechanism for anycast that takes server selection into account and achieves load balancing among servers as well as links with the help of software defined network (SDN). We first propose the problem of joint server selection and SFC routing for anycast in NFV-enabled SDNs (JSR). Then based on the method of random rounding, we design an algorithm called RBLB with approximate ratio guarantee that can solve the JSR problem. The extensive simulation results show that our algorithm can reduce the load of servers and links. For example, algorithm RBLB can reduce the server load by 41.4%–60.1% compared with the comparison algorithm, when the number of requests exceeds 20k.

[1]  Aditya Akella,et al.  OpenNF: enabling innovation in network function control , 2015, SIGCOMM 2015.

[2]  Roberto Bifulco,et al.  ClickOS and the Art of Network Function Virtualization , 2014, NSDI.

[3]  Thomas D. Nadeau,et al.  Problem Statement for Service Function Chaining , 2015, RFC.

[4]  Andrew Warfield,et al.  Split/Merge: System Support for Elastic Execution in Virtual Middleboxes , 2013, NSDI.

[5]  Amin Vahdat,et al.  A scalable, commodity data center network architecture , 2008, SIGCOMM '08.

[6]  Chen-Nee Chuah,et al.  Intelligent SDN based traffic (de)Aggregation and Measurement Paradigm (iSTAMP) , 2014, IEEE INFOCOM 2014 - IEEE Conference on Computer Communications.

[7]  Vyas Sekar,et al.  Making middleboxes someone else's problem: network processing as a cloud service , 2012, SIGCOMM '12.

[8]  Srikanth Kandula,et al.  Achieving high utilization with software-driven WAN , 2013, SIGCOMM.

[9]  Xiang-Yang Li,et al.  Real-time update with joint optimization of route selection and update scheduling for SDNs , 2016, 2016 IEEE 24th International Conference on Network Protocols (ICNP).

[10]  SekarVyas,et al.  Making middleboxes someone else's problem , 2012 .

[11]  Yongqiang Xiong,et al.  ClickNP: Highly Flexible and High Performance Network Processing with Reconfigurable Hardware , 2016, SIGCOMM.

[12]  Yang Li,et al.  Network functions virtualization with soft real-time guarantees , 2016, IEEE INFOCOM 2016 - The 35th Annual IEEE International Conference on Computer Communications.

[13]  Sujata Banerjee,et al.  DevoFlow: scaling flow management for high-performance networks , 2011, SIGCOMM 2011.

[14]  Anwar Elwalid,et al.  Joint Placement and Routing of Network Function Chains in Data Centers , 2018, IEEE INFOCOM 2018 - IEEE Conference on Computer Communications.

[15]  MahajanRatul,et al.  Achieving high utilization with software-driven WAN , 2013 .

[16]  Joseph Naor,et al.  On the effect of forwarding table size on SDN network utilization , 2014, IEEE INFOCOM 2014 - IEEE Conference on Computer Communications.

[17]  Edsger W. Dijkstra,et al.  A note on two problems in connexion with graphs , 1959, Numerische Mathematik.

[18]  Minlan Yu,et al.  SIMPLE-fying middlebox policy enforcement using SDN , 2013, SIGCOMM.

[19]  Weijia Jia,et al.  Routing algorithms for anycast messages , 1998, Proceedings. 1998 International Conference on Parallel Processing (Cat. No.98EX205).

[20]  QaziZafar Ayyub,et al.  SIMPLE-fying middlebox policy enforcement using SDN , 2013 .

[21]  Anwar Elwalid,et al.  Dynamic Service Function Chaining in SDN-enabled networks with middleboxes , 2016, 2016 IEEE 24th International Conference on Network Protocols (ICNP).

[22]  Tilman Wolf,et al.  Adaptive Service-Chain Routing for Virtual Network Functions in Software-Defined Networks , 2016, HotMiddlebox@SIGCOMM.

[23]  VahdatAmin,et al.  A scalable, commodity data center network architecture , 2008 .

[24]  Xiang-Yang Li,et al.  High-throughput anycast routing and congestion-free reconfiguration for SDNs , 2016, 2016 IEEE/ACM 24th International Symposium on Quality of Service (IWQoS).