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

Write-Aware Replica Placement for Cloud Computing

IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS 2019年第3期37卷 656-667页

作者： Chang, Wan-Chi Wang, Pi-Chung Natl Chung Hsing Univ Dept Comp Sci & Engn Taichung 402 Taiwan

Cloud applications such as virtualized network functions usually rely on static or dynamic replication mechanisms to achieve high service reliability and satisfy the requirements of service level agreement. Because replicas are allocated in geographically distributed datacenters, their updates increase the difficulty of maintaining consistency among replicas in different datacenters. The consistency overheads among replicas increase bandwidth consumption and transmission latencies to degrade the quality of service (QoS) performance and service reliability. Although previous mechanisms attempt to shorten response time, reduce bandwidth consumption, or maintain high service reliability with minimized storage cost, they do not consider the overhead of data consistency. In this paper, we study the problem of replica placement with consistency overheads by analyzing the latency and reliability for different types of operations. A replication algorithm, write-aware replica placement (WARP), is then presented based on the analysis. The simulation results show that WARP can shorten response time and improve QoS without degrading reliability.

关键词： Cloud computing dynamic replication algorithm reliability network function virtualization virtualized network function

来源：评论

学校读者我要写书评

暂无评论

Performance of a trunk reservation policy in distributed data centres

引用

PERFORMANCE EVALUATION 2018年 125卷 48-67页

作者： Guillemin, Fabrice Thompson, Guilherme Orange Labs2 NCA CNC Ave Pierre Marzin F-22300 Lannion France INRIA Paris 2 Rue Simone IffCS 42112 F-75589 Paris 12 France

In this paper, we analyse a system composed of two data centres with limited capacity in terms of computing (namely virtual cores). When one request for a single core is blocked at the first data centre, this request is forwarded to the second one. To protect the requests originally assigned to the second data centre, a trunk reservation policy is introduced (i.e., a redirected request is accepted only if the number of free cores at the second data centre is greater than a given threshold). After rescaling the system when there are many cores in both data centres and high request arrival rates, we are led to analyse a random walk in the quarter plane, which has the particularity of having nonconstant reflecting conditions on one boundary of the quarter plane. Computing the stationary distribution of the present random walk requires the determination of three unknown functions, one polynomial and two infinite generating functions. We show that the coefficients of the polynomial are solutions to a linear system. After numerically solving this linear system, we are able to compute the two other unknown functions and the blocking probabilities at both data centres. Numerical experiments are eventually performed to estimate the gain achieved by the trunk reservation policy. (C) 2018 Elsevier B.V. All rights reserved.

关键词： virtualized network function Mobile edge computing Random walk Boundary value problem

来源：评论

学校读者我要写书评

暂无评论

Service function Chain Deployment Using Deep Q Learning and Tidal Mechanism

引用

IEEE INTERNET OF THINGS JOURNAL 2024年第3期11卷 5401-5416页

作者： Xu, Jiuyun Cao, Xuemei Duan, Qiang Li, Shibao China Univ Petr East China Coll Comp Sci & Technol Qingdao 266580 Peoples R China Penn State Univ Informat Sci & Technol Dept Abington PA 19001 USA China Univ Petr East China Coll Oceanog & Space Informat Qingdao 266580 Peoples R China

With the rapid development of software-defined networking/network function virtualization (NFV) technologies, service function chaining (SFC) has become a key enabler for end-to-end service provisioning in future networks. In the Internet of Things (IoT), the highly dynamic nature of the network environment demands flexible and adaptive mechanisms for dynamic SFC deployment to fully utilize network resources while meeting the service requirements. Although reinforcement learning (RL) techniques offer a promising approach to dynamic SFC deployment, the learning delay of RL may limit its prompt response to sudden changes in network state and/or service demand. To address this challenge in this article, we propose to employ a deep Q -learning network (DQN) method for dynamic SFC deployment combined with a tidal virtual machine (TVM) control mechanism for adaptive virtual machine (VM) auto-scaling. We present a tidal DQN framework (TDQNF) that integrates the DQN method and TVM control in the ETSI NFV architecture and develop the algorithms for implementing DQN-based decisions for SFC deployment and TVM control for VM scaling. The performance of the TDQNF framework with the proposed algorithms has been evaluated through extensive simulation experiments. The obtained experimental results verify the effectiveness of the proposed scheme and indicate better performance in terms of system delay, packet loss, and load balancing in large-scale networks compared to existing methods.

