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

On a virtual network functions placement and routing problem: Some properties and a comparison of two formulations

networkS 2020年第2期75卷 158-182页

作者： Addis, Bernardetta Carello, Giuliana Gao, Meihui Univ Lorraine CNRS LORIA Nancy France Politecn Milan Dipartimento Elettron Informaz & Bioingn Milan Italy

The mass diffusion of internet applications, both from computers and mobiles, has yielded to an increasing demand for network services with which the expensive and not flexible hardware appliances cannot keep up. On the other hand, computational capability has become available on the network nodes connected with computing servers and the cloud. This has suggested the network functions virtualization paradigm: services are provided on a software basis thus giving a flexible and cost effective response to the request for services. The network functions virtualization proposes challenging optimization problems such as the virtual network functions (VNFs) chaining problem, where service instances must be located on some network nodes and each demand must be routed through the services it requires. Most of the literature is currently focused on heuristic solutions, rather than on studying the problem properties or comparing approaches. With the aim of investigating the problem properties and comparing existing formulations, both from the theoretical and the numerical points of view, we consider a single service VNFs chaining problem, with different link and service capacities and the objective of minimizing the number of installed VNF instances.

关键词： ILP formulations location network routing networks OR in telecommunications virtual network functions

来源：评论

学校读者我要写书评

暂无评论

Management and Orchestration of virtual network functions via Deep Reinforcement Learning

引用

IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS 2020年第2期38卷 304-317页

作者： Roig, Joan S. Gutierrez-Estevez, David M. Gunduz, Deniz Imperial Coll London Dept Elect & Elect Engn London England Samsung Elect R&D Inst UK Surrey TW18 4QE England

Management and orchestration (MANO) of resources by virtual network functions (VNFs) represents one of the key challenges towards a fully virtualized network architecture as envisaged by 5G standards. Current threshold-based policies inefficiently over-provision network resources and under-utilize available hardware, incurring high cost for network operators, and consequently, the users. In this work, we present a MANO algorithm for VNFs allowing a central unit (CU) to learn to autonomously re-configure resources (processing power and storage), deploy new VNF instances, or offload them to the cloud, depending on the network conditions, available pool of resources, and the VNF requirements, with the goal of minimizing a cost function that takes into account the economical cost as well as latency and the quality-of-service (QoS) experienced by the users. First, we formulate the stochastic resource optimization problem as a parameterized action Markov decision process (PAMDP). Then, we propose a solution based on deep reinforcement learning (DRL). More precisely, we present a novel RL approach, called parameterized action twin (PAT) deterministic policy gradient, which leverages an actor-critic architecture to learn to provision resources to the VNFs in an online manner. Finally, we present numerical performance results, and map them to 5G key performance indicators (KPIs). To the best of our knowledge, this is the first work that considers DRL for MANO of VNFs' physical resources.

关键词： Deep reinforcement learning resource allocation software defined networks virtual network functions wireless edge processing

来源：评论

学校读者我要写书评

暂无评论

On the Optimal Deployment of virtual network functions in Non-Terrestrial Segments

引用

IEEE TRANSACTIONS ON network AND SERVICE MANAGEMENT 2023年第4期20卷 4831-4845页

作者： Petrosino, Antonio Piro, Giuseppe Grieco, Luigi Alfredo Boggia, Gennaro Politecn Bari Dept Elect & Informat Engn I-70126 Bari Italy Consorzio Nazl Interuniv Telecomunicaz I-43124 Parma Italy

In the upcoming Sixth-Generation (6G) of mobile communication systems, space network entities will cooperate with conventional terrestrial networks to provide three-dimensional wireless connectivity around the World. By considering the resulting massive amount of data to be managed into non-terrestrial segments, it will be necessary to dynamically configure functionalities across space network entities. Preliminary contributions in this context focus on quasi-static scenarios, while ignoring the challenging issues (i.e., intermittent visibility, dynamic network configuration, and communication delays) introduced by satellites' movement and communication protocols enabling the integration of terrestrial and non-terrestrial networks. To bridge this gap, this work presents a network architecture with novel orchestration capabilities of services into non-terrestrial segments. In the proposed approach, the interaction between terrestrial and non-terrestrial entities and the cloud has been detailed across service request, configuration, and provisioning phases. Then, starting from a system model describing the network configuration and the resulting deployment delays of services, an optimization problem has been formulated to dynamically allocate virtual network functions (VNFs) among LEO CubeSats over a looking-ahead horizon, based on service requests, computational capabilities of the involved CubeSats, visibility matrices, and expected deployment delay bounds. Finally, the proposed optimization problem has been solved through three heuristic strategies. Computer simulations have been carried out to demonstrate the ability of the developed strategies to achieve results close to the optimal solution and to ensure better performance against a benchmark scheme.

关键词： 6G non-terrestrial network virtual network functions network optimization

来源：评论

学校读者我要写书评

暂无评论

