Geo-LPM: An Efficient Scheme for Locating Nodes in the Internet
Hanh Le, Doan Bang Hoang, Andrew J. Simmonds · UTS ePRESS (University of Technology Sydney) · 2005
One of the major weaknesses of existing peer-to-peer networks is that their overlay structures do not reflect the underlying Internet topology, resulting in unnecessary consumption of network resources. We propose a Geographical Longest Prefix Matching (Geo-LPM) scheme to self-organise nodes into clusters using IP prefixes and network metric measurements. Geo-LPM efficiently locates nodes to produce superior overlays while optimising the usage of network resources. It is simple, scalable and self-organising.