基于域间二维路由的流量工程模型

徐明伟; 高冰洁

doi:10.16511/j.cnki.qhdxxb.2017.21.022

PDF(1879 KB)

清华大学学报（自然科学版） ›› 2017, Vol. 57 ›› Issue (12) : 1233-1238. DOI: 10.16511/j.cnki.qhdxxb.2017.21.022

计算机科学与技术

基于域间二维路由的流量工程模型

徐明伟, 高冰洁

作者信息 +

Two-dimensional routing based inter-domain traffic engineering model

XU Mingwei, GAO Bingjie

Author information +

文章历史 +

摘要

流量工程是网络资源优化配置的重要手段，域间流量工程是针对自治系统（autonomous system，AS）间链路的负载均衡及利用率优化。目前，互联网的路由都是按照报文目的地址进行的，这使得基于边界网关协议（border gateway protocol，BGP）的域间流量工程在网络拥塞时的调整能力有限。该文在分析了域间流量工程典型场景和需求的基础上，提出了基于二维路由的域间流量工程模型，并提出了域间二维路由流量工程场景下流量放置问题和源地址块切分问题的启发式算法来求解。仿真结果表明：基于域间二维路由的流量工程能够成功解决流量细分问题，并在吞吐量、路径稳定性等指标上均优于基于BGP的流量工程方案。

Abstract

Traffic engineering (TE) optimizes the allocation of resources. Inter-domain TE aims to balance the load of inter-autonomous system links and to optimize the utilization of every link. Internet routing is based on the packet destination address which limits BGP-based inter-domain TE when the network is congested. Typical inter-domain TE environments and requirements were analyzed to develop a TE model based on two-dimensional routing, a traffic placement algorithm and a source addresses splitting algorithm. Simulation show that the 2D-based inter-domain TE can successfully solve the fine-grained traffic split problem with better throughput and path stability than the traditional BGP TE.

导出引用

徐明伟, 高冰洁. 基于域间二维路由的流量工程模型[J]. 清华大学学报（自然科学版）. 2017, 57(12): 1233-1238 https://doi.org/10.16511/j.cnki.qhdxxb.2017.21.022

XU Mingwei, GAO Bingjie. Two-dimensional routing based inter-domain traffic engineering model[J]. Journal of Tsinghua University(Science and Technology). 2017, 57(12): 1233-1238 https://doi.org/10.16511/j.cnki.qhdxxb.2017.21.022

中图分类号： TP393.2

参考文献

[1] Hassidim A, Raz D, Segalov M, et al. Network utilization:The flow view[C]//IEEE International Conference on Computer Communications, INFOCOM 2013 Proceedings IEEE. Atlanta, GA, USA:IEEE, 2013:1429-1437.[2] Rosen E, Viswanathan A, Callon R. Multiprotocol Label Switching Architecture[R]. Fremont, CA, USA:Internet Engineering Task Force, 2000.[3] Kreutz D, Ramos F M V, Verissimo P E, et al. Software-defined networking:A comprehensive survey[J]. Proceedings of the IEEE, 2015, 103(1):14-76.[4] Wang N, Ho K, Pavlou G, et al. An overview of routing optimization for internet traffic engineering[J]. IEEE Communications Surveys & Tutorials, 2008, 10(1):36-56[5] Tangmunarunkit H, Govindan R, Shenker S. Internet path inflation due to policy routing[C]//ITCom 2001:International Symposium on the Convergence of IT and Communications. Denver, CO, USA:International Society for Optics and Photonics, 2001:188-195.[6] Nagami K, Uda S, Ogashiwa N, et al. Multi-homing for Small Scale Fixed Network Using Mobile IP and NEMO[R]. Fremont, CA, USA:Internet Engineering Task Force, 2007.[7] Zhang R, Vasseur J P. RFC 4216:MPLS Inter-Autonomous System (AS) Traffic Engineering (TE) Requirements[R]. Fremont, CA, USA:Internet Engineering Task Force, 2005.[8] McKeown N, Anderson T, Balakrishnan H, et al. OpenFlow:Enabling innovation in campus networks[J]. ACM SIGCOMM Computer Communication Review, 2008, 38(2):69-74.[9] Yang S, Xu M, Wang D, et al. Scalable forwarding tables for supporting flexible policies in enterprise networks[C]//IEEE International Conference on Computer Communications, INFOCOM 2014 Proceedings IEEE. Toronto, Canada:IEEE, 2014:208-216.[10] Kist A A, Harris R J. Cost efficient overflow routing for outbound ISP traffic[C]//ISCC 2004. Alexandria, Egypt:IEEE, 2004:876-882.[11] Baker B S. A new proof for the first-fit decreasing bin-packing algorithm[J]. Journal of Algorithms, 1985, 6(1):49-70.[12] UCLA IRL. Internet topology collection[Z/OL].[2017-02-21]. http://irl.cs.ucla.edu/topology.[13] Bates T, Chandra R, Chen E. BGP Route Reflection-An Alternative to Full Mesh IBGP[R]. Pittsburgh, PA, USA:Internet Engineering Task Force, 2000.[14] Adamic L A, Huberman B A. Zipf's law and the Internet[J]. Glottometrics, 2002, 3(1):143-150.