Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
4955929 | Journal of Network and Computer Applications | 2017 | 36 Pages |
Abstract
This paper presents Fractal, a fully decentralized and highly scalable multidimensional range query lookup protocol for distributed systems. In this work, to organize the available nodes in the system, an n-dimensional space called Key Space is utilized. The available nodes on the nested Fractal rings maintain information about only O(logN) other nodes, and the Fractal lookup protocol discovers the destination node through these nested rings with a logarithmic cost. Because of its flexibility, Fractal allows the system to create a concept called Layering, which minimizes the probability of the wide-area message transfers (WAMTs) during the lookup process. Using several criteria, Fractal is compared with several successful methods that have recently been presented. Simulation results show the efficiency and performance of Fractal in networks of different sizes.
Keywords
Related Topics
Physical Sciences and Engineering
Computer Science
Computer Networks and Communications
Authors
Saeed Kargar, Leyli Mohammad-Khanli,