Parallelizing peer-to-peer overlays with multi-destination routing

Citation

Buford J, Brown A & Kolberg M (2007) Parallelizing peer-to-peer overlays with multi-destination routing. In: 4th IEEE Conference on Consumer Communications and Networking (CCNC), 2007. 4th IEEE Conference on Consumer Communications and Networking (CCNC), 2007, Las Vegas, NV, USA, 11.01.2007-13.01.2007. Piscataway, NJ: IEEE, pp. 540-545. http://ieeexplore.ieee.org/xpl/freeabs_all.jsp?arnumber=4199200&abstractAccess=no&userType=inst; https://doi.org/10.1109/CCNC.2007.112

Abstract
Distributed Hash Tables (DHTs) are the basic indexing mechanism for decentralized peer-to-peer systems. How to obtain best performance in a large-scale wide area context for DHT operations is an important question. Here we introduce parallelization of overlay and DHT operations using native multi-destination multicasting, resulting in significant message traffic reduction for both overlay maintenance and lookup operations. We show through simulation savings of up to 30% message reduction for the 1-hop EpiChord peer-to-peer overlay.