检索结果-内蒙古大学图书馆

network function parallelism configuration with segment routing over IPv6 based on deep reinforcement learning

ETRI JOURNAL 2025年第2期47卷 278-289页

作者： Jang, Seokwon Ko, Namseok Kyung, Yeunwoong Ko, Haneul Lee, Jaewook Pack, Sangheon Elect & Telecommun Res Inst Mobile Core Network Res Sect Daejeon South Korea Kongju Natl Univ Div Informat & Commun Engn Cheonan South Korea Kyung Hee Univ Dept Elect Engn Yongin South Korea Pukyong Natl Univ Dept Informat & Commun Engn Busan South Korea Korea Univ Sch Elect Engn Seoul South Korea

network function parallelism (NFP) has gained attention for processing packets in parallel through service functions arranged in the required service function chain. While parallel processing efficiently reduces the service function chaining (SFC) completion time, it incurs a higher network overhead (e.g., network congestion) to replicate various packets for processing. To reduce the SFC completion time while maintaining a low network overhead, we propose a deep-reinforcement-learning-based NFP algorithm (DeepNFP) that provides an SFC processing policy to determine the sequential or parallel processing of every service function. In DeepNFP, deep reinforcement learning captures the network dynamics and service function conditions and iteratively finds the SFC processing policy in the network environment. Furthermore, an SFC data plane protocol based on segment routing over IPv6 configures and operates the policy in the SFC data network. Evaluation results show that DeepNFP can achieve 46% of the SFC completion time and 66% of the network overhead compared with conventional SFC and NFP, respectively.

关键词： deep reinforcement learning network function parallelism segment routing over IPv6 service function chaining

来源：评论

学校读者我要写书评

暂无评论

A network function parallelism-Enabled MEC Framework for Supporting Low-Latency Services

引用

IEEE TRANSACTIONS ON SERVICES COMPUTING 2023年第1期16卷 40-52页

作者： Liu, Mengjie Feng, Gang Sun, Yao Chen, Nan Tan, Wei Univ Elect Sci & Technol China Natl Key Lab Commun Chengdu Sichuan Peoples R China Univ Elect Sci & Technol China Yangtze Delta Reg Inst Huzhou Huzhou Peoples R China Univ Glasgow James Watt Sch Engn Glasgow City Scotland Tennessee Technol Univ Dept Elect & Comp Engn Cookeville TN USA Co Ltd Shanghai Cent Res Inst Huawei Technol Co Ltd Shanghai Peoples R China

Mobile edge computing (MEC) enables users to offload computing tasks to edge servers for provisioning low-latency and computation-intensive services. To manage heterogeneous resources and improve service flexibility, MEC is entailed by new technologies, i.e., software defined networking (SDN) and network function virtualization (NFV), which allow services running on common commodity hardware instead of proprietary hardware. However, data processing via software on commodity servers may induce high latency due to limited processing capacity, which impedes the quality of service. Meanwhile, MEC is a resource-sharing system and thus fairness should be considered. In this paper, we propose a network function parallelism (NFP)-enabled MEC (NFPMec) framework for supporting low-latency services. To reap the potential benefits of the NFPMec, we formulate the fairness-aware throughput maximization problem (FTMP) with aim of maximizing the fairness-aware system throughput while satisfying the QoS requirements. We propose a relaxation-based generalized benders algorithm (RGBA) to decouple the FTMP into two sub-problems based on the non-linear convex duality theory. After relaxation, the sub-problems are solved by the Karush-Kuhn-Tucker (KKT) approach. The convergence of the RGBA is theoretically proved. The simulation results demonstrate that the proposed NFPMec outperforms SDN-enabled MEC networks in terms of resource utilization, service latency and system throughput.

关键词： Noise measurement Throughput Servers Low latency communication Software Resource management Quality of service network slicing low-latency MEC network function parallelism NFP-enabled MEC framework

来源：评论

学校读者我要写书评

暂无评论

NFP: Enabling network function parallelism in NFV 17

NFP: Enabling Network Function Parallelism in NFV

引用

Conference of the ACM-Special-Interest-Group-on-Data-Communication (SIGCOMM)

作者： Sun, Chen Bi, Jun Zheng, Zhilong Yu, Heng Hu, Hongxin Tsinghua Univ Inst Network Sci & Cyberspace Dept Comp Sci Beijing Peoples R China Tsinghua Natl Lab Informat Sci & Technol Beijing Peoples R China Clemson Univ Clemson SC 29631 USA

ISBN: (纸本)9781450346535

