[1] |
Karas P, Pioro M. Optimization problems related to the assignment of admini strative weights in the IP networks’ routing protocols[C]// Proc. of the 1st PGTS’2000. 2000:185-192.
|
[2] |
Fortz B, Rexford J, Thorup M. Traffic engineering with traditional IP routing protocols[J]. IEEE Commun.Mag., 2002,40(10):118-124.
|
[3] |
Gunnar A, Abrahamsson H, Sderqvist M. Performance of traffic engineering in operational IP-networks: An experimental study[C]// Proceedings of the 5th IEEE International Workshop on IP Operations and Management. 2005:202-
|
21 |
1.
|
[4] |
Altn A, Fortz B, mit H. Oblivious OSPF routing with weight optimization under polyhedral demand uncertainty[J]. Networks, 2012, 60(2):132-139.
|
[5] |
Altn A, Fortz B, Thorup M. Intra-domain trafc engineering with shortest pathrouting protocols[J]. Annals of Operations Research, 2013,204(1):65-95.
|
[6] |
Steven S W Lee, Tseng P-K, Chen A . Link weight assignment and loop-free routing table update for link state routing protocols in energy-aware internet[J]. Future Generation Computer Systems, 2012,28(2):437-445.
|
[7] |
Tomaszewski A, Pióro M, Dzida M, et al. Optimization of administrative weights in IP networks using the branch-and-cut approach[C]// Proceedings of the 2nd International Network Optimization Conference (INOC 2005). 2005:393-400.
|
|
|
[8] |
Ben-Ameur W, Kerivin H. Routing of uncertain traffic demands[J]. Optimization and Engineering, 2005,6(3):283-313.
|
[9] |
Altn A, Belotti B, Pnar H. OSPF routing with optimal oblivious performance ratio under polyhedral demand uncertainty[J]. Optimization and Engineering, 2010,11(3):395-422.
|
[10] |
Altn A, Fortz B, mit H. Oblivious OSPF routing with weight optimization under polyhedral demand uncertainty[J]. Networks, 2012,60(2):132-139.
|
[11] |
Cheng Xiao-mei, Wang Sheng, Wang Xiong. Optimizing link weight in OSPF routing[C]// IEEE 34th Conference on Local Computer Networks. 2009:20-23.
|
[12] |
Koster A M C A, Kutschka M, Raack C. On the robustness of optimal network designs[C]// IEEE International Conference on Communications. 2011:49-54.
|
[13] |
杨华为,王洪波,等. 最小割多路径路由算法[J]. 软件学报, 2012,23(8):2115-2129.
|
[14] |
SNDlib. Library of Test Instances for Survivable Fixed Telecommunication Network Design[DB/OL]. http://sndlib.zib.de/home.action, 2013-08-19.
|