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

2024 International Symposium on networks, Computers and Communications, ISNCC 2024

作者： Attawna, Mahdi Doan, Tung V. Fitzek, Frank H.P. Nguyen, Giang T. Tu Dresden Haptic Communication Systems Germany Tu Dresden Deutsche Telekom of Communication Networks Germany Germany

ISBN: (纸本)9798350364910

Edge clouds embrace network function virtualization (NFV) to bring network functions (NFs) closer to end devices. The mobility nature of edge clouds and the emergence of new use cases, such as robot control or metaverse, demand NFs with high resilience. However, numerous NFs like firewalls require stateful processing that depends on historical processing values, referred to as NF states. Consequently, supporting stateful NFs with high resilience necessitates the maintenance of their states, often resulting in significant modification of the NFs. While providing high resilience for NFs, maintaining their processing performance is a critical challenge for existing solutions. Our proposed framework, StateProc, eliminates this concern by enhancing the processing capabilities of NFs through the utilization of NF states for custom processing. Through custom processing for state transfer, the evaluation results show that StateProc significantly improves the state transfer time, up to 93% faster than a notable state-of-the-art framework, without additional processing overhead. © 2024 IEEE.

关键词： network function virtualization

来源：评论

学校读者我要写书评

暂无评论

Load Balancing of Virtual network functions through Packet Delegation

Load Balancing of Virtual Network Functions through Packet D...

引用

International Balkan Conference on Communications and networking (BalkanCom)

作者： Zervopoulos, Alexandros Oikonomou, Konstantinos Ionian Univ Dept Informat Corfu Greece

ISBN: (纸本)9798350339109

network function virtualization is a promising technology that can provide complex packet processing capabilities through Virtual network function (VNF) chains. Service function Chaining aims to facilitate the management of these chains, typically through centralized management and orchestration, which perform inadequately when operating under heavy load, as they require the exchange of a significant amount of packets and they often optimize for network-wide metrics, potentially providing subpar performance to a few individuals. To address these shortcomings, a packet delegation mechanism is proposed in this paper, which can be integrated into the lifecycle managers of VNFs and serves as a load sharing mechanism redirecting traffic from VNFs under heavy load to other servers. Additionally, the prioritization of delegated packets is proposed to reduce the delay overhead that is introduced by the additional hops that delegated packets may need to traverse. The packet delegation mechanism is analytically studied under certain assumptions using queueing theory and its performance is evaluated through experimentation in a simulation setting. The acquired results validate the analysis, which indicates that packet delegation can effectively redirect traffic from overburdened VNFs and reduce end-to-end delay, while utilizing purely local information.

关键词： Load balancing load sharing network function virtualization virtual network function service function chaining

来源：评论

学校读者我要写书评

暂无评论

VDH: a dynamic honeynet technology based on game theory 4

VDH: a dynamic honeynet technology based on game theory

引用

4th International Conference on Machine Learning and Computer Application, ICMLCA 2023

作者： Ma, Li Chen, Ming Liu, Liang College of Computer Science and Technology Nanjing University of Aeronautics and Astronautics Nanjing China

ISBN: (数字)9781510680265

ISBN: (纸本)9781510680258

As the complexity of cyber attacks increases, honeypot networks, acting as a proactive security mechanism, have become an important area of research in the field of cybersecurity. Although traditional honeynets offer a degree of defense, their limitations in dealing with complex and persistent cyber attacks, including a lack of flexibility, insufficient allure for attackers, and high maintenance costs, are increasingly exposed. This paper introduces a versatile dynamic honeynet architecture (VDH) to compensate for these deficiencies in existing honeynet technologies. By deploying in parallel with enterprise networks and dynamically generating honeypot nodes, the VDH architecture achieves flexible control and redirection of suspicious traffic, thus enhancing network protection capabilities. The paper further abstracts honeynet attack and defense behaviors into a non-cooperative incomplete information game model, and through precise modeling and analysis of the single-stage attack-defense game process, proposes a novel optimal configuration strategy for dynamic honeynets. Lastly, the paper designs and implements the VDH prototype system based on network function virtualization, and verifies the effectiveness and superiority of the VDH structure and configuration strategy. © 2024 SPIE.

