Mon-Song Chen, Tsipora Barzilai, et al.
IEEE ComSoc MULTIMEDIA 1992
We define a class of Guaranteed Rate (GR) scheduling algorithms. The GR class includes Virtual Clock, Packet-by-Packet Generalized Processor Sharing and Self-Clocked Fair Queuing. For networks that employ scheduling algorithms belonging to GR, we present a method for determining an upper bound on end-to-end delay. The method facilitates determination of end-to-end delay bounds for a variety of sources. We illustrate the method by determining end-to-end delay bounds for sources conforming to Leaky Bucket and exponentially bounded burstiness.
Mon-Song Chen, Tsipora Barzilai, et al.
IEEE ComSoc MULTIMEDIA 1992
Mohammad Raunak, Prashant Shenoy, et al.
IEEE Journal on Selected Areas in Communications
Pawan Goyal, Dharmendra S. Modha, et al.
SIGMETRICS 2003
Simon S. Lam, Leonard Kleinrock
IEEE Transactions on Communications