File Download
There are no files associated with this item.
Links for fulltext
(May Require Subscription)
- Publisher Website: 10.1109/INFOCOM.2007.193
- Scopus: eid_2-s2.0-51349168707
- Find via
Supplementary
-
Citations:
- Scopus: 0
- Appears in Collections:
Conference Paper: Multi-channel live P2P streaming: Refocusing on servers
Title | Multi-channel live P2P streaming: Refocusing on servers |
---|---|
Authors | |
Keywords | Boolean Functions Competition Computer Networks Distributed Computer Systems Electric Load Forecasting Internet Internet Service Providers Learning Algorithms Telecommunication Systems |
Issue Date | 2008 |
Publisher | I E E E, Computer Society. The Journal's web site is located at http://www.ieee-infocom.org/ |
Citation | Proceedings - Ieee Infocom, 2008, p. 2029-2037 How to Cite? |
Abstract | Due to peer instability and time-varying peer up-load bandwidth availability in live peer-to-peer (F2P) streaming channels, it is preferable to provision adequate levels of stable upload capacities at dedicated streaming servers, in order to guarantee the streaming quality in all channels. Most commercial P2P streaming systems have resorted to the practice of over-provisioning upload capacities on streaming servers. In this paper, we have performed a detailed analysis on 400 GB and 7 months of run-time traces from UUSee, a commercial P2P streaming system, and observed that available capacities on streaming servers are not able to keep up with the increasing demand imposed by hundreds of channels. We propose a novel online server capacity provisioning algorithm that proactively adjusts the server capacities available to each of the concurrent channels, such that the supply of server bandwidth in each channel dynamically adapts to the forecasted demand, taking into account the number of peers, the streaming quality, and the priorities of channels. The algorithm is able to learn over time, and has full ISP awareness to maximally constrain P2P traffic within ISP boundaries. To evaluate the effectiveness of our solution, our experimental studies are based on an implementation of the algorithm with actual channels of P2P streaming traffic, with real-world traces replayed within a server cluster. © 2008 IEEE. |
Persistent Identifier | http://hdl.handle.net/10722/92665 |
ISSN | 2023 SCImago Journal Rankings: 2.865 |
References |
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Wu, C | en_HK |
dc.contributor.author | Li, B | en_HK |
dc.contributor.author | Zhao, S | en_HK |
dc.date.accessioned | 2010-09-17T10:53:28Z | - |
dc.date.available | 2010-09-17T10:53:28Z | - |
dc.date.issued | 2008 | en_HK |
dc.identifier.citation | Proceedings - Ieee Infocom, 2008, p. 2029-2037 | en_HK |
dc.identifier.issn | 0743-166X | en_HK |
dc.identifier.uri | http://hdl.handle.net/10722/92665 | - |
dc.description.abstract | Due to peer instability and time-varying peer up-load bandwidth availability in live peer-to-peer (F2P) streaming channels, it is preferable to provision adequate levels of stable upload capacities at dedicated streaming servers, in order to guarantee the streaming quality in all channels. Most commercial P2P streaming systems have resorted to the practice of over-provisioning upload capacities on streaming servers. In this paper, we have performed a detailed analysis on 400 GB and 7 months of run-time traces from UUSee, a commercial P2P streaming system, and observed that available capacities on streaming servers are not able to keep up with the increasing demand imposed by hundreds of channels. We propose a novel online server capacity provisioning algorithm that proactively adjusts the server capacities available to each of the concurrent channels, such that the supply of server bandwidth in each channel dynamically adapts to the forecasted demand, taking into account the number of peers, the streaming quality, and the priorities of channels. The algorithm is able to learn over time, and has full ISP awareness to maximally constrain P2P traffic within ISP boundaries. To evaluate the effectiveness of our solution, our experimental studies are based on an implementation of the algorithm with actual channels of P2P streaming traffic, with real-world traces replayed within a server cluster. © 2008 IEEE. | en_HK |
dc.language | eng | en_HK |
dc.publisher | I E E E, Computer Society. The Journal's web site is located at http://www.ieee-infocom.org/ | en_HK |
dc.relation.ispartof | Proceedings - IEEE INFOCOM | en_HK |
dc.subject | Boolean Functions | en_HK |
dc.subject | Competition | en_HK |
dc.subject | Computer Networks | en_HK |
dc.subject | Distributed Computer Systems | en_HK |
dc.subject | Electric Load Forecasting | en_HK |
dc.subject | Internet | en_HK |
dc.subject | Internet Service Providers | en_HK |
dc.subject | Learning Algorithms | en_HK |
dc.subject | Telecommunication Systems | en_HK |
dc.title | Multi-channel live P2P streaming: Refocusing on servers | en_HK |
dc.type | Conference_Paper | en_HK |
dc.identifier.email | Wu, C:cwu@cs.hku.hk | en_HK |
dc.identifier.authority | Wu, C=rp01397 | en_HK |
dc.description.nature | link_to_subscribed_fulltext | - |
dc.identifier.doi | 10.1109/INFOCOM.2007.193 | en_HK |
dc.identifier.scopus | eid_2-s2.0-51349168707 | en_HK |
dc.relation.references | http://www.scopus.com/mlt/select.url?eid=2-s2.0-51349168707&selection=ref&src=s&origin=recordpage | en_HK |
dc.identifier.spage | 2029 | en_HK |
dc.identifier.epage | 2037 | en_HK |
dc.publisher.place | United States | en_HK |
dc.identifier.scopusauthorid | Wu, C=15836048100 | en_HK |
dc.identifier.scopusauthorid | Li, B=35248588700 | en_HK |
dc.identifier.scopusauthorid | Zhao, S=22137150800 | en_HK |
dc.identifier.issnl | 0743-166X | - |