关键词： network function virtualization

来源：评论

学校读者我要写书评

暂无评论

Optimizing Stateful Service function Chaining on PDP Switches with Table Merging

Optimizing Stateful Service Function Chaining on PDP Switche...

引用

2024 IEEE Global Communications Conference, GLOBECOM 2024

作者： Wei, Zhen Li, Tingyu Xu, Zichen Zhu, Zuqing School of Information Science and Technology University of Science and Technology of China Hefei China

ISBN: (纸本)9798350351255

The rapid development of network function virtualization (NFV) has notably increased the implementation of virtual network functions (vNFs), especially the stateful ones, on high-performance programmable data plane (PDP) switches (e.g., those based on P4 and Tofino ASICs). This facilitates offloading stateful service function chains (SFCs) to PDP switches. However, the capability of PDP switches to carry stateful SFCs is still constrained by their limited hardware resources. In this work, we propose to address this issue with adaptive table merging, formulate an integer linear programming (ILP) model to optimize the deployment of stateful SFCs on P4-based PDP switches with table merging, and design a time-efficient heuristic to solve the problem quickly. Simulation results validate that our proposals successfully enhance the deployment efficiency of stateful SFCs, outperforming existing benchmarks significantly. © 2024 IEEE.

关键词： network function virtualization

来源：评论

学校读者我要写书评

暂无评论

Game Theory-Based Trusted Virtual network function Deployment in LEO Satellite Optical networks

Game Theory-Based Trusted Virtual Network Function Deploymen...

引用

2024 Asia Communications and Photonics Conference, ACP 2024 and International Conference on Information Photonics and Optical Communications, IPOC 2024

作者： Zhu, Ruijie Li, Haicheng Qin, Shaobo Zhang, Yudong Xi, Chao Yang, Bo Zhengzhou University Songshan Laboratory Zhengzhou China Zhengzhou University Zhengzhou China Space Star Technology Co. Ltd. Beijing China

This paper proposes a Fuzzy Theory-based trust model and a Game Theory-Based Delay-Aware VNF Deployment *** results show that it outperforms four other benchmark algorithms ensuring the deployment of trustworthy servi... 详细信息

ISBN: (纸本)9798350379266

关键词： network function virtualization

来源：评论

学校读者我要写书评

暂无评论

Machine Learning Based 5G network Slicing Management and Classification 6

Machine Learning Based 5G Network Slicing Management and Cla...

引用

6th International Conference on Artificial Intelligence in Information and Communication, ICAIIC 2024

作者： Wu, Zong-Xun You, Yun-Zhe Liu, Chien-Chang Chou, Li-Der National Central University Department of Computer Science and Information Engineering Taoyuan320317 Taiwan

ISBN: (纸本)9798350344349

Due to the rapid development of the Internet, network bandwidth and stability are becoming more and more important. With the increase in the number of users, how to make each user have a high Quality of Service (QoS) is an urgent problem to be solved. 5G slicing allows flexible management of each user's network usage, which in turn optimizes the overall network usage and reduces the consumption of network resources. The 5G slicing can flexibly manage each user's network usage to optimize overall network usage and reduce network resource consumption. In this paper, use machine learning to analyze the network traffic, and analyze a total of 141 different applications on the network, and conduct experiments on different machine learning models. Based on the above experimental results, propose an algorithm for 5G slice management. Based on the above traffic analysis results, we will dynamically configure and optimize the resources of each slice according to the current network traffic of each user. © 2024 IEEE.

关键词： network function virtualization

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Hierarchical Distributed Overarching Architecture of Decoupled Federation and Orchestration Frameworks for Multidomain NFV MANOs

引用

IEEE COMMUNICATIONS MAGAZINE 2022年第9期60卷 68-74页

作者： Choi, Jin Seek Chun, Se Joon Lee, Sunghwan Hanyang Univ Seoul South Korea Hanyang Univ Dept Comp Sci Seoul South Korea

