|
- 2016
SDN网络中基于业务资源偏好的批路由策略
|
Abstract:
摘要 SDN网络中有限的交换机流表资源限制流经节点的业务流数目,带宽资源限制流经链路的业务流的数据流量。本研究基于业务流特点,提出业务资源偏好的概念;基于SDN网络集中控制的特点,提出使用批路由策略处理多个同时到达SDN控制器的业务流请求。设计了SDN网络中基于业务资源偏好的批路由策略BRP-SA。仿真结果表明,BRP-SA算法有效地均衡流表资源和带宽资源的使用,使网络接纳更多的业务流请求。
[1] | <p> McKeown N, Anderson T, Balakrishnan H, et al.OpenFlow: enabling innovation in campus networks[J].ACM SIGCOMM Computer Communication Review, 2008, 38(2): 69-74. |
[2] | Luo S, Yu H, Li L.Practical flow table aggregation in SDN[J].Computer Networks, 2015, 92: 72-88. |
[3] | Trivisonno R, Vaishnavi I, Guerzoni R, et al.Virtual links mapping in future sdn-enabled networks //Future Networks and Services (SDN4FNS), 2013 IEEE SDN for.IEEE, 2013: 1-5. |
[4] | Cai Y, Wu B, Zhang X, et al.Flow identification and characteristics mining from internet traffic with hadoop //Computer, Information and Telecommunication Systems (CITS), 2014 International Conference on.IEEE, 2014: 1-5. |
[5] | Xiao P, Qu W, Qi H, et al.An efficient elephant flow detection with cost-sensitive in SDN //Industrial Networks and Intelligent Systems (INISCom), 2015 1st International Conference on.IEEE, 2015: 24-28. |
[6] | Barnhart C, Hane C A, Vance P H.Using branch-and-price-and-cut to solve origin-destination integer multicommodity flow problems[J].Operations Research, 2000, 48(2): 318-326. |
[7] | Chowdhury N M, Rahman M R, Boutaba R.Virtual network embedding with coordinated node and link mapping //INFOCOM 2009, IEEE.IEEE, 2009: 783-791. |
[8] | Yang X Q, Mees A I, Campbell K.Simulated annealing and penalty methods for binary multicommodity flow problems, Progress in Optimization[M].New York: Springer US, 2000: 93-105. |
[9] | Ganesh A, Massoulié L, Towsley D.The effect of network topology on the spread of epidemics //INFOCOM 2005.24th Annual Joint Conference of the IEEE Computer and Communications Societies.Proceedings IEEE.IEEE, 2005, 2: 1 455-1 466. |
[10] | Benson T, Akella A, Maltz D A.Network traffic characteristics of data centers in the wild //Proceedings of the 10th ACM SIGCOMM conference on Internet measurement.ACM, 2010: 267-280. |
[11] | Hardy G H, Littlewood J E, Pólya G.Inequalities[M].Cambridge: Cambridge university press, 1952.</p> |
[12] | Moshref M, Yu M, Govindan R, et al.DREAM: dynamic resource allocation for software-defined measurement[J].ACM SIGCOMM Computer Communication Review, 2015, 44(4): 419-430. |
[13] | Banerjee S, Kannan K.Tag-in-tag: Efficient flow table management in sdn switches //Network and Service Management (CNSM), 2014 10th International Conference on.IEEE, 2014: 109-117. |
[14] | Sarrar N, Uhlig S, Feldmann A, et al.Leveraging Zipf's law for traffic offloading[J].ACM SIGCOMM Computer Communication Review, 2012, 42(1): 16-22. |
[15] | Min G, Wu Y, Wang L, et al.Performance modelling of adaptive routing in hypercubic networks under non-uniform and batch arrival traffic //Local Computer Networks, 2007.32nd IEEE Conference on.IEEE, 2007: 583-590. |
[16] | Curtis A R, Mogul J C, Tourrilhes J, et al.DevoFlow: scaling flow management for high-performance networks[J].ACM SIGCOMM Computer Communication Review, 2011, 41(4): 254-265. |
[17] | Huang D Y, Yocum K, Snoeren A C.High-fidelity switch models for software-defined network emulation //Proceedings of the second ACM SIGCOMM workshop on Hot topics in software defined networking.ACM, 2013: 43-48. |
[18] | Cohen R, Lewin-Eytan L, Naor J S, et al.On the effect of forwarding table size on SDN network utilization //INFOCOM, 2014 Proceedings IEEE.IEEE, 2014: 1 734-1 742. |
[19] | Feng T, Bi J, Wang K.Joint allocation and scheduling of network resource for multiple control applications in SDN // Network Operations and Management Symposium (NOMS), 2014 IEEE.IEEE, 2014: 1-7. |
[20] | Zhang J, Xi K, Luo M, et al.Load balancing for multiple traffic matrices using sdn hybrid routing //High Performance Switching and Routing (HPSR), 2014 IEEE 15th International Conference on.IEEE, 2014: 44-49. |
[21] | Hegde S, Koolagudi S G, Bhattacharya S.Scalable and fair forwarding of elephant and mice traffic in software defined networks[J].Computer Networks, 2015, 92: 330-340. |
[22] | A Allalouf M, Shavitt Y.Centralized and distributed algorithms for routing and weighted max-min fair bandwidth allocation[J].Networking, IEEE/ACM Transactions on, 2008, 16(5): 1 015-1 024. |