Sciweavers

Share
NOSSDAV
1995
Springer

Determining End-to-End Delay Bounds in Heterogeneous Networks

10 years 8 months ago
Determining End-to-End Delay Bounds in Heterogeneous Networks
We define a class of Guaranteed Rate (GR) scheduling algorithms. The GR class includes Virtual Clock, Packet-byPacket 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.
Pawan Goyal, Simon S. Lam, Harrick M. Vin
Added 26 Aug 2010
Updated 26 Aug 2010
Type Conference
Year 1995
Where NOSSDAV
Authors Pawan Goyal, Simon S. Lam, Harrick M. Vin
Comments (0)
books