Placement and Allocation of virtual network functions: Multi-Dimensional Case

引用

IEEE TRANSACTIONS ON MOBILE COMPUTING 2023年第7期22卷 4195-4211页

作者： Sallam, Gamal Zheng, Zizhan Ji, Bo Temple Univ Dept Comp & Informat Sci Philadelphia PA 19122 USA Tulane Univ Dept Comp Sci New Orleans LA 70118 USA Virginia Tech Dept Comp Sci Blacksburg VA 24061 USA

network function virtualization (NFV) is an emerging design paradigm that replaces physical middlebox devices with software modules running on general purpose commodity servers. While gradually transitioning to NFV, Internet service providers face the problem of where to introduce NFV in order to make the most benefit of that;here, we measure the benefit by the amount of traffic that can be served in an NFV-enabled network. This problem is non-trivial as it is composed of two challenging subproblems: 1) placement of nodes to support virtual network functions (referred to as VNF-nodes);2) allocation of the VNF-nodes' resources to network flows. These two subproblems must be jointly considered to satisfy the objective of serving the maximum amount of traffic. This problem has been studied for the one-dimensional setting, where all network flows require one network function, which requires a unit of resource to process a unit of flow. In this work, we consider the multi-dimensional setting, where flows must be processed by multiple network functions, which require a different amount of each resource to process a unit of flow. The multi-dimensional setting introduces new challenges in addition to those of the one-dimensional setting (e.g., NP-hardness and non-submodularity) and also makes the resource allocation subproblem a multi-dimensional generalization of the generalized assignment problem with assignment restrictions. To address these difficulties, we propose a novel two-level relaxation method that allows us to draw a connection to the sequence submodular theory and utilize the property of sequence submodularity along with the primal-dual technique to design two approximation algorithms. We further prove that the proposed algorithms have a non-trivial approximation ratio that depends on the number of VNF-nodes, resources, and a measure of the available resource compared to flow demand. Finally, we perform trace-driven simulations to show the effectiveness of the

关键词： virtual network functions multi-dimensional resource allocation sequence submodular functions approximation algorithms

来源：评论

学校读者我要写书评

暂无评论

A Composition Selection Mechanism for Chaining and Placement of virtual network functions 15

A Composition Selection Mechanism for Chaining and Placement...

引用

15th Int Conf on network and Serv Management (CNSM) / 1st Int Workshop on Analyt for Serv and Application Management (AnServApp) / Int Workshop on High-Precision networks Operat and Control, Segment Routing and Serv Function Chaining (HiPNet+SR/SFC)

作者： Araujo, Samuel M. A. de Souza, Fernanda S. H. Mateus, Geraldo R. Univ Fed Minas Gerais Dept Comp Sci Belo Horizonte MG Brazil Univ Fed Sao Joao del Rei Dept Comp Sci Sao Joao Del Rei Brazil

ISBN: (纸本)9783903176249

virtual network functions (VNF) reduce the complexity to deploy a network Service (NS), yielding flexibility, and scalability to attend new market appliances and minimizing the required investments. An ordered set of VNFs to serve a NS is called a Service Function Chain (SFC). Most of the literature works deal with SFCs generation and embedding as independent problems, not taking into account the residual substrate network (SN) status during the SFCs generation stage. Furthermore, a NS can award some flexibility regarding the VNFs sequence, i.e., only a subset of VNFs have a fixed precedence requirement. Following this idea, the network operator may enjoy some options to serve a NS. In this work, we introduce a new embedding approach which selects the SFC composition that best fits the residual SN, leading to a better performance in the chaining and placement of VNFs. The results showed that the composition selection mechanism increases performance compared to traditional models that use a fixed composition, improving resources sharing, and increasing the network operator revenues. Also, we demonstrated that the generation of an optimal SFC for a NS does not always lead to the best acceptance rates in a network with partially consumed resources.

关键词： network function virtualization virtual network functions resource allocation chain composition

来源：评论

学校读者我要写书评

暂无评论

Modeling Native Software Components as virtual network functions 16

Modeling Native Software Components as Virtual Network Funct...

引用

ACM Conference on Special Interest Group on Data Communication (SIGCOMM)

作者： Baldi, Mario Bonafiglia, Roberto Risso, Fulvio Sapio, Amedeo Politecn Torino Dept Control & Comp Engn Turin Italy

ISBN: (纸本)9781450341936

virtual network functions (VNFs) are often realized using virtual machines (VMs) because they provide an isolated environment compatible with classical cloud computing technologies. However, VMs are demanding in terms of required resources (CPU and memory) and therefore not suitable for low-cost devices like residential gateways. Such equipment often runs a Linux-based operating system that includes by default a (large) number of common network functions, which can provide some of the services otherwise offered by simple VNFs, but with reduced overhead. In this paper those native software components are made available through a network Function virtualization (NFV) platform, thus making their use transparent from the VNF developer point of view.

关键词： network functions virtualization virtual network functions Service Orchestration

