Cited By
View all- Sharma SJukan AMalik AGumaste A(2024)A Network Calculus Model for SFC Realization and Traffic Bounds Estimation in Data CentersACM Transactions on Internet Technology10.1145/370044024:4(1-32)Online publication date: 18-Nov-2024
Online Learning for Failure-Aware Edge Backup of Service Function Chains With the Minimum Latency
Authors: 
Chen Wang, Qin Hu, Dongxiao Yu, Xiuzhen ChengAuthors Info & Claims
Chen Wang, Qin Hu, Dongxiao Yu, Xiuzhen ChengAuthors Info & ClaimsPages 2730 - 2744
Abstract
Virtual network functions (VNFs) have been widely deployed in mobile edge computing (MEC) to flexibly and efficiently serve end users running resource-intensive applications, which can be further serialized to form service function chains (SFCs), providing customized networking services. To ensure the availability of SFCs, it turns out to be effective to place redundant SFC backups at the edge for quickly recovering from any failures. The existing research largely overlooks the influences of SFC popularity, backup completeness, and failure rate on the optimal deployment of SFC backups on edge servers. In this paper, we comprehensively consider from the perspectives of both the end users and edge system to backup SFCs for providing popular services with the lowest latency. To overcome the challenges resulted from unknown SFC popularity and failure rate, as well as the known system parameter constraints, we take advantage of the online bandit learning technique to cope with the uncertainty issue. Combining the Prim -inspired method with the greedy strategy, we propose a Real-Time Selection and Deployment (RTSD) algorithm. Extensive simulation experiments are conducted to demonstrate the superiority of our proposed algorithms.
References
[1]
Y. Mao, C. You, J. Zhang, K. Huang, and K. B. Letaief, “A survey on mobile edge computing: The communication perspective,” IEEE Commun. Surveys Tuts., vol. 19, no. 4, pp. 2322–2358, 4th Quart., 2017.
[2]
Y. Xiao, Y. Jia, C. Liu, X. Cheng, J. Yu, and W. Lv, “Edge computing security: State of the art and challenges,” Proc. IEEE, vol. 107, no. 8, pp. 1608–1631, Aug. 2019.
[3]
J. Erfanian and B. Smith, “Network functions virtualisation-white paper on NFV priorities for 5G,” ETSI White Paper, pp. 1–15, 2017.
[4]
S. Van Rossem, W. Tavernier, D. Colle, M. Pickavet, and P. Demeester, “VNF performance modelling: From stand-alone to chained topologies,” Comput. Netw., vol. 181, Nov. 2020, Art. no.
[5]
M. Peusteret al., “Introducing automated verification and validation for virtualized network functions and services,” IEEE Commun. Mag., vol. 57, no. 5, pp. 96–102, May 2019.
[6]
M. Chiosiet al., “Network functions virtualisation-white paper#3,” ETSI, Tech. Rep., 2014.
[7]
X. Fei, F. Liu, H. Xu, and H. Jin, “Adaptive VNF scaling and flow routing with proactive demand prediction,” in Proc. IEEE INFOCOM Conf. Comput. Commun., Apr. 2018, pp. 486–494.
[8]
J. Zhang, Z. Wang, C. Peng, L. Zhang, T. Huang, and Y. Liu, “RABA: Resource-aware backup allocation for a chain of virtual network functions,” in Proc. IEEE INFOCOM Conf. Comput. Commun., Apr. 2019, pp. 1918–1926.
[9]
T. Taleb, A. Ksentini, and B. Sericola, “On service resilience in cloud-native 5G mobile systems,” IEEE J. Sel. Areas Commun., vol. 34, no. 3, pp. 483–496, Mar. 2016.
[10]
X. Shang, Z. Li, and Y. Yang, “Partial rerouting for high-availability and low-cost service function chain,” in Proc. IEEE Global Commun. Conf. (GLOBECOM), Dec. 2018, pp. 1–6.
[11]
X. Shang, Y. Huang, Z. Liu, and Y. Yang, “Reducing the service function chain backup cost over the edge and cloud by a self-adapting scheme,” in Proc. IEEE INFOCOM Conf. Comput. Commun., Jul. 2020, pp. 2096–2105.
[12]
J. Fanet al., “A framework for provisioning availability of NFV in data center networks,” IEEE J. Sel. Areas Commun., vol. 36, no. 3, pp. 2246–2259, Oct. 2018.
[13]
X. Shang, Z. Li, and Y. Yang, “Placement of highly available virtual network functions through local rerouting,” in Proc. IEEE 15th Int. Conf. Mobile Ad Hoc Sensor Syst. (MASS), Oct. 2018, pp. 80–88.
[14]
Y. Sang, B. Ji, G. R. Gupta, X. Du, and L. Ye, “Provably efficient algorithms for joint placement and allocation of virtual network functions,” in Proc. IEEE INFOCOM Conf. Comput. Commun., May 2017, pp. 1–9.
[15]
T. W. Kuo, B. H. Liou, K. C. Lin, and M. J. Tsai, “Deploying chains of virtual network functions: On the relation between link and server usage,” IEEE/ACM Trans. Netw., vol. 26, no. 4, pp. 1562–1576, Aug. 2018.
[16]
R. Mijumbi, S. Hasija, S. Davy, A. Davy, B. Jennings, and R. Boutaba, “A connectionist approach to dynamic resource management for virtualised network functions,” in Proc. 12th Int. Conf. Netw. Service Manag. (CNSM), Oct. 2016, pp. 1–9.
[17]
R. Cziva, C. Anagnostopoulos, and D. P. Pezaros, “Dynamic, latency-optimal VNF placement at the network edge,” in Proc. IEEE INFOCOM Conf. Comput. Commun., Apr. 2018, pp. 693–701.
[18]
P. Jin, X. Fei, Q. Zhang, F. Liu, and B. Li, “Latency-aware VNF chain deployment with efficient resource reuse at network edge,” in Proc. IEEE INFOCOM Conf. Comput. Commun., Jul. 2020, pp. 267–276.
[19]
H. Zhu and C. Huang, “EdgePlace: Availability-aware placement for chained mobile edge applications,” Trans. Emerg. Telecommun. Technol., vol. 29, no. 11, p. e3504, Nov. 2018.
[20]
J. Fan, C. Guan, Y. Zhao, and C. Qiao, “Availability-aware mapping of service function chains,” in Proc. IEEE INFOCOM Conf. Comput. Commun., May 2017, pp. 1–9.
[21]
Y. Kanizo, O. Rottenstreich, I. Segall, and J. Yallouz, “Optimizing virtual backup allocation for middleboxes,” IEEE/ACM Trans. Netw., vol. 25, no. 5, pp. 2759–2772, Oct. 2017.
[22]
N. T. Dinh and Y. Kim, “An efficient availability guaranteed deployment scheme for IoT service chains over fog-core cloud networks,” Sensors, vol. 18, no. 11, p. 3970, 2018.
[23]
C. Wang, Q. Hu, D. Yu, and X. Cheng, “Proactive deployment of chain-based VNF backup at the edge using online bandit learning,” in Proc. IEEE 41st Int. Conf. Distrib. Comput. Syst. (ICDCS), Jul. 2021, pp. 740–750.
[24]
T. Hirayama and M. Jibiki, “SFC path selection based on combination of topological analysis and demand prediction,” in Proc. 23rd Asia–Pacific Netw. Oper. Manag. Symp. (APNOMS), Sep. 2022, pp. 1–4.
[25]
M. M. K. Jitu and M. H. Haque, “Determining best travelling salesman route of 12 cities of Europe,” Tech. Rep., 2022.
[26]
P. Auer, N. Cesa-Bianchi, and P. Fischer, “Finite-time analysis of the multiarmed bandit problem,” Mach. Learn., vol. 47, no. 2, pp. 235–256, 2002.
[27]
D. P. Williamson and D. B. Shmoys, The Design of Approximation Algorithms. Cambridge, U.K.: Cambridge Univ. Press, 2011.
Index Terms
- Online Learning for Failure-Aware Edge Backup of Service Function Chains With the Minimum Latency
Index terms have been assigned to the content through auto-classification.
Recommendations
Efficient Redundancy Allocation for Reliable Service Function Chains in Edge Computing
AbstractEnsuring the high reliability of service function chains (SFCs) in Edge Computing, in which several distributed edge servers are available, is a challenging issue. Previous studies on reliable SFCs ignore the impact of physical hardware failures ...
Reliability-Oriented and Resource-Efficient Service Function Chain Construction and Backup
In the network function virtualization (NFV) environment, network services are usually provided in the form of service function chains (SFCs), which defines the link order of virtual network functions required in service requests and are mapped to the ...
Backup Path Classification Based on Failure Risks for Efficient Backup Path Computation
NETWORKING '09: Proceedings of the 8th International IFIP-TC 6 Networking ConferenceWe propose a new approach exploiting the failure risk (node, link or Shared Risk Link Group) structures to enhance the backup path computation. Upon failure, our approach classifies the backup paths into two categories: operative backup paths and ...
Comments
Information & Contributors
Information
Published In
1558-2566 © 2023 IEEE. Personal use is permitted, but republication/redistribution requires IEEE permission. See https://www.ieee.org/publications/rights/index.html for more information.
Publisher
IEEE Press
Publication History
Published: 18 April 2023
Published in TON Volume 31, Issue 6
Qualifiers
- Research-article
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- View Citations1Total Citations
- 13Total Downloads
- Downloads (Last 12 months)13
- Downloads (Last 6 weeks)1
Reflects downloads up to 02 Feb 2025
Other Metrics
Citations
Cited By
View all- Sharma SJukan AMalik AGumaste A(2024)A Network Calculus Model for SFC Realization and Traffic Bounds Estimation in Data CentersACM Transactions on Internet Technology10.1145/370044024:4(1-32)Online publication date: 18-Nov-2024
View Options
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in