关键词： Service function chaining Heuristic algorithms Internet of Things Dynamic scheduling Costs Q-learning Delays Deep reinforcement learning (DRL) network function virtualization (NFV) service function chain virtual network function (VNF) deployment virtualized network function

来源：评论

学校读者我要写书评

暂无评论

Toward Latency-Optimal Placement and Autoscaling of Monitoring functions in MEC

引用

IEEE ACCESS 2020年 8卷 41649-41658页

作者： Yuan, Quan Ji, Xinsheng Tang, Hongbo You, Wei PLA Strateg Support Force Informat Engn Univ Informat Technol Res Ctr Zhengzhou 450002 Peoples R China

Multi-Access Edge Computing (MEC) promises to provide sufficient computing capacity close to users and realize smart management at the edge of mobile network. To achieve the aforementioned objectives, it is indispensable to implement real-time monitoring of the whole MEC network. However, the geo-distributed deployment of MEC infrastructure dramatically increases the communication latency of gathering the state information (e.g. current status and resource utilization) from servers at the edge. This paper addresses latency-optimal placement and autoscaling of monitoring functions in MEC. First, we formally formulate latency-optimal placement of monitoring functions as an integer linear programming problem and proposed a genetic algorithm-based meta-heuristic to obtain the optimal solution with fast convergence. Moreover, to serve the time-varying demand on resource capacity from diversified mobile services, an online VNF scaling scheme is designed for realizing on-demand resource allocation. The effectiveness of our heuristic algorithm is verified through both numerical simulation and experiments in real cloud environment. Experimental results demonstrate performance superiority of the proposed approach over the state-of-art researches, in terms of algorithm CPU time, total network latency and long-term scaling cost.

关键词： Monitoring Servers Cloud computing Resource management Data centers Real-time systems Genetic algorithms network function virtualization multi-access edge computing virtualized network function latency-optimal placement genetic algorithm

来源：评论

学校读者我要写书评

暂无评论

Security challenges with network functions virtualization

引用

FUTURE GENERATION COMPUTER SYSTEMS-THE INTERNATIONAL JOURNAL OF ESCIENCE 2017年 67卷 315-324页

作者： Firoozjaei, Mahdi Daghmehchi Jeong, Jaehoon (Paul) Jo, Hoon Kim, Hyoungshick Sungkyunkwan Univ Coll Informat & Commun Engn Dept Elect & Comp Engn Seoul South Korea Sungkyunkwan Univ Coll Informat & Commun Engn Dept Interact Sci Seoul South Korea

The advent of network functions virtualization (NFV) has revolutionized numerous network-based applications due to its several benefits such as flexibility, manageability, scalability, and security. By the software-based virtualization of network functions on a single infrastructure, NFV provides users with a framework that dynamically provisions various network services in a flexible manner. However, NFV faces several security challenges (e.g., multi-tenancy and live migration) which make it vulnerable to some cybersecurity attacks (e.g., side-channel attacks and shared resource misuse attacks). In this paper, we provide an overview of NFV, discuss potentially serious security threats on NFV and introduce effective countermeasures to mitigate those threats. Finally, we suggest some practical solutions to provide a trustworthy platform for NFV. (C) 2016 Elsevier B.V. All rights reserved.

关键词： network functions virtualization network security virtualized network function Security threats

来源：评论

学校读者我要写书评

暂无评论

Joint VNF Parallelization and Deployment in Mobile Edge networks

引用

IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS 2023年第11期22卷 8185-8199页

