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

Resource Optimization and Delay Guarantee Virtual network function Placement for Mapping SFC Requests in Cloud networks

引用

IEEE TRANSACTIONS ON network AND SERVICE MANAGEMENT 2021年第2期18卷 1508-1523页

作者： Yue, Yi Cheng, Bo Liu, Xuan Wang, Meng Li, Biyi Chen, Junliang Beijing Univ Posts & Telecommun State Key Lab Networking & Switching Technol Beijing 100876 Peoples R China

Since the advent of network function virtualization (NFV), cloud service providers (CSPs) can implement traditional dedicated network devices as software and flexibly instantiate network functions (NFs) on common off-the-shelf servers. NFV technology enables CSPs to deploy their NFs to a cloud data center in the form of virtual network functions (VNFs) without costly capital expenditures and operating expenses. However, it is an essential but intractable issue for CSPs to devise a suitable VNF placement scheme to optimize network resource consumption and improve network performance. In this article, we focus on the VNF placement problem for mapping users' service function chain requests (SFCRs) in cloud networks. To enhance network resource utilization, we consider the fundamental resource overheads and implementation method of VNFs. The VNF placement problem is formulated as an integer linear programming model with the aim of minimizing the total network resource consumption while guaranteeing the delay requirements of SFCRs. We devise a two-phase optimization solution (TPOS) to solve the problem. TPOS contains a mapping phase to map SFCRs on servers and an adjustment phase to optimize the placement of VNFs and VNF requests. Evaluation results demonstrate that TPOS can derive near-optimal server resource consumption and significantly enhance network resource utilization. TPOS can guarantee the delay requirements of SFCRs and outperform contrastive schemes in terms of activated servers, SFCR acceptance ratio, and average VNF utilization.

关键词： Servers Delays Optimization Resource management Cloud computing Bandwidth Routing network function virtualization resource optimization virtual network function placement SFC delay guarantee

来源：评论

学校读者我要写书评

暂无评论

A KPI-Enabled NFV MANO Architecture for network Slicing with QoS

引用

IEEE COMMUNICATIONS MAGAZINE 2021年第7期59卷 44-50页

作者： Alemany, Pol Roman, Anton Vilalta, Ricard Pol, Ana Bonnet, Jose Kapassa, Evgenia Touloupou, Marios Kyriazis, Dimosthenis Karkazis, Panagiotis Trakadas, Panagiotis Martrat, Josep Casellas, Ramon Martinez, Ricardo Munoz, Raul Ctr Tecnol Telecomunciac Catalunya CTTC CERCA Barcelona Spain Quobis Porino Spain Corunet San Francisco CA USA Altice Labs Aveiro Portugal Univ Piraeus Piraeus Greece Univ Western Attica Athens Greece Natl & Kapodistrian Univ Athens Athens Greece Atos Paris France

Communication systems are used not only by voice or file exchange applications, but also by other types of applications due to the coexistence of multiple and different verticals. Each vertical has its own requirements in terms of key performance indicators (KPIs) for their applications. Mapping the verticals KPIs into network quality of service (QoS) parameters and enforcing it at the network level is a complex procedure. network slicing allows the deployment of multiple virtual networks (one per vertical) to work in parallel with their specific QoS based on the KPIs. This article presents and experimentally validates a KPI-enabled network function virtualization (NFV) management and orchestration (MANO) architecture able to manage network slices, to monitor the vertical KPI requirements and react in case they are not met. We address this objective from a holistic perspective, defining the network QoS parameters that enable meeting vertical KPIs along all levels of the NFV MANO architecture: the NSs using the 5G QoS Identifier parameter, the NFV network services using service level agreements, and the networking and computing services with QoS parameters. Finally, the described architecture is validated through an experimental use case based on a vertical realtime communications application.

关键词： network slicing Key performance indicator Quality of service Computer architecture network function virtualization Security Resource management Communication systems

来源：评论

学校读者我要写书评

暂无评论

Mobile-Aware Service function Chain Intelligent Seamless Migration in Multi-access Edge Computing

引用

JOURNAL OF network AND SYSTEMS MANAGEMENT 2024年第3期32卷 49-49页

作者： Xu, Lingyi Liu, Wenbin Wang, Zhiwei Luo, Jianxiao Wang, Jinjiang Ma, Zhi China Mobile Hangzhou Informat Technol Co Ltd Hangzhou 310000 Peoples R China