Software-based sequential service chains in network function Virtualization (NFV) could introduce significant performance overhead. Current acceleration efforts for NFV mainly target on optimizing each component of the sequential service chain. However, based on the statistics from real world enterprise networks, we observe that 53.8% network function (NF) pairs can work in parallel. In particular, 41.5% NF pairs can be parallelized without causing extra resource overhead. In this paper, we present NFP, a high performance framework, that innovatively enables network function parallelism to improve NFV performance. NFP consists of three logical components. First, NFP provides a policy specification scheme for operators to intuitively describe sequential or parallel NF chaining intents. Second, NFP orchestrator intelligently identifies NF dependency and automatically compiles the policies into high performance service graphs. Third, NFP infrastructure performs light-weight packet copying, distributed parallel packet delivery, and load-balanced merging of packet copies to support NF parallelism. We implement an NFP prototype based on DPDK in Linux containers. Our evaluation results show that NFP achieves significant latency reduction for real world service chains.

关键词： NFV network function parallelism service chain

来源：评论

学校读者我要写书评

暂无评论

SFT-Box: An Online Approach for Minimizing the Embedding Cost of Multiple Hybrid SFCs

引用

IEEE-ACM TRANSACTIONS ON networkING 2023年第4期31卷 1463-1477页

作者： Lin, Xu Guo, Deke Shen, Yulong Tang, Guoming Ren, Bangbang Xu, Ming Natl Univ Def Technol Coll Comp Changsha 410073 Peoples R China Natl Univ Def Technol Sci & Technol Informat Syst Engn Lab Changsha 410073 Peoples R China Xidian Univ Sch Comp Sci & Technol Xian 710071 Peoples R China

In network function Virtualization (NFV), a series of Virtual network functions (VNFs) organized in a specific order (called Service function Chain, SFC) could offer an end to-end network service for a network flow. Recently, with the new results of the exploration of VNF parallelism, hybrid SFC (SFC contains parallel VNFs) is proposed to reduce the SFC execution delay. However, it remains challenging and open to optimally embed multiple hybrid SFCs into the network. In this paper, we target at the optimal embedding problem of multiple hybrid SFCs with the purpose of minimizing the cost in an online scenario. Specifically, we propose SFT-Box, an online approach that can respond to hybrid SFC embedding requests in real-time. SFT-Box is designed to i) transform SFCs from the traditional sequential form to a standardized hierarchical Service function Tree (SFT) form, ii) calculate and store the low-cost sub solutions of embedding common SFTs, and iii) provide prompt solution response based on stored sub-solutions. To the best of our knowledge, this is the first work to address the online optimal embedding problem of multiple hybrid SFCs. With extensive evaluations, we demonstrate that, compared with the benchmark methods, SFT-Box can achieve up to 30% cost-saving and at least 22x latency reduction in enabling real-time response.

关键词： network function virtualization service function chain network function parallelism real-time response

来源：评论

学校读者我要写书评

暂无评论

parallelism-Aware Service function Chain Placement for Delay-sensitive IoT Applications with VNF Reuse in Mobile Edge Computing

Parallelism-Aware Service Function Chain Placement for Delay...

引用

IEEE International Conference on Web Services (IEEE ICWS)

作者： Wang, Haiyan Chen, Pei Nanjing Univ Posts & Telecommunicat Sch Comp Sci Nanjing Peoples R China

ISBN: (纸本)9798350368567;9798350368550

With the rise of network function Virtualization technology, Service function Chain (SFC), composed of Virtual network functions (VNFs), has become a mainstream service form for IoT applications in Mobile Edge Computing network. However, the delay-sensitive and resource-intensive nature of IoT applications poses great challenges for SFC placement. Besides, energy consumption has to be taken into consideration in the designing of strategy. To address these challenges above, we integrate network function parallelism (NFP) and VNF Reuse into MEC network. Specifically, we formulate the parallelism-aware Optimization for Delay-sensitive SFC Placement with VNF Reuse (PODPR) and design a heuristic NFP and VNF Reuse-based SFC Placement Solution (PRPS). The proposed PRPS incorporates candidate transmission paths into a routing tree structure and utilizes a parallelism and Reuse-aware Greedy Placement Algorithm to search for a placement strategy with the lowest energy consumption. Simulation results demonstrate that PRPS outperforms baselines in terms of energy consumption and service delay.

关键词： Mobile Edge Computing Internet of Things Service function Chain Placement network function parallelism VNF Reuse

来源：评论

学校读者我要写书评

暂无评论

Towards Optimal parallelism-Aware Service Chaining and Embedding

引用

IEEE TRANSACTIONS ON network AND SERVICE MANAGEMENT 2022年第3期19卷 2063-2077页