作者： Tian, Fengsen Liang, Junbin Liu, Jiangchuan Guangxi Univ Guangxi Key Lab Multimedia Commun & Network Techno Sch Comp Elect & Informat Nanning 530008 Peoples R China Simon Fraser Univ Sch Comp Sci Burnaby BC V5A 1S6 Canada

Mobile edge computing (MEC) has emerged as a promising computing paradigm that provides flexible and responsive local services for mobile user equipment at the network edge. Software instances for user equipment tasks are typically deployed as virtualized network functions (VNFs) at resource-constrained edge nodes. Task data exchanged across the VNFs in serial can incur high task completion latency. It is therefore desirable to deploy certain VNFs in parallel. However, deciding where to deploy VNFs depends on which VNFs are parallel, and conversely, their deployment also affects their parallel execution. In this paper, for the first time, we jointly consider the parallelization and deployment strategies for VNFs at edge nodes. We closely examine the complexity of the joint optimization problem and introduce an Improved Service function Graph (I-SFG) that reflects the coordination and dependency relations among the VNFs to provide parallel services for each piece of user equipment. We first propose an approach based on integer linear programming to find optimal solutions in small-scale scenarios and then present an effective solution through cascading I-SFG construction and VNF deployment approximation to solve large-scale problems. Theoretical analyses and experimental results show the superiority of our joint design and the proposed practical solution.

关键词： Mobile edge computing virtualized network function VNF parallelization VNF deployment service function graph

来源：评论

学校读者我要写书评

暂无评论

Probius: Automated Approach for VNF and Service Chain Analysis in Software-Defined NFV

Probius: Automated Approach for VNF and Service Chain Analys...

引用

Symposium on SDN Research (SOSR)

作者： Nam, Jaehyun Seo, Junsik Shin, Seungwon Korea Adv Inst Sci & Technol Daejeon South Korea

ISBN: (纸本)9781450356640

As the complexity of modern networks increases, virtualization techniques, such as software-defined networking (SDN) and network function virtualization (NFV), get highlighted to achieve various network management and operating requirements. However, those virtualization techniques (specifically, NFV) have a critical issue that the performance of virtualized network functions (VNFs) is easily affected by diverse environmental factors (e.g., various workloads, resource contentions among VNFs), so resulting in unexpected performance degradations - performance uncertainty. Unfortunately, existing approaches mostly provide limited information about a single VNF or the underlying infrastructure (e.g., Xen, KVM), which is deficient in reasoning why the performance uncertainties occur. For such reasons, we first deeply investigate the behaviors of multiple VNFs along service chains in NFV environments, and define a set of critical performance features for each layer in the NFV hierarchical stack. Based on our investigations and findings, we introduce an automated analysis system, Probius, providing the comprehensive view of VNFs and their service chains on the basis of NFV architectural characteristics. Probius collects most possible NFV performance related features efficiently, analyzes the behaviors of NFV, and finally detects abnormal behaviors of NFV - possible reasons of performance uncertainties. To show the effectiveness of Probius, we have deployed 7 open-source VNFs and found 5 interesting performance issues caused by environmental factors.

关键词： virtualized network function Service Chain Performance Analysis

来源：评论

学校读者我要写书评

暂无评论

SPV: Formal Verification of Stateful Parallel SFC Correctness 48

SPV: Formal Verification of Stateful Parallel SFC Correctnes...

引用

48th Annual IEEE International Computers, Software, and Applications Conference (COMPSAC) - Digital Development for a Better Future

作者： Guo, Yijun Liu, Zhenyu Ai, Yintan Li, Hua Inner Mongolia Univ Dept Comp Sci Hohhot Peoples R China

ISBN: (纸本)9798350376975;9798350376968

