MCAN:A Scalable Modified Content-Addressable Network

A fundamental problem that confronts peer-to-peer application is to efficient locate the node that stored a particular data item. In this paper we introduce the concept of Scalable Modified Content -Addressable Network (MCAN) that combining Hash table and interesting cluster together and resolving the fundamental problem. We can locate requested data efficiently on MCAN system basing-on the interesting value of requested data. Results of theoretical analysis show that MCAN is scalable,fault-tolerant and completely self-organizing. We demonstrate its scalability and efficient routing properties through simulation.

[1]  Bruce M. Maggs,et al.  Efficient content location using interest-based locality in peer-to-peer systems , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[2]  Robert Morris,et al.  Chord: A scalable peer-to-peer lookup service for internet applications , 2001, SIGCOMM 2001.