Abstract
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.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsReferences
Al-Fares, M., Loukissas, A., Vahdat, A.: A scalable, commodity data center network architecture. ACM SIGCOMM Comput. Commun. Rev. 38(4), 63–74 (2008)
Cohen, R., Lewin-Eytan, L., Naor, J.S., Raz, D.: On the effect of forwarding table size on SDN network utilization. In: IEEE Conference on Computer Communications, IEEE INFOCOM 2014, pp. 1734–1742. IEEE (2014)
Curtis, A.R., Mogul, J.C., Tourrilhes, J., Yalagandula, P., Sharma, P., Banerjee, S.: Devoflow: scaling flow management for high-performance networks. In: Proceedings of the ACM SIGCOMM 2011 Conference, pp. 254–265 (2011)
Dijkstra, E.W., et al.: A note on two problems in connexion with graphs. Numer. Math. 1(1), 269–271 (1959)
Dwaraki, A., Wolf, T.: Adaptive service-chain routing for virtual network functions in software-defined networks. In: Proceedings of the 2016 Workshop on Hot Topics in Middleboxes and Network Function Virtualization, pp. 32–37 (2016)
Gember-Jacobson, A., et al.: OpenNF: enabling innovation in network function control. ACM SIGCOMM Comput. Commun. Rev. 44(4), 163–174 (2014)
Guo, L., Pang, J., Walid, A.: Dynamic service function chaining in SDN-enabled networks with middleboxes. In: 2016 IEEE 24th International Conference on Network Protocols (ICNP), pp. 1–10. IEEE (2016)
Guo, L., Pang, J., Walid, A.: Joint placement and routing of network function chains in data centers. In: IEEE Conference on Computer Communications, IEEE INFOCOM 2018, pp. 612–620. IEEE (2018)
Hong, C.Y., et al.: Achieving high utilization with software-driven WAN. In: Proceedings of the ACM SIGCOMM 2013 Conference on SIGCOMM, pp. 15–26 (2013)
Li, B., et al.: ClickNP: highly flexible and high performance network processing with reconfigurable hardware. In: Proceedings of the 2016 ACM SIGCOMM Conference, pp. 1–14 (2016)
Li, Y., Phan, L.T.X., Loo, B.T.: Network functions virtualization with soft real-time guarantees. In: The 35th Annual IEEE International Conference on Computer Communications, IEEE INFOCOM 2016, pp. 1–9. IEEE (2016)
Malboubi, M., Wang, L., Chuah, C.N., Sharma, P.: Intelligent SDN based traffic (de)aggregation and measurement paradigm (ISTAMP). In: IEEE Conference on Computer Communications, IEEE INFOCOM 2014, pp. 934–942. IEEE (2014)
Martins, J., et al.: ClickOS and the art of network function virtualization. In: 11th USENIX Symposium on Networked Systems Design and Implementation (NSDI 2014), pp. 459–473 (2014)
Qazi, Z.A., Tu, C.C., Chiang, L., Miao, R., Sekar, V., Yu, M.: SIMPLE-fying middlebox policy enforcement using SDN. In: Proceedings of the ACM SIGCOMM 2013 Conference on SIGCOMM, pp. 27–38 (2013)
Quinn, P., Nadeau, T.: Problem statement for service function chaining. In: RFC 7498. RFC Editor (2015)
Rajagopalan, S., Williams, D., Jamjoom, H., Warfield, A.: Split/merge: system support for elastic execution in virtual middleboxes. In: Presented as Part of the 10th USENIX Symposium on Networked Systems Design and Implementation (NSDI 2013), pp. 227–240 (2013)
Sherry, J., Hasan, S., Scott, C., Krishnamurthy, A., Ratnasamy, S., Sekar, V.: Making middleboxes someone else’s problem: network processing as a cloud service. ACM SIGCOMM Comput. Commun. Rev. 42(4), 13–24 (2012)
Xu, H., Li, X., Huang, L., Wang, J., Leng, B.: High-throughput anycast routing and congestion-free reconfiguration for SDNs. In: 2016 IEEE/ACM 24th International Symposium on Quality of Service (IWQoS), pp. 1–6. IEEE (2016)
Xu, H., Yu, Z., Li, X.Y., Qian, C., Huang, L., Jung, T.: Real-time update with joint optimization of route selection and update scheduling for SDNs. In: 2016 IEEE 24th International Conference on Network Protocols (ICNP), pp. 1–10. IEEE (2016)
Xuan, D., Jia, W., Zhao, W.: Routing algorithms for anycast messages. In: Proceedings of 1998 International Conference on Parallel Processing (Cat. No. 98EX205), pp. 122–130. IEEE (1998)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2020 Springer Nature Switzerland AG
About this paper
Cite this paper
Tu, H., Xu, H., Huang, L., Yang, X., Yao, D. (2020). Joint Server Selection and SFC Routing for Anycast in NFV-enabled SDNs. In: Yu, D., Dressler, F., Yu, J. (eds) Wireless Algorithms, Systems, and Applications. WASA 2020. Lecture Notes in Computer Science(), vol 12384. Springer, Cham. https://doi.org/10.1007/978-3-030-59016-1_36
Download citation
DOI: https://doi.org/10.1007/978-3-030-59016-1_36
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-59015-4
Online ISBN: 978-3-030-59016-1
eBook Packages: Computer ScienceComputer Science (R0)