EPDKS: an efficient proximity-based distributed $K$-ary structured overlay network. ... In this paper we present EPDKS, a novel structured peer-to-peer overlay network that is based on the distributed K-ary search principle. EPDKS takes proximity into account by combining round-trip times and the number of IP hops for interconnecting peers, thereby reducing end-to-end latencies and making effective use of the underlying network. Furthermore, we propose improvements for some of the algorithms currently implemented in the DKS. Simulation results confirm our expectations that EPDKS ensures lower end-to-end latencies and smaller number of IP hops when compared to DKS.
Keywords for this software
References in zbMATH (referenced in 1 article , 1 standard article )
Showing result 1 of 1.
- Alima, Luc Onana; Beauport, Stefan: EPDKS: an efficient proximity-based distributed (K)-ary structured overlay network (2007)