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

virtual network function allocation to Maximize Continuous Available Time of Service function Chains With Availability Schedule

引用

IEEE TRANSACTIONS ON network AND SERVICE MANAGEMENT 2021年第2期18卷 1556-1570页

作者： Kang, Rui He, Fujun Sato, Takehiro Oki, Eiji Kyoto Univ Grad Sch Informat Kyoto 6068501 Japan

This paper proposes an optimization model to derive the virtual network function (VNF) allocation of time slots in sequence aiming to maximize the continuous available time of service function chains (SFCs) in a network. The proposed model suppresses service interruptions otherwise created by the unavailability of virtual machines (VMs) and the reallocation of VNFs. The proposed model computes VNF allocation in a series of time slots based on a VM availability schedule, which provides information on the availability of each VM in each time slot. We formulate the proposed model as an integer linear programming (ILP) problem with the goal of maximizing the minimum number of longest continuous available time slots in each SFC. We prove that the decision version of the VNF allocation problem (VNFA) is NP-complete. As the size of ILP problem increases, the problem is difficult to solve in a practical time. We develop a heuristic algorithm to solve the VNFA problem. Numerical results show that the proposed model improves the continuous available time of SFCs compared with existing models, which partially consider VM unavailability or VNF reallocation. We observe that the proposed model together with a consideration of routing reduces the path length of requests. The developed heuristic algorithm is faster than the ILP approach with a limited performance penalty.

关键词： Resource management Schedules Numerical models Computational modeling Maintenance engineering Heuristic algorithms network function virtualization virtual network function allocation service function chain availability schedule NP-complete

来源：评论

学校读者我要写书评

暂无评论

Resilient virtual network function allocation with Diversity and Fault Tolerance Considering Dynamic Requests

Resilient Virtual Network Function Allocation with Diversity...

引用

IEEE/IFIP network Operations and Management Symposium

作者： Kang, Rui He, Fujun Oki, Eiji Kyoto Univ Grad Sch Informat Kyoto Japan

ISBN: (纸本)9781665406017

This paper proposes an optimization model to derive a resilient virtual network function (VNF) allocation aiming to maximize the number of accepted requests with considering VNF diversity and ensuring the requirements of node fault tolerances in a dynamic scenario, where the requests have random requirements, arriving and releasing time. The model considers fault tolerance assurance and satisfies the service requirements under different error patterns. The allocation provided by the proposed model ensures the required amount of processing ability in the situation that there are several failed nodes. The node fault tolerance can be set variously for different requirements of services. The proposed model selects and instantiates suitable replicas from the pools of replicas, and then determines the locations of these replicas instances. We develop a reinforcement learning approach for solving the proposed model including the design of the learning environment and the reward shaping. The numerical results show that the proposed model increases the number of accepted requests with ensuring the resiliency of the functions compared with baseline models in the examined cases, where the allocation of a request can be determined in tens of milliseconds.

关键词： network function virtualization virtual network function allocation network resilience fault tolerance network diversity dynamic reinforcement learning

来源：评论

学校读者我要写书评

暂无评论

Robust virtual network function allocation in Service function Chains With Uncertain Availability Schedule

引用

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

作者： Kang, Rui He, Fujun Oki, Eiji Kyoto Univ Grad Sch Informat Kyoto 6068501 Japan

The availability schedule provides information on whether each network node is available at each time slot. The service interruptions caused by node unavailability marked in availability schedule can be suppressed if the functions are allocated according to the availability schedule. However, the given availability schedule may have gaps with the actual one and influence the VNF allocation. This paper proposes a robust optimization model to allocate virtual network functions (VNFs) in service function chains (SFCs) for time slots in sequence aiming to maximize the continuous available time of SFCs in a network with uncertain availability schedules by suppressing the interruptions caused by node unavailability marked in availability schedule and function reallocation. We formulate the problem as a mixed integer linear programming (MILP) problem over the given uncertainty set of the start time slot and period of unavailability on each node in the availability schedule. For solving the model in a practical time in a relative large size of network, we develop a heuristic algorithm. The numerical results show that the proposed model outperforms the baseline models under different levels of robustness in terms of the worst-case minimum number of the longest continuous available time slot in each SFC. The heuristic algorithm reduces the computation time with limited performance loss compared with the MILP approach. In the discussion, we introduce a constraint condition for the maintenance ability, which reduces the size of uncertainty set, and an extension for supporting more than one unavailability periods in the availability schedule on each node.

关键词： Schedules Resource management Maintenance engineering Numerical models Uncertainty Robustness Measurement network function virtualization virtual network function allocation service function chain availability schedule mixed integer linear programming

来源：评论

学校读者我要写书评

暂无评论

Implementation of virtual network function allocation with Diversity and Redundancy in Kubernetes 20

Implementation of Virtual Network Function Allocation with D...

引用

IFIP networking Conference and Workshops (IFIP networking)

作者： Kang, Rui Zhu, Mengfei He, Fujun Oki, Eiji Kyoto Univ Grad Sch Informat Kyoto Japan

ISBN: (纸本)9783903176393

Diversity in network function virtualization is to use a group of thin replicas to provide the network services under the required processing ability. Redundancy is to provide a certain number of replicas against function failures and improve network reliability. Kubernetes is a system to deploy and manage virtual network functions automatically. Existing tools in Kubernetes do not provide a resource type to provide required functions jointly considering VNF diversity and redundancy. This paper designs and implements a custom resource and the corresponding controller in Kubernetes to manage the VNF diversity and redundancy jointly. The controller selects suitable replicas from a pool of replica templates to satisfy the required processing ability with the minimum required number of replicas and converts the backup functions to the primary functions when the primary functions cannot provide the required ability. Demonstration validates that the controller automatically manages the resources correctly, improves the resource utilization, and increases the number of acceptable requests.