With the improvement of service delay and quality requirements for new applications such as unmanned driving, internet of vehicles, and virtual reality, the deployment of network services is gradually moving from the cloud to the edge. This transition has led to the emergence of multi-access edge computing (MEC) architectures such as distributed micro data center and fog computing. In the MEC environment, network infrastructure is distributed around users, allowing them to access the network nearby and move between different service coverage locations. However, the high mobility of users can significantly affect service orchestration and quality, and even cause service interruption. How to respond to user mobility, dynamically migrate user services, and provide users with a continuous and seamless service experience has become a huge challenge. This paper studies the dynamic migration of service function chain (SFC) caused by user mobility in MEC environments. First, we model the SFC dynamic migration problem in mobile scenarios as an integer programming problem with the goal of optimizing service delay, migration success rate, and migration time. Based on the above model, we propose a deep reinforcement learning-driven SFC adaptive dynamic migration optimization algorithm (DRL-ADMO). DRL-ADMO can perceive the underlying network resources and SFC migration requests, intelligently decide on the migration paths of multiple network functions, and adaptively allocate bandwidth, achieving parallel and seamless SFC migration. Performance evaluation results show that compared with existing algorithms, the proposed algorithm can optimize 7% service delay and 20% migration success rate at the cost of sacrificing a small amount of migration time.

关键词： Multi-access edge computing network function virtualization Service function chain Service migration Deep reinforcement learning

来源：评论

学校读者我要写书评

暂无评论

DRACO: Distributed Resource-aware Admission Control for large-scale, multi-tier systems

引用

JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING 2024年 192卷

作者： Cotroneo, Domenico Natella, Roberto Rosiello, Stefano Univ Napoli Federico II Dipartimento Ingn Elettr & Tecnol Informaz DIETI Via Claudio 21 I-80125 Naples Italy

Modern distributed systems are designed to manage overload conditions, by throttling the traffic in excess that cannot be served through overload control techniques. However, the adoption of large-scale NoSQL datastores make systems vulnerable to unbalanced overloads , where specific datastore nodes are overloaded because of hotspot resources and hogs. In this paper, we propose DRACO, a novel overload control solution that is aware of data dependencies between the application and the datastore tiers. DRACO performs selective admission control of application requests, by only dropping the ones that map to resources on overloaded datastore nodes, while achieving high resource utilization on non -overloaded datastore nodes. We evaluate DRACO on two case studies with high availability and performance requirements, a virtualized IP Multimedia Subsystem and a distributed fileserver. Results show that the solution can achieve high performance and resource utilization even under extreme overload conditions, up to 100x the engineered capacity.

关键词： Overload control Traffic throttling Hot-spot resources Cluster systems network function virtualization

来源：评论

学校读者我要写书评

暂无评论

Multi-source multicast service chaining model guaranteeing reliability of network services

引用

COMPUTER networkS 2024年 241卷

作者： Ozaki, Shintaro Sato, Takehiro Oki, Eiji Kyoto Univ Grad Sch Informat Kyoto 6068501 Japan

Service chaining provides network services to users by processing packets with a series of virtualized network functions (VNFs). Multicast communication can suppress the network load compared to unicast communication when the same service is provided to multiple users simultaneously. network providers need to ensure that services are provided to users under reliability requirements. Existing service chaining models can cause failure -intolerant or cost -inefficient resource allocation for multicast services. This paper proposes a multisource multicast service chaining model that guarantees the reliability of network services with flexible routing and VNF placement. The proposed model determines the routing and VNF placement for each service chain request with redundancy so as to minimize the total resource utilization cost while satisfying the reliability requirement. In order to obtain cost-efficient feasible solutions, we introduce two heuristic algorithms. One is an algorithm that iteratively solves an integer linear programming problem until the reliability requirements are satisfied for all requests. The other is an algorithm that determines the VNF placement by using a metric based on the betweenness centrality and server failure rate. Numerical results show that the proposed model allocates the network and computation resources for services with lower total cost compared to the existing model. We also show illustrative examples of the resource allocation to compare the characteristics of two heuristic algorithms.

关键词： network function virtualization Service chaining Multicast Reliability Optimization problem

来源：评论

学校读者我要写书评

暂无评论

Efficient service reconfiguration with partial virtual network function migration

引用

COMPUTER networkS 2024年 241卷

