期刊文献+

集成服务网络中的分组调度算法研究综述 被引量:13

THE RESEARCH OF PACKET SCHEDULING ALGORITHMS WITHIN INTEGRATED SERVICES NETWORK: A SURVEY
下载PDF
导出
摘要 未来的计算机网络将是一种能够提供多种不同服务,以支持多种不同应用需求,有着集成服务(Integratedservices)支持能力的网络.这种网络是通过在统一的分组交换网络上实现各种不同的服务性能保证机制来构造的.分组调度机制是集成服务网络构造所依赖的最主要性能保证机制之一,而其核心问题就是分组调度算法问题.文章以集成服务网络的相关研究为背景,综述了集成服务网络研究领域中的分组调度算法研究.对于该研究开展以来所提出的各种主要分组调度算法进行了对比分析和分类阐述.其主要贡献在于首次从集成服务网络研究的角度出发,对该领域研究成果进行了总结;同时对该领域的最新研究进展进行了分析。 Future computer network will become an integrated services network that will be able to provide various services to support a wide range of network applications. This integrated services network will be built by using many kinds of service performance assurance mechanisms upon a general packet switched network. Packet scheduling mechanism is one of the most important mechanism of such mechanisms, and the core problem of packet scheduling mechanism is its algorithm.This paper makes a survey of the research on packet scheduling algorithms by taking the related integrated services network researches as background. First, this paper starts by doing some background setting. Then, it describes the principles and compares the similarities and differences of some main algorithms that are proposed in the literature. It also discusses the internal relationships between these algorithms and analyzes their performance characteristics. The main contribution of this paper is that it summaries this research field from the integrated services network's point of view for the first time. Meanwhile, it puts forward an analysis of some of the recent research advance in this field. At the end of this paper, the authors purpose some new researches which are believed to be of great research value.
出处 《计算机学报》 EI CSCD 北大核心 1999年第10期1090-1099,共10页 Chinese Journal of Computers
基金 国家自然科学基金 国家八六三高技术研究发展计划 国家"九五"重点科技攻关计划
关键词 集成服务网络 分组调度算法 计算机网络 Integrated services network, packet scheduling algorithm, service performance, implementation mechanism.
  • 相关文献

参考文献21

  • 1Stoica I,Proc ACM SIGCOM M’98,1998年,118页
  • 2Stephens D C,Proc INFOCOM’98,1998年,282页
  • 3Stoica I,Proc INFOCOM’98,1998年,1103页
  • 4Stoica I,Proc IW Qo S’98,1998年,218页
  • 5Stoica I,Proc NOSSDAV’98 Cambridge England,1998年,115页
  • 6Clark D,IEEE/ACM Trans Networking,1998年,6卷,4期,362页
  • 7Xie G,IEEE/ACM Trans Networking,1998年,6卷,1期,30页
  • 8Lu S,Proc ACM SIGCOM M’97,1997年,63页
  • 9Stoica I,Proc ACM SIGCOM M’97,1997年,249页
  • 10Lam S,IEEE/ACM Trans Networking,1997年,5卷,2期,205页

同被引文献89

  • 1张奇智,张彬,张卫东.基于网络演算计算交换式工业以太网中的最大时延[J].控制与决策,2005,20(1):117-120. 被引量:44
  • 2Altintas O. Uregncy-based round robin: a new scheduling discipline for packet switching networks[J]. IEEE Globecom, 1997,2 (1):1 119-1 183.
  • 3Goyal P , Vin H M,Cheng H. Start-time fair queueing:a scheduling algorithm for integrated services packet switched networks[J]. IEEE Trans on Networking, 1997,5: 690-740.
  • 4Parekh A K,Gallager R G. A generalized processor sharing approach to flow in integrated services: the sing-node case[J]. IEEE/ ACM Trans Network, 1993,1(3) : 344-357.
  • 5Jacobson V. Cngestion avoidance and coutrol[J]. ACM Computer Communications Review, 1998,18(4) :314-329.
  • 6Armitage G,隆克平等译.IP网路服务质量[M].北京:机械工业出版社,2001.
  • 7Zhang H, Ferrari D. Rate-controlled service disciplines[J]. Journal of High Speed Networks, 1995,3(4): 389-412.
  • 8Feng W, Kandlur D, Saha D, et al. A self configuring RED gateway[J]. IEEE INFOCOM,1999, (3):1 320-1 328.
  • 9Floyd S, Gummadi R, Shenker S . Adaptive RED: an algorithm for increasing the robustness of RED's active queue management [Z], 2001.
  • 10Shreedhar M , Varghese G. Efficient fair queueing using deficit round-robin[J]. EEE Transactions on Networking, 1996,4 (3) : 375-385.

引证文献13

二级引证文献29

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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