关键词： virtual network function allocation redundancy network diversity controller Kubernetes demonstration

来源：评论

学校读者我要写书评

暂无评论

virtual network function allocation to Maximize Continuous Available Time of Service function Chains 8

Virtual Network Function Allocation to Maximize Continuous A...

引用

8th IEEE International Conference on Cloud networking (CloudNet)

作者： Kang, Rui He, Fujun Sato, Takehiro Oki, Eiji Kyoto Univ Grad Sch Informat Kyoto Japan

ISBN: (纸本)9781728148328

This paper proposes an optimization model to derive a virtual network function (VNF) allocation for time slots in sequence aiming to maximize the continuous available time of service function chains (SFCs) in a network. The proposed model suppresses service interruptions due to the unavailability of nodes and the reallocation of VNFs. Compared with conventional models, the proposed model computes the VNF allocation in a series of time slots based on the network node availability schedule, which provides information on whether each network node is available at each time slot. We formulate the proposed model as an integer linear programming problem with the goal of maximizing the minimum number of longest continuous available time slots in each SFC. The numerical results show that the proposed model improves the continuous available time of SFCs compared with existing models.

关键词： network function virtualization virtual network function allocation service function chain availability schedule integer linear programming

来源：评论

学校读者我要写书评

暂无评论

Design of Scheduler Plugins for Reliable function allocation in Kubernetes 17

Design of Scheduler Plugins for Reliable Function Allocation...

引用

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

作者： Kang, Rui Zhu, Mengfei He, Fujun Sato, Takehiro Oki, Eiji Kyoto Univ Grad Sch Informat Kyoto Japan

ISBN: (纸本)9780738123288

The reliability of virtual network can be increased by allocating virtual network functions (VNF) to suitable locations. The VNF placement problems are formulated as optimization models with different objectives. The models are solved by optimization software and heuristic algorithms. The allocation results obtained by the models are used to allocate the VNFs to nodes. Since different users have different objectives, it is necessary to allocate different groups of VNFs by using different models. Existing tools did not provide a method to connect multiple optimization models with Kubernetes. We implement function scheduler plugins cooperating with multiple reliable function allocation models in Kubernetes, which is a system for automating deployment, scaling, and management of containerized applications. Demonstration validates that the plugins allocate functions by using the allocation results obtained by the model automatically and run service functions correctly.

关键词： virtual network function allocation scheduler Kubernetes demonstration

来源：评论

学校读者我要写书评

暂无评论

Resilient Resource allocation Model in Service function Chains with Diversity and Redundancy

Resilient Resource Allocation Model in Service Function Chai...

引用

IEEE International Conference on Communications (ICC)

作者： Kang, Rui He, Fujun Oki, Eiji Kyoto Univ Grad Sch Informat Kyoto Japan

ISBN: (纸本)9781728171227

This paper proposes an optimization model to derive the resilient virtual network function allocation in service function chains aiming to reduce the recovery time during the migrations from the primary functions to backup functions. We consider k-fault-tolerance assurance and satisfy the service requirements under different error patterns in this model. The allocation provided by the proposed model ensures that the processing ability satisfies the requirements even though there are k failed nodes in the network. Diversity splits a single VNF into a pool of replicas with different specifications. The diversity of both primary and backup functions are considered. Redundancy is used for recovering the failed functions. We formulate the proposed model as a mixed integer linear programming problem to select suitable replicas from the pools of replicas and decide the locations of these replicas for both primary and backup functions. The objective of the proposed model is to minimize the sum of the maximum recovery time among functions under all possible failure patterns which have k node failures. The numerical results show that the proposed model reduces the recovery times of VNFs with ensuring the resiliency of the functions compared with baseline models in the examined cases. We give some methods to improve the maximum resiliency at last.

关键词： network function virtualization virtual network function allocation service function chain network resilience redundancy network diversity

来源：评论

学校读者我要写书评

暂无评论

Fault-tolerant resource allocation model for service function chains with joint diversity and redundancy

引用

COMPUTER networkS 2022年第0期217卷 1页

作者： Kang, Rui He, Fujun Oki, Eiji Kyoto Univ Grad Sch Informat Yoshida HonmachiSakyo ku Kyoto 6068501 Japan

This paper proposes an optimization model to derive a resilient virtual network function allocation in service function chains aiming to reduce the end-to-end (E2E) latency during the migrations from the primary functions to backup functions. The model considers k-fault tolerance assurance and the satisfactions of service requirements under different error patterns in this model. The allocation provided by the proposed model ensures that the processing ability satisfies the requirements even though there are k failed nodes in the network. Diversity splits a single virtual network function (VNF) into a pool of replicas with different specifications. The diversity of both primary and backup functions is considered. Redundancy is used for recovering the failed functions. We formulate the proposed model as a mixed integer linear programming problem to select suitable replicas from the pools of replicas and decide the locations of these replicas for both primary and backup functions. The objective of the proposed model is to minimize the sum of the maximum E2E latencies among functions under all possible failure patterns which have k node failures. The numerical results show that the proposed model reduces the E2E latency between the pair of primary and backup VNFs with ensuring the resiliency of the functions compared with baseline models in the examined cases. Two approximate approaches are developed to reduce the computation time of solving the proposed model with a limited performance penalty. We derive theorems to give the bounds of maximum resiliency in the proposed model.

关键词： network function virtualization virtual network function allocation Service function chain network resilience Redundancy network diversity

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：