File Download
There are no files associated with this item.
Links for fulltext
(May Require Subscription)
- Publisher Website: 10.1109/ICC.2008.1049
- Scopus: eid_2-s2.0-51249124737
- Find via
Supplementary
-
Citations:
- Scopus: 0
- Appears in Collections:
Conference Paper: A peer grouping scheme for P2P file distribution networks
Title | A peer grouping scheme for P2P file distribution networks |
---|---|
Authors | |
Issue Date | 2008 |
Citation | Ieee International Conference On Communications, 2008, p. 5598-5602 How to Cite? |
Abstract | Peer-to-Peer networks leverage the upload bandwidth of leechers, which results in a significant improvement of scalability over that of client-server networks. Numerous P2P applications serve as overlay networks for file distribution. In evaluating the performance of such systems, file distribution time is an important metric. Based on fluid models, scheduling algorithms that allow files to be downloaded in a minimum time have been developed. To further improve the system performance, our objective is to reduce the leechers' average download time while maintaining the minimum download time. A grouping scheme is presented based on the bandwidth characteristics of the network. According to this optimization objective, we identify cases where it is beneficial to apply the grouping strategy. Simulation results show that applying grouping schemes in suitable cases brings in significant performance improvement over a wide range of networks of varying bandwidth characteristics. ©2008 IEEE. |
Persistent Identifier | http://hdl.handle.net/10722/158552 |
ISSN | 2023 SCImago Journal Rankings: 0.861 |
References |
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Ma, L | en_US |
dc.contributor.author | Wang, X | en_US |
dc.contributor.author | Lui, KS | en_US |
dc.date.accessioned | 2012-08-08T09:00:13Z | - |
dc.date.available | 2012-08-08T09:00:13Z | - |
dc.date.issued | 2008 | en_US |
dc.identifier.citation | Ieee International Conference On Communications, 2008, p. 5598-5602 | en_US |
dc.identifier.issn | 0536-1486 | en_US |
dc.identifier.uri | http://hdl.handle.net/10722/158552 | - |
dc.description.abstract | Peer-to-Peer networks leverage the upload bandwidth of leechers, which results in a significant improvement of scalability over that of client-server networks. Numerous P2P applications serve as overlay networks for file distribution. In evaluating the performance of such systems, file distribution time is an important metric. Based on fluid models, scheduling algorithms that allow files to be downloaded in a minimum time have been developed. To further improve the system performance, our objective is to reduce the leechers' average download time while maintaining the minimum download time. A grouping scheme is presented based on the bandwidth characteristics of the network. According to this optimization objective, we identify cases where it is beneficial to apply the grouping strategy. Simulation results show that applying grouping schemes in suitable cases brings in significant performance improvement over a wide range of networks of varying bandwidth characteristics. ©2008 IEEE. | en_US |
dc.language | eng | en_US |
dc.relation.ispartof | IEEE International Conference on Communications | en_US |
dc.title | A peer grouping scheme for P2P file distribution networks | en_US |
dc.type | Conference_Paper | en_US |
dc.identifier.email | Lui, KS:kslui@eee.hku.hk | en_US |
dc.identifier.authority | Lui, KS=rp00188 | en_US |
dc.description.nature | link_to_subscribed_fulltext | en_US |
dc.identifier.doi | 10.1109/ICC.2008.1049 | en_US |
dc.identifier.scopus | eid_2-s2.0-51249124737 | en_US |
dc.relation.references | http://www.scopus.com/mlt/select.url?eid=2-s2.0-51249124737&selection=ref&src=s&origin=recordpage | en_US |
dc.identifier.spage | 5598 | en_US |
dc.identifier.epage | 5602 | en_US |
dc.identifier.scopusauthorid | Ma, L=15923137600 | en_US |
dc.identifier.scopusauthorid | Wang, X=23476023600 | en_US |
dc.identifier.scopusauthorid | Lui, KS=7103390016 | en_US |
dc.identifier.issnl | 0536-1486 | - |