SAM: Maximizing Service Function Chain Availability in Cloud Data Centers

被引:0
作者
Abrahams, Sterling [1 ]
Tang, Bin [1 ]
Pan, Deng [2 ]
机构
[1] Calif State Univ Dominguez Hills, Dept Comp Sci, Carson, CA 90747 USA
[2] Florida Int Univ, Sch Comp & Informat Sci, Miami, FL 33199 USA
来源
IEEE CONFERENCE ON GLOBAL COMMUNICATIONS, GLOBECOM | 2023年
关键词
Virtual Network Functions; Service Function Chaining; Availability; Cloud Data Centers; NFV; ALLOCATION;
D O I
10.1109/GLOBECOM54140.2023.10437355
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
Service function chaining (SFC), consisting of a sequence of virtual network functions (VNFs), provides effective and flexible network service management in a cloud computing environment. Due to the vulnerabilities of software-implemented VNFs, existing research has introduced VNF backup servers to achieve the fault-tolerance of VNFs and improve the availability of SFCs. However, they either do not consider the failures of backup servers or do not aim to maximize the availability of the entire SFC. In this paper, we study how to maximize the availability of an SFC, considering that both VNFs and backup servers can fail. We refer to the problem as SAM: service function chaining availability maximization problem. Given an SFC and a set of backup servers placed inside a cloud data center network, the failure probabilities of the VNFs and the backup servers, the goal of SAM is to assign backup servers to VNFs to maximize the availability of the SFC while satisfying the backup capacity constraint of the servers. We design a suite of optimal and efficient algorithms to solve SAM. Via extensive simulations with different network parameters, we show that our work outperforms the existing research by up to 21.7% in SFC availability, demonstrating the effectiveness of our algorithms in achieving high fault tolerance of SFC in cloud data centers.
引用
收藏
页码:6783 / 6788
页数:6
相关论文
共 24 条
[1]  
Aggarwal V, 2017, IEEE INFOCOM SER
[2]   A scalable, commodity data center network architecture [J].
Al-Fares, Mohammad ;
Loukissas, Alexander ;
Vahdat, Amin .
ACM SIGCOMM COMPUTER COMMUNICATION REVIEW, 2008, 38 (04) :63-74
[3]  
[Anonymous], 1988, Network flows
[4]  
Carpio F, 2017, IEEE ICC
[5]   Container Network Functions: Bringing NFV to the Network Edge [J].
Cziva, Richard ;
Pezaros, Dimitrios P. .
IEEE COMMUNICATIONS MAGAZINE, 2017, 55 (06) :24-31
[6]   A Framework for Provisioning Availability of NFV in Data Center Networks [J].
Fan, Jingyuan ;
Jiang, Meiling ;
Rottenstreich, Ori ;
Zhao, Yangming ;
Guan, Tong ;
Ramesh, Ram ;
Das, Sanjukta ;
Qiao, Chunming .
IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, 2018, 36 (10) :2246-2259
[7]   An efficient implementation of a scaling minimum-cost flow algorithm [J].
Goldberg, AV .
JOURNAL OF ALGORITHMS, 1997, 22 (01) :1-29
[8]   Traffic Steering for Service Function Chaining [J].
Hantouti, Hajar ;
Benamar, Nabil ;
Taleb, Tarik ;
Laghrissi, Abdelquoddous .
IEEE COMMUNICATIONS SURVEYS AND TUTORIALS, 2019, 21 (01) :487-507
[9]   Optimization Model for Backup Resource Allocation in Middleboxes With Importance [J].
He, Fujun ;
Sato, Takehiro ;
Oki, Eiji .
IEEE-ACM TRANSACTIONS ON NETWORKING, 2019, 27 (04) :1742-1755
[10]   Service Chaining for Hybrid Network Function [J].
Huang, Huawei ;
Guo, Song ;
Wu, Jinsong ;
Li, Jie .
IEEE TRANSACTIONS ON CLOUD COMPUTING, 2019, 7 (04) :1082-1094