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

Game Theoretic Approach for a Service function Chain Routing in NFV With Coupled Constraints

IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS II-EXPRESS BRIEFS 2021年第12期68卷 3557-3561页

作者： Le, Shuting Wu, Yuhu Guo, Yuqian Vecchio, Carmen Del Dalian Univ Technol Sch Control Sci & Engn Dalian 116024 Peoples R China Cent South Univ Sch Informat Sci & Engn Changsha 410083 Peoples R China Univ Sannio Dept Engn I-82100 Benevento Italy

In this brief, the service function chain (SFC) routing in network function virtualization (NFV) with server capacity limitation and user minimum target rate constraint is investigated simultaneously. After relaxing the constraints by the addition of extra cost terms, an extended NFV game incorporating the coupled constraints is formulated. By using semi-tensor product of matrices, we prove that the formulated game is a potential game which possesses at least one Nash equilibrium. We then present the equilibrium point algorithm for solving the SFC routes problem. The numerical simulation of two cases with constraints and without constraints illustrates the influence of coupled limitations on the SFC routing.

关键词： Servers Games Routing network function virtualization Service function chaining Circuits and systems Telecommunications network function virtualization semi-tensor product of matrices coupled constraints potential game Boolean network

来源：评论

学校读者我要写书评

暂无评论

Multi-Strategy Particle Swarm Optimization based MOEA/D for VNF-SC Deployment

Journal of Network Intelligence

引用

Journal of network Intelligence 2021年第4期6卷 741-752页

作者： Zhao, Xuelin Zhao, Yansong You, Lei Liu, Zhenghui Xuan, Hejun Li, Yanling Department of Computer Science and Information Technology Xinyang Normal University 237 Nanhu Road Henan Xinyang464000 China Department of Foreign Languages Xinyang Normal University 237 Nanhu Road Henan Xinyang464000 China

network function virtualization (NFV) technology can realize on-demand distribution of network resources and improve network flexibility. It has become one of the key technologies for next-generation communications. Virtual network function Service Chain (VNF-SC) deployment is an important problem faced by network function virtualization technology. In this paper, the problem VNFs deployment for VNF-SC in inter-data center elastic optical networks (inter-DC EONs) is investigated. First, a multi-objective mathematical model, which minimizes total time delay and energy con-sumption, is establish. In this model, VNF-SCs are divide into two classes, i.e., part of required VNFs in each VNF-SC is dependent, others are independent. Second, Multi-Strategy Particle Swarm Optimization based MOEA/D (MSPSO-MOEA/D) is proposed to solve the model effectively. In MSPSO-MOEA/D, Chebyshev decomposition mecha-nism is used to transform multi-objective optimization problem into a series of single objective optimization subproblems. A new optimal mutation strategy is deeply studied in order to propose a new Particle Swarm Optimization (MSPSO) algorithm with multi-strategy. Finally, to show high performance of the proposed algorithm, large number of experiments are conducted. Experimental results indicate that the proposed algorithm has more advantages than compared algorithms. © 2021, Taiwan Ubiquitous Information CO LTD. All rights reserved.

关键词： network function virtualization

来源：评论

学校读者我要写书评

暂无评论

Optimal network Slicing for Service-Oriented networks With Flexible Routing and Guaranteed E2E Latency

引用

IEEE TRANSACTIONS ON network AND SERVICE MANAGEMENT 2021年第4期18卷 4337-4352页

作者： Chen, Wei-Kun Liu, Ya-Feng De Domenico, Antonio Luo, Zhi-Quan Dai, Yu-Hong Beijing Inst Technol Sch Math & Stat Beijing 100081 Peoples R China Beijing Inst Technol Beijing Key Lab MCAACI Beijing 100081 Peoples R China Chinese Acad Sci Acad Math & Syst Sci Inst Computat Math & Sci Engn Comp State Key Lab Sci & Engn Comp Beijing 100190 Peoples R China Huawei Technol Co Ltd France Res Ctr F-92100 Boulogne France Chinese Univ Hong Kong Shenzhen Res Inst Big Data Shenzhen 518172 Peoples R China

