首页> 外文会议>IFIP Networking Conference >Online virtual links resource allocation in Software-Defined Networks
【24h】

Online virtual links resource allocation in Software-Defined Networks

机译:软件定义网络中的在线虚拟链接资源分配

获取原文

摘要

Network virtualization is seen as a key networking paradigm for building diverse network services and architectures over a shared network infrastructure. Assigning network resources to virtual links and, more generally to virtual network topologies, efficiently and on-demand is one of the most challenging components of any network virtualization solution. This paper addresses the problem of on-line resource allocation of multiple virtual links on a Software Defined Network (SDN) infrastructure. The application context that is targeted is primarily the online provisioning of virtual overlay networks even if it can be broadened to address more general virtual networks. Considering an SDN physical infrastructure allows a complete freedom in choosing the optimal physical paths and the associated resources that support the virtual links with no interference from any other network function (such as routing). However, for the time being, forwarding in an SDN network is resource consuming with a noticeable impact on the size of the flow tables. Hence, forwarding (i.e. switching) resources should be carefully considered by the network resource allocation algorithm. This paper proposes a novel Integer-Linear formulation of the above cited problem by taking into account: (1) point-to-point as well as point-to-multipoint virtual links, each with an associated bandwidth requirement and a maximum transfer delay requirement, (2) two types of network resources, namely network links' bandwidth and nodes' switching resources, and (3) optionally, path splitting which allows a virtual link to be established on multiple physical paths. We report preliminary experimental results on a real network topology in an overloaded scenario (bandwidth requests largely exceed network capacity); they show that our algorithm outperforms shortest path heuristics with a gain on the admission rate (of virtual links requests) that ranges from 5 to 15% (compared to the most efficient heuristic) and wit- a computation time less than a few seconds.
机译:网络虚拟化被视为在共享网络基础架构上构建各种网络服务和体系结构的关键网络范例。将网络资源有效地按需分配给虚拟链路,更普遍地分配给虚拟网络拓扑,是任何网络虚拟化解决方案中最具挑战性的组件之一。本文解决了软件定义网络(SDN)基础结构上多个虚拟链接的在线资源分配问题。面向的应用程序上下文主要是虚拟覆盖网络的联机配置,即使可以扩展它以解决更通用的虚拟网络。考虑到SDN物理基础结构,可以完全自由地选择支持虚拟链路的最佳物理路径和相关资源,而不会受到任何其他网络功能(例如路由)的干扰。但是,目前,SDN网络中的转发非常耗资源,对流表的大小有明显的影响。因此,网络资源分配算法应仔细考虑转发(即交换)资源。本文针对上述问题提出了一种新颖的Integer-Linear表示法,其中考虑了:(1)点对点以及点对多点虚拟链接,每个链接都具有相关的带宽要求和最大传输延迟要求,(2)两种类型的网络资源,即网络链接的带宽和节点的交换资源,以及(3)可选的路径拆分,允许在多个物理路径上建立虚拟链接。我们报告了在过载情况下(带宽请求大大超过网络容量)在真实网络拓扑上的初步实验结果;他们表明,我们的算法优于最短路径启发式算法,其(虚拟链接请求的)准入率的增益为5%至15%(与最有效的启发式算法相比),并且计算时间少于几秒钟。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号