Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | 이춘화 | - |
dc.date.accessioned | 2019-11-20T22:05:16Z | - |
dc.date.available | 2019-11-20T22:05:16Z | - |
dc.date.issued | 2017-02 | - |
dc.identifier.citation | APPLIED SCIENCES-BASEL, v. 7, no. 2, Article no. 204 | en_US |
dc.identifier.issn | 2076-3417 | - |
dc.identifier.uri | https://repository.hanyang.ac.kr/handle/20.500.11754/112902 | - |
dc.identifier.uri | https://www.mdpi.com/2076-3417/7/2/204 | - |
dc.description.abstract | Recently, P2P streaming techniques have been a promising solution to a large-scale live streaming system because of their high scalability and low installation cost. In P2P live streaming systems, however, it is difficult to manage peers' buffers effectively, because they can buffer only a limited amount of data around a live broadcasting time in the main memory and suffer from long playback lag due to the nature of P2P structures. In addition, the number of peers decreases rapidly as the playback position moves further from this time by performing time-shifted viewing. These situations widen the distribution of peers' playback positions, thereby decreasing the degree of data duplication among peers. Moreover, it is hard to use each peer's buffer as the caching area because the buffer area where the chunks that have already been played back are stored can be overwritten at any time by new chunks that will arrive soon. In this paper, we therefore propose a novel buffering scheme to significantly increase data duplication in buffering periods among peers in P2P live and time-shifted streaming systems. In our proposed scheme, the buffer ratio of each peer is adaptively adjusted according to its relative playback position in a group by increasing the ratio of the caching area in its buffer as its playback position moves earlier in time and increasing the ratio of the prefetching area as its playback position moves later. Through extensive simulations, we demonstrate that our proposed adaptive buffering scheme outperforms the conventional buffering technique considerably in terms of startup delay, average jitter ratio, and the ratio of necessary chunks in a buffermap. | en_US |
dc.description.sponsorship | This research was supported by Basic Science Research Program through the National Research Foundation of Korea (NRF) funded by the Ministry of Education (2016R1D1A1A09917396) and by the MSIP (Ministry of Science, ICT & Future Planning), Korea, under the ITRC (Information Technology Research Center) support program (IITP-2016-H8501-16-1006) supervised by the IITP (Institute for Information & communications Technology Promotion). | en_US |
dc.language.iso | en_US | en_US |
dc.publisher | MDPI AG | en_US |
dc.subject | P2P live streaming | en_US |
dc.subject | time-shifted viewing | en_US |
dc.subject | adaptive buffering | en_US |
dc.subject | prefetching | en_US |
dc.subject | caching | en_US |
dc.title | An Adaptive Buffering Scheme for P2P Live and Time-Shifted Streaming | en_US |
dc.type | Article | en_US |
dc.relation.no | 2 | - |
dc.relation.volume | 7 | - |
dc.identifier.doi | 10.3390/app7020204 | - |
dc.relation.page | 1-14 | - |
dc.relation.journal | APPLIED SCIENCES-BASEL | - |
dc.contributor.googleauthor | Kim, Eunsam | - |
dc.contributor.googleauthor | Kim, Taeyoung | - |
dc.contributor.googleauthor | Lee, Choonhwa | - |
dc.relation.code | 2017009397 | - |
dc.sector.campus | S | - |
dc.sector.daehak | COLLEGE OF ENGINEERING[S] | - |
dc.sector.department | DEPARTMENT OF COMPUTER SCIENCE | - |
dc.identifier.pid | lee | - |
dc.identifier.researcherID | L-1691-2016 | - |
dc.identifier.orcid | http://orcid.org/0000-0002-6564-2392 | - |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.