network function virtualization is a promising technology to simultaneously support multiple services with diverse characteristics and requirements in the 5G and beyond networks. In particular, each service consists of a predetermined sequence of functions, called service function chain (SFC), running on a cloud environment. To make different service slices work properly in harmony, it is crucial to appropriately select the cloud nodes to deploy the functions in the SFC and flexibly route the flow of the services such that these functions are processed in the order defined in the corresponding SFC, the end-to-end (E2E) latency constraints of all services are guaranteed, and all cloud and communication resource budget constraints are respected. In this paper, we first propose a new mixed binary linear program (MBLP) formulation of the above network slicing problem that optimizes the system energy efficiency while jointly considers the E2E latency requirement, resource budget, flow routing, and functional instantiation. Then, we develop another MBLP formulation and show that the two formulations are equivalent in the sense that they share the same optimal solution. However, since the numbers of variables and constraints in the second problem formulation are significantly smaller than those in the first one, solving the second problem formulation is more computationally efficient especially when the dimension of the corresponding network is large. Numerical results demonstrate the advantage of the proposed formulations compared with the existing ones.

关键词： Routing Cloud computing network slicing Delays 5G mobile communication Service function chaining Data centers Energy efficiency E2E delay network function virtualization network slicing resource allocation service function chain

来源：评论

学校读者我要写书评

暂无评论

Multi-Agent Based Autonomic network Management Architecture

引用

IEEE TRANSACTIONS ON network AND SERVICE MANAGEMENT 2021年第3期18卷 3595-3618页

作者： Arzo, Sisay Tadesse Bassoli, Riccardo Granelli, Fabrizio Fitzek, Frank H. P. Univ Trento Dept Informat Engn & Comp Sci I-38122 Trento Italy Tech Univ Dresden Fac Elect & Comp Engn Deutsch Telekom Chair Commun Networks Inst Commun Technol D-01069 Dresden Germany Cluster Excellence Ctr Tactile Internet Human Loop D-01067 Dresden Germany

The advent of network softwarization is enabling multiple innovative solutions through software-defined networking (SDN) and network function virtualization (NFV). Specifically, network softwarization paves the way for autonomic and intelligent networking, which has gained popularity in the research community. Along with the arrival of 5G and beyond, which interconnects billions of devices, the complexity of network management is significantly increasing both investments and operational costs. Autonomic networking is the creation of self-organizing, self-managing, and self-protecting networks, to afford the network management complexes and heterogeneous networks. To achieve full network automation, various aspects of networking need to be addressed. So, this article proposes a novel architecture for the multi-agent-based network automation of the network management system (MANA-NMS). The architecture rely on network function atomization, which defines atomic decision-making units. Such units could represent virtual network functions. These atomic units are autonomous and adaptive. First, the article presents a theoretical discussion of the challenges arisen by automating the decision-making process. Next, the proposed multi-agent system is presented along with its mathematical modeling. Finally, MANA-NMS architecture is mathematically evaluated from functionality, reliability, latency, and resource consumption performance perspectives.

关键词： Automation Computer architecture Software network function virtualization Quality of service Monitoring Mathematical model Autonomic networking multi-agent system network management network function virtualization software defined networking C-RAN 5G future networks

来源：评论

学校读者我要写书评

暂无评论

Availability- and Traffic-Aware Placement of Parallelized SFC in Data Center networks

引用

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

作者： Wang, Meng Cheng, Bo Wang, Shangguang Chen, Junliang Beijing Univ Posts & Telecommun State Key Lab Networking & Switching Technol Beijing 100876 Peoples R China

network function virtualization (NFV) brings flexible provisioning and great convenience for enterprises outsource their network functions to the Data Center networks (DCNs). network service in NFV is deployed as a Service function Chain (SFC), which includes an ordered set of Virtual network functions (VNFs). However, in one SFC, the SFC delay increases linearly as the length of SFC increases. SFC parallelism can achieve high performance of SFC. In this article, we focus on the parallelized SFC placement problem in DCN considering availability guarantee and resource optimization. Firstly, we define the parallelized SFC and propose a multi-flow backup model. The parallelized SFC consists of multiple parallelized sub-SFCs. We split large data flow into multiple small sub-flows, each of them can be transmitted in one sub-SFC. The backup model provides backup sub-SFCs for working sub-SFCs to improve availability. Finally, we design three placement strategies and a Hybrid Placement Algorithm (HPA) aimed at mapping SFCs to DCN. Evaluation results show that our proposed solutions outperform the related work. We can reduce SFC delay (30%) and optimize link consumption (reduce 40%) while guaranteeing availability (99.999%).

关键词： Parallel processing Delays Virtual private networks Optimization Monitoring Firewalls (computing) Noise measurement network function virtualization service function chain placement parallel availability traffic

来源：评论

