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

[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