File Download

There are no files associated with this item.

  Links for fulltext
     (May Require Subscription)
Supplementary

Article: Practical algorithms for scheduling video data in a local area network environment

TitlePractical algorithms for scheduling video data in a local area network environment
Authors
KeywordsClient-Server Systems
Earliest-Deadline-First
Link Scheduling
Linux
Multimedia Networking
Parallel Processing
Qos
Rate-Monotonic
Smoothed Video
Smp
Soft Real-Time Constraints
Issue Date2007
PublisherSpringer New York LLC. The Journal's web site is located at http://springerlink.metapress.com/openurl.asp?genre=journal&issn=0920-8542
Citation
Journal Of Supercomputing, 2007, v. 39 n. 2, p. 131-147 How to Cite?
AbstractSimultaneous transmission of multiple high quality video streams from a server to the clients is becoming an increasingly important class of traffic in a network of workstations or cluster environment. With a powerful symmetric multiprocessor (SMP) as the server and a high-speed network, such transmission is practicable from a hardware point of view. However, the actual construction of such a video data server system entails tackling a number of difficult problems related to the provision of strict quality of service (QoS) guarantees. Among others, the smoothing and scheduling of multiple video packet streams are two crucial issues. Smoothing is concerned with reducing the rate variability of video streams in view of the fact that video data are usually compressed in a variable bit rate fashion. Scheduling is important to guarantee the requested QoS levels while maximizing the utilization of the resources. Although much work on smoothing has been done, it is not clear which scheduling scheme is suitable for multiplexing smoothed video data to the network. In this paper we present an extensive performance study of the EDF and RM scheduling algorithms which are modified to provide QoS guarantees for smoothed video data. With a probabilistic definition of QoS, admission control conditions are incorporated into the two algorithms. Furthermore, a counter-based scheduling module is included as the core scheduling mechanism which adaptively adjusts the actual QoS levels assigned to requests. Our theoretical analysis of the two modified algorithms, called QEDF and QRM, shows that the QRM algorithm is more robust than the QEDF algorithm for different workload and utilization conditions. We also propose to use a new metric called meta-QoS to quantify the overall performance of a packet scheduler given a set of simultaneous requests. In our experiments based on an SMP-based Linux platform, we find that the QRM algorithm can sustain a rather stable level of meta-QoS even when the workload and utilization levels are increased. On the other hand, the QEDF algorithm, due to its conservative admission control policy, is found to be not suitable for a high level of utilization and a large number of requests. In view of the lower complexity of the QRM algorithm, it seems that the QRM approach is a more suitable candidate for packet scheduling in the client-server environment considered in our study. © Springer Science+Business Media, LLC 2007.
Persistent Identifierhttp://hdl.handle.net/10722/155360
ISSN
2015 Impact Factor: 1.088
2015 SCImago Journal Rankings: 0.615
ISI Accession Number ID
References

 

DC FieldValueLanguage
dc.contributor.authorTsoi, KYLen_US
dc.contributor.authorKwok, YKen_US
dc.date.accessioned2012-08-08T08:33:04Z-
dc.date.available2012-08-08T08:33:04Z-
dc.date.issued2007en_US
dc.identifier.citationJournal Of Supercomputing, 2007, v. 39 n. 2, p. 131-147en_US
dc.identifier.issn0920-8542en_US
dc.identifier.urihttp://hdl.handle.net/10722/155360-
dc.description.abstractSimultaneous transmission of multiple high quality video streams from a server to the clients is becoming an increasingly important class of traffic in a network of workstations or cluster environment. With a powerful symmetric multiprocessor (SMP) as the server and a high-speed network, such transmission is practicable from a hardware point of view. However, the actual construction of such a video data server system entails tackling a number of difficult problems related to the provision of strict quality of service (QoS) guarantees. Among others, the smoothing and scheduling of multiple video packet streams are two crucial issues. Smoothing is concerned with reducing the rate variability of video streams in view of the fact that video data are usually compressed in a variable bit rate fashion. Scheduling is important to guarantee the requested QoS levels while maximizing the utilization of the resources. Although much work on smoothing has been done, it is not clear which scheduling scheme is suitable for multiplexing smoothed video data to the network. In this paper we present an extensive performance study of the EDF and RM scheduling algorithms which are modified to provide QoS guarantees for smoothed video data. With a probabilistic definition of QoS, admission control conditions are incorporated into the two algorithms. Furthermore, a counter-based scheduling module is included as the core scheduling mechanism which adaptively adjusts the actual QoS levels assigned to requests. Our theoretical analysis of the two modified algorithms, called QEDF and QRM, shows that the QRM algorithm is more robust than the QEDF algorithm for different workload and utilization conditions. We also propose to use a new metric called meta-QoS to quantify the overall performance of a packet scheduler given a set of simultaneous requests. In our experiments based on an SMP-based Linux platform, we find that the QRM algorithm can sustain a rather stable level of meta-QoS even when the workload and utilization levels are increased. On the other hand, the QEDF algorithm, due to its conservative admission control policy, is found to be not suitable for a high level of utilization and a large number of requests. In view of the lower complexity of the QRM algorithm, it seems that the QRM approach is a more suitable candidate for packet scheduling in the client-server environment considered in our study. © Springer Science+Business Media, LLC 2007.en_US
dc.languageengen_US
dc.publisherSpringer New York LLC. The Journal's web site is located at http://springerlink.metapress.com/openurl.asp?genre=journal&issn=0920-8542en_US
dc.relation.ispartofJournal of Supercomputingen_US
dc.subjectClient-Server Systemsen_US
dc.subjectEarliest-Deadline-Firsten_US
dc.subjectLink Schedulingen_US
dc.subjectLinuxen_US
dc.subjectMultimedia Networkingen_US
dc.subjectParallel Processingen_US
dc.subjectQosen_US
dc.subjectRate-Monotonicen_US
dc.subjectSmoothed Videoen_US
dc.subjectSmpen_US
dc.subjectSoft Real-Time Constraintsen_US
dc.titlePractical algorithms for scheduling video data in a local area network environmenten_US
dc.typeArticleen_US
dc.identifier.emailKwok, YK:ykwok@eee.hku.hken_US
dc.identifier.authorityKwok, YK=rp00128en_US
dc.description.naturelink_to_subscribed_fulltexten_US
dc.identifier.doi10.1007/s11227-007-0105-9en_US
dc.identifier.scopuseid_2-s2.0-33947318388en_US
dc.identifier.hkuros131037-
dc.relation.referenceshttp://www.scopus.com/mlt/select.url?eid=2-s2.0-33947318388&selection=ref&src=s&origin=recordpageen_US
dc.identifier.volume39en_US
dc.identifier.issue2en_US
dc.identifier.spage131en_US
dc.identifier.epage147en_US
dc.identifier.isiWOS:000245006300003-
dc.publisher.placeUnited Statesen_US
dc.identifier.scopusauthoridTsoi, KYL=6701730234en_US
dc.identifier.scopusauthoridKwok, YK=7101857718en_US

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats