Local resource allocation for providing end to end delay guarantees in ATM networks using PGPS scheduling

The paper addresses the issue of reserving resources at ATM switches along the path of flows that require a hard (deterministic) bound on end to end delay. The switches are assumed to be using packet-by-packet generalized processor sharing (PGPS) schedulers for each outgoing link. An algorithm for call admission control of these flows is proposed. Different policies for mapping the end to end delay requirement into service rates to be assigned at each scheduler are suggested and analyzed.