[1]UHLIG S,QUOITIN B,LEPROPRE J,et al.Providing public intradomain traffic matrices to the research community[J].ACM SIGCOMM Computer Communication Review,2006,36(1):83-86.
[2]CHEN Jian.Juniper router products introduction:reference description[EB/OL].[2016-10-28].http://max.Book118.com/html/2015/0728/22201499.shtm.
[3]HUAWEI.High-end router product introduction:reference description[EB/OL].[2016-10-28].http://www.doc88.com/p-386731950343.html.
[4]Cisco.Network convergence system 6008 single-chassis system data sheet:reference description[EB/OL].[2016-10-28].http://www.cisco.com/c/en/us/products/routers/network-convergence-system-6000-series-routers/index.html.
[5]FORTZ B,THORUP M.Internet traffic engineering by optimizing OSPF weights[C]//Proceedings of IEEE INFOCOM’00.Washington D.C.,USA:IEEE Press,2000:519-528.
[6]FORTZ B,REXFORD J,THORUP M.Traffic engineering with traditional IP routing protocols[J].IEEE Communications Magazine,2002,40(10):118-124.
[7]HOPPS C.Analysis of an equal-cost multi-path algorithm:RFC 2992[S].2000.
[8]KELLY F,VOICE T.Stability of end-to-end algorithms for joint routing and rate control[J].ACM SIGCOMM Computer Communication Review,2005,35(2):5-12.
[9]燕洪成,张庆君,孙勇.空间延迟中断容忍网络拥塞控制策略研究[J].通信学报,2016,37(1):142-150.
[10]蔡岳平,王昌平.软件定义数据中心网络混合路由机制[J].通信学报,2016,35(4):44-52.
[11]杨洋,杨家海,王会,等.网络时延敏感型业务流自适应负载均衡算法[J].通信学报,2015,36(3):131-141.
[12]STEVENS W R.TCP/IP详解(卷I:协议)[M].吴英,张玉,许昱玮,译.北京:机械工业出版社,2016.
[13]KVALBEIN A,HANSEN A F,CICIC T,et al.Fast IP network recovery using multiple routing configurations[C]//Proceedings of the 25th International Conference on Computer Communications.Washington D.C.,USA:IEEE Press,2006:1-11.
[14]BURIOL L,RESENDE M,RIBEIRO C,et al.A memetic algorithm for OSPF routing[C]//Proceedings of the 6th INFORMS Telecommunications Conference.Copenhagen,Denmark:University of Copenhagen,2002:187-188.
(下转第103页)
(上接第99页)
[15]朱立瑞.群智能优化算法及其在路由优化策略中的应用[D].长春:吉林大学,2013.
[16]COHEN R,NAKIBLY G.On the computational complexity and effectiveness of N-hub shortest path routing[J].IEEE ACM Transactions on Networking,2008,16(3):691-704.
[17]FONG J,GILBERT A,KANNAN S,et al.Better alternatives to OSPF routing[J].Algorithmica,2005,43(1/2):113-131.
[18]郭超平,张恒,张海林.自私网络中带宽与路由的联合分配机制[J].北京邮电大学学报,2010,33(5):61-65.
[19]杨晓琴,章丽芳,曹庆黄.基于链路带宽利用率的路由选择算法[J].计算机应用,2012,32(9):2422-2425.
[20]王峰.中国互联网带宽年年扩容但问题仍严重[EB/OL].[2016-10-28].http://news.sohu.com/20150422/n411647342.shtml.
[21]CHEN Xusheng.Shortest path algorithm in OSPF[J].H3C-IToIP Sloution Expert in H3Care Club,2009,2(2):4-8.
[22]PALOMAR D P,CHIANG M.A tutorial on decomposition methods for network utility maximization[J].IEEE Journal on Selected Areas in Communications,2006,24(8):1439-1451.
[23]MANISH J.End-to-end available bandwidth estimation and its applications[D].Atlanta,USA:Georgia Institute of Technology,2013:80-81.
[24]李鸿仪.理想化最速下降法及其逼近实例[J].上海第二工业大学学报,2011,28(1):8-13.
[25]姚俊峰,杨献永,彭小奇,等.基于混沌变量的变步长梯度下降优化算法[J].清华大学学报(自然科学版),2003,43(12):1676-1678.
[26]林嘉宇,刘荧.神经网络的梯度下降训练方法中的学习步长优化[J].信号处理,2002,18(1):43-48.
|