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.
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.
2017, Vol. 57 
