期刊文献+

核心无状态虚拟时钟调度策略 被引量:3

Core-stateless virtual clock scheduling algorithms
原文传递
导出
摘要 为了提供具有可伸缩性的延迟保证,通过对虚拟时钟(GDVC)调度策略的研究,提出了核心无状态虚拟时钟(CS-GDVC)调度策略的框架,并证明它能够与基于流的虚拟时钟调度策略提供相同的端到端延迟保证。通过选择CS-GDVC中的一个参数和工作方式(工作守恒/不守恒),可以构造各种具体的核心无状态虚拟时钟调度策略。已经提出的各种基于虚拟时钟的核心无状态调度策略都可以认为是CS-GDVC的实例。CS-GDVC为核心无状态虚拟时钟调度策略的设计提供了完整的理论基础。 A general framework for corestateless virtual clock scheduling algorithms is proposed to provide scalable delay guarantees. The framework is based on the GDVC (generalized deferred virtual clock) scheduling algorithms, which provide the same endtoend delay bound as the per flow virtual clock scheduling algorithm. Various corestateless virtual clock scheduling algorithms can be built by selecting the parameter and the nature (workconserving or nonwork conserving) of the algorithm. All virtual clockbased corestateless scheduling algorithms can be shown to belong to this general framework which provides a complete theory for the design of virtual clockbased corestateless scheduling algorithms.
出处 《清华大学学报(自然科学版)》 EI CAS CSCD 北大核心 2003年第1期86-89,共4页 Journal of Tsinghua University(Science and Technology)
基金 国家自然科学基金资助项目(60173009) 清华大学"九八五"基金项目
关键词 核心无状态虚拟时钟调度策略 延迟保证 端到端延迟 工作方式 参数选择 网络节点 数据包 状态信息 core-stateless scheduling algorithms virtual clock end-to-end delay
  • 相关文献

参考文献5

  • 1Stoica Ion,Zhang Hui. Providing guaranteed services without per flow management [A]. Proc ACM SIGCOMM'99 [C]. New York: ACM,1999. 81-94. 被引量:1
  • 2Zhang Zhili,Duan Zhenhai,Hou Yiwei Thomas. Virtual time reference system: A unifying scheduling framework for scalable support of guaranteed services [J]. IEEE Journal on Selective Areas in Communications,2000,18(12): 2684-2695. 被引量:1
  • 3Kaur Jasleen,Vin Harrick. Core-stateless guaranteed rate scheduling algorithms [A]. Proc IEEE INFOCOM 2001 [C]. Hilton Anchorage,2001. 1484-1492. 被引量:1
  • 4Goyal Pawan,Vin Harrick. Generalized guaranteed rate scheduling algorithms: a framework [J]. IEEE/ACM Transactions on Networking,1997,5(4): 561-571. 被引量:1
  • 5Figueira Norival,Pasquale Joseph. A schedulability condition for deadline-based service disciplines [J]. Transactions on Networking,1997,5(2): 232-244. 被引量:1

同被引文献26

  • 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. 被引量:1
  • 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. 被引量:1
  • 3ZHANG Li-xia. A New Architecture for Packet Switching Networks Protocols [ D ]. Dept Elect Eng And Comput. Sci, MIT,Massachusetts Cambridge, 1989. 被引量:1
  • 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. 被引量:1
  • 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. 被引量:1
  • 6XIE G G, LAM SIMON S. Delay Guarantee of VC Server [J]. IEEE/ACM Transactions on Networking, 1995, 3 (6) : 683-689. 被引量:1
  • 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. 被引量:1
  • 8BENNEFF J, ZHANG H. WF2Q: Worst-Case Fair Weighted Fair Queueing [ A ]. Proc IEEE Infocom96 [ C ]. San Francisco, CA: IEEE, 1996: 120-128. 被引量:1
  • 9BENNETT C R, ZHANG H. Hierarchical Packet Fair Queueing Algorithms [ J ]. IEEE/ACM Transactions on Networking,1997, 5 (5) : 675-689. 被引量:1
  • 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. 被引量:1

引证文献3

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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