File Download

There are no files associated with this item.

  Links for fulltext
     (May Require Subscription)
Supplementary

Article: A quasi-static retrieval scheme for interactive VOD servers

TitleA quasi-static retrieval scheme for interactive VOD servers
Authors
KeywordsMultimedia
Scheduling
Server
Video-On-Demand
Issue Date1997
PublisherElsevier BV. The Journal's web site is located at http://www.elsevier.com/locate/comcom
Citation
Computer Communications, 1997, v. 20 n. 12, p. 1031-1041 How to Cite?
AbstractVideo-on-demand (VOD) servers need to be efficiently designed in order to support a large number of users viewing the same or different videos at different rates. In this paper, we propose a simple quasi-static retrieval scheme that may be used for this purpose when interactive disk-array based video servers are used. We assume presence of no buffer at the server and hence, all retrieved segments are immediately transmitted to the appropriate users. Such a retrieval scheme employs a macro-slot assigner and a disk scheduler. Macro-slots define a duration of time in a service round within which one video segment needs to be retrieved for a user. Having assigned macro-slots to users, the disk scheduler uses the non-preemptive earliest deadline first (N-EDF) algorithm to determine a valid schedule for segment retrieval. In order to increase the number of users that can be served by the system, the number of disk seeks in a service round needs to be decreased. This is done in the Scan-N-EDF algorithm by appropriately grouping retrievals and using the scan algorithm within each group. For a given video segment size, the amount of buffer required at each user's set-top box is reduced to two video segments. Guarantees are provided for the avoidance of video starvation as well as buffer overflow at each user's set-top box. © 1997 Elsevier Science B.V.
Persistent Identifierhttp://hdl.handle.net/10722/155059
ISSN
2015 Impact Factor: 2.099
2015 SCImago Journal Rankings: 0.889
References

 

DC FieldValueLanguage
dc.contributor.authorSengodan, Sen_US
dc.contributor.authorLi, VOKen_US
dc.date.accessioned2012-08-08T08:31:41Z-
dc.date.available2012-08-08T08:31:41Z-
dc.date.issued1997en_US
dc.identifier.citationComputer Communications, 1997, v. 20 n. 12, p. 1031-1041en_US
dc.identifier.issn0140-3664en_US
dc.identifier.urihttp://hdl.handle.net/10722/155059-
dc.description.abstractVideo-on-demand (VOD) servers need to be efficiently designed in order to support a large number of users viewing the same or different videos at different rates. In this paper, we propose a simple quasi-static retrieval scheme that may be used for this purpose when interactive disk-array based video servers are used. We assume presence of no buffer at the server and hence, all retrieved segments are immediately transmitted to the appropriate users. Such a retrieval scheme employs a macro-slot assigner and a disk scheduler. Macro-slots define a duration of time in a service round within which one video segment needs to be retrieved for a user. Having assigned macro-slots to users, the disk scheduler uses the non-preemptive earliest deadline first (N-EDF) algorithm to determine a valid schedule for segment retrieval. In order to increase the number of users that can be served by the system, the number of disk seeks in a service round needs to be decreased. This is done in the Scan-N-EDF algorithm by appropriately grouping retrievals and using the scan algorithm within each group. For a given video segment size, the amount of buffer required at each user's set-top box is reduced to two video segments. Guarantees are provided for the avoidance of video starvation as well as buffer overflow at each user's set-top box. © 1997 Elsevier Science B.V.en_US
dc.languageengen_US
dc.publisherElsevier BV. The Journal's web site is located at http://www.elsevier.com/locate/comcomen_US
dc.relation.ispartofComputer Communicationsen_US
dc.subjectMultimediaen_US
dc.subjectSchedulingen_US
dc.subjectServeren_US
dc.subjectVideo-On-Demanden_US
dc.titleA quasi-static retrieval scheme for interactive VOD serversen_US
dc.typeArticleen_US
dc.identifier.emailLi, VOK:vli@eee.hku.hken_US
dc.identifier.authorityLi, VOK=rp00150en_US
dc.description.naturelink_to_subscribed_fulltexten_US
dc.identifier.scopuseid_2-s2.0-0031268233en_US
dc.relation.referenceshttp://www.scopus.com/mlt/select.url?eid=2-s2.0-0031268233&selection=ref&src=s&origin=recordpageen_US
dc.identifier.volume20en_US
dc.identifier.issue12en_US
dc.identifier.spage1031en_US
dc.identifier.epage1041en_US
dc.publisher.placeNetherlandsen_US
dc.identifier.scopusauthoridSengodan, S=6601969297en_US
dc.identifier.scopusauthoridLi, VOK=7202621685en_US

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats