Bradler, Dirk ; Kangasharju, Jussi ; Mühlhäuser, Max (2009)
Optimally Efficient Multicast in Structured Peer-to-Peer Networks.
doi: 10.1109/CCNC.2009.4784805
Konferenzveröffentlichung, Bibliographie
Kurzbeschreibung (Abstract)
The Distributed Tree Construction (DTC) algorithm is designed for optimally efficient multicast tree construction over structured peer-to-peer networks. It achieves this by creating a spanning tree over the peers in the multicast group, using only information available locally on each peer. Furthermore, we show that the tree depth has the same upper bound as a regular DHT lookup which in turn guarantees fast and responsive runtime behavior. Our DTC algorithm is DHT-agnostic and works with most existing DHTs. We evaluate the performance of DTC over several DHTs by comparing the performance to existing application-level multicast solutions, we show that DTC sends 30–250% fewer messages than common solutions.
| Typ des Eintrags: | Konferenzveröffentlichung |
|---|---|
| Erschienen: | 2009 |
| Autor(en): | Bradler, Dirk ; Kangasharju, Jussi ; Mühlhäuser, Max |
| Art des Eintrags: | Bibliographie |
| Titel: | Optimally Efficient Multicast in Structured Peer-to-Peer Networks |
| Sprache: | Deutsch |
| Publikationsjahr: | Januar 2009 |
| Buchtitel: | Consumer Communications and Networking Conference, 2009. CCNC 2009. 6th IEEE |
| DOI: | 10.1109/CCNC.2009.4784805 |
| Zugehörige Links: | |
| Kurzbeschreibung (Abstract): | The Distributed Tree Construction (DTC) algorithm is designed for optimally efficient multicast tree construction over structured peer-to-peer networks. It achieves this by creating a spanning tree over the peers in the multicast group, using only information available locally on each peer. Furthermore, we show that the tree depth has the same upper bound as a regular DHT lookup which in turn guarantees fast and responsive runtime behavior. Our DTC algorithm is DHT-agnostic and works with most existing DHTs. We evaluate the performance of DTC over several DHTs by comparing the performance to existing application-level multicast solutions, we show that DTC sends 30–250% fewer messages than common solutions. |
| Freie Schlagworte: | DHT lookup; DTC algorithm; application-level multicast solutions;distributed tree construction algorithm; multicast group; optimally efficient multicast;spanning tree; structured peer-to-peer networks; multicast communication;peer-to-peer computing; |
| ID-Nummer: | TUD-CS-2009-1891 |
| Fachbereich(e)/-gebiet(e): | 20 Fachbereich Informatik 20 Fachbereich Informatik > Telekooperation |
| Hinterlegungsdatum: | 31 Dez 2016 12:59 |
| Letzte Änderung: | 14 Jun 2021 06:14 |
| PPN: | |
| Zugehörige Links: | |
| Export: | |
| Suche nach Titel in: | TUfind oder in Google |
 |
Frage zum Eintrag |
Optionen (nur für Redakteure)
 |
Redaktionelle Details anzeigen |
Drucken
Impressum