Cited 0 time in
Simple and efficient fast staggered data broadcasting scheme for popular video services
| DC Field | Value | Language |
|---|---|---|
| dc.contributor.author | Kim, Hong-Ik | - |
| dc.contributor.author | Park, Sung kwon | - |
| dc.date.accessioned | 2022-12-21T04:45:13Z | - |
| dc.date.available | 2022-12-21T04:45:13Z | - |
| dc.date.issued | 2008-01 | - |
| dc.identifier.issn | 0302-9743 | - |
| dc.identifier.issn | 1611-3349 | - |
| dc.identifier.uri | https://scholarworks.bwise.kr/hanyang/handle/2021.sw.hanyang/179065 | - |
| dc.description.abstract | In a popular video broadcasting scheme, one of the major challenges is how to reduce a viewer's waiting time maintaining a given bandwidth allocation and how to reduce a client's buffer requirement. In order to solve these problems, many significant broadcasting schemes had been proposed. Among them, the harmonic broadcasting scheme has the best performance for viewer's waiting time and staircase broadcasting scheme has the best performance for client's buffer requirement. However, these previously proposed broadcasting schemes required managing many segments of a video and frequency of channel hopping as well as using many channels at the same time. These complexities make it difficult to implement. In this paper, we propose a fast staggered broadcasting scheme which has simple structure and channel efficiency in a given bandwidth. By comparing with other previously proposed broadcasting schemes, the proposed scheme is substantially reduced dividing segments of a video, a number of managing channels and frequency of channel hopping. Moreover, the proposed scheme is achieved significant bandwidth efficiency in viewer's waiting time and buffer requirement. The numerical results demonstrate that viewer's waiting time of the fast staggered broadcasting scheme converge to that of harmonic scheme as the bandwidth is increased and buffer requirements of this can be decreased below that of staircase scheme by adjusting a short front part of a video sizes. ? 2008 Springer Berlin Heidelberg. | - |
| dc.format.extent | 10 | - |
| dc.language | 영어 | - |
| dc.language.iso | ENG | - |
| dc.publisher | Springer Verlag | - |
| dc.title | Simple and efficient fast staggered data broadcasting scheme for popular video services | - |
| dc.type | Article | - |
| dc.publisher.location | 미국 | - |
| dc.identifier.doi | 10.1007/978-3-540-89524-4_69 | - |
| dc.identifier.scopusid | 2-s2.0-58049096431 | - |
| dc.identifier.bibliographicCitation | Lecture Notes in Computer Science, v.5200 LNCS, pp 699 - 708 | - |
| dc.citation.title | Lecture Notes in Computer Science | - |
| dc.citation.volume | 5200 LNCS | - |
| dc.citation.startPage | 699 | - |
| dc.citation.endPage | 708 | - |
| dc.type.docType | Conference Paper | - |
| dc.description.isOpenAccess | N | - |
| dc.description.journalRegisteredClass | scopus | - |
| dc.subject.keywordPlus | Bandwidth | - |
| dc.subject.keywordPlus | Efficiency | - |
| dc.subject.keywordPlus | Stairs | - |
| dc.subject.keywordPlus | Buffer requirements | - |
| dc.subject.keywordPlus | Channel efficiency | - |
| dc.subject.keywordPlus | Simple structures | - |
| dc.subject.keywordPlus | Staggered broadcasting | - |
| dc.subject.keywordPlus | Waiting-time | - |
| dc.subject.keywordPlus | Broadcasting | - |
| dc.subject.keywordAuthor | Broadcasting | - |
| dc.subject.keywordAuthor | Buffer requirement | - |
| dc.subject.keywordAuthor | Channel efficiency | - |
| dc.subject.keywordAuthor | Fast staggered broadcasting scheme | - |
| dc.subject.keywordAuthor | Simple structure | - |
| dc.subject.keywordAuthor | Waiting time | - |
| dc.identifier.url | https://link.springer.com/chapter/10.1007/978-3-540-89524-4_69 | - |
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.
222, Wangsimni-ro, Seongdong-gu, Seoul, 04763, Korea+82-2-2220-1366
COPYRIGHT © 2024 HANYANG UNIVERSITY.
Certain data included herein are derived from the © Web of Science of Clarivate Analytics. All rights reserved.
You may not copy or re-distribute this material in whole or in part without the prior written consent of Clarivate Analytics.
