Magic Square: Scalable Peer-to-Peer Lookup Protocol Considering Peer's Characteristics

One of the research problems in P2P computing is to look up and store the resource efficiently. The recent algorithms developed by several research groups for the lookup problem present a simple and general interface, a distributed hash table (DHT). In this paper, we propose Magic Square, a lookup protocol using a distributed hash table in p2p computing. A peer in Magic Square has the local routing table, which is constructed with bi-directed skip lists and reflects the computing power of peers on, and the global routing table, which consists of any peer in Magic Square. The operation of managing local routing tables in this paper is simpler than that of previous researches because of using skip lists. Magic Square using these simple operations adapts efficiently as peers join and leave the system. Results from simulations show that Magic Square is scalable, with communication cost and the state maintained by each peer scaling logarithmically with the number of peers. Keywords : resou...

• Type: Conference
• Year: 2003
• Where: CIC
• Authors: Sun-Mi Park, Il-dong Jung, Dong-joo Song, Young-sung Sun, Kyongsok Kim
• Keywords: CIC 2003, CIC 2008, Distributed Hash Table, Magic Square, Routing Tables