[1] 吴舢. 一种基于SDN的网络负载均衡方案的设计与实现[D]. 复旦大学, 2014.
[2] 曹傧, 刘勰, 孙奇. 软件定义网络架构下的动态自适应负载均衡策略研究[J]. 重庆邮电大学学报(自然科学版), 2015, 27(4):460-465. Cao Bin, Liu Xie, Sun Qi. Dynamically adaptive load balancing strategy under the software defined network structure[J]. Journal of Chongqing University of Posts and Telecommunications (Natural Science Edition), 2015, 27(4):460-465.
[3] Dobrijevic O, Santl M, Matijasevic M. Ant colony optimization for QoE-centric flow routing in software defined networks[C]//International Conference on Network and Service Management.[S.l.]:IEEE, 2015:274-278.
[4] Cui Chenxiao, Xu Yabin. Research on load balance method in SDN[J]. International Journal of Grid and Distributed Computing, 2016, 9(1):25-36.
[5] Long Hui, Shen Yao, Guo Minyi, et al. LABERIO:dynamic load-balanced routing in OpenFlow-enabled networks[C]//AINA 2013. Barcelona:IEEE, 2013:290-297.
[6] Wang Yong, Tao Xiaoling, He Qian, et al. A dynamic load balancing method of cloud-center based on SDN[J]. China Communications, 2016, 13(2):130-137
[7] 赵梦亚, 龙昭华, 蒋贵全, 等. 基于OpenFlow的负载均衡机制[J]. 计算机工程与设计, 2015, 36(9):2356-2360. Zhao Mengya, Long Zhaohua, Jiang Guiquan, et al. Load balancing mechanism based on OpenFlow[J]. Computer Engineering and Design, 2015, 36(9):2356-2360.
[8] Jain S, Kumar A, Mandal S, et al. B4:Experience with a globally-deployed software defined WAN[J]. ACM SIGCOMM Computer Communication Review, 2013, 43(4):3-14.
[9] 徐涛, 丁晓璐, 李建伏. K最短路径算法综述[J]. 计算机工程与设计, 2013, 34(11):3900-3906. Xu Tao, Ding Xiaolu, Li Jianfu. Review on K shortest paths algorithms[J]. Computer Engineering and Design, 2013, 34(11):3900-3906.
[10] 白轶多, 胡鹏, 夏兰芳, 等. 关于k次短路径问题的分析与求解[J]. 武汉大学学报(信息科学版), 2009, 34(4):492-494. Bai Yiduo, Hu Peng, Xia Lanfang, et al. A kth-shortest path algorithm based on k-1 shortest paths[J]. Geomatics and Information Science of Wuhan University, 2009, 34(4):492-494.
[11] 段海滨. 仿生智能计算[M]. 北京:科学出版社, 2011. |