Show simple item record

dc.contributor.authorWest, Richarden_US
dc.contributor.authorSchwan, Karsten
dc.contributor.authorPoellabauer, Christian
dc.date.accessioned2005-06-17T17:50:30Z
dc.date.available2005-06-17T17:50:30Z
dc.date.issued1998en_US
dc.identifier.urihttp://hdl.handle.net/1853/6639
dc.description.abstractReal-time media servers need to service hundreds and, possibly, thousands of clients, each with their own quality of service (QoS) requirements. To guarantee such diverse QoS requires fast and efficient scheduling support at the server. This paper describes the practical issues concerned with the implementation of a scalable real-time packet scheduler resident on a server, designed to meet service constraints on information transferred across a network to many clients. Specifically, we describe the implementation issues and performance achieved by Dynamic Window-Constrained Scheduling (DWCS), which is designed to meet the delay and loss constraints on packets from multiple streams with different performance objectives. In fact, DWCS is designed to limit the number of late packets over finite numbers of consecutive packets in loss-tolerant and/or delay-constrained, heterogeneous traffic streams. We show how DWCS can be efficiently implemented to provide service guarantees to hundreds of streams. We compare the costs of different implementations, including an approximation algorithm, which trades service quality for speed of execution.en_US
dc.format.extent390160 bytes
dc.format.mimetypeapplication/pdf
dc.language.isoen_US
dc.publisherGeorgia Institute of Technologyen_US
dc.relation.ispartofseriesCC Technical Report; GIT-CC-98-29en_US
dc.subjectPacket scheduling algorithms
dc.subjectQoS guarantees
dc.subjectMedia streams
dc.titleScalable Scheduling Support for Loss and Delay Constrained Media Streamsen_US
dc.typeTechnical Reporteng_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record