Abstract: One of the core problems of P2P computing is resource locating. The main research results of determined resource locating algorithms are four distributed hash table algorithms, i.e: CAN, Chord, Pastry and Tapestry. Based on these algorithms, this paper presents a hierarchical and manageable resource locating model (HMRLM) which can provide P2P networks with scalability and manageability.
Publication Year: 2004
Publication Date: 2004-01-01
Language: en
Type: book-chapter
Indexed In: ['crossref']
Access and Citation
Cited By Count: 2
AI Researcher Chatbot
Get quick answers to your questions about the article from our AI researcher chatbot