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

Profit-Maximizing Service function Chain Embedding in NFV-Based 5G Core networks

IEEE TRANSACTIONS ON network SCIENCE AND ENGINEERING 2024年第6期11卷 6105-6117页

作者： Chen, Zhenke Li, He Ota, Kaoru Dong, Mianxiong Muroran Inst Technol Dept Sci & Informat Muroran 0508585 Japan

network function virtualization (NFV) is a promising technology to make 5G networks more flexible and cost-efficient. With NFV, a 5G network service is implemented as several Virtual network functions (VNFs) that run on general machines, called a Service function Chain (SFC). A recent survey has revealed that when multiple VNFs are colocated in the same machine, contention for shared physical resources will occur and hence degrade the throughput of a VNF and finally increase its processing delays by 50%, as compared to it runs in isolation. However, prior works fail to capture this important characteristic because they simply treat machines as a resource pool without any resource contention happening, making their approach inapplicable to the SFC embedding problem when resource contention is taken into consideration. To bridge that gap, in this paper, we study a contention-aware QoS-guaranteed SFC embedding problem and formulate it as an Integer Non-Linear Programming (INLP) under a couple of constraints. Given the formulated problem is challenging to solve due to high complexity, we propose a low-complexity approach, which can achieve a near-optimal result in a reasonable time. Numerical results reveal that the proposed approach has advantages in profit, delay, and execution time compared with other state-of-the-art approaches.

关键词： 5G mobile communication Delays Costs Quality of service Interference Heuristic algorithms Service function chaining network function virtualization software-defined networking 5G virtual network function service function chain integer non-linear programming

来源：评论

学校读者我要写书评

暂无评论

FlowLever: Leverage Flow Director for Packet Dispatch Acceleration in NFV

引用

IEEE ACCESS 2024年 12卷 36122-36134页

作者： Fu, Liang Zhang, Hubin Zhang, Zongpu Li, Jian Guan, Haibing Shanghai Jiao Tong Univ Sch Software Engn Shanghai 200240 Peoples R China Shanghai Jiao Tong Univ Dept Comp Sci & Engn Shanghai 200240 Peoples R China

The efficiency of dispatching incoming network flow packets to the destination virtual network function (VNF) has been recognized as a key problem in network function virtualization (NFV) platforms. Recent hardware assisted packet dispatch systems tend to rely on expensive software-defined network (SDN) switches or SmartNICs to mitigate the dispatch performance bottleneck, commonly observed in traditional software dispatch systems. In this paper, we revisit a hardware Flow Director (FDir) feature commonly found on commercial off-the-shelf NICs and propose a FDir-based NFV system that greatly accelerates packet dispatch with a much lower total cost of ownership (TCO). FlowLever is carefully designed to resolve nontrivial challenges such as the lack of flow state monitoring in FDir, the limited flow classification schema, heavy flow cache reconfiguration overhead, and high VNF scaling costs. With our software-hardware codesigned dispatch system and newly proposed flow activeness detection and cache replacement mechanisms, our evaluation using real-world network traffic traces shows that FlowLever improves the throughput by 1.6x - 2.8x and costs only 0.2 ms - 0.6 ms for load balance during VNF scaling.

关键词： Cloud computing network function virtualization flow director NFV

来源：评论

学校读者我要写书评

暂无评论

Position-aware packet loss optimization on service function chain placement

引用

Digital Communications and networks 2024年第4期10卷 1057-1067页

作者： Wenjie Liang Chengxiang Li Lin Cui Fung Po Tso Department of Computer Science Jinan UniversityGuangzhou510632China Department of Computer Science Loughborough UniversityLoughboroughLE113TUUK

