A scalable,locality aware,fault-tolerant,and decentralized location scheme for distributed networks

摘要

This paper presents Isotope,an efficient,locality aware,fault-tolerant,and decentralized scheme for data location in distributed networks.This scheme is designed based on the mathematical model of decentralized location services and thus has provable correctness and performance.In Isotope,each node needs to only maintain linkage information with about OMICRON(log n)other nodes and any node can be reached within OMICRON(log n)routing hops.Compared with other related schemes,Isotope ' s average locating path length is only half that of Chord,and its locating performance and locality-awareness are similar to that of Pastry and Tapestry.In addition,Isotope is more suitable for constantly changing networks because it needs to exchange only OMICRON(log n)OMICRON(log n)messages to update the routing information for nodes arrival,departure and failure.