Please wait a minute...
 首页  期刊介绍 期刊订阅 联系我们 横山亮次奖 百年刊庆
 
最新录用  |  预出版  |  当期目录  |  过刊浏览  |  阅读排行  |  下载排行  |  引用排行  |  横山亮次奖  |  百年刊庆
清华大学学报(自然科学版)  2017, Vol. 57 Issue (12): 1233-1238    DOI: 10.16511/j.cnki.qhdxxb.2017.21.022
  计算机科学与技术 本期目录 | 过刊浏览 | 高级检索 |
基于域间二维路由的流量工程模型
徐明伟, 高冰洁
清华大学 计算机科学与技术系, 北京 100084
Two-dimensional routing based inter-domain traffic engineering model
XU Mingwei, GAO Bingjie
Department of Computer Science and Technology, Tsinghua University, Beijing 100084, China
全文: PDF(1879 KB)  
输出: BibTeX | EndNote (RIS)      
摘要 流量工程是网络资源优化配置的重要手段,域间流量工程是针对自治系统(autonomous system,AS)间链路的负载均衡及利用率优化。目前,互联网的路由都是按照报文目的地址进行的,这使得基于边界网关协议(border gateway protocol,BGP)的域间流量工程在网络拥塞时的调整能力有限。该文在分析了域间流量工程典型场景和需求的基础上,提出了基于二维路由的域间流量工程模型,并提出了域间二维路由流量工程场景下流量放置问题和源地址块切分问题的启发式算法来求解。仿真结果表明:基于域间二维路由的流量工程能够成功解决流量细分问题,并在吞吐量、路径稳定性等指标上均优于基于BGP的流量工程方案。
服务
把本文推荐给朋友
加入引用管理器
E-mail Alert
RSS
作者相关文章
徐明伟
高冰洁
关键词 二维路由流量工程域间路由    
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.
Key wordstwo-dimensional routing    traffic engineering    inter-domain routing
收稿日期: 2017-03-19      出版日期: 2017-12-15
ZTFLH:  TP393.2  
引用本文:   
徐明伟, 高冰洁. 基于域间二维路由的流量工程模型[J]. 清华大学学报(自然科学版), 2017, 57(12): 1233-1238.
XU Mingwei, GAO Bingjie. Two-dimensional routing based inter-domain traffic engineering model. Journal of Tsinghua University(Science and Technology), 2017, 57(12): 1233-1238.
链接本文:  
http://jst.tsinghuajournals.com/CN/10.16511/j.cnki.qhdxxb.2017.21.022  或          http://jst.tsinghuajournals.com/CN/Y2017/V57/I12/1233
  图1 二维路由解决流量细分问题
  图2 域间流量工程模型示意图
  图3 流量初始放置算法伪代码
  图4 流量动态调整算法伪代码
  图5 源地址切分算法效果示意图
  图6 源地址分割算法伪代码
  图7 均匀分布下流量吞吐率的 CDF
  图8 幂律分布下流量吞吐率的 CDF
  图9 流量路径切换次数分布
[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.
[1] 杨增印, 吴茜, 李贺武, 吴建平. 天地一体化信息网络域间路由协议NTD-BGP[J]. 清华大学学报(自然科学版), 2019, 59(7): 512-522.
[2] 黎松, 段海新, 李星. 域间路由中间人攻击的实时检测系统[J]. 清华大学学报(自然科学版), 2015, 55(11): 1229-1234.
Viewed
Full text


Abstract

Cited

  Shared   
  Discussed   
版权所有 © 《清华大学学报(自然科学版)》编辑部
本系统由北京玛格泰克科技发展有限公司设计开发 技术支持:support@magtech.com.cn