The advent of network function virtualization(NFV)and Service function Chains(SFCs)unleashes the power of dynamic creation of network services using Virtual network functions(VNFs).This is of great interest to network operators since poor service quality and resource wastage can potentially hurt their revenue in the long ***,the study shows with a set of test-bed experiments that packet loss at certain positions(i.e.,different VNFs)in an SFC can cause various degrees of resource wastage and performance degradation because of repeated upstream processing and transmission of retransmitted *** overcome this challenge,this study focuses on resource scheduling and deployment of SFCs while considering packet loss *** study developed a novel SFC packet dropping cost model and formulated an SFC scheduling problem that aims to minimize overall packet dropping cost as a Mixed-Integer Linear Programming(MILP)and proved that it is *** this study,Palos is proposed as an efficient scheme in exploiting the functional characteristics of VNFs and their positions in SFCs for scheduling resources and deployment to optimize packet dropping *** experiment results show that Palos can achieve up to 42.73%improvement on packet dropping cost and up to 33.03%reduction on average SFC latency when compared with two other state-of-the-art schemes.

关键词： network function virtualization Resource scheduling SFC deployment Packet loss

来源：评论

学校读者我要写书评

暂无评论

Deterministic and Dynamic Joint Placement and Scheduling of VNF-FGs for Remote Robotic Surgery

引用

IEEE TRANSACTIONS ON network AND SERVICE MANAGEMENT 2025年第2期22卷 1841-1858页

作者： Hentati, Amina Ebrahimzadeh, Amin Glitho, Roch H. Belqasmi, Fatna Mizouni, Rabeb Concordia Univ Telecommun Serv Engn Res Lab Montreal PQ H3G1M8 Canada Univ Western Cape Comp Sci Programme ZA-7535 Cape Town South Africa Zayed Univ Coll Innovat Technol Abu Dhabi U Arab Emirates Khalifa Univ Dept ECE Abu Dhabi U Arab Emirates

During a Remote Robotic Surgery (RRS) session, multimodal data traffic with different requirements is initiated. In order to achieve a cost-effective deployment of such a system, it is crucial to tailor resource allocation policies based on the different quality of service (QoS) requirements of each data traffic. In this paper, we focus on resource allocation in a 5G-enabled tactile Internet RRS system using network function virtualization (NFV). In particular, we investigate the joint placement and scheduling of Virtualized network functions (VNFs) in a RRS system under both deterministic and dynamic settings. An integer linear program (ILP) is used to formulate the problem. Due to its high computational complexity, we first propose an efficient greedy algorithm to solve the ILP under deterministic settings. Simulation results show that our proposed algorithm achieves near-optimal performance and outperforms the benchmark solutions in terms of cost and admission rate. It can reduce cost by up to 37% and improve admission rate by up to 34% while satisfying both latency and reliability constraints. Furthermore, our results show that modeling the multimodal data traffic by multiple VNF Forwarding Graphs (VNF-FGs) with different QoS requirements achieves a significant gain in terms of cost and acceptance rate compared to modeling it by a single VNF-FG with the most stringent requirements. We then considered a dynamic environment where latency variations and traffic arrivals may occur over time. Using the principles of optimal stopping theory, we propose an adaptive dynamic scheduler that is capable of triggering recalculations of the existing optimal solution based on the observed cumulative number of traffic arrivals and latency violations without the need for predictions. Our proposed optimal scheduler minimizes the migration cost compared to other schedulers.

关键词： Surgery Haptic interfaces Robots Dynamic scheduling Quality of service Reliability Costs Heuristic algorithms network function virtualization Servers Tactile Internet remote robotic surgery (RRS) network function virtualization (NFV) latency reliability joint placement and scheduling stopping theory

来源：评论

学校读者我要写书评

暂无评论

NFV-Enabled Service Recovery in SpaceGround Integrated networks: A Matching Game-Based Approach

引用

IEEE TRANSACTIONS ON network SCIENCE AND ENGINEERING 2025年第3期12卷 1732-1744页

