期刊文献+

基于软件定义网络的分层路径规划策略 被引量:3

Hierarchical Path Planning Strategy Based on Software Defined Networking
下载PDF
导出
摘要 基于软件定义网络的流媒体边缘云需要有效的路径规划策略,传统规划策略多数仅考虑网络负载和拓扑信息,在执行效率和优化效果上存在不足。为此,提出一种动态分层的路径规划策略。利用不同用户区域服务请求的相对独立性,通过对物理网络资源的虚拟划分将原问题分治为多个子问题,并在求解过程中综合考虑服务现状和视频流行度信息以对网络资源进行分配。实验结果表明,该策略能有效避免网络拥塞,提升系统服务质量,并保持较低的服务代价。 The Streaming Media Edge Cloud( SMEC) based on Software Defined Networking( SDN) needs effective path planning strategy. However,the traditional path planning strategy in SDN only considers the load of network and topology information,there are some defects both in the execution efficiency and optimization effect. To solve the problem,a dynamic hierarchical path planning strategy is proposed. It uses the relative independence of different user regional service requests, and divides the original problem into multiple sub problems by the virtual division of physical network resources, and considers the service status and video popularity information in the process of solving, so as to allocate the network resources. Experimental results show that the proposed strategy can effectively avoid network congestion,improve the service quality of the systems and maintain a low service cost.
作者 何杰挺 王子磊 奚宏生 HE Jieting;WANG Zilei;XI Hongsheng(Department of Automation, University of Science and Technology of China, Hefei 230027, Chin)
出处 《计算机工程》 CAS CSCD 北大核心 2018年第5期268-273,279,共7页 Computer Engineering
基金 国家自然科学基金(61233003) 中央高校科研业务费专项资金 中国科学院青年创新促进会项目
关键词 软件定义网络 流媒体边缘云 路径规划 队列调度 动态资源分配 流量工程 Software Defined Networking (SDN) Streaming Media Edge Cloud (SMEC) path planning queue scheduling dynamic resource allocation Traffic Engineering (TE)
  • 相关文献

参考文献1

二级参考文献9

  • 1高文宇,陈松乔,王建新.用于DiffServ的核心无状态的虚拟时钟调度算法[J].通信学报,2004,25(10):134-142. 被引量:2
  • 2陈晓峰,平玲娣,陈健.一种对数自适应队列调度算法[J].浙江大学学报(工学版),2006,40(3):381-386. 被引量:3
  • 3Demers A, Keshav S, Shenker S. Analysis and Simulation of a Fair Queueing Algorithm[J]. Intemetworking: Research and Experience, 1990, 1(1): 3-26.
  • 4Parekb A K, Gallager R G. A Generalized Processor Sharing Approach to Flow Control in Integrated Services Networks: the Single-node Case [J]. IEEE/ACM Trans. on Networking, 1993, 1(3): 344-357.
  • 5Golestani S. A Self-clocked Fair Queueing Scheme for Broadband Applications[C]//Proc. of IEEE INFOCOM'94. Toronto, Canada: [s. n.]. 1994.
  • 6Shreedhar M, G.Varghese, Efficient Fair Queueing Using Deficit Round Robin[C]//Proc. of ACM SIGCOMM'95. Cambridge, MA: [s. n.]. 1995.
  • 7Bennett R. WF^2Q: Worst-case Fair Weighted Fair Queueing[C]//Proc. of IEEE INFOCOM'96. [S. 1.]: IEEE Press, 1996.
  • 8Shimonishi H, Yoshida M, Ruixue F, et al. An Improvement of Weighted Round Robin Cell Scheduling in ATM Networks[C]//Proc. of IEEE GLOBECOM'97. [S. 1.]: IEEE Press, 1997.
  • 9Bennett J C R. Hierarchical Packet Fair Queueing Algorithms[J]. IEEE/ACM Transactions on Networking, 1997, 5(5): 675-689.

共引文献14

同被引文献25

引证文献3

二级引证文献3

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部