service function
Recently Published Documents


TOTAL DOCUMENTS

697
(FIVE YEARS 390)

H-INDEX

23
(FIVE YEARS 10)

2022 ◽  
Author(s):  
Jingzhao Xie ◽  
Run Zhou ◽  
Gang Sun ◽  
Jian Sun ◽  
Hongfang Yu

Author(s):  
Venkatarami Reddy Chintapalli ◽  
Sai Balaram Korrapati ◽  
Bheemarjuna Reddy Tamma ◽  
Antony Franklin A

Electronics ◽  
2021 ◽  
Vol 11 (1) ◽  
pp. 57
Author(s):  
Hefei Hu ◽  
Chen Yang ◽  
Lingyi Xu ◽  
Tangyijia Song ◽  
Bonaho Bocochi Dalia

With network function virtualization (NFV) expanding from network center to edge, the service function chain (SFC) will gradually approach users to provide lower delay and higher-quality services. User mobility seriously affects the quality of service (QoS) provided by the mobile-aware SFC. Therefore, we must migrate the SFC to provide continuous services. In the user estimable movement scenario with a known mobile path and estimable arrival time, we establish the estimation model of user arrival time to obtain the estimated arrival time. Then, to reduce the time that the user is waiting for the migration completion, we propose a softer migration strategy migrating mobile-aware SFC before the user arrives at the corresponding access node. Moreover, for the problem of routing and bandwidth allocation (RBA), to reduce the migration failure rate, the paper proposes a path load adaptive routing and bandwidth allocation (PLARBA) algorithm adjusting the migration bandwidth according to the path load. The experimental results show that the proposed algorithm has significant advantages in reducing the user’s waiting time by more than 90%, decreasing migration failure rate by up to 75%, and improving QoS compared to the soft migration strategy and two RBA algorithms.


2021 ◽  
Author(s):  
Ryusei Shiiba ◽  
Satoru Kobayashi ◽  
Osamu Akashi ◽  
Kensuke Fukuda

2021 ◽  
Author(s):  
Danyang Zheng ◽  
Gangxiang Shen ◽  
Yongcheng Li ◽  
Xiaojun Cao ◽  
Biswanath Mukherjee

<p>In the upcoming 5G-and-beyond era, ultra-reliable low-latency communication (URLLC) services will be ubiquitous in edge networks. To improve network performance and quality of service (QoS), URLLC services could be delivered via a sequence of software-based network functions, also known as service function chains (SFCs). Towards reliable SFC delivery, it is imperative to incorporate deterministic fault tolerance during SFC deployment. However, deploying an SFC with deterministic fault tolerance is challenging because the protection mechanism needs to consider protection against physical/virtual network failures and hardware/software failures jointly. Against multiple and diverse failures, this work investigates how to effectively deliver an SFC in optical edge networks with deterministic fault tolerance while minimizing wavelength resource consumption. We introduce a protection augmented graph, called <i>k</i>-connected service function slices layered graph (KC-SLG), protecting against <i>k</i>-1 fiber link failures and <i>k</i>-1 server failures. We formulate a novel problem called deterministic-fault-tolerant SFC embedding and propose an effective algorithm, called most candidate first SF slices layered graph embedding (MCF-SE). MCF-SE employs two proposed techniques: <i>k</i>-connected network slicing (KC-NS) and <i>k</i>-connected function slicing (KC-FS). Through thorough mathematical proof, we show that KC-NS is <i>2</i>-approximate. For KC-FS, we demonstrate that <i>k</i> = 3 provides the best cost-efficiency. Our experimental results also show that the proposed MCF-SE achieves deterministic-fault-tolerant service delivery and performs better than the schemes directly extended from existing work regarding survivability and average cost-efficiency.</p>


2021 ◽  
Author(s):  
Danyang Zheng ◽  
Gangxiang Shen ◽  
Yongcheng Li ◽  
Xiaojun Cao ◽  
Biswanath Mukherjee

<p>In the upcoming 5G-and-beyond era, ultra-reliable low-latency communication (URLLC) services will be ubiquitous in edge networks. To improve network performance and quality of service (QoS), URLLC services could be delivered via a sequence of software-based network functions, also known as service function chains (SFCs). Towards reliable SFC delivery, it is imperative to incorporate deterministic fault tolerance during SFC deployment. However, deploying an SFC with deterministic fault tolerance is challenging because the protection mechanism needs to consider protection against physical/virtual network failures and hardware/software failures jointly. Against multiple and diverse failures, this work investigates how to effectively deliver an SFC in optical edge networks with deterministic fault tolerance while minimizing wavelength resource consumption. We introduce a protection augmented graph, called <i>k</i>-connected service function slices layered graph (KC-SLG), protecting against <i>k</i>-1 fiber link failures and <i>k</i>-1 server failures. We formulate a novel problem called deterministic-fault-tolerant SFC embedding and propose an effective algorithm, called most candidate first SF slices layered graph embedding (MCF-SE). MCF-SE employs two proposed techniques: <i>k</i>-connected network slicing (KC-NS) and <i>k</i>-connected function slicing (KC-FS). Through thorough mathematical proof, we show that KC-NS is <i>2</i>-approximate. For KC-FS, we demonstrate that <i>k</i> = 3 provides the best cost-efficiency. Our experimental results also show that the proposed MCF-SE achieves deterministic-fault-tolerant service delivery and performs better than the schemes directly extended from existing work regarding survivability and average cost-efficiency.</p>


Sign in / Sign up

Export Citation Format

Share Document