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.

• Type: Conference
• Year: 1995
• Where: NOSSDAV
• Authors: Pawan Goyal, Simon S. Lam, Harrick M. Vin
• Keywords: Computer Networks, End-to-end Delay, End-to-end Delay Bounds, NOSSDAV 1995, Scheduling Algorithms