作者： Zheng, Danyang Shen, Gangxiang Cao, Xiaojun Mukherjee, Biswanath Soochow Univ Sch Elect & Informat Engn Suzhou Key Lab Adv Opt Commun Network Technol Suzhou 215006 Peoples R China Georgia State Univ Dept Comp Sci Atlanta GA 30302 USA

Emerging 5G technologies can significantly reduce end-to-end service latency for applications requiring strict quality of service (QoS). With network function virtualization (NFV), to complete a client's request from those applications, the client's data can sequentially go through multiple service functions (SFs) for processing/analysis but introduce additional processing delay. To reduce the processing delay from the serially-running SFs, network function parallelism (NFP) that allows multiple SFs to run in parallel is introduced. In this work, we study how to apply NFP into the SF chaining and embedding process such that the latency, including processing and propagation delays, can be jointly minimized. We introduce a novel augmented graph to address the parallel relationship constraint among the required SFs. Considering parallel relationship constraints, we propose a novel problem called parallelism-aware service function chaining and embedding (PSFCE). For this problem, we propose a near-optimal maximum parallel block gain (MPBG) first optimization algorithm when computing resources at each physical node are enough to host the required SFs. When computing resources are limited, we propose a logarithm-approximate algorithm, called parallelism-aware SFs deployment (PSFD), to jointly optimize processing and propagation delays. We conduct extensive simulations on multiple network scenarios to evaluate the performances of our schemes. Accordingly, we find that (i) MPBG is near-optimal, (ii) the optimization of end-to-end service latency largely depends on the processing delay in small networks and is impacted more by the propagation delay in large networks, and (iii) PSFD outperforms the schemes directly extended from existing works regarding end-to-end latency.

关键词： Delays Propagation delay Parallel processing Service function chaining network function virtualization Optimization 5G mobile communication network function virtualization network function parallelism parallelism-aware service function chaining and embedding approximation algorithm

来源：评论

学校读者我要写书评

暂无评论

FlexChain: Bridging parallelism and Placement for Service function Chains

引用

IEEE TRANSACTIONS ON network AND SERVICE MANAGEMENT 2021年第1期18卷 195-208页

作者： Xie, Sihao Ma, Junte Zhao, Jin Fudan Univ Sch Comp Sci Shanghai 200438 Peoples R China Fudan Univ Shanghai Key Lab Intelligent Informat Proc Shanghai 200438 Peoples R China

A Service function Chain (SFC) is an ordered sequence of network functions (NFs). With the emerging network function Virtualization (NFV) paradigm, NFs can be deployed as software instances on commodity servers, leading to a more flexible provision of network service. However, the flexibility of NFV comes with considerable compromises since virtual network functions (VNFs) introduce significant processing latency overheads. In this article, we design a flexible SFC parallel system called FlexChain, enabling the parallelism among VNFs to reduce the processing latency of SFCs. To leverage the benefits of parallelism, we study the problem of joint optimization over SFC parallelism and placement with the objective of accepting as many requests as possible. Since the problem is proved to be NP-hard, we propose a parallelism-aware approximation placement algorithm with performance guarantees, and an efficient heuristic algorithm for large-scale data center networks. Our simulation results show that FlexChain combined with our placement algorithm can substantially improve the number of accepted flows in the latency-sensitive scenario, and significantly reduce the average latency of accepted flows at the same time.

关键词： Servers Parallel processing Noise measurement Bandwidth Approximation algorithms Data centers Heuristic algorithms NFV network function parallelism SFC placement

来源：评论

学校读者我要写书评

暂无评论

NEST: Optimal deploying DAG-SFCs to maximize the flows wholly served in the network edge

引用

COMPUTER networkS 2023年第1期235卷

作者： Lin, Xu Liu, Chuchu Luo, Lailong Guo, Deke Xu, Ming Natl Univ Def Technol Coll Comp Changsha 410073 Peoples R China Natl Univ Def Technol Coll Syst Engn Sci & Technol Informat Syst Engn Lab Changsha 410073 Peoples R China Changsha Univ Technol & Sci Sch Econ & Management Changsha 410015 Peoples R China Natl Univ Def Technol Coll Syst Engn Changsha 410073 Peoples R China