作者： Liu, Dongquan Zhou, Zhengyan Zhang, Dong Guo, Kaiwei Wu, Yanni Wu, Chunming Fuzhou Univ Coll Comp & Data Sci Fuzhou Peoples R China Quan Cheng Lab Jinan Peoples R China Zhejiang Univ Coll Comp Sci & Technol Hangzhou Peoples R China Fuzhou Univ Zhicheng Coll Fuzhou Peoples R China

network function virtualization (NFV) decouples network functions from dedicated hardware devices into Virtual network functions (VNFs). These VNFs are chained in order as a Service function Chain (SFC) to provision flexible and efficient services. When service requests dynamically increase, the intensive workloads often lead to node overloads and further impact the Quality of Service (QoS). Existing works address this problem by migrating VNFs from overload nodes to other low-load nodes, known as VNF migration. However, when a VNF is shared by multiple SFCs, migrating the VNF will change the mapping relationships between these SFCs and the physical network (nodes and links). That may make some SFCs traverse more links and increase their propagation latency. That violates the demand of users for low-latency services. In this paper, to minimize the impact of VNF migration on SFC latency, we propose partial VNF migration. It migrates only partial VNFs within these SFCs to minimize the overall SFC latency while reducing migration costs. As such, we leverage partial VNF migration for efficient latency minimization with the formulation of an integer linear programming (ILP) model. Given the NP-hard nature of the problem, we propose a dynamic latency-aware partial VNF migration algorithm to reduce node overloads and minimize SFC latency. Evaluation indicates that the proposed approach has 12.7%-21.8% lower average SFC latency and 12.5%-48.5% less migration cost than state -of -the -art VNF migration algorithms. And it demonstrates about 90% shorter execution time with similar minimization performance, compared to other SFC reconfiguration algorithms.

关键词： network function virtualization Service function chain VNF migration Multi-access edge computing Request dynamics

来源：评论

学校读者我要写书评

暂无评论

On the Performance Benefits of Heterogeneous Virtual network function Execution Frameworks 8

On the Performance Benefits of Heterogeneous Virtual Network...

引用

8th IEEE International Conference on network Softwarization (NetSoft) - network Softwarization Coming of Age - New Challenges and Opportunities

作者： Adoga, Haruna Umar Elkhatib, Yehia Pezaros, Dimitrios P. Univ Glasgow Sch Comp Sci Glasgow Lanark Scotland

ISBN: (纸本)9781665406949

As the adoption of softwarized network functions (NFs) keeps growing, we evaluate the performance benefits of SDN-aware data-plane implementations when compared to diverse acceleration and process-based NFV frameworks. Typical network functions have been implemented using four alternative frameworks scenarios, an SDN-aware software switch (data-plane), a virtual machine (VM), a Data-Plane Development Kit (DPDK) NF, and a containerized NF. Results from our experiments show that the data-plane NF implementation yields much higher bandwidth and packets per second (pps) rates. The bandwidth obtained is 14% more than the user-space scenario while retaining CPU utilization. The DPDK NFs in our evaluation can process packets at a much higher rate for 64B packets, on a single CPU core, which is 7 times higher than the containerized NF implementations, also tied to a single core. Our results also show the performance gains from deploying virtual network functions on heterogeneous frameworks.

关键词： SDN Data-plane network function virtualization network Softwarization Containerized network functions DPDK Virtual network functions Virtual Machines Performance Comparison NFV frameworks

来源：评论

学校读者我要写书评

暂无评论

Remote Robotic Surgery: Joint Placement and Scheduling of VNF-FGs 18

Remote Robotic Surgery: Joint Placement and Scheduling of VN...

引用

18th International Conference on network and Service Management (CNSM) - Intelligent Management of Disruptive network Technologies and Services

作者： Hentati, Amina Ebrahimzadeh, Amin Glitho, Roch H. Belqasmi, Fatna Mizouni, Rabeb Concordia Univ CHSE Montreal PQ Canada Univ Western Cape Bellville South Africa Zayed Univ Dubai U Arab Emirates Khalifa Univ Abu Dhabi U Arab Emirates

ISBN: (纸本)9783903176515