学校读者我要写书评

暂无评论

On 5G-V2X Use Cases and Enabling Technologies: A Comprehensive Survey

引用

IEEE ACCESS 2021年 9卷 107710-107737页

作者： Alalewi, Ahmad Dayoub, Iyad Cherkaoui, Soumaya Univ Lille CNRSInst Elect Microelect & Nanotechnol IEMN ISENDept Optoacoustoelect DOAE Cent LilleUMR 8520Univ Polytech Hauts France F-8520 Valenciennes France INSA Hauts De France F-59313 Valenciennes France Univ Sherbrooke Dept Elect & Comp Engn Sherbrooke PQ J1K 2R1 Canada

5G technologies promise faster connections, lower latency, higher reliability, more capacity and wider coverage. We are looking to rely on these technologies to achieve Vehicle-to-Everything (V2X) communications, which increase the safety and autonomy of vehicles in addition to road safety, saving energy and costs. The integration of vehicular communication systems and 5G is the subject of many research. Nowadays, researchers address challenges such as automated and intelligent networks, cloud and edge data processing, network management, virtualization, security, privacy and finally interoperability. This paper provides a survey of the latest V2X use cases including requirements, and various 5G enabling technologies under consideration for vehicular communications. Subsequently, we first provide an interesting mapping between the three 5G pillars and V2X use case groups. Then, we present a summary of potential applications of enabling technologies for V2X use case groups. Finally, the open directions of research are discussed, and the challenges that await to be met are pointed out.

关键词： 5G mobile communication Vehicle-to-everything Standards Long Term Evolution Ultra reliable low latency communication Safety network function virtualization 5G V2X 3GPP use cases resource management NR SL NFV SDN network slicing C-RAN NOMA mmWave full-duplex

来源：评论

学校读者我要写书评

暂无评论

Detecting and mitigating cyberattacks using software defined networks for integrated clinical environments

引用

PEER-TO-PEER networkING AND APPLICATIONS 2021年第5期14卷 2719-2734页

作者： Celdran, Alberto Huertas Karmakar, Kallol Krishna Marmol, Felix Gomez Varadharajan, Vijay Univ Zurich UZH Dept Informat IfI Commun Syst Grp CSG CH-8050 Zurich Switzerland Waterford Inst Technol Syst Grp Telecommun Software Waterford Ireland Univ Newcastle Newcastle NSW Australia Univ Murcia Dept Ingn Informac & Comunicac Murcia 30071 Spain

The evolution of integrated clinical environments (ICE) and the future generations of mobile networks brings to reality the hospitals of the future and their innovative clinical scenarios. The mobile edge computing paradigm together with network function virtualization techniques and the software-defined networking paradigm enable self-management, adaptability, and security of medical devices and data management processes making up clinical environments. However, the logical centralized approach of the SDN control plane and its protocols introduce new vulnerabilities which affect the security of the network infrastructure and the patients' safety. The paper at hand proposes an SDN/NFV-based architecture for the mobile edge computing infrastructure to detect and mitigate cybersecurity attacks exploiting SDN vulnerabilities of ICE in real time and on-demand. A motivating example and experiments presented in this paper demonstrate the feasibility of of the proposed architecture in a realistic clinical scenario.

关键词： Cybersecurity Integrated clinical environments Medical cyber-physical systems Software defined networks network function virtualization

来源：评论

学校读者我要写书评

暂无评论

Cooperative-Aware Radio Resource Allocation Scheme for 5G network Slicing in Cloud Radio Access networks

引用

SENSORS 2023年第11期23卷 5111-5111页

作者： AlQahtani, Salman A. King Saud Univ Coll Comp & Informat Sci New Emerging Technol & 5G Networks & Beyond Res Ch Dept Comp Engn POB 51178 Riyadh 11543 Saudi Arabia

