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

Energy Cost Optimization in Dynamic Placement of virtualized network function Chains

IEEE TRANSACTIONS ON network AND SERVICE MANAGEMENT 2018年第1期15卷 372-386页

作者： Kar, Binayak Wu, Eric Hsiao-Kuang Lin, Ying-Dar Natl Cent Univ Dept Comp Sci & Informat Engn Chungli 32001 Taiwan Natl Chiao Tung Univ Dept Comp Sci Hsinchu 300 Taiwan

network function virtualization (NFV), with its virtualization technologies, brings cloud computing to networking. virtualized network functions (VNFs) are chained together to provide the required functionality at runtime on demand. It has a direct impact on power consumption depending on where and how these VNFs are placed and chained to accomplish certain demands as the power consumption of a physical machine (PM) depends on its traffic load. One of the advantages of VNF placement over traditional virtual machine placement is that virtualization is not limited solely to servers. The PMs, including the servers and varying loads to these machines and their utilization, are critical issues related to the network's energy consumption. In this paper, we designed a dynamic energy-saving model with NFV technology using an M/M/c queuing network with the minimum capacity policy where a certain amount of load is required to start the machine, which increases the utilization of the machine and avoids frequent changes of the machines' states. We formulate an energy-cost optimization problem with capacity and delay as constraints. We propose a dynamic placement of VNF chains (DPVC) heuristic solution to the NP-hard problem. The results show that the DPVC solution performs better and saves more energy. It uses 45%-55% less active nodes to satisfy the requested demands and increases the utilization of the active nodes by 40%-50% compared to other algorithms.

关键词： virtualized network function service chaining Markov model energy consumption cost optimization

来源：评论

学校读者我要写书评

暂无评论

Consistent State Updates for virtualized network function Migration

引用

IEEE TRANSACTIONS ON SERVICES COMPUTING 2020年第6期13卷 999-1006页

作者： Wang, Wenxin Liu, Yujie Liu, Jiaqiang Li, Yong Song, Haoyu Wang, Yue Yuan, Jian Tsinghua Univ Dept Elect Engn Beijing 100084 Peoples R China Huawei Technol Shenzhen 560066 Peoples R China

Combining network functions Virtualization (NFV) with Software-Defined networking (SDN) is an emerging and promising solution to provide scalable and elastic network control and service. In such a system, virtualized network functions (NFs) need to be consistently migrated from one instance to another for various purposes, such as resource optimization, fault tolerance, load balancing, etc. These migrations involve simultaneously coordinating updates to the NF state and SDN forwarding state. To solve this problem, we design two consistent NF state update schemes: a controller-forwarding based scheme and a tagging-based scheme. Through analysis of the update process, we demonstrate that they both guarantee loss-free and order-preserving migrations. We further implement a prototype and carry out experiments with diverse traffic settings. Results demonstrate that the controller-forwarding based solution achieves 77 percent migration time compared with the state-of-the-art solution OpenNF, while correcting an error of it. Moreover, the tagging-based solution not only achieves 4.4 percent migration time, but also reduces up to 75 percent controller overhead compared with OpenNF at the cost of adding a tag in the unused fields of packet header.

关键词： Noise measurement Process control Control systems network function virtualization Computer architecture Optimization Software-defined networks virtualized network function state consistency network function migration

来源：评论

学校读者我要写书评

暂无评论

An efficient virtualized network function deployment scheme for service function chain using deep Q-network

引用

INTERNATIONAL JOURNAL OF COMMUNICATION SYSTEMS 2022年第6期35卷 e5084-e5084页

作者： Wu, Wei-Cheng Kao, Shang-Juh Chang, Fu-Min Natl Chung Hsing Univ Dept Comp Sci & Engn Taichung Taiwan Chaoyang Univ Technol Dept Finance 168 Jifeng E Rd Taichung 41349 Taiwan