来源：评论

学校读者我要写书评

暂无评论

Specifying and Placing Chains of virtual network functions 3

Specifying and Placing Chains of Virtual Network Functions

引用

3rd IEEE International Conference on Cloud networking (CloudNet)

作者： Mehraghdam, Sevil Keller, Matthias Karl, Holger Univ Paderborn D-33098 Paderborn Germany

ISBN: (纸本)9781479927302

network appliances perform different functions on network flows and constitute an important part of an operator's network. Normally, a set of chained network functions process network flows. Following the trend of virtualization of networks, virtualization of the network functions has also become a topic of interest. We define a model for formalizing the chaining of network functions using a context-free language. We process deployment requests and construct virtual network function graphs that can be mapped to the network. We describe the mapping as a Mixed Integer Quadratically Constrained Program (MIQCP) for finding the placement of the network functions and chaining them together considering the limited network resources and requirements of the functions. We have performed a Pareto set analysis to investigate the possible trade-offs between different optimization objectives.

关键词： network function virtualization virtual network functions network function chaining network service chaining network function placement

来源：评论

学校读者我要写书评

暂无评论

On-Demand Placement and Scheduling of virtual network functions with Software Requirements

On-Demand Placement and Scheduling of Virtual Network Functi...

引用

IEEE Latin-American Conference on Communications (LATINCOM)

作者： dos Santos, Giovanne Marcelo Batista, Daniel Macedo Univ Sao Paulo Dept Comp Sci Sao Paulo Brazil

ISBN: (纸本)9781728189031

virtual network functions (VNFs) can be combined together to meet several network services with reduced capital and operational expenditures. Given that the VNFs are virtualized, a network operator needs to solve two problems to efficiently deploy them: VNF placement and VNF scheduling. In this paper, we propose an algorithm to solve the two problems at the same time, placing and scheduling the VNFs on demand, and taking the software requirements into consideration, in a way that traditional distributed computing schedulers can be used. The proposed algorithm was evaluated via simulation against three other schedulers. Results showed that the algorithm is able to increase, by 19.7%, the number of completed VNFs in a scenario with 16540 VNFs being instantiated.

关键词： virtual network functions NFV Scheduling Placement

来源：评论

学校读者我要写书评

暂无评论

Anomaly detection based on system text logs of virtual network functions

引用

BIG DATA RESEARCH 2024年 38卷

作者： Rim, Daniela N. Heo, Dongnyeong Lee, Chungjun Nam, Sukhyun Yoo, Jae-Hyoung Hong, James Won-Ki Choi, Heeyoul Handong Global Univ Pohang South Korea Pohang Univ Sci & Technol Pohang South Korea

In virtual network environments building secure and effective systems is crucial for its correct functioning, and so the anomaly detection task is at its core. To uncover and predict abnormalities in the behavior of a virtual machine, it is desirable to extract relevant information from system text logs. The main issue is that text is unstructured and symbolic data, and also very expensive to process. However, recent advances in deep learning have shown remarkable capabilities of handling such data. In this work, we propose using a simple LSTM recurrent network on top of a pre-trained Sentence-BERT, which encodes the system logs into fixed-length vectors. We trained the model in an unsupervised fashion to learn the likelihood of the represented sequences of logs. This way, the model can trigger a warning with an accuracy of 81% when a virtual machine generates an abnormal sequence. Our model approach is not only easy to train and computationally cheap, it also generalizes to the content of any input.

关键词： Anomaly detection virtual network functions Sentence representation Unsupervised learning

来源：评论

学校读者我要写书评

暂无评论

Content Media Retrieval using virtual network functions in Multi-access Edge Computing architecture

引用

INTERNATIONAL JOURNAL OF network MANAGEMENT 2022年第5期32卷 e2208-e2208页

作者： Bastos, Ian Vilar Moraes, Igor Monteiro Thi-Mai-Trang Nguyen Pujolle, Guy Univ Fed Fluminense Inst Comp Lab Midiacom Niteroi RJ Brazil Sorbonne Univ Paris Lab Informat Paris 6 Paris France

The mobile traffic grows every year. Resource requirements of mobile applications, as processing power and storage capacity, transformed the architecture of cellular networks into a centralized infrastructure, the C-RANs. On the other hand, providing resources close to base stations, as the multi-access edge computing suggests, allows an immediate processing for delay sensitive applications. In this work, we formulate as a mixed integer linear programming the retrieval of media contents through caches acting as virtual network functions. The optimization model minimizes both the media contents' retrieval cost and the number of instantiated virtual network functions. Results show that the characteristic that has most impact on caching is the high throughput between the node that stores the virtual network function images and the virtualized environment that hosts the image, where up to 70% of the requests are satisfied. When caches have low storage capacity and incurs high transferring delay cost for deployment, the most important characteristic is the throughput distribution between the virtualized environment and the base stations.

关键词： caching mobile networks virtual network functions

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：