Dynamic buffer allocation in video-on-demand systems

Cited 8 time in webofscience Cited 0 time in scopus
  • Hit : 400
  • Download : 367
DC FieldValueLanguage
dc.contributor.authorLee, Sang-Hoko
dc.contributor.authorWhang, Kyu-Youngko
dc.contributor.authorMoon, Yang-Saeko
dc.contributor.authorHan, Wook-Shinko
dc.contributor.authorSong, Il-Yeolko
dc.date.accessioned2009-11-09T01:47:48Z-
dc.date.available2009-11-09T01:47:48Z-
dc.date.created2012-02-06-
dc.date.created2012-02-06-
dc.date.created2012-02-06-
dc.date.issued2003-11-
dc.identifier.citationIEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING, v.15, pp.1535 - 1551-
dc.identifier.issn1041-4347-
dc.identifier.urihttp://hdl.handle.net/10203/12231-
dc.description.abstractIn video-on-demand (VOD) systems, as the size of the buffer allocated to user requests increases, initial latency and memory requirements increase. Hence, the buffer size must be minimized. The existing static buffer allocation scheme, however, determines the buffer size based on the assumption that the system is in the fully loaded state. Thus, when the system is in a partially loaded state, the scheme allocates a buffer larger than necessary to a user request. This paper proposes a dynamic buffer allocation scheme that allocates to user requests buffers of the minimum size in a partially loaded state, as well as in the fully loaded state. The inherent difficulty in determining the buffer size in the dynamic buffer allocation scheme is that the size of the buffer currently being allocated is dependent on the number of and the sizes of the buffers to be allocated in the next service period. We solve this problem by the predict, and-enforce strategy, where we predict the number and the sizes of future buffers based on inertia assumptions and enforce these assumptions at runtime. Any violation of these assumptions is resolved by deferring service to the violating new user request until the assumptions are satisfied. Since the,size of the current buffer is dependent on the sizes of the future buffers, it is represented by a recurrence equation. We provide a solution to this equation, which can be computed at the system initialization time for runtime efficiency. We have performed extensive analysis and simulation. The results show that the dynamic buffer allocation scheme reduces initial latency (averaged over the number of user requests in service from one to the maximum capacity) to (29.4)/(1) similar to (11.0)/(1) of that for the static one and, by reducing the memory requirement, increases the number of concurrent user requests to 2.36 similar to 3.25 times that of the static one when averaged over the amount of system memory available. These results demonstrate that the dynamic buffer allocation scheme significantly improves the performance and capacity of VOD systems.-
dc.languageEnglish-
dc.language.isoen_USen
dc.publisherIEEE COMPUTER SOC-
dc.titleDynamic buffer allocation in video-on-demand systems-
dc.typeArticle-
dc.identifier.wosid000186249300015-
dc.identifier.scopusid2-s2.0-0242493754-
dc.type.rimsART-
dc.citation.volume15-
dc.citation.beginningpage1535-
dc.citation.endingpage1551-
dc.citation.publicationnameIEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING-
dc.identifier.doi10.1109/TKDE.2003.1245291-
dc.embargo.liftdate9999-12-31-
dc.embargo.terms9999-12-31-
dc.contributor.localauthorWhang, Kyu-Young-
dc.contributor.nonIdAuthorLee, Sang-Ho-
dc.contributor.nonIdAuthorMoon, Yang-Sae-
dc.contributor.nonIdAuthorHan, Wook-Shin-
dc.contributor.nonIdAuthorSong, Il-Yeol-
dc.description.isOpenAccessN-
dc.type.journalArticleArticle-
dc.subject.keywordAuthorVOD systems-
dc.subject.keywordAuthordynamic buffer allocation-
dc.subject.keywordAuthormultimedia systems-
dc.subject.keywordAuthorbuffer scheduling methods-
dc.subject.keywordPlusSERVERS-
Appears in Collection
CS-Journal Papers(저널논문)
Files in This Item
This item is cited by other documents in WoS
⊙ Detail Information in WoSⓡ Click to see webofscience_button
⊙ Cited 8 items in WoS Click to see citing articles in records_button

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0