The European Telecommunications Standards Institute (ETSI) has developed network function virtualization (NW) management and orchestration (MANO) for operators to enable quick adaptation of deployment and to reduce the management costs of virtual network functions (VNFs). For scalable and flexible management across transport, cloud, and edge infrastructures, the NFV MANO has been extended into multidomain architectures with network-cloud/edge convergence. In this article, a novel hierarchical distributed overarching architecture of decoupled federation and orchestration frameworks for multidomain ETSI-compliant NFV MANOs is proposed. The proposed architecture can minimize overhead costs for the scalable exchange of abstracted vertical service information through hierarchical brokering and can enable flexible federation through distributed binding among multiple domains. The proposed architecture deploys end-to-end services in single and multiple domains for vertical industries, activates their service processes in a holistic way, and enables operational independence with administrative autonomy. This article serves as an important and necessary step toward the cloud-native design and implementation of federation and orchestration frameworks for multidomain NFV MANOs.

关键词： Computer architecture Cloud computing Peer-to-peer computing Topology Costs 5G mobile communication Ecosystems network function virtualization ETSI

来源：评论

学校读者我要写书评

暂无评论

VNF Embedding and Assignment for network function Parallelism

引用

IEEE TRANSACTIONS ON network AND SERVICE MANAGEMENT 2022年第2期19卷 1006-1016页

作者： Lin, Kate Ching-Ju Chou, Pei-Ling Natl Chiao Tung Univ Dept Comp Sci Hsinchu 300 Taiwan

The emergence of network function virtualization (NFV) and Service function Chaining (SFC) together enable flexible and agile network management and traffic engineering. Recently, network function Parallelism (NFP) has been proposed to break the need for sequential services and, hence, significantly reduce the latency of SFC. While some studies have investigated how to identify parallel paths to enhance the efficiency of parallelism, less effort has been paid to efficient network function embedding with consideration of parallelism opportunities. Hence, this work aims at solving the instance deployment problem so as to prevent parallel functions from waiting for each other before continuing to the next stage. As it is extremely difficult to optimize VNF (Virtual network functions) embedding for uncertain parallelism opportunities, we propose a practical embedding scoring mechanism to enhance the likelihood of low-cost function parallelism. Our scoring design tends to cluster independent functions for efficient parallelism while ensuring load balancing. After instance deployment, we then assign function instances to parallel chains so as to minimize their end-to-end latency while balancing the workload of instances. Our evaluation results show that the proposed scoringbased embedding scheme ensures homogeneous delays of parallel functions and, hence, reduces the end-to-end latency for NFP by up to 22% as compared to the embedding algorithm without considering parallelism opportunities.

关键词： Service function chaining Loading Clustering algorithms Parallel processing Load management network function virtualization Delays network function parallelization network function embedding function instance assignment

来源：评论

学校读者我要写书评

暂无评论

On Using Physical Programming for Multi-Domain SFC Placement With Limited Visibility

引用

IEEE TRANSACTIONS ON CLOUD COMPUTING 2022年第4期10卷 2787-2803页

作者： Toumi, Nassima Bernier, Olivier Meddour, Djamal-Eddine Ksentini, Adlen Orange F-22300 Lannion France EURECOM Commun Syst Dept F-06410 Sophia Antipolis France EURE COM Commun Syst Dept F-06410 Sophia Antipolis France

Service function Chaining (SFC) is a networking concept by which traffic is steered through a set of ordered functions composing an end-to-end service. It represents one of the facilitating technologies for 5G, and is enabled by the network function virtualization (NFV) and Software Defined networks (SDN) paradigms. In the multi-domain context, SFC placement faces new challenges related to the lack of visibility on the local domain's networks. Indeed, the domain operators are often reluctant to unveil details on their topology to external parties. Furthermore, the new 5G use cases introduce new requirements for services such as end-to-end latency, and a minimal guaranteed bandwidth that the placement process needs to optimize simultaneously. In this article, we propose a centralized framework that allows SFC partitioning and embedding over multiple domains with a limited visibility over the global infrastructure. We model the multi-objective SFC placement problem using the Physical Programming method, which allows the expression of the Decision Maker's preferences through meaningful parameters, and propose an exact algorithm as well as a scalable heuristic solution. We then perform an extensive evaluation of the framework as well as the proposed algorithms. The results demonstrate our solution's effectiveness with a limited visibility on the network.

关键词： Service function chaining multi-domain multi objective optimization physical programming network function virtualization software defined networks

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：