期刊文献+

PSS:一种提供服务质量保证的区分优先级的分组调度架构

PSS:A QoS-Oriented and Priority-Based Packet Scheduling Structure
下载PDF
导出
摘要 为解决融合多媒体应用的互联网的QoS问题,该文提出了一种适用于高速分组网络的低复杂度的分组调度通用架构(PSS,Priority-based Scheduling Structure)。PSS将整个调度分为高、低两个优先级调度过程,在高优先级调度过程,提出了一种带约束条件和速率控制因子的排序优先型算法,避免了带宽抢占现象,有效控制了高优先级业务的服务速率;在低优先级过程,提出了一种改进的帧结构型算法,不仅降低了算法复杂度,减小了硬件实现成本,而且缓解了输出业务流的突发性。最后从数学分析和仿真实验两方面证实了PSS架构的可行性和实效性。 To solve the QoS issue of the Internet including multi-services, a Priority-based Scheduling Structure (PSS) designed for high-speed packet networks is proposed. PSS divides packet scheduling into high-priority section and low-priority section. In the high-priority section, a sorted-priority algorithm with low implementation complexity is presented to avoid bandwidth preemption and to control effectively service rates of high-priority services. In the low-priority section, an improved framed-based algorithm is proposed, which decreases not only the algorithm complexity but also the hardware implementation cost. Computer simulation results as well as theoretic analysis show that the PSS mechanism has excellent performance in terms of the implementation complexity, fairness and delay properties.
出处 《电子与信息学报》 EI CSCD 北大核心 2007年第3期702-706,共5页 Journal of Electronics & Information Technology
基金 国家自然科学基金(60377024) 上海市科委科学技术发展基金(04dz12045)资助课题
关键词 服务质量 分组调度 优先级 排序优先型算法 帧结构型算法 QoS Packet scheduling Priority Sorted-priority algorithm Frame-based algorithm
  • 相关文献

参考文献8

  • 1Parekh A and Gallager R.A generalized processor sharing approach to flow control—The single node case.ACM/IEEE Trans.on Networking,1993,1(3):344-357.
  • 2Zhang L.VirtualClock:A new traffic control algorithm for packet switching networks.ACM Trans.on Computer Systems,1991,9(2):101-124.
  • 3Shreedhar M and Varghese G.Efficient fair queueing using deficit round-robin.IEEE/ACM Trans.on Networking,1996,4(3):375-385.
  • 4Do V L and Yun K Y.High Performance Switching and Routing.2003 Workshop on HPSR,California,24-27 June 2003:103-110.
  • 5Wang Song.Hierarchical Qos Integration for Real-time Systems.Dissertation for the degree of Doctor of philosophy in electrical and computer engineering,University of California,IRVINE,2003:30-62.
  • 6Bennett J C R and Zhang H.Hierarchical packet fair queueing algorithms.ACM/IEEE Trans.on Networking,1997,5(5):675-689.
  • 7杨帆,刘增基.一种合理共享空闲带宽的分组调度算法[J].南京大学学报(自然科学版),2003,39(2):246-264. 被引量:2
  • 8Bennett J C R and Zhang H.WF2Q:Worst-case fair weighted fair queueing.in Proc.IEEEINFOCOM'96,San Francisco,CA,Mar.1996:120-128.

二级参考文献6

  • 1Abhay K P, Robert G G. A generalized processor sharing approach to flow control in integerated service networks: The single node case . IEEE/ACM Transactions on Networking, 1993,1(3): 344-357.
  • 2Zhang L. Virtual clock: A new traffic control algorithm for packet switching networks. Proceedings of ACM Sigcomm, 1990:19-29.
  • 3Jamaloddin S G. A self-clocked fair queueing scheme for broadband applications. Proceedings of Infocom'94, 1994: 636-646.
  • 4Subhash S, C-corgc V, Girish C. Leap forward virtual clock. Proceedings of IEEE Infocom'97, 1997:557-565.
  • 5Stephens D C, Zhang H. Implementing scheduling algorithm in high speed networks. IEEE JSAC, Special Issue on Next Generation IP Switches and Routers, 1999, 6(17) :834-845.
  • 6宋继强,苏丰,蔡士杰.基于线条识别的扫描工程图字线分割方法[J].南京大学学报(自然科学版),2001,37(5):535-541. 被引量:2

共引文献1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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