Abstract| To support the requirements for the transmission of continuous media, such as audio and video, multiservice packet-switching networks must provide service guarantees to connections, including guarantees on throughput, network delays, and network delay variations. For the most demanding applications, the network must o er a service which provides deterministically bounded delay guarantees, referred to as`bounded delay service'. The admission control functions in a network with a bounded delay service require`schedulability conditions' that detect violations of delay guarantees in a network switch. In this paper, exact schedulability conditions are presented for three packet scheduling methods: Earliest-Deadline-First (EDF), Static-Priority (SP), and a novel scheduling method, referred to as Rotating-Priority-Queues (RPQ). By characterizing the worst-case tra c with general subadditive functions, the presented schedulability conditions can be applied to a large class of tra c models. Examples, which include actual MPEG video traces, are presented to demonstrate the trade-o s involved in selecting a packet scheduling method for a bounded delay service.
propose Rotating Priority Queue (RPQ) REF .
Exact admission control for networks with a bounded delay service
IEEE/ACM Trans. Netw.
Computer Science