virtualized network functions (VNFs) are virtualized network services running on the network functions virtualization infrastructure in order to replace physical hardware. Integrating with software defined networking and network functions virtualization, internet service providers (ISPs) can chain VNFs together, called service function chain (SFC), to provide various network service demands with virtual links. Many studies have proposed for the VNFs deployment under different objectives, for example, energy, delay, quality of service (QoS), and quality of experience (QoE). From the aspects of both ISPs and customers, both energy consumption and QoE are the primary concerns for the purpose of operating expense reduction and users' satisfaction. This paper proposes a QoS/QoE/energy-aware deep Q-network (DQN)-based scheme, called DQN-QQE for VNFs deployment under the consideration of both energy consumption and QoE requirement with QoS constraints. The reward of the proposed scheme is formulated by the Weber-Fechner law and the exponential interdependency of QoE and QoS (IQX) hypothesis. Afterwards, we compared the proposed DQN-QQE to the QoS/QoE-aware approach DQN-Q2-SFC, brute force, and randomness in terms of energy, QoE, error rate, and processing time. The simulation results revealed that DQN-QQE is more stable and is better than DQN-Q2-SFC and randomness approach in terms of energy, QoE, and error rate. The average processing time and energy consumption of the proposed DQN-QQE was 43% and 11% less than DQN-Q2-SFC, respectively. Although brute force approach is better than others in terms of energy, QoE, and error rate, the processing time of brute force approach is nearly 20 times larger than the proposed DQN-QQE.

关键词： deep Q-network server function chaining virtualized network function

来源：评论

学校读者我要写书评

暂无评论

The Value of Simple Heuristics for virtualized network function Placement

引用

FUTURE INTERNET 2020年第10期12卷 161页

作者： Jahedi, Zahra Kunz, Thomas Carleton Univ Dept Syst & Comp Engn 1125 Colonel Dr Ottawa ON K1S 5B6 Canada

network function Virtualization (NFV) can lower the CAPEX and/or OPEX for service providers and allow for quick deployment of services. Along with the advantages come some challenges. The main challenge in the use of virtualized network functions (VNF) is the VNFs' placement in the network. There is a wide range of mathematical models proposed to place the network functions (NF) optimally. However, the critical problem of mathematical models is that they are NP-hard, and consequently not applicable to larger networks. In wireless networks, we are considering the scarcity of Bandwidth (BW) as another constraint that is due to the presence of interference. While there exist many efforts in designing a heuristic model that can provide solutions in a timely manner, the primary focus with such heuristics was almost always whether they provide results almost as good as optimal solution. Consequently, the heuristics themselves become quite non-trivial, and solving the placement problem for larger networks still takes a significant amount of time. In this paper, in contrast, we focus on designing a simple and scalable heuristic. We propose four heuristics, which are gradually becoming more complex. We compare their performance with each other, a related heuristic proposed in the literature, and a mathematical optimization model. Our results demonstrate that while more complex placement heuristics do not improve the performance of the algorithm in terms of the number of accepted placement requests, they take longer to solve and therefore are not applicable to larger *** contrast, a very simple heuristic can find near-optimal solutions much faster than the other more complicated heuristics while keeping the number of accepted requests close to the results achieved with an NP-hard optimization model.

关键词： virtualized network function wireless multi-hop networks network function embedding problem Service graph linear programming interference simple fast

来源：评论

学校读者我要写书评

暂无评论

State of the Art and Research Challenges in the Security Technologies of network function Virtualization

引用

IEEE INTERNET COMPUTING 2020年第1期24卷 25-35页

作者： Wu, Xiaochun Hou, Kaiyu Leng, Xue Li, Xing Yu, Yinbo Wu, Bo Chen, Yan Zhejiang Gongshang Univ Hangzhou Peoples R China Northwestern Univ Evanston IL USA Northwestern Univ Dept Elect Engn & Comp Sci Evanston IL USA Zhejiang Univ Comp Sci & Technol Hangzhou Peoples R China Zhejiang Univ Coll Comp Sci & Technol Hangzhou Peoples R China Wuhan Univ Sch Elect Informat Wuhan Peoples R China Tsinghua Univ Beijing Peoples R China

