期刊文献+

基于服务量差值的Virtual Clock接入允许控制算法 被引量:2

The admission control algorithm based on difference of service for the virtual clock packet scheduling algorithm
下载PDF
导出
摘要 VirtualClock算法的接入允许控制算法仅要求系统中复用的各个连接的服务速率总和不超过系统的容量 ,但是这并不足以保证每个分组的时延都达到要求 .主要原因在于 :这种接入算法没有对每个连接占用的带宽在何种条件下能够释放作出规定 .文中提出 ,当一个连接拆除时 ,只有等到所有未被服务完的连接在VirtualClock系统中的服务量超过它们在各自参照服务器中的服务量时 ,该连接占用的带宽才能释放 .采用这种接入允许控制算法 。 The existing admission control scheme for the virtual clock algorithm only requirs that the total bandwidth of each session be less than the system capacity. But it can not guarantee the packet delay. The reason is that it does not prescribe the condition when a sessions band width can be released. In this paper, it is proposed that the band width of a session can be released only when the virtual clock system provides more service for the sessions being served than these sessionss ideal servers. Theoretical and simulation results show this scheme can fully guarantee the delay of packet.
作者 杨帆 刘增基
出处 《西安电子科技大学学报》 EI CAS CSCD 北大核心 2002年第4期429-433,443,共6页 Journal of Xidian University
基金 国家部委"九五"预研重点项目资助 (3 1 4 4 2 )
关键词 VIRTUAL CLOCK 接入允许控制算法 分组调度算法 时延 服务质量 QOS 服务速率 分组交换系统 admission control algorithm packet scheduling algorithm delay
  • 相关文献

参考文献1

二级参考文献3

  • 1Sriram K,IEEE J Selected Areasin Communicaitons,1999年,17卷,1期,18页
  • 2Sriram K,IEEE J Selected Areasin Communications,1999年,17卷,1期,4页
  • 3Schwartz M,Broadband Integated networks,1998年,130页

共引文献1

同被引文献15

  • 1DEMERS A, KESHAV S, SHENKER S. Analysis and Simulation of a Fair-Queueing Algorithm [ A ]. In Proceedings of ACM SIGCOMM89 [C]. ACM SIGCOMM89. Austin, Texas: ACM, 1989:1-12.
  • 2ZHANG Li-xia. Virtual Clock: A New Traffic Control Algorithm for Packet Switching Networks [ A]. Proc ACM SIGCOMM90[C]. New York: The Association for Computeing Machinery, Inc, 1990: 19-29.
  • 3ZHANG Li-xia. A New Architecture for Packet Switching Networks Protocols [ D ]. Dept Elect Eng And Comput. Sci, MIT,Massachusetts Cambridge, 1989.
  • 4PAREKH A K, GALLAGER R G. A Generalized Processor Sharing Approach to Flow Control in Integrated Services Networks:The Single-Node Case [J]. IEEE/ACM Transactions on Networking, 1993, 1 (3) : 344-357.
  • 5SURI S. Leap Forward Virtual Clock: A New Fair Queuing Scheme with Guaranteed Delays and Throughput Fairness [ A ].IEEE Infocom97 [C]. Kobe: IEEE, 1997:557-565.
  • 6XIE G G, LAM SIMON S. Delay Guarantee of VC Server [J]. IEEE/ACM Transactions on Networking, 1995, 3 (6) : 683-689.
  • 7FIGUEIRA N R, PASQUALE J. An Upper Bound on Delay for the Virtualclock Service Discipline [ J ]. IEEE/ACM Transactions on Networking, 1995, 3 (4) : 399-408.
  • 8BENNEFF J, ZHANG H. WF2Q: Worst-Case Fair Weighted Fair Queueing [ A ]. Proc IEEE Infocom96 [ C ]. San Francisco, CA: IEEE, 1996: 120-128.
  • 9BENNETT C R, ZHANG H. Hierarchical Packet Fair Queueing Algorithms [ J ]. IEEE/ACM Transactions on Networking,1997, 5 (5) : 675-689.
  • 10GOYAL P, VIN H, CHENG H. Start-Time Fair Queueing: A Scheduling Algorithm for Integrated Services Packet Switching Networks [A]. In Proc ACM SIGCOMM96 [C]. Stanford, CA: ACM, 1996: 157-168.

引证文献2

二级引证文献4

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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