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.
