Kangasharju, Jaakko ; Kangasharju, Jussi (2006)
An Optimal Basis for Efficient Peer-to-Peer Content Distribution.
15th International Conference on Computer Communications and Networks. Arlington, VA, USA (09.10.2006-11.10.2006)
doi: 10.1109/ICCCN.2006.286324
Konferenzveröffentlichung, Bibliographie
Kurzbeschreibung (Abstract)
Peer-to-peer content distribution has become extremely popular, thanks to its highly scalable performance. In this paper, we derive a lower bound on the performance of chunk-based peer-to-peer content distribution systems and develop an algorithm that is within 1 round of the lower bound in special cases, and within 1 + log 2 2 (I) rounds in the general case, where I is the number of peers. We consider the performance of our algorithm also in a heterogeneous bandwidth environment and under churn. We show that our algorithm always achieves good performance and does not impose an undue burden on fast peers, thus providing a natural incentive for all peers to participate.
| Typ des Eintrags: | Konferenzveröffentlichung |
|---|---|
| Erschienen: | 2006 |
| Autor(en): | Kangasharju, Jaakko ; Kangasharju, Jussi |
| Art des Eintrags: | Bibliographie |
| Titel: | An Optimal Basis for Efficient Peer-to-Peer Content Distribution |
| Sprache: | Englisch |
| Publikationsjahr: | 2006 |
| Ort: | New York, NY, USA |
| Verlag: | IEEE Press |
| Buchtitel: | Proceedings of 15th International Conference on Computer Communications and Networks |
| Veranstaltungstitel: | 15th International Conference on Computer Communications and Networks |
| Veranstaltungsort: | Arlington, VA, USA |
| Veranstaltungsdatum: | 09.10.2006-11.10.2006 |
| DOI: | 10.1109/ICCCN.2006.286324 |
| Kurzbeschreibung (Abstract): | Peer-to-peer content distribution has become extremely popular, thanks to its highly scalable performance. In this paper, we derive a lower bound on the performance of chunk-based peer-to-peer content distribution systems and develop an algorithm that is within 1 round of the lower bound in special cases, and within 1 + log 2 2 (I) rounds in the general case, where I is the number of peers. We consider the performance of our algorithm also in a heterogeneous bandwidth environment and under churn. We show that our algorithm always achieves good performance and does not impose an undue burden on fast peers, thus providing a natural incentive for all peers to participate. |
| Fachbereich(e)/-gebiet(e): | 20 Fachbereich Informatik |
| Hinterlegungsdatum: | 20 Nov 2008 08:24 |
| Letzte Änderung: | 03 Dez 2024 11:24 |
| PPN: | |
| Export: | |
| Suche nach Titel in: | TUfind oder in Google |
 |
Frage zum Eintrag |
Optionen (nur für Redakteure)
 |
Redaktionelle Details anzeigen |
Drucken
Impressum