[go: up one dir, main page]
More Web Proxy on the site http://driver.im/ skip to main content
research-article

RoNS: : Robust network function services in clouds

Published: 09 October 2022 Publication History

Abstract

In multi-tenant clouds, the traffic of tenants (e.g., enterprises) needs to be processed by network functions (NFs), for security and business logic issues. Due to potential hardware failures and software errors, NFs may break down. When encountering NF failures, we should consider two critical requirements for maintaining cloud robustness: limited influence scope and fast failure recovery. Without considering these two requirements, prior works based on deploying backup NF instances may result in large influence scope and long recovery time when a failure occurs. To bridge the gap, this paper investigates how to build robust network function services (RoNS) in multi-tenant clouds. Specifically, RoNS limits the number of tenants that each NF instance will serve so as to control the influence scope of an NF failure, and schedule requests with the help of agents designed in the data plane to achieve fast failure recovery. This is however a difficult undertaking. To solve this problem, RoNS takes a two-phase approach: NF instance allocation and tenant request scheduling. For NF instance allocation, we propose an efficient algorithm with bounded approximation factors based on the randomized rounding method. For tenant request scheduling, we present a primal–dual-based algorithm with a superior competitiveness ratio to solve it. We implement RoNS on a real testbed for experimental studies and use simulations for large-scale investigation. Both experiment results and simulation results show the superior performance of the proposed algorithms compared with other alternatives. For example, RoNS can cut down the number of affected tenants by 60%, and reduce recovery delay from 1170 ms to 316 ms on average, compared with existing failure recovery mechanisms based on deploying backup instances.

References

