Delay bounds of a dynamic priority queueing scheme: single node case

The issue of providing a deterministic delay guarantee using the dynamic priority queueing (DPQ) scheme to support multiple connections at a single server queue is investigated. The novelty of the approach lies in that the delay bound is derived without making any assumptions about the traffic characteristics of the connections. The authors first show that the DPQ server provides a delay bound comparable to that of the packet by packet generalized process sharing server in a single node and then improves the delay bound by incorporating a peak rate constraint on the connections. The results reveal the possibility of using the DPQ scheme to support integrated services, including real-time applications in a B-ISDN/ATM network