A priority based packet scheduler with deadline considerations
暂无分享,去创建一个
[1] Christina Hattingh,et al. End-to-end qos network design , 2005 .
[2] Jean C. Walrand,et al. Achieving 100% throughput in an input-queued switch , 1996, Proceedings of IEEE INFOCOM '96. Conference on Computer Communications.
[3] Ali Movaghar-Rahimabadi,et al. A Method for Performance Analysis of Earliest-Deadline-First Scheduling Policy , 2004, International Conference on Dependable Systems and Networks, 2004.
[4] Michael Menth,et al. Service differentiation with MEDF scheduling in TCP/IP networks , 2006, Comput. Commun..
[5] Hui Zhang,et al. Service disciplines for guaranteed performance service in packet-switching networks , 1995, Proc. IEEE.
[6] Xiaoxia Sun,et al. A packet scheduling algorithm in high performance routers , 2001, Joint 4th IEEE International Conference on ATM(ICATM'01) and High Speed Intelligent Internet Symposium. ICATM 2001 (Cat. No.00EX486).
[7] Jörg Liebeherr,et al. A near-optimal packet scheduler for QoS networks , 1997, Proceedings of INFOCOM '97.
[8] Harrick M. Vin,et al. Start-time fair queueing: a scheduling algorithm for integrated services packet switching networks , 1997, TNET.
[9] Hui Zhang,et al. WF/sup 2/Q: worst-case fair weighted fair queueing , 1996, Proceedings of IEEE INFOCOM '96. Conference on Computer Communications.
[10] Ali Movaghar-Rahimabadi,et al. A Method for Performance Analysis of Earliest-Deadline-First Scheduling Policy , 2004, DSN.