With the evolution of modern networks, network operators are able to flexibly deploy Service function Chains (SFCs) in accordance with network policy requirements to achieve desired purposes. At the same time, to reduce the latency of processing packets through SFCs, an increasing number of network operators are designing SFCs to operate in parallel. In addition, many service functions are designed to be stateful, making the processing behavior of packets state-dependent, but the state is complex and arbitrary, which introduces greater complexity and uncertainty and makes the verification of SFCs behavior more difficult. To verify the correctness of stateful parallel SFCs, a formal verification method named SPV is proposed in this paper. SPV first defines the correctness attribute of stateful parallel SFCs, and then uses Coloured Petri Nets (CPN) for offline modeling of stateful parallel SFCs. This model describes the topological structure and behavior of the stateful parallel SFCs and enhances the expressiveness of the CPN model with Standard ML Language (ML) functions. In experiments, by analyzing the reachability graph and state space of the stateful parallel SFC's CPN model, the correctness attribute of the stateful parallel SFCs are verified, completing the correctness verification of stateful parallel SFCs. Moreover, these results also demonstrate the potential of CPN-based modeling for the verification of SFCs in stateful networks.

关键词： coloured petri net software defined network service function chain network verification formal method virtualized network function

来源：评论

学校读者我要写书评

暂无评论

Availability-Guaranteed Service function Chain Provisioning with Optional Shared Backups 16

Availability-Guaranteed Service Function Chain Provisioning ...

引用

16th International Conference on the Design of Reliable Communication networks (DRCN)

作者： Araujo, Igor M. Natalino, Carlos Chen, Hao De Andrade, Marilet Cardoso, Diego L. Monti, Paolo Fed Univ Para UFPA Lab Computat Intelligence Belem PA Brazil Chalmers Univ Technol Dept Elect Engn SE-41296 Gothenburg Sweden KTH Royal Inst Technol SE-16440 Kista Sweden Ericsson Res Kista Sweden

ISBN: (纸本)9781728163000

The dynamic provisioning of Service function Chain (SFC) using Virtual network functions (VNFs) is a challenging problem, especially for availability-constrained services. The provisioning of backup resources is often used to ensure that availability requirements are fulfilled. However, the assignment of backup resources should be carefully designed to avoid resource inefficiencies as much as possible. This paper proposes the Optional Backup with Shared Path and Shared function (OBSPSF) strategy, which aims at improving resource efficiency while fulfilling the availability requirements of SFC requests. The strategy uses optional backup provisioning to ensure that backup resources are assigned only when strictly needed (i.e., when the SFC alone does not meet the availability constraint). Moreover, OBSPSF encourages backup sharing (among both connectivity and backup VNFs) to reduce the backup resource overhead. Results show that the strategy can accommodate orders-of-magnitude more services than benchmark heuristics from the literature.

关键词： Service function Chaining virtualized network function Provisioning Availability Shared Protection

来源：评论

学校读者我要写书评

暂无评论

Segment Routing for Chaining Micro-Services at Different Programmable network Levels 27

Segment Routing for Chaining Micro-Services at Different Pro...

引用

27th Conference on Innovation in Clouds, Internet and networks (ICIN)

作者： Mathieu, Bertrand Dugeon, Olivier Ky, Joel Roman Graff, Philippe Cholez, Thibault Orange Innovat Lannion France Univ Lorraine CNRS INRIA LORIA F-54000 Nancy France

ISBN: (纸本)9798350393767;9798350393774

network function Virtualization (NFV) is now well known for making network services deployable in a virtual environment, for instance in data-centers. On another hand, the programability of functions has come down to the network forwarding equipment itself, such as programmable switches, using the Programming Protocol-independent Packet Processors (P4) solution. Each of the two programmable concepts has its own advantages and drawbacks and micro-services should be preferably developed in one or the other solution depending on their constraints and requirements. In this paper, our objective is to combine both approaches. We propose to leverage Segment Routing (SR) to define a solution allowing to chain the microservices to be executed at both levels. This signaling protocol is integrated within network equipment but not within a NFV infrastructure. To overcome it, we design an intermediary proxy between the P4 nodes and the VNFs. This proxy is in charge of managing the SR labels and their association with the related VNF. The demonstrator we have developed proves the feasibility of the approach and opens the way towards a composition of network services taking the best of the two levels of programmable networks.

关键词： Segment Routing P4 Traffic Detection Cloud Gaming virtualized network function

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：