作者： Jia, Ziye Cao, Yilu He, Lijun Li, Guangxia Zhou, Fuhui Wu, Qihui Han, Zhu Nanjing Univ Aeronaut & Astronaut Coll Elect & Informat Engn Nanjing 211106 Peoples R China Xidian Univ State Key Lab ISN Xian 710071 Peoples R China China Univ Min & Technol Sch Informat & Control Engn Xuzhou 221116 Peoples R China Univ Houston Dept Elect & Comp Engn Houston TX 77004 USA Kyung Hee Univ Dept Comp Sci & Engn Seoul 446701 South Korea

To achieve ubiquitous connectivity of the sixth generation communication, the space-air-ground integrated network (SAGIN) is a popular topic. However, the dynamic nodes in SAGIN such as satellites and unmanned aerial vehicles, may be fragile and out of operation, which can potentially cause service failure. Therefore, the research on service recovery in SAGIN under situations of resource failure is critical. In order to facilitate the flexible resource utilization of SAGIN, the network function virtualization technology (NFV) is proposed to be employed. Firstly, the task management is transformed into the deployment of service function chains (SFCs). Then, we design an NFV-based SFC recovery model in SAGIN in the face of resource failure, so that tasks can quickly select alternative resources to complete deployments. Moreover, the problem of SFC recovery is formulated to minimize the total time consumption for all completed SFCs. Since it is an NP-hard integer linear programming problem, we propose the efficient recovery algorithm based on the matching game. Finally, via various simulations, the effectiveness of the proposed algorithm and its advantages are verified, where the total time consumption is optimized by about 25%, compared with other benchmark methods.

关键词： Space-air-ground integrated networks Heuristic algorithms Resource management Vehicle dynamics Satellites Games Dynamic scheduling Electronic mail virtualization Service function chaining Space-air-ground integrated network network function virtualization service function chain resource failure service recovery matching game

来源：评论

学校读者我要写书评

暂无评论

Multi-Access Edge Computing Resource Slice Allocation: A Review

引用

IEEE ACCESS 2024年 12卷 188572-188589页

作者： Bahramisirat, Faezeh Gregory, Mark A. Li, Shuo RMIT Univ Sch Engn Melbourne Vic 3000 Australia

The global deployment of fifth generation mobile cellular (5G) and beyond (5GB) communication systems has accelerated the growth of the Internet of Things (IoT) and the Internet of Everything (IoE). New applications and services that add complexity to the network, and require low latency, have necessitated new architectures that facilitate dynamic resource allocation. The network edge is changing, as Multi-Access Edge Computing (MEC) is deployed with new responsive designs that include dynamic resource slice allocation that supports the varying needs of new and innovative applications and services. Augmented reality, extended reality and virtual reality applications are key drivers for the changing network architecture. IoT and IoE data aggregation and analysis at the network edge has required new approaches to designing edge network architectures that achieve seamless access anywhere and anytime, ultra-low latency, edge computing and storage, and ultra-high bandwidth. MEC and network Slicing (NS) are evolving to provide a key part of the solution to the new challenges. MEC allows operators to connect user devices to edge cloud computing and storage systems with low latency and high bandwidth. However, a practical configuration is required to facilitate cloud-based applications and services at the network edge and to address end-user demands. The MEC resources may be flexibly and dynamincally partitioned into separate slices. This paper will review how the integration of MEC and NS can be utilised for efficient resource allocation in edge networks. This article comprehensively reviewed the architecture of network slicing and edge computing. A review of MEC and NS in support of 5G and 5GB has been included and current challenges identified. This article aims to serve as an insightful guide to inspire further research into 5GB communication systems and edge computing.

关键词： Resource management 5G mobile communication network slicing Ultra reliable low latency communication Radio access networks network function virtualization Internet of Things Cloud computing Surveys Reviews multi-access edge computing 5G 6G resource allocation radio access network

来源：评论

学校读者我要写书评

暂无评论

Reliability-Aware Resource Allocation for SFC: A Column Generation-Based Link Protection Approach

引用

