File Download
Links for fulltext
(May Require Subscription)
- Publisher Website: 10.1109/INFCOM.1997.631167
- Find via
Supplementary
-
Citations:
- Appears in Collections:
Conference Paper: A shared buffer architecture for interactive VOD servers
Title | A shared buffer architecture for interactive VOD servers |
---|---|
Authors | |
Keywords | Communications Computer applications |
Issue Date | 1997 |
Publisher | IEEE, 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? |
Abstract | Video-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 Identifier | http://hdl.handle.net/10722/54085 |
ISSN | 2023 SCImago Journal Rankings: 2.865 |
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Sengodan, S | en_HK |
dc.contributor.author | Li, VOK | en_HK |
dc.date.accessioned | 2009-04-03T07:36:19Z | - |
dc.date.available | 2009-04-03T07:36:19Z | - |
dc.date.issued | 1997 | en_HK |
dc.identifier.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 | en_HK |
dc.identifier.issn | 0743-166X | en_HK |
dc.identifier.uri | http://hdl.handle.net/10722/54085 | - |
dc.description.abstract | Video-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.language | eng | en_HK |
dc.publisher | IEEE, Computer Society. The Journal's web site is located at http://www.ieee-infocom.org/ | en_HK |
dc.relation.ispartof | IEEE 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.subject | Communications | en_HK |
dc.subject | Computer applications | en_HK |
dc.title | A shared buffer architecture for interactive VOD servers | en_HK |
dc.type | Conference_Paper | en_HK |
dc.identifier.openurl | http://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+servers | en_HK |
dc.identifier.email | Li, VOK: vli@eee.hku.hk | en_HK |
dc.description.nature | published_or_final_version | en_HK |
dc.identifier.doi | 10.1109/INFCOM.1997.631167 | en_HK |
dc.identifier.hkuros | 27455 | - |
dc.identifier.volume | 3 | - |
dc.identifier.spage | 1341 | - |
dc.identifier.epage | 1348 | - |
dc.customcontrol.immutable | sml 160114 - amend | - |
dc.identifier.issnl | 0743-166X | - |