最小化路径代价和流量均衡模型及算法

杨华卫; 王洪波; 程时端; 陈山枝; 林宇

doi:10.3724/SP.J.1146.2009.01341

最小化路径代价和流量均衡模型及算法

doi: 10.3724/SP.J.1146.2009.01341

杨华卫^{① 王洪波,},
王洪波,
程时端,
陈山枝,
林宇

基金项目:

国家自然科学基金(90604019)，高等学校博士学科点专项科研基金(200800131019)，新世纪优秀人才支持计划(NECT-07-0109)软件开发环境国家重点实验开放课题(SKLSDE-2009KF-2-08)和国家重点基础研究发展计划(2005CB321901)资助课题

计量
- 文章访问数: 3150
- HTML全文浏览量: 93
- PDF下载量: 1322
- 被引次数: 0
出版历程
- 收稿日期: 2009-10-15
- 修回日期: 2010-04-15
- 刊出日期: 2010-10-19

Minimizing Sum of Path-cost Model and Algorithm for Traffic Balancing

摘要

摘要: 流量均衡是流量工程中为避免网络拥塞经常采用的路由优化目标，如何选择路径以使流量达到均衡分布是流量路由的研究热点和难点。为了最小化网络拥塞，该文在指出网络拥塞决定于流量路由时所选路径的拥塞特征后，建立了流量分布的最小化路径代价和模型。在流量路由选择路径时，提出基于瓶颈链路的最小代价路径路由算法。在实际的网络拓扑和流量矩阵数据基础上对所提模型及算法进行了实验验证，结果显示：在网络负载较大时最大链路利用率相对于已有模型可降低近20%。
- IP网流量工程 /
- 路由优化 /
- 最小化拥塞 /
- 流量均衡
Abstract: Traffic balancing in routing optimization targets to minimize network congestion in traffic engineering. How to select paths for traffic balancing becomes a challenging problem. For minimizing network congestion, this paper argues that network congestion is determined by paths congestion, and proposes the minimizing sum of path-cost model of traffic balancing. For path selection in routing traffic, a minimal cost path algorithm is proposed. On the basis of real network topology and traffic demand, experiments are conducted to verify the model and algorithm proposed, and results show a nearly 20% decrease of maximal link utilization when network is becoming congested.
- IP traffic engineering /
- Routing optimization /
- Congestion minimizing /
- Traffic balancing

HTML全文

参考文献(1)

[1] Wang N, Kin H, and Pavlou G, et al.. An overview of routing optimization for internet traffic engineering[J].IEEE Communications Surveys Tutorials.2008, 10(1):36-56 [2] Rincon D, Roughan M, and Willinger W. Towards a meaningful MRA of traffic matrices[C]. Proceedings of the 8th ACM SIGCOMM Conference on Internet measurement, Vouliagmeni, Greece, 2008: 331-336. [3] Wang Y and Wang Z. Explicit routing algorithms for internet traffic engineering[C]. Computer Communications and Networks, Boston, MA, USA, 1999: 582-588. [4] Wang Y, Wang Z, and Zhang L. Internet traffic engineering without full mesh overlaying[C]. IEEE Infocom Proceedings, Anchorage, Alaska, USA, 2001, 1: 565-71. [5] Cugola G and Nitto E. On adopting content-based routing in service-oriented architectures[J].Information and Software Technology.2008, 50(1-2):22-35 [6] Fortz B and Thorup M. Internet traffic engineering by optimizing ospf weights[C]. IEEE Infocom Proceedings,Tel Aviv,Israel, Aug, 2000, 2: 518-528. [7] Fortz B, Rexford J, and Thorup M. Traffic engineering with traditional ip routing protocols[J]. IEEE Communications Magazine, 2002, 40(10): 118-124. [8] Resende M and Pardalos P. Handbook of Optimization in Telecommunications[M]. New York, Springer Science + Business Media, 2006: 679-700. [9] Ahuja R, Magnanti T, and Orlin J. Network Flows: Theory, Algorithms, and Applications[M]. New Jersey, Prentice Hall, 2005: 294-356. [10] Zhang Y. 6 months of Abilene traffic matrices. Http:// www.cs.utexas.edu/~yzhang/, 2009. [11] Kundu S, Pal S, and Basu K, et al.. An architectural framework for accurate characterization of network traffic[J].IEEE Transactions on Parallel and Distrituted Systems.2009, 20(1):111-123

施引文献

资源附件(0)

访问统计