K. Zhu, Y. Zhuang and Y. Viniotis. "Achieving End-to-end Delay Bounds by EDF Scheduling without Traffic Shaping", IEEE INFOCOM'01, 2001. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Schedulability Criterion and Performance Analysis of.. - Li, Knightly (2001) (Correct)
....such techniques provide schedulability conditions, i.e. constraints that, if satisfied, ensure that all packets of all flows will meet their respective delay bounds without violation or loss. Recently, a class of schedulers has been studied which employ coordination of priorities among nodes [2,15,28]. A scheduler that employs coordination can give a packet higher or lower priority at downstream nodes depending on whether the packet was serviced late or early at upstream nodes. This intuitively appealing concept has been applied in a number of service disciplines proposed in the literature ....
K. Zhu, Y. Zhuang, and Y. Viniotis. Achieving end-to-end delay bounds by EDF scheduling without traffic shaping. In Proceedings of IEEE INFOCOM '01, Anchorage, Alaska, April 2001.
Queue Management for QoS Provision Build on Network Processor - Zhou, Lin, Li, Tan (2003) (Correct)
No context found.
K. Zhu, Y. Zhuang and Y. Viniotis. "Achieving End-to-end Delay Bounds by EDF Scheduling without Traffic Shaping", IEEE INFOCOM'01, 2001.
Schedulability Criterion and Performance Analysis of.. - Li, Knightly (2001) (Correct)
No context found.
K. Zhu, Y. Zhuang, and Y. Viniotis. Achieving end-to-end delay bounds by EDF scheduling without traffic shaping. In Proceedings of IEEE INFOCOM '01, Anchorage, Alaska, April 2001.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC