AJSR: an Efficient Multiple Jumps Forwarding Scheme in Software-Defined WAN

AJSR: an Efficient Multiple Jumps Forwarding Scheme in Software-Defined WAN
复制标题

AJSR:软件定义广域网中的一种高效多跳转发方案

DOI:
10.1109/access.2017.2670683
复制
发表时间:
2017
期刊:
影响因子:
3.9
通讯作者:
Li Keqiu
Li Keqiu
中科院分区:
计算机科学3区
文献类型:
--
作者:
Dong Xiaodong;Guo Zhiqiang;Zhou Xiaobo;Qi Heng;Li Keqiu

文献摘要

参考文献

相似文献

软件定义网络(SDN)是一种新兴的网络架构。结果表明,SDN可以部署在各种小型网络,如个人区域网和局域网。然而,SDN在诸如广域网的大规模网络中的部署引起了很多关注。在这些场景中,SDN依赖于传统的逐跳转发方案,这可能会导致由于产生大量控制流量和流表过度消耗而导致的性能下降。通过在入口交换机中仅安装一个流表条目并在分组报头中编码特定流的完整路由路径,可以利用源路由来减少控制流量和流表消耗。然而,这将导致严重的带宽开销,这也可能降低网络性能。在本文中,我们提出了一个高效的转发方案称为任意跳转源路由(AJSR),它利用基于MPLS的源路由。AJSR的目标是通过将特定流的完整路由路径划分为任意长度的部分,并将这些部分分布在流的路由路径上的不同交换机上,来实现控制流量开销和带宽开销之间的折衷。为了找到最合适的流条目放置方案,我们将流入口放置问题公式化为优化问题,并提出了以最大化总成本节省为目标的动态规划解决方案。通过仿真实验,我们发现AJSR可以有效地实现控制流量开销和带宽开销之间的折衷。
Software Defined Networks (SDN) is an emerging network architecture. It is shown that SDN can be deployed in a variety of small size networks, such as personal area networks and local area networks. Nevertheless, the deployment of SDN in large scale networks, such as wide area networks, raises a lot of concerns. In these scenarios, SDN relies on traditional hop-by-hop forwarding scheme which may lead to performance degradation due to heavy control traffic incurred and flow tables over-consumption. Source routing can be utilized to reduce control traffic and flow table consumption by installing only one flow table entry in the ingress switch and encoding complete routing path of a particular flow in the packet header. However, it will lead to severe bandwidth overhead which may also degrade network performance. In this paper, we propose an efficient forwarding scheme called Arbitrary Jump Source Routing (AJSR), which makes use of MPLS-based source routing. AJSR aims to achieve a trade-off between the control traffic overhead and the bandwidth overhead by dividing the complete routing path of a particular flow into arbitrary length sections and distributing these sections at different switches along the flow’s routing path. To find the most suitable flow entry placement scheme, we formulate the flow entry placement problem as an optimization problem and present a dynamic programming solution with the objective of maximizing the overall cost saving. Through simulation experiments, we find that AJSR can effectively achieve a trade-off between the control traffic overhead and the bandwidth overhead.
DOI: 10.1145/2611286.2611301
发表时间: 2014-05
影响因子: 2.3
作者:
Anilkumar Vishnoi;Rishabh Poddar;V. Mann;Suparna Bhattacharya
通讯作者: Anilkumar Vishnoi;Rishabh Poddar;V. Mann;Suparna Bhattacharya
DOI: 10.1145/1644893.1644918
发表时间: 2009-11
期刊: --
影响因子: --
作者:
Srikanth Kandula;S. Sengupta;A. Greenberg;Parveen Patel;R. Chaiken
通讯作者: Srikanth Kandula;S. Sengupta;A. Greenberg;Parveen Patel;R. Chaiken
DOI: 10.1109/jlt.2015.2473656
发表时间: 2016
影响因子: 4.7
作者:
A. Sgambelluri;F. Paolucci;A. Giorgetti;F. Cugini;P. Castoldi
通讯作者: A. Sgambelluri;F. Paolucci;A. Giorgetti;F. Cugini;P. Castoldi
DOI: 10.1145/2486001.2486019
发表时间: 2013-08
期刊: Proceedings of the ACM SIGCOMM 2013 conference on SIGCOMM
影响因子: --
作者:
S. Jain;Alok Kumar;Subhasree Mandal;J. Ong;L. Poutievski;Arjun Singh;Subbaiah Venkata;Jim Wanderer-Jim
通讯作者: S. Jain;Alok Kumar;Subhasree Mandal;J. Ong;L. Poutievski;Arjun Singh;Subbaiah Venkata;Jim Wanderer-Jim
DOI: 10.1109/jproc.2014.2371999
发表时间: 2015-01-01
影响因子: 20.6
作者:
Kreutz, Diego;Ramos, Fernando M. V.;Uhlig, Steve
通讯作者: Uhlig, Steve