Virtual landmarking for locality aware peer IDs

In Peer-to-Peer (P2P) networks, it is often desirable to assign node IDs which preserve locality relationships in the underlying topology. Node locality can be embedded into node IDs by utilizing a one dimensional mapping by a Hilbert space filling curve on a vector of network distances from each node to a subset of reference landmark nodes within the network. However this approach is fundamentally limited because while robustness and accuracy might be expected to improve with the number of landmarks, the effectiveness of 1 dimensional Hilbert Curve mapping falls for the curse of dimensionality. This work proposes an approach to solve this issue using Landmark Multidimensional Scaling (LMDS) to reduce a large set of landmarks to a smaller set of virtual landmarks. This smaller set of landmarks has been postulated to represent the intrinsic dimensionality of the network space and therefore a space filling curve applied to these virtual landmarks is expected to produce a better mapping of the node ID space. The proposed approach, the Virtual Landmarks Hilbert Curve (VLHC), is particularly suitable for decentralised systems like P2P networks. In the experimental simulations the effectiveness of the methods is measured by means of the locality preservation derived from node IDs in terms of latency to nearest neighbours. A variety of realistic network topologies are simulated and this work provides strong evidence to suggest that VLHC performs better than either Hilbert Curves or LMDS use independently of each other.

[1]  Mohammed Gharib,et al.  A Novel Method for Supporting Locality in Peer-to-Peer Overlays Using Hypercube Topology , 2010, 2010 International Conference on Intelligent Systems, Modelling and Simulation.

[2]  Ibrahim Matta,et al.  BRITE: an approach to universal topology generation , 2001, MASCOTS 2001, Proceedings Ninth International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems.

[3]  Cheng-Zhong Xu,et al.  Hash-based proximity clustering for load balancing in heterogeneous DHT networks , 2006, Proceedings 20th IEEE International Parallel & Distributed Processing Symposium.

[4]  John W. Sammon,et al.  A Nonlinear Mapping for Data Structure Analysis , 1969, IEEE Transactions on Computers.

[5]  Zhongcheng Li,et al.  Locality-Aware Consistency Maintenance for Heterogeneous P2P Systems , 2007, 2007 IEEE International Parallel and Distributed Processing Symposium.

[6]  Min Cai,et al.  RDFPeers: a scalable distributed RDF repository based on a structured peer-to-peer network , 2004, WWW '04.

[7]  John Platt,et al.  FastMap, MetricMap, and Landmark MDS are all Nystrom Algorithms , 2005, AISTATS.

[8]  R. Shepard The analysis of proximities: Multidimensional scaling with an unknown distance function. II , 1962 .

[9]  H. V. Jagadish,et al.  Linear clustering of objects with multiple attributes , 1990, SIGMOD '90.

[10]  Mark Crovella,et al.  Virtual landmarks for the internet , 2003, IMC '03.

[11]  Christos Faloutsos,et al.  Analysis of the Clustering Properties of the Hilbert Space-Filling Curve , 2001, IEEE Trans. Knowl. Data Eng..

[12]  Tarek F. Abdelzaher,et al.  A scalable logical coordinates framework for routing in wireless sensor networks , 2004, 25th IEEE International Real-Time Systems Symposium.

[13]  Mark Handley,et al.  Topologically-aware overlay construction and server selection , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.