In recent years, network function virtualization (NFV) has drawn considerable attention due to its potential for service agility and low total cost of ownership. As the core of an NFV implementation, security issues in the management and control platform must be comprehensively addressed-from architectural concept to deployment. In this article, we first analyze the state of the security architecture based on ETSI-NFV, and then propose useful security practices for an NFV-based management and control ecosystem. To encourage future research, we also identify the ongoing research challenges and open security issues relevant to the NFV.

关键词： Computer security Computer architecture Monitoring network function virtualization Hardware Ecosystems network function virtualization Service chain Microservice virtualized network function

来源：评论

学校读者我要写书评

暂无评论

Near-Optimal Energy-Efficient Algorithm for Virtual network function Placement

引用

IEEE TRANSACTIONS ON CLOUD COMPUTING 2022年第1期10卷 553-567页

作者： Zhang, Xiaoning Xu, Zhichao Fan, Lang Yu, Shui Qu, Youyang Univ Elect Sci & Technol China Sch Informat & Commun Engn Chengdu 611731 Peoples R China Univ Technol Sydney Sch Software Sydney NSW 2007 Australia Sch Informat Technol Melbourne Vic 3125 Australia

To accommodate heterogeneous and sophisticated network services, network function Virtualization (NFV) is invented as a hopeful networking technology. The most distinct feature of NFV is that it separates network functions from physical hardware. In the NFV architecture, various types of Virtual network functions (VNFs) are placed on specific software-based middleboxes by telecom providers. Traffic traverses through a sequence of Virtual network functions (VNFs) in pre-defined order, which is named as Service function Chain (SFC). However, how to effectively place VNFs at different locations and steer SFC requests while minimizing energy consumption is still an open problem. Accordingly, we investigate on the joint optimization of VNF placement and traffic steering for energy efficiency in telecom networks. We first present the power consumption model in NFV-enabled telecom networks, and then formulate the studied problem as an Integer Linear Programming (ILP) model. Since the problem is proved as NP-hard, we design a polynomial algorithm that can achieve near-optimal performances based on the Markov approximation technique. In addition, our algorithm can be extended to an online version to serve dynamic arriving SFC requests. The online algorithm achieves a near-optimal long-term averaged performance. Extensive simulation results show that compared with the benchmark algorithms, in the offline and online scenario, our algorithm can reduce up to 14.08 and 13.72 percent power consumption in telecom networks, respectively.

关键词： virtualized network function service function chain energy efficiency Markov approximation

来源：评论

学校读者我要写书评

暂无评论

Cross-VM Cache Timing Attacks on virtualized network functions

引用

IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS 2019年第9期E102D卷 1874-1877页

作者： Shin, Youngjoo Kwangwoon Univ Sch Comp & Informat Engn Seoul South Korea

network function virtualization (NFV) achieves the flexibility of network service provisioning by using virtualization technology. However, NFV is exposed to a serious security threat known as cross-VM cache timing attacks. In this letter, we look into real security impacts on network virtualization. Specifically, we present two kinds of practical cache timing attacks on virtualized firewalls and routers. We also propose some countermeasures to mitigate such attacks on virtualized network functions.

关键词： cross-VM cache timing attack network function virtualization virtualized network function

来源：评论

学校读者我要写书评

暂无评论

Security and Privacy Issues in network function Virtualization: A Review from Architectural Perspective

引用

INTERNATIONAL JOURNAL OF ADVANCED COMPUTER SCIENCE AND APPLICATIONS 2024年第6期15卷 475-480页

作者： Zahran, Bilal Ahmed, Naveed Alzoubaidi, Abdel Rahman Ngadi, Md Asri Al Balqa Appl Univ Engn & AI Dept As Salt Jordan Univ Teknol Malaysia Fac Engn Skudai Malaysia Al Balqa Appl Univ Elect Engn Dept As Salt Jordan