Remote robotic surgery is one of the most interesting Tactile Internet (TI) applications. It has a huge potential to deliver healthcare services to remote locations. Moreover, it provides better precision and accuracy to diagnose and operate on patients. Remote robotic surgery requires ultra-low latency and ultra-high reliability. The aforementioned stringent requirements do not apply for all the multimodal data traffic (i.e., audio, video, and haptic) triggered during a surgery session. Hence, customizing resource allocation policies according to the different qualityof-service (QoS) requirements is crucial in order to achieve a cost-effective deployment of such system. In this paper, we focus on resource allocation in a softwarized 5G-enabled TI remote robotic surgery system through the use of network functions virtualization (NFV). Specifically, this work is devoted to the joint placement and scheduling of application components in an NFVbased remote robotic surgery system, while considering haptic and video data. The problem is formulated as an integer linear program (ILP). Due to its complexity, we propose a greedy algorithm to solve the developed ILP in a computationally efficient manner. The simulation results show that our proposed algorithm is close to optimal and outperforms the benchmark solutions in terms of cost and admission rate. Furthermore, our results demonstrate that splitting application traffic to multiple VNFforwarding graphs (VNF-FGs) with different QoS requirements achieves a significant gain in terms of cost and admission rate compared to modeling the whole application traffic with one VNF-FG having the most stringent requirements.

关键词： Tactile Internet Remote Robotic Surgery network function virtualization Latency Virtual network function VNF Forwarding Graph Joint Placement and Scheduling

来源：评论

学校读者我要写书评

暂无评论

Comparison of UPF acceleration technologies and their tail-latency for URLLC

Comparison of UPF acceleration technologies and their tail-l...

引用

IEEE Conference on network function virtualization and Software Defined networks (IEEE NFV-SDN)

作者： Rischke, Justus Vielhaus, Christian Sossalla, Peter Wang, Junyue Fitzek, Frank H. P. Tech Univ Dresden Deutsch Telekom Chair Commun Networks Dresden Germany Dr Ing Hc F Porsche AG Dresden Germany Ctr Tactile Internet Human In The Loop CeTI Dresden Germany

ISBN: (数字)9781665473347

ISBN: (纸本)9781665473347

The industry is striving to deploy private cellular networks in their factories. The envisioned use cases, such as industrial automation, require Ultra-Reliable and Low-Latency Communications (URLLC). In 5G, the User Plane function (UPF) handles user traffic and hence significantly influences the performance in terms of latency and throughput. However, present UPFs are often user-space applications running on commercial off-the-shelf (COTS) servers introducing computational delays that follow long-tailed distributions. In this work, we compare modern packet processing acceleration technologies such as XDP, DPDK, and P4 and their respective tail-latency performance. Our results demonstrate the clear advantage of hardware-based P4 implementations in terms of reduced tail-latency of about 6 mu s at a percentile of 99.999% for small packets. Furthermore, we also demonstrate that software-based frameworks can compete with hardware-based approaches. For example, DPDK achieves tail-latencies of approximately 23 mu s at a percentile of 99.999%. Based on our findings, we illustrate the trade-offs between low-cost software- and high-performant hardware-based packet processing systems.

关键词： Industries 5G mobile communication Ultra reliable low latency communication Throughput Real-time systems Production facilities network function virtualization

来源：评论

学校读者我要写书评

暂无评论

Simultaneous Update Model of Multiple Service function Chains Guaranteeing State Consistency 23

Simultaneous Update Model of Multiple Service Function Chain...

引用

23rd Asia-Pacific network Operations and Management Symposium (APNOMS)

作者： Takahashi, Tomoki Sato, Takehiro Oki, Eiji Kyoto Univ Grad Sch Informat Kyoto Japan

ISBN: (数字)9784885523397

ISBN: (纸本)9784885523397

Service chaining concatenates virtual network functions (VNFs) in the network to automatically process packets in an appropriate order. In a situation where network traffic fluctuates, routes of service function chains (SFCs) need to be updated to achieve users' requirements. States of VNF instances that make up the SFC need to be kept consistent when updating the SFC routes. Existing models update SFCs one by one. If these models are adopted to the update of multiple SFCs, the total time required to update all SFCs can be long;problems such as leaving VNFs out-of-date can occur. This paper proposes a model that determines the update schedule of multiple SFCs guaranteeing state consistency. The objective function is minimizing the total time required to update all SFCs. Numerical results show that the total time required to update all SFCs can be shortened by updating multiple SFCs at the same time. The numerical results also show that the total time can be shortened by dividing a large buffer into an adequate number of small buffers.

关键词： network function virtualization service function chain network update software-defined network

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：