Abstract | ||
---|---|---|
P2P networking is a distributed model where entities play both the client and server role. One major problem addressed in this model is the discovery, searching and routing in a dynamic distributed environment. Among the different envisaged solutions, Distributed Hash Tables (DHT) are very promising. They allow the build of robust content addressable networks. Despite good theoretical performance properties, infrastructures which implement the model need a performance management framework able to monitor them in case of a concrete deployment. In this article we propose a generic performance management information model for DHTs. Our contribution uses a standard management approach based on the Common Information Model (CIM) Metric model. |
Year | DOI | Venue |
---|---|---|
2005 | 10.1007/0-387-31170-X_17 | International Federation for Information Processing |
Keywords | Field | DocType |
Peer-to-Peer,network management,performance,information model,Common Information Model (CIM),distributed hash tables | Hash tree,Double hashing,Computer science,Merkle tree,Hash function,Consistent hashing,Hash chain,Hash list,Database,Secure Hash Algorithm,Distributed computing | Conference |
Volume | ISSN | Citations |
196 | 1571-5736 | 0 |
PageRank | References | Authors |
0.34 | 16 | 3 |
Name | Order | Citations | PageRank |
---|---|---|---|
Guillaume Doyen | 1 | 98 | 13.25 |
Emmanuel Nataf | 2 | 53 | 8.77 |
Olivier Festor | 3 | 665 | 85.40 |