The 5G network is designed to serve three main use cases: enhanced mobile broadband (eMBB), massive machine-type communications (mMTC), and ultra-reliable and low-latency communications (uRLLC). There are many new technological enablers, including the cloud radio access network (C-RAN) and network slicing, that can support 5G and meet its requirements. The C-RAN combines both network virtualization and based band unit (BBU) centralization. Using the network slicing concept, the C-RAN BBU pool can be virtually sliced into three different slices. 5G slices require a number of Quality of service (QoS) metrics, such as average response time and resource utilization. In order to enhance the C-RAN BBUs utilization while protecting the minimum QoS of the coexisting three slices, a priority-based resource allocation with queuing model is proposed. The uRLLC is given the highest priority, while eMBB has a higher priority than mMTC services. The proposed model allows the eMBB and mMTC to be queued and the interrupted mMTC to be restored in its queue to increase its chance to reattempt the service later. The proposed model's performance measures are defined and derived using a continuous-time Markov chain (CTMC) model and evaluated and compared using different methodologies. Based on the results, the proposed scheme can increase C-RAN resource utilization without degrading the QoS of the highest-priority uRLLC slice. Additionally, it can reduce the forced termination priority of the interrupted mMTC slice by allowing it to re-join its queue. Therefore, the comparison of the results shows that the proposed scheme outperforms the other states of the art in terms of improving the C-RAN utilization and enhancing the QoS of eMBB and mMTC slices without degrading the QoS of the highest priority use case.

关键词： cooperative communications 5G network slicing QoS resource allocation software-defined networking network function virtualization

来源：评论

学校读者我要写书评

暂无评论

Tabu Search For Service function Chain Composition In NFV

引用

IEEE LATIN AMERICA TRANSACTIONS 2021年第1期19卷 17-25页

作者： Gil-Herrera, Juliver Botero, Juan Felipe Fac Ingn Tecnol Antioquia IU Calle 78B 72A-220 Medellin Colombia Univ Antioquia Fac Ingn Calle 67 53-108 Medellin Colombia

One of the main challenges for service providers when they try to deploy network function virtualization based networks is to efficiently make use of substrate network resources to facilitate the design, delivery and operation of network services in a dynamic and scalable manner. This challenge is known as network function virtualization Resource Allocation, which can be addressed in two stages called Service function Chain Composition and Service function Chain Embedding. The main objective of the first stage is to compose an optimized chain of Virtual network functions, which offers a complete network service. The second stage is responsible for the embedding of such network service onto a physical infrastructure based on virtualization technologies. In this paper, we propose a metaheuristic algorithm to face the scalability challenges of exact approaches, when solving the composition stage. The performance of our metaheuristic approach shows that large, complex and heterogeneous service requests can be processed in reasonable running times, finding better results compared with existing heuristics in the state of the art.

关键词： Service function chaining network function virtualization Middleboxes IEEE transactions virtualization Software Silicon compounds communication networks network function virtualization virtual network functions resource allocation

来源：评论

学校读者我要写书评

暂无评论

A Multi-Stage Graph Aided Algorithm for Distributed Service function Chain Provisioning Across Multiple Domains

引用

IEEE ACCESS 2021年 9卷 114884-114904页

作者： Kibalya, Godfrey Serrat-Fernandez, Joan Gorricho, Juan-Luis Bujjingo, Doreen Gift Serugunda, Jonathan Univ Politecn Cataluna Dept Network Engn Barcelona 08034 Spain Makerere Univ Dept Elect & Comp Engn Kampala Uganda

network Service Providers (NSPs) envisage to support the divergent and stringent requirements of future services by instantiating these services as service chains, commonly referred to as Service function Chains (SFCs), that are customized and configured to meet specific service requirements. However, due to the limited footprint of the Infrastructure Providers (InPs), these SFCs may have to transcend multiple InPs/domains. In this regard, determining the optimal set of InPs in which to embed the SFC request emerges as a complex problem for several reasons. First, the large number of possible combinations for selecting the InPs to embed the different sub-chains of the request makes this problem computationally complex, rendering optimal solutions only after long computations, especially in large scale networks, which is unfeasible for delay sensitive applications. Second, the unwillingness of InPs to disclose their internal information, which may be vital for making embedding decisions, usually implies the provisioning of single-domain solutions, which are unsuitable in this working scenario. In this regard, this paper first formulates the multi-domain service deployment problem under multiple request constraints, such as bandwidth or delay, among others. Then, due to the NP-hardness nature of the above problem, this paper proposes an algorithm that is aided by a multi-stage graph for computing a request embedding solution in a distributed manner, solving the problem in acceptable run-times. Results from different simulations reveal that the proposed algorithm is optimized in terms of acceptance ratio and embedding cost, with up to 60.0% and 88.7% improvements in terms of embedding cost and execution time, respectively, for some scenarios, in comparison with a benchmark state-of-the-art algorithm.

关键词： Indium phosphide III-V semiconductor materials Delays Computer architecture Distributed algorithms Service function chaining Licenses Service function chaining distributed algorithm multi-domain embedding network function virtualization

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：