File Download

There are no files associated with this item.

  Links for fulltext
     (May Require Subscription)
Supplementary

Conference Paper: Shared buffer architecture for interactive VOD servers

TitleShared buffer architecture for interactive VOD servers
Authors
Issue Date1997
PublisherI E E E, Computer Society. The Journal's web site is located at http://www.ieee-infocom.org/
Citation
Proceedings - Ieee Infocom, 1997, v. 3, p. 1341-1348 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. While considering a disk-array based VOD server, use of a shared buffer at the server end may be more economical than the sole use of dedicated buffers at each user's end. In this paper, we propose a simple buffer sharing architecture that may be used when disk-array based video servers are used. Our aim is to support the maximum number of users for a given number of video server disks while employing a simple scheme requiring less buffer space. The number of video segment retrievals that can occur within a certain time (the service round) is maximum when the scan disk scheduling algorithm is used. Consequently, we shall assume use of the scan algorithm for disk retrieval. The VOD server has a buffer manager that directs retrieved segments to appropriate buffer locations depending on their release and deadlines. The release and deadlines of segments are such that buffer requirement at the user's set-top box is minimized to two video segments while avoiding video starvation and buffer overflow at the user's end. We propose a novel scheme for the operation of the shared buffer that aims at increasing buffer utilization and decreasing cell loss due to buffer overflow. An ATM based broadband network is assumed and all segments are stored in buffers as fixed length ATM cells.
Persistent Identifierhttp://hdl.handle.net/10722/158234
ISSN

 

DC FieldValueLanguage
dc.contributor.authorSengodan, Senthilen_US
dc.contributor.authorLi, Victor OKen_US
dc.date.accessioned2012-08-08T08:58:40Z-
dc.date.available2012-08-08T08:58:40Z-
dc.date.issued1997en_US
dc.identifier.citationProceedings - Ieee Infocom, 1997, v. 3, p. 1341-1348en_US
dc.identifier.issn0743-166Xen_US
dc.identifier.urihttp://hdl.handle.net/10722/158234-
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. While considering a disk-array based VOD server, use of a shared buffer at the server end may be more economical than the sole use of dedicated buffers at each user's end. In this paper, we propose a simple buffer sharing architecture that may be used when disk-array based video servers are used. Our aim is to support the maximum number of users for a given number of video server disks while employing a simple scheme requiring less buffer space. The number of video segment retrievals that can occur within a certain time (the service round) is maximum when the scan disk scheduling algorithm is used. Consequently, we shall assume use of the scan algorithm for disk retrieval. The VOD server has a buffer manager that directs retrieved segments to appropriate buffer locations depending on their release and deadlines. The release and deadlines of segments are such that buffer requirement at the user's set-top box is minimized to two video segments while avoiding video starvation and buffer overflow at the user's end. We propose a novel scheme for the operation of the shared buffer that aims at increasing buffer utilization and decreasing cell loss due to buffer overflow. An ATM based broadband network is assumed and all segments are stored in buffers as fixed length ATM cells.en_US
dc.languageengen_US
dc.publisherI E E E, Computer Society. The Journal's web site is located at http://www.ieee-infocom.org/en_US
dc.relation.ispartofProceedings - IEEE INFOCOMen_US
dc.titleShared buffer architecture for interactive VOD serversen_US
dc.typeConference_Paperen_US
dc.identifier.emailLi, Victor OK:vli@eee.hku.hken_US
dc.identifier.authorityLi, Victor OK=rp00150en_US
dc.description.naturelink_to_subscribed_fulltexten_US
dc.identifier.scopuseid_2-s2.0-0031377378en_US
dc.identifier.volume3en_US
dc.identifier.spage1341en_US
dc.identifier.epage1348en_US
dc.publisher.placeUnited Statesen_US
dc.identifier.scopusauthoridSengodan, Senthil=6601969297en_US
dc.identifier.scopusauthoridLi, Victor OK=7202621685en_US

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats