As the demands on quality of service (QoS) of real-time applications over the Internet
increase, many research efforts have developed various packet scheduling schemes to …

This paper deals with the performance of delay-sensitive applications running over a
network that offers multiple classes of service, where the adaption of application rates in …

Packet networks are currently enabling the integration of traffic with a wide range of
characteristics that extend from video traffic with stringent QoS requirements to the best-effort …

There exist a Model of Proportional Jitter Differentiated Service and Proportional Delay
Differentiated Serivce, which provides proportional jitter or proportional delay between …

Providing quality of service (QoS) to applications with different traffic characteristics based
on their needs is an important research area for today's and tomorrow's high speed …

The Internet traditionally provides service that is commonly characterized as a best-effort
service. Many applications run very well using this service model but some new interactive …

The relative differentiation architecture does not require per-flow state at the network core or
edges, nor admission control, but it can only provide higher classes with better service than …

Generalized processor sharing (GPS) and earliest-due-date (EDD) algorithms are two work
conserving service disciplines to provide bounded delay and fair queuing for packet data …

The absolute priority scheme is message preemptive and allows only the highest priority
class to be present on the network under heavy load. The allocation priority scheme permits …

We present an end-to-end delay guarantee theorem for a class of guaranteed deadline (GD)
servers. The theorem can be instantiated to obtain end-to-end delay bounds for a variety of …