期刊文献+

改进的前跳虚时钟调度算法 被引量:2

Enhanced Leap Forward Virtual Clock Scheduling Algorithm
下载PDF
导出
摘要 基于前跳虚时钟算法原理提出了一种新的调度算法 ,它将业务所预留的带宽和链路的剩余带宽实时分离 ,并用剩余带宽改善其他种类业务的 Qo S特性 ,使得带宽资源的分配更加灵活 .理论分析和仿真证明 ,算法不仅降低了“尽力而为”业务的平均时延 ,还具有确定的时延保证和公平性 . Based on the leap forward virtual clock algorithm, this paper proposed a new scheduling algorithm which can separate the reserved bandwidth and residual bandwidth. The residual bandwidth can be used to improve the QoS performance of best effort services, which makes the bandwidth allocation more flexible. The deterministic delay guarantee and fairness performance were also demonstrated and proved by the simulations.
出处 《上海交通大学学报》 EI CAS CSCD 北大核心 2002年第6期785-788,共4页 Journal of Shanghai Jiaotong University
关键词 前跳虚时钟调度算法 时延保证 宽带网络 服务质量 带宽分配 通信业务 Algorithms Computer simulation Optical communication Scheduling
  • 相关文献

参考文献2

二级参考文献10

共引文献3

同被引文献19

  • 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

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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