[1]
Kumar R., Charu S., An importance of using virtualization technology in cloud computing, Glob. J. Comput. Technol. 1 (2) (2015).
[2]
The amazon web service, URL http://www.aws.amazon.com/.
[3]
The google cloud platform, URL http://www.cloud.google.com/.
[4]
Marston S., Li Z., Bandyopadhyay S., Zhang J., Ghalsasi A., Cloud computing the business perspective, Decis. Support Syst. 51 (1) (2011) 176–189.
[5]
Gai K., Guo J., Zhu L., Yu S., Blockchain meets cloud computing: a survey, IEEE Commun. Surv. Tutor. 22 (3) (2020) 2009–2030.
[6]
Engelmann A., Jukan A., A reliability study of parallelized VNF chaining, in: 2018 IEEE International Conference on Communications (ICC), IEEE, 2018, pp. 1–6.
[7]
R. Potharaju, N. Jain, Demystifying the dark side of the middle: a field study of middlebox failures in datacenters, in: Proceedings of the 2013 Conference on Internet Measurement Conference, 2013, pp. 9–22.
[8]
Li J., Liang W., Huang M., Jia X., Reliability-aware network service provisioning in mobile edge-cloud networks, IEEE Trans. Parallel Distrib. Syst. 31 (7) (2020) 1545–1558.
[9]
Shang X., Huang Y., Liu Z., Yang Y., Reducing the service function chain backup cost over the edge and cloud by a self-adapting scheme, IEEE Trans. Mob. Comput. (2021).
[10]
Zhang J., Wang Z., Peng C., Zhang L., Huang T., Liu Y., Raba: Resource-aware backup allocation for a chain of virtual network functions, in: IEEE INFOCOM 2019-IEEE Conference on Computer Communications, IEEE, 2019, pp. 1918–1926.
[11]
Shang X., Liu Y., Mao Y., Liu Z., Yang Y., Greening reliability of virtual network functions via online optimization, in: 2020 IEEE/ACM 28th International Symposium on Quality of Service (IWQoS), IEEE, 2020, pp. 1–10.
[12]
Zhao G., Xu H., Liu J., Qian C., Ge J., Huang L., Safe-me: Scalable and flexible middlebox policy enforcement with software defined networking, in: 2019 IEEE 27th International Conference on Network Protocols (ICNP), IEEE, 2019, pp. 1–11.
[13]
Petale S., Thangaraj J., Link failure recovery mechanism in software defined networks, IEEE J. Sel. Areas Commun. 38 (7) (2020) 1285–1292.
[14]
Tomassilli A., Di Lena G., Giroire F., Tahiri I., Saucez D., Perennes S., Turletti T., Sadykov R., Vanderbeck F., Lac C., Poster: design of survivable SDN/NFV-enabled networks with bandwidth-optimal failure recovery, in: 2019 IFIP Networking Conference (IFIP Networking), IEEE, 2019, pp. 1–2.
[15]
Yang S., Li F., Yahyapour R., Fu X., Delay-sensitive and availability-aware virtual network function scheduling for NFV, IEEE Trans. Serv. Comput. (2019).
[16]
Mai L., Ding Y., Zhang X., Fan L., Yu S., Xu Z., Energy efficiency with service availability guarantee for network function virtualization, Future Gener. Comput. Syst. 119 (2021) 140–153.
[17]
Fan X., Xu H., Huang H., Yang X., Real-time update of joint SFC and routing in software defined networks, IEEE/ACM Trans. Netw. (2021).
[18]
Srinivasan A., Approximation algorithms via randomized rounding: A survey, 2001, Series in Advanced Topics in Mathematics Polish Scientific Publishers Pwn.
[19]
Hellman M., Raviv J., Probability of error, equivocation, and the Chernoff bound, IEEE Trans. Inform. Theory 16 (4) (1970) 368–372.
[20]
Tellambura C., Evaluation of the exact union bound for trellis-coded modulations over fading channels, IEEE Trans. Commun. 44 (12) (1996) 1693–1699.
[21]
B. Pfaff, J. Pettit, T. Koponen, E. Jackson, A. Zhou, J. Rajahalme, J. Gross, A. Wang, J. Stringer, P. Shelar, et al. The design and implementation of open vswitch, in: 12th {USENIX} Symposium on Networked Systems Design and Implementation ({NSDI} 15), 2015, pp. 117–130.
[22]
McKeown N., Anderson T., Balakrishnan H., Parulkar G., Peterson L., Rexford J., Shenker S., Turner J., Openflow: enabling innovation in campus networks, ACM SIGCOMM Comput. Commun. Rev. 38 (2) (2008) 69–74.
[23]
Lin Y.-D., Teng H.-Y., Hsu C.-R., Liao C.-C., Lai Y.-C., Fast failover and switchover for link failures and congestion in software defined networks, in: 2016 IEEE International Conference on Communications (ICC), IEEE, 2016, pp. 1–6.
[24]
M. Borokhovich, L. Schiff, S. Schmid, Provable data plane connectivity with local fast failover: Introducing openflow graph algorithms, in: Proceedings of the Third Workshop on Hot Topics in Software Defined Networking, 2014, pp. 121–126.
[25]
A. Verma, L. Pedrosa, M. Korupolu, D. Oppenheimer, E. Tune, J. Wilkes, Large-scale cluster management at Google with Borg, in: Proceedings of the Tenth European Conference on Computer Systems, 2015, pp. 1–17.
[26]
Guo L., Pang J., Walid A., Joint placement and routing of network function chains in data centers, in: IEEE INFOCOM 2018-IEEE Conference on Computer Communications, IEEE, 2018, pp. 612–620.
[27]
Dukkipati N., McKeown N., Why flow-completion time is the right metric for congestion control, ACM SIGCOMM Comput. Commun. Rev. 36 (1) (2006) 59–62.
[28]
Rusakov V.A., Using metrics in the throughput analysis and synthesis of undirected graphs, in: International Conference on Integrated Science, Springer, 2020, pp. 277–287.
[29]
R. Olsson, Pktgen the linux packet generator, in: Proceedings of the Linux Symposium, Vol. 2, Ottawa, Canada, 2005, pp. 11–24.
[30]
G. Chen, Y. Lu, Y. Meng, B. Li, K. Tan, D. Pei, P. Cheng, L.L. Luo, Y. Xiong, X. Wang, et al. Fast and cautious: Leveraging multi-path diversity for transport loss recovery in data centers, in: 2016 {USENIX} Annual Technical Conference ({USENIX}{ATC} 16), 2016, pp. 29–42.
[31]
Chen W.-E., Packet forwarding enhancement for virtualized next-generation core networks, in: 2018 27th Wireless and Optical Communication Conference (WOCC), IEEE, 2018, pp. 1–2.
[32]
Gember-Jacobson A., Viswanathan R., Prakash C., Grandl R., Khalid J., Das S., Akella A., Opennf: Enabling innovation in network function control, ACM SIGCOMM Comput. Commun. Rev. 44 (4) (2014) 163–174.
[33]
Tomassilli A., Di Lena G., Giroire F., Tahiri I., Saucez D., Perennes S., Turletti T., Sadykov R., Vanderbeck F., Lac C., Design of robust programmable networks with bandwidth-optimal failure recovery scheme, Comput. Netw. 192 (2021).
[34]
Wang H., Xu H., Huang H., Chen M., Chen S., Robust task offloading in dynamic edge computing, IEEE Trans. Mob. Comput. (2021).
[35]
Fan J., Jiang M., Rottenstreich O., Zhao Y., Guan T., Ramesh R., Das S., Qiao C., A framework for provisioning availability of NFV in data center networks, IEEE J. Sel. Areas Commun. 36 (10) (2018) 2246–2259.
[36]
Sun G., Chen Z., Yu H., Du X., Guizani M., Online parallelized service function chain orchestration in data center networks, IEEE Access 7 (2019) 100147–100161.
[38]
Sefraoui O., Aissaoui M., Eleuldj M., Openstack: toward an open-source solution for cloud computing, Int. J. Comput. Appl. 55 (3) (2012) 38–42.
[39]
N.K. Sharma, C. Zhao, M. Liu, P.G. Kannan, C. Kim, A. Krishnamurthy, A. Sivaraman, Programmable calendar queues for high-speed packet scheduling, in: 17th {USENIX} Symposium on Networked Systems Design and Implementation ({NSDI} 20), 2020, pp. 685–699.
[40]
Gu L., Zeng D., Li W., Guo S., Zomaya A.Y., Jin H., Intelligent VNF orchestration and flow scheduling via model-assisted deep reinforcement learning, IEEE J. Sel. Areas Commun. 38 (2) (2019) 279–291.
[41]
Blöcher M., Khalili R., Wang L., Eugster P., Letting off STEAM: Distributed runtime traffic scheduling for service function chaining, in: IEEE INFOCOM 2020-IEEE Conference on Computer Communications, IEEE, 2020, pp. 824–833.
[42]
Liu L., Guo S., Liu G., Yang Y., Joint dynamical VNF placement and SFC routing in NFV-enabled SDNs, IEEE Trans. Netw. Serv. Manag. (2021).

Cited By

View all

Recommendations

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

cover image Computer Networks: The International Journal of Computer and Telecommunications Networking
Computer Networks: The International Journal of Computer and Telecommunications Networking  Volume 215, Issue C
Oct 2022
224 pages

Publisher

Elsevier North-Holland, Inc.

United States

Publication History

Published: 09 October 2022

Author Tags

  1. Network function
  2. Failure
  3. Fast recovery
  4. Clouds

Qualifiers

  • Research-article

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)0
  • Downloads (Last 6 weeks)0
Reflects downloads up to 23 Dec 2024

Other Metrics

Citations

Cited By

View all

View Options

View options

Media

Figures

Other

Tables

Share

Share

Share this Publication link

Share on social media