Range queries over skip tree graphs

Resource discovery for distributed computing systems: A comprehensive survey

“…As examples of these approaches we can mention CANbased protocols (e.g., CAN [61,319,320], RT-CAN [321], PID-CAN [322]), MAAN [323], Mercury [66,324], Armada [325], Murk [326], Skip-Tree [327], SWORD [328], Node-Wiz [108] and MatchTree [48]. Moreover, a comprehensive survey on multi-dimensional methods and techniques can be found in [329].…”

Adaptive Agent-Based Self-Organization for Robust Hierarchical Topologies

“…Hierarchies can also be useful for other types of applications, such as video streaming [15], security [9] and distributed databases [5]. The main challenge in using hierarchical topologies is how the uncertainties of distributed environments influence the topology and the application that uses it.…”

“…However, it only utilizes stable nodes, excluding others from the system. Similarly, in [5], the tree overlay is based on skip graphs and is able to perform complex range queries over multidimensional data. This approach requires additional complex mechanisms for load-balancing and healing.…”

“…These topologies can be used in a wide range of applications [5,9,13,14,15]. Robustness refers to the fact that the hierarchical topology must be dynamic, adaptive, reconfigurable and finally selforganized to (i) handle the changes of the underlying distributed environment and (ii) reflect the application requirements.…”

Multi-level reconfigurable self-organization in overlay services

“…Application examples include routing, search, aggregation, information dissemination and decision-making in domains such as multimedia multicasting [Birrer and Bustamante, 2007], distributed databases [González-Beltrán et al, 2008] and demand-side energy management [Palensky and Dietrich, 2011].…”