network function Virtualization (NFV) delivers numerous benefits to customers since it is a cost-effective evolution of legacy networks, allowing for rapid network augmentation and extension at a low cost as network functions are virtualized. However, on the other hand, there is a big security concern for NFV users because of shared infrastructure. There are many studies in the literature that report various NFV security threats. In this paper, we categorize these threats according to the alignment of NFV architecture and delineate a taxonomy for NFV security threats. This work provides detailed information about security threats, causes, and countermeasures to reduce the security vulnerabilities of NFV. We believe that the study of NFV security threats from an architectural perspective is a step forward for better insight into these threats since the roots of many NFV threats are connected to their architecture. We also present how NFV design should be revamped to mitigate NFV security threats, something that is a recent trend in this area. Finally, we highlight future research directions to provide enhanced security for future NFV-based networks.

关键词： network functions virtualization virtualized network function network security, security threat cloud computing

来源：评论

学校读者我要写书评

暂无评论

Stringer: Balancing Latency and Resource Usage in Service function Chain Provisioning

引用

IEEE INTERNET COMPUTING 2016年第6期20卷 22-31页

作者： Chua, Freddy C. Ward, Julie Zhang, Ying Sharma, Puneet Huberman, Bernardo A. Hewlett Packard Labs Mech & Design Lab Palo Alto CA 94304 USA Hewlett Packard Labs Networking & Mobil Lab Palo Alto CA USA Hewlett Packard Labs Palo Alto CA USA

network function virtualization (NFV) enables telecommunications infrastructure providers to replace special-purpose networking equipment with commodity servers running virtualized network functions (VNFs). A provider using NFV faces the service function chain (SFC) provisioning problem of assigning VNF instances to nodes in the physical infrastructure, and routing SFCs in the physical network. The provider must balance competing goals of performance and resource usage. This article presents an approach to SFC provisioning, called Stringer, which lets providers balance the conflicting goals of minimizing infrastructure resources and end-to-end latency for meeting their respective service-level agreements.

关键词： Servers Routing Protocols Service Level Agreements Resource Management network Virtualization Data Centers Queueing Theory Internet Web Technologies network function Virtualization NFV virtualized network function VNF Service function Chain SFC Optimization Orchestration Routing Virtualization networking

来源：评论

学校读者我要写书评

暂无评论

A graphical deep learning technique-based VNF dependencies for multi resource requirements prediction in virtualized environments

引用

COMPUTING 2024年第2期106卷 449-473页

作者： Bellili, Asma Kara, Nadjia Ecole Technol Super Dept Genie Logiciel & TI 1100 Rue Notre Dame O Montreal PQ H3C 1K3 Canada

With recent developments in cloud computing, massive unplanned traffic loads are submitted to cloud platforms. High traffic load variations lead to uncertainty in resource utilization. Therefore, efficient data-driven mechanisms for automatic resource management become crucial. These mechanisms enable complex and distributed systems to anticipate and efficiently react to workload fluctuations. They rely on accurate resource utilization prediction techniques to satisfy the resource needs, in order to fulfill the service level objective for cloud applications and infrastructures. In this paper, we propose a deep learning model to predict the resource consumption (e.g., CPU, memory) in network function virtualization infrastructures. We model an augmented graphical neural network (GNN) that exploit neighbouring relationships between virtual network functions (VNF) composing various service function chains (SFC), and use an augmented feature vector allowing to capture the consumption evolution of a VNF. The model enables to predict the resource needs of VNFs by identifying the multidimensional dependencies according to the graph structure of an SFC. The proposed GNN model has been compared with MLP, LSTM, hybrid LSTM and CNN models to evaluate its accuracy and efficiency. Real word datasets have been used to evaluate the proposed model using five performance metrics. The performance analysis reveals that our graph-features based GNN model outperforms the other models for SFCs with high traffic load variation.

关键词： virtualized network function Deep learning VNF neighboring dependencies Service function chain Cloud computing network design and communication in computer systems

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：