zbMATH — the first resource for mathematics

EPDKS: an efficient proximity-based distributed \(K\)-ary structured overlay network. (English) Zbl 1157.68318
Zheng, S. Q. (ed.), Parallel and distributed computing systems. Proceedings of the 19th IASTED international conference (PDCS 2007), Cambridge, MA, USA, November 19–21, 2007. Calgary: International Association of Science and Technology for Development (IASTED); Anaheim, CA: Acta Press (ISBN 978-0-88986-704-8/CD-ROM). 472-477 (2007).
Summary: Structured peer-to-peer overlay networks provide a means for interconnecting a large set of computing nodes called peers in a distributed, scalable and self-organizing manner. Typically in such systems, each peer maintains contact information about a small subset of other peers called neighbors. These neighbors are often chosen to ensure that each lookup operation takes a logarithmic number of overlay hops under normal conditions. Relying solely on the number of overlay hops as the metric for the quality of the lookup operation is not sufficient both for the applications using the overlay network and, for the effective use of the underlying communication network which is typically the Internet.
DKS [Distributed \(K\)-ary System, http://dks.sics.se] is a P2P middleware built upon the principle we called distributed \(K\)-ary search, which ensures that any lookup takes \(O(\log_{K}(N))\) overlay hops, where \(N\) is the number of nodes in the system and \(K\) is the search arity. In a DKS overlay network, proximity is not considered. As a result, end-to-end latencies could be significantly large.
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.
For the entire collection see [Zbl 1154.68030].
68M14 Distributed systems