IEEE TRANSACTIONS ON network AND SERVICE MANAGEMENT 2024年第4期21卷 4583-4597页

作者： Li, Wenqian Qu, Long Liu, Juan Xie, Lingfu Ningbo Univ Fac Elect Engn & Comp Sci Ningbo 315211 Peoples R China

network function virtualization (NFV) is considered one of the key technologies of 5G/B5G because of its advantages of flexibility, scalability, and manageability. In NFV networks, the flow of network service needs to go through a certain number of Virtual network functions (VNFs) which form Service function Chain (SFC). Compared to link protection in traditional networks, the backup transmission links for different types of VNFs need to be considered to improve the SFCs' reliability, since any failure of transmission link may interrupt the network service. Due to the uncertainty of VNF placement and routing, the flexible selection of link backup for each VNF to satisfy the reliability requirement of SFC becomes a remarkably challenging problem. In this paper, a Flexible virtual Link Protection (Fle_LP) mechanism is proposed to calculate backup resources accurately, enhancing the reliability of NFV-enabled network service. We mathematically formulate the problem as a Mixed Integer Nonlinear Program (MINLP). An Extended Least Square (ELS) method is introduced to deal with the nonlinear constraints, which transforms MINLP to Mixed Integer Linear Programming (MILP). Owing to the MILP's remarkable complexity, a Column Generation-based Link Protection (CG_LP) algorithm is proposed, which generates an acceptable sub-optimal solution. Numerical results show that CG_LP reduces the computing time (8-node network: 92.3%, 16-node network: 99.6%) while achieving the same bandwidth consumption as MILP.

关键词： Reliability Protection Surgery Delays 5G mobile communication Virtual links Resource management network function virtualization service function chain least square network reliability column generation

来源：评论

学校读者我要写书评

暂无评论

Datacenter optimization methods for Softwarized network Services

引用

JOURNAL OF SYSTEMS ARCHITECTURE 2024年 156卷

作者： Pannocchi, Luigi Lahiri, Sourav Fichera, Silvia Artale, Antonino Cucinotta, Tommaso Scuola Super Sant Anna Via Moruzzi 1 I-56124 Pisa Italy Vodafone Milan Italy

This paper tackles the problem of optimum Virtual Machine placement, focusing on an industrial use-case dealing with capacity planning for Virtualized network functions. The work is framed within an industrial collaboration with the Vodafone network operator, where a particularly important problem is the one of optimum deployment of Softwarized network functions within their Virtualized networking Infrastructure, spanning across several EU countries. The problem is particularly difficult due to the presence of a multitude of placement constraints that are needed in the industrial use-case, including soft affinity constraints, that should be respected only as secondary objective;furthermore, in some EU regions, the size of the problem makes it unfeasible to solve it with traditional MILP-based techniques. In this work, we review and address limitations of previously proposed heuristics for this kind of problems, and propose a new placement strategy that is shown experimentally to be more effective in dealing with soft affinity constraints. The paper includes an extensive experimental evaluation encompassing a multitude of optimization strategies, applied to a set of problems including both real-world problems that we made available as an open data-set, and additional randomly generated problems mimicking the structure of the original real-world problems.

关键词： Virtual machine placement Resource optimization Genetic algorithms network function virtualization

来源：评论

学校读者我要写书评

暂无评论

Toward Full-Coverage and Low-Overhead Profiling of network-Stack Latency

引用

IEEE-ACM TRANSACTIONS ON networkING 2024年第5期32卷 4441-4455页

