Control Systems and Computers

DOI: https://doi.org/10.15407/usim.2016.02.041

Upr. sist. maš., 2016, Issue 2 (262), pp. 41-47.

 UDC 004.75

A.V. Serhieiev, post-graduate student,  Taras Shevchenko National University of Kyiv, E-mail: a.serhieiev@gmail.com

The Technologies of the Data Retrieval in Peer-to-Peer Networks Constructed on the Basis of the Distributed Hash Tables

Introduction. The necessity of the large data sets processing, increasing the scalability and fault tolerance lead to the development of peer-to-peer networks, that require, unlike client-server architecture, the use of complex algorithms for data search. Thus, it is necessary to determine a peer-to-peer network with the optimal search algorithm according to the certain criteria.

Purpose. The purpose of this paper is to analyze the constructed peer-to-peer networks based on distributed hash tables and to determine the optimal network according to some metrics.

Methods. To determine the optimal system we have introduced the set of metrics, which correspond to the set of criteria’s which are critical to the systems comparison. The set of criteria’s is as follows: the number of steps in the search algorithm, the operation of calculating the «distance» between the elements of the network, and practical implementation of the system. Next, the criteria are ranked by importance and to each criterion there is a certain coefficient (weight) which is assigned so that the more important criterion strongly influences on the result than the less important. The linear convolution has been calculated for each system and the best system is the one which has the minimal result.

Results. According to the result of calculations, the optimal search criteria is proved by Kademlia system, primarily due to the unique metric of distance between elements of the network.

Conclusion. Analysis and comparison of peer-to-peer networks constructed on the basis of distributed hash tables, shows that, despite the fact that each of them is able to solve the problem of scalability and fault tolerance, the optimum system is Kademlia.

Download full text! (Russian).

Keywords: decentralized networks, ad hoc networks, distributed hash table.

1. Poryev, H.V., 2004. Metody ta zasoby pobudovy informatsiynykh tekhnolohiy na osnovi terytorialʹno rozoseredzhenykh servis-oriyentovanykh odnoranhovykh merezh: Dys. d-ra tekhn. nauk. K., 397 p. (In Ukrainian).
2. Florin, Pop, Valentin, Cristea.,2009. “DistHash: A robust P2P DHT-based system for replicated objects Ciprian Dobre”. Bucharest, Romania, May 26–29, 1, pp. 453-460.
3. Hardekopf, B., Kwiat, K., Upadhyaya, S., 2001. “A Decentralized Voting Algorithm for Increasing Dependability in Distributed Systems. 5th World MultiConference on Systemic”. Cybernetics and Informatics (SCI2001), pp. 3–5.
4. Stoica, I., Morris, R., Karger D. et al., 2003. “Chord: A scalable peer-to-peer lookup protocol for internet applications”. IEEE/ACM Transactions on Networking, 11 (1), pp. 17–32.
   https://doi.org/10.1109/TNET.2002.808407
5. Ratnasamy, S., Francis, P., Handley M. et al., 2001. “A scalable content-addressable network”. Proc. of ACM SIGCOMM. San Diego, CA (Aug. 2001), pp. 162–168.
   https://doi.org/10.1145/383059.383072
6. Balakrishnan, H., Kaashoek, M., Karger D. et al., 2003. Looking up data in p2p systems. Comm. ACM 46,2 (Feb. 2003).
   https://doi.org/10.1145/606272.606299
7. Rowstron, A., Druschel, P., 2001. Pastry: Scalable, distributed object location and routing for large-scale peer-to-peer systems. Proc. of the 18th IFIP/ACM Int’l Conf. on Distributed Systems Platforms (Nov. 2001), pp. 3–13.
   https://doi.org/10.1007/3-540-45518-3_18
8. Maymounkov, P., Mazieres, D., 2002. “Kademlia: A Peer-to-Peer Information System Based on the XOR Metric”. IPTPS 2002, 7-8 March 2002, pp. 2–9.
9. Hnatiyenko, H.M., Snytyuk, V.Ye., 2008. Ekspertni tekhnolohiyi pryynyattya rishen. K.: Maklaut, 444 p. (In Ukrainian).

Received 14.12.2015