Simon S. Lam, Y. Luke Lien
Computer Network Performance Symposium 1982
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.
Simon S. Lam, Y. Luke Lien
Computer Network Performance Symposium 1982
Simon S. Lam, Leonard Kleinrock
IEEE Transactions on Communications
Simon S. Lam, Martin Reiser
IEEE Transactions on Communications
Prashant Shenoy, Pawan Goyal, et al.
Multimedia Systems