作者： Chen, Xiang Liu, Hongyan Zhang, Wenbin Huang, Qun Zhang, Dong Zhou, Haifeng Liu, Xuan Wu, Chunming Zhejiang Univ Coll Comp Sci & Technol Hangzhou 310007 Peoples R China Zhejiang Univ Coll Control Sci & Engn Hangzhou 310007 Peoples R China Peking Univ Sch Comp Sci Natl Key Lab Multimedia Informat Proc Beijing 100871 Peoples R China Fuzhou Univ Coll Comp Sci & Big Data Fuzhou 350116 Peoples R China Zhicheng Coll Fuzhou 350025 Peoples R China Yangzhou Univ Coll Informat Engn Coll Artificial Intelligence Yangzhou 225002 Peoples R China Southeast Univ Sch Comp Sci & Engn Nanjing 211189 Peoples R China Zhejiang Univ Quan Cheng Lab Hangzhou 310007 Peoples R China Zhejiang Univ Coll Comp Sci & Technol Hangzhou 310007 Peoples R China

In modern data center networks (DCNs), network-stack processing denotes a large portion of the end-to-end latency of TCP flows. So profiling network-stack latency anomalies has been considered as a crucial part in DCN performance diagnosis and troubleshooting. In particular, such profiling requires full coverage (i.e., profiling every TCP packet) and low overhead (i.e., profiling should avoid high CPU consumption in end-hosts). However, existing solutions rely on system calls or tracepoints in end-hosts to implement network-stack latency profiling, leading to either low coverage or high overhead. We propose Torp, a framework that offers full-coverage and low-overhead profiling of network-stack latency. Our key idea is to offload as much of the profiling from costly system calls or tracepoints to the Torp agent built on eBPF modules, and further to include a Torp handler on the ToR switch to accelerate the remaining profiling operations. Torp efficiently coordinates the ToR switch and the Torp agent on end-hosts to jointly execute the entire latency profiling task. We have implemented Torp on $32\times 100$ Gbps Tofino switches. Testbed experiments indicate that Torp achieves full coverage and orders of magnitude lower host-side overhead compared to other solutions.

关键词： Kernel Computer science Real-time systems network function virtualization Monitoring Instruments Hash functions Hardware-software coordination latency profiling programmable switches

来源：评论

学校读者我要写书评

暂无评论

Security in 5G network Slices: Concerns and Opportunities

引用

IEEE ACCESS 2024年 12卷 52727-52743页

作者： Singh, Virendra Pratap Singh, Mahendra Pratap Hegde, Saumya Gupta, Maanak Natl Inst Technol Karnataka Dept Comp Sci & Engn Mangaluru 575025 India Tennessee Technol Univ Dept Comp Sci Cookeville TN 38505 USA

network slicing has emerged as a cornerstone technology within the 5G ecosystem, enabling efficient resource allocation, service customization, and support for various applications. Its ability to deliver network-as-a-Service (NaaS) brings a new paradigm of adaptable and efficient network provisioning. However, with the diversification of services and the increasing complexity of network infrastructures, a simultaneous rise in security vulnerabilities becomes evident. These flaws go beyond the limitations of conventional network security and affect various aspects of network slice (NS) implementation and management. The limitations of traditional security, such as static policies, single point of failure, and challenges in effectively securing network slicing deployments, underscore the need to explore security measures tailored to the dynamic nature of 5G networks. To ensure the robust security of 5G networks, it is essential to consider various security concerns such as isolation, authentication, and authorization. Furthermore, dynamic orchestration and inter-slice communication security challenges must be proactively tackled. The security concerns related to 5G networks must be addressed comprehensively to ensure the safe and secure operation of the network. Our survey paper goes into these complex security issues, providing an in-depth and systematic review of the various contexts in which they emerge. We have identified the five most vulnerable areas in network Slicing: Slice-Lifecycle, Communication type slice uses, Technologies used to provide service, Management threats, and End Devices utilized in service. Apart from threats in these vulnerable areas, we also discussed a few generous attacks that can be launched to disrupt network-slicing services. Furthermore, this study is a valuable resource for evaluating the current state of research efforts in this domain, contributing to the ongoing enhancement of security measures and the overall robustness of netwo

关键词： Security 5G mobile communication network slicing 3GPP Surveys Artificial intelligence Terminology network function virtualization Software defined networking 5G network security network function virtualization software defined networking

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：