File Download
There are no files associated with this item.
Links for fulltext
(May Require Subscription)
- Publisher Website: 10.1007/s00530-010-0185-x
- Scopus: eid_2-s2.0-77953360478
- WOS: WOS:000278027900003
- Find via
Supplementary
- Citations:
- Appears in Collections:
Article: InstantLeap: An architecture for fast neighbor discovery in large-scale P2P VoD streaming
Title | InstantLeap: An architecture for fast neighbor discovery in large-scale P2P VoD streaming |
---|---|
Authors | |
Keywords | Fast neighbor discovery Indexing overlay P2P streaming Video-on-demand |
Issue Date | 2010 |
Publisher | Springer Verlag. The Journal's web site is located at http://link.springer.de/link/service/journals/00530/index.htm |
Citation | Multimedia Systems, 2010, v. 16 n. 3, p. 183-198 How to Cite? |
Abstract | In large-scale peer-to-peer (P2P) video-on-demand (VoD) streaming applications, a fundamental challenge is to quickly locate new supplying peers whenever a VCR command is issued, in order to achieve smooth viewing experiences. For many existing commercial systems which use tracker servers for neighbor discovery, the increasing scale of P2P VoD systems has overloaded the dedicated servers to the point where they cannot accurately identify the suppliers with the desired content and bandwidth. To avoid overloading the servers and achieve instant neighbor discovery over the self-organizing P2P overlay, we design a novel method of organizing peers watching a video. The method features a light-weight indexing architecture to support efficient streaming and fast neighbor discovery at the same time. InstantLeap separates the neighbors at each peer into a streaming neighbor list and a shortcut neighbor list, for streaming and neighbor discovery respectively, which are maintained loosely but effectively based on random neighbor list exchanges. Our analysis shows that InstantLeap achieves an O(1) neighbor discovery efficiency upon any playback "leap" across the media stream in streaming overlays of any size, and low messaging costs for overlay maintenance upon peer join, departure, and VCR operations. We also verify our design with large-scale simulation studies of dynamic P2P VoD systems based on real-world settings. © Springer-Verlag 2010. |
Persistent Identifier | http://hdl.handle.net/10722/127356 |
ISSN | 2023 Impact Factor: 3.5 2023 SCImago Journal Rankings: 0.745 |
ISI Accession Number ID | |
References |
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Qiu, X | en_HK |
dc.contributor.author | Huang, W | en_HK |
dc.contributor.author | Wu, C | en_HK |
dc.contributor.author | Lau, FCM | en_HK |
dc.contributor.author | Lin, X | en_HK |
dc.date.accessioned | 2010-10-31T13:20:49Z | - |
dc.date.available | 2010-10-31T13:20:49Z | - |
dc.date.issued | 2010 | en_HK |
dc.identifier.citation | Multimedia Systems, 2010, v. 16 n. 3, p. 183-198 | en_HK |
dc.identifier.issn | 0942-4962 | en_HK |
dc.identifier.uri | http://hdl.handle.net/10722/127356 | - |
dc.description.abstract | In large-scale peer-to-peer (P2P) video-on-demand (VoD) streaming applications, a fundamental challenge is to quickly locate new supplying peers whenever a VCR command is issued, in order to achieve smooth viewing experiences. For many existing commercial systems which use tracker servers for neighbor discovery, the increasing scale of P2P VoD systems has overloaded the dedicated servers to the point where they cannot accurately identify the suppliers with the desired content and bandwidth. To avoid overloading the servers and achieve instant neighbor discovery over the self-organizing P2P overlay, we design a novel method of organizing peers watching a video. The method features a light-weight indexing architecture to support efficient streaming and fast neighbor discovery at the same time. InstantLeap separates the neighbors at each peer into a streaming neighbor list and a shortcut neighbor list, for streaming and neighbor discovery respectively, which are maintained loosely but effectively based on random neighbor list exchanges. Our analysis shows that InstantLeap achieves an O(1) neighbor discovery efficiency upon any playback "leap" across the media stream in streaming overlays of any size, and low messaging costs for overlay maintenance upon peer join, departure, and VCR operations. We also verify our design with large-scale simulation studies of dynamic P2P VoD systems based on real-world settings. © Springer-Verlag 2010. | en_HK |
dc.language | eng | en_HK |
dc.publisher | Springer Verlag. The Journal's web site is located at http://link.springer.de/link/service/journals/00530/index.htm | en_HK |
dc.relation.ispartof | Multimedia Systems | en_HK |
dc.rights | The original publication is available at www.springerlink.com | - |
dc.subject | Fast neighbor discovery | en_HK |
dc.subject | Indexing overlay | en_HK |
dc.subject | P2P streaming | en_HK |
dc.subject | Video-on-demand | en_HK |
dc.title | InstantLeap: An architecture for fast neighbor discovery in large-scale P2P VoD streaming | en_HK |
dc.type | Article | en_HK |
dc.identifier.openurl | http://library.hku.hk:4550/resserv?sid=HKU:IR&issn=0942-4962&volume=16&issue=3&spage=183&epage=198&date=2010&atitle=InstantLeap:+an+Architecture+for+Fast+Neighbor+Discovery+in+Large-scale+P2P+VoD+Streaming | en_HK |
dc.identifier.email | Wu, C:cwu@cs.hku.hk | en_HK |
dc.identifier.email | Lau, FCM:fcmlau@cs.hku.hk | en_HK |
dc.identifier.authority | Wu, C=rp01397 | en_HK |
dc.identifier.authority | Lau, FCM=rp00221 | en_HK |
dc.description.nature | link_to_subscribed_fulltext | - |
dc.identifier.doi | 10.1007/s00530-010-0185-x | en_HK |
dc.identifier.scopus | eid_2-s2.0-77953360478 | en_HK |
dc.identifier.hkuros | 175393 | en_HK |
dc.relation.references | http://www.scopus.com/mlt/select.url?eid=2-s2.0-77953360478&selection=ref&src=s&origin=recordpage | en_HK |
dc.identifier.volume | 16 | en_HK |
dc.identifier.issue | 3 | en_HK |
dc.identifier.spage | 183 | en_HK |
dc.identifier.epage | 198 | en_HK |
dc.identifier.isi | WOS:000278027900003 | - |
dc.publisher.place | Germany | en_HK |
dc.identifier.scopusauthorid | Qiu, X=35183905700 | en_HK |
dc.identifier.scopusauthorid | Huang, W=36080162400 | en_HK |
dc.identifier.scopusauthorid | Wu, C=15836048100 | en_HK |
dc.identifier.scopusauthorid | Lau, FCM=7102749723 | en_HK |
dc.identifier.scopusauthorid | Lin, X=8208832700 | en_HK |
dc.identifier.citeulike | 7192184 | - |
dc.identifier.issnl | 0942-4962 | - |