Compared with the dedicated hardware-based middle-boxes, network function Virtualization (NFV) makes network services more flexible, scalable, and cost-efficient by replacing the network functions, e.g., Firewalls, Deep Packet Inspections (DPI), Load Balancers, by Virtual network functions (VNFs) running on generalpurpose commercial servers. Multiple VNFs usually chain up to formulate Service function Chains (SFC) to enable complex network services. With the exploitation of VNF parallelism, SFC with parallel VNFs (Para-SFC) is proposed to reduce the SFC execution delay. However, the inner-structure of a Para-SFC is usually complex and a Para-SFC may have multiple legitimate topologies. DAG-SFC is one of the basic sharping methods for standardizing the topology of Para-SFCs. To adapt to the fast development of edge computing, it is critical to find an optimal deployment of Para-SFCs in hybrid edge-and-cloud network with the purpose of maximizing the amount of the flows completely serviced in the edge. In this paper, we first analyze the target problem via integer program modeling and prove its NP-hardness. Then, we propose a heuristic algorithm named NEST, which is based on the combination of maximum spanning tree and Next Fit. With extensive evaluations, we demonstrate that, compared with the benchmark methods, NEST can achieve up to respective 14% and 37% performance gain on DAG-SFC edge deployment maximization while can always realize (up to respective 276% and 305%) higher efficiency of link usage.

关键词： network function Virtualization Edge computing Service function Chain network function parallelism

来源：评论

学校读者我要写书评

暂无评论

parallelism-aware Service function Chaining and Embedding for 5G networks 30

Parallelism-aware Service Function Chaining and Embedding fo...

引用

30th International Conference on Computer Communications and networks (ICCCN)

作者： Zheng, Danyang Peng, Chengzong Liao, Xueting Cao, Xiaojun Soochow Univ Sch Elect & Informat Engn Suzhou Peoples R China Georgia State Univ Dept Comp Sci Atlanta GA 30303 USA

ISBN: (纸本)9780738113302

The ultra-fast speed and massive capacity in 5G networks push huge amounts of data to networks. With network function virtualization, these data will go through multiple service functions (SFs) and big data processing/analysis. As a result, the processing delay from such SFs and data processing/analysis can significantly impact the delivery of latency-sensitive services. To reduce the processing delay, network function parallelism techniques are introduced to allow multiple SFs running parallelly for the same request. In this work, we study how to apply network function parallelism into SF chaining and embedding to optimize the latency. When physical nodes have unlimited computing resource, we propose the mixed integer programming based parallelism-aware SFC optimization (MIP-PS) algorithm. Our analysis proves the proposed MIP-PS is integer-approximation. When physical nodes have limited computing resource, we propose the latency factor based parallelism-aware SFC optimization (LF-PS) algorithm. Our extensive simulations demonstrate that our proposed schemes outperform the approaches extended directly from the existing work.

关键词： network function virtualization network function parallelism Service function chaining and embedding

来源：评论

学校读者我要写书评

暂无评论

OpenPATH: Application aware high-performance software-defined switching framework

引用

JOURNAL OF network AND COMPUTER APPLICATIONS 2021年 193卷 103196-103196页

作者： Krishnan, Prabhakar Duttagupta, Subhasri Buyya, Rajkumar Amrita Vishwa Vidyapeetham Ctr Cybersecur Syst & Networks Amritapuri Campus Amritapuri Kerala India Amrita Vishwa Vidyapeetham Dept Comp Sci & Engn Amritapuri Campus Amritapuri Kerala India Univ Melbourne Sch Comp & Informat Syst Cloud Comp & Distributed Syst CLOUDS Lab Melbourne Vic Australia

Currently, core networking architecture is facing disruptive developments, due to the emergence of SDN for control, NFV for services and so on. SDN promises more versatility in routing and managing traffic flows, while NFV represents a large shift in how network functions and services are built, deployed, and managed. We present OpenPATH (aPplication Aware software-defined swiTcHing framework)-A software-defined switching framework for NFV processing and orchestration of network functions (NFs) and steering the flows through service chains. Inspired by the potential benefits of encapsulating the application logic into the SDN dataplane, OpenPATH is built on the concept of a modular dataplane, which consists of two layers - switching fabric layer to control packet forwarding;and switch management layer, which inspects the incoming packets, steers the flows through a sequence of NFs and determines the next forward/drop action. The application logic of the NFs can be introduced and pushed to the dataplane at runtime and the framework offers fast packet processing and I/O functionalities to support NF parallelism in the Service function Chaining (SFC) scenarios. OpenPATH is a modular framework for software switches and offers flexibility for programming run time functions depending on the dynamic behavior of the network traffic and cyberattacks. The architecture components are not hard-coded or rigidly implementations in conventional switches/bridges and standard OpenFlow based SDN stacks. The design allows the vendors, operators, or developers to configure policies at run time and deploy custom logic and NF (also series of NFs) through software programs embedded in the switching fabric. While the basic concept is similar to some pioneering works in this area, OpenPATH does not sacrifice portability, performance, or security for programmability. The OpenPATH as a programmable switching platform takes a different approach to meet most of the requirements of application-a

关键词： SDN NFV Service function chaining network function parallelism Intent-based networking Software switching

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：