File Download
  Links for fulltext
     (May Require Subscription)
Supplementary

Conference Paper: A shared buffer architecture for interactive VOD servers

TitleA shared buffer architecture for interactive VOD servers
Authors
KeywordsCommunications
Computer applications
Issue Date1997
PublisherIEEE, Computer Society. The Journal's web site is located at http://www.ieee-infocom.org/
Citation
The 16th Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE INFOCOM '97), Kobe, Japan, 7-11 April 1997. In IEEE Infocom Proceedings, 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/54085
ISSN
2023 SCImago Journal Rankings: 2.865

 

DC FieldValueLanguage
dc.contributor.authorSengodan, Sen_HK
dc.contributor.authorLi, VOKen_HK
dc.date.accessioned2009-04-03T07:36:19Z-
dc.date.available2009-04-03T07:36:19Z-
dc.date.issued1997en_HK
dc.identifier.citationThe 16th Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE INFOCOM '97), Kobe, Japan, 7-11 April 1997. In IEEE Infocom Proceedings, 1997, v. 3, p. 1341-1348en_HK
dc.identifier.issn0743-166Xen_HK
dc.identifier.urihttp://hdl.handle.net/10722/54085-
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_HK
dc.languageengen_HK
dc.publisherIEEE, Computer Society. The Journal's web site is located at http://www.ieee-infocom.org/en_HK
dc.relation.ispartofIEEE Infocom Proceedings-
dc.rights©1997 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.-
dc.subjectCommunicationsen_HK
dc.subjectComputer applicationsen_HK
dc.titleA shared buffer architecture for interactive VOD serversen_HK
dc.typeConference_Paperen_HK
dc.identifier.openurlhttp://library.hku.hk:4550/resserv?sid=HKU:IR&issn=0743-166X&volume=3&spage=1341&epage=1348&date=1997&atitle=A+shared+buffer+architecture+for+interactive+VOD+serversen_HK
dc.identifier.emailLi, VOK: vli@eee.hku.hken_HK
dc.description.naturepublished_or_final_versionen_HK
dc.identifier.doi10.1109/INFCOM.1997.631167en_HK
dc.identifier.hkuros27455-
dc.identifier.volume3-
dc.identifier.spage1341-
dc.identifier.epage1348-
dc.customcontrol.immutablesml 160114 - amend-
dc.identifier.issnl0743-166X-

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats