An Evaluation of Chord and Pastry Models in OverSim
Jamie Furness, Mario Kolberg, Marwan M. Fayed
Abstract
Jamie Furness, Mario Kolberg, Marwan M. Fayed
Abstract
Peer-to-peer (P2P) simulation frameworks are excellent tools for developing and testing P2P algorithms, however there has been very little work done on validation of the models within these frameworks. Validation of these models is an important issue, as without knowing the models are valid we can not necessarily rely on the results generated using such models. In this work we provide an independent evaluation of both the Chord and Pastry Distributed Hash Table (DHT) models within OverSim, and validate the models by comparison against results presented in the original Chord and Pastry papers.
OpenAlex reports 4 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
Peer-to-peer (P2P) simulation frameworks are excellent tools for developing and testing P2P algorithms, however there has been very little work done on validation of the models within these frameworks. Validation of these models is an important issue, as without knowing the models are valid we can not necessarily rely on the results generated using such models. In this work we provide an independent evaluation of both the Chord and Pastry Distributed Hash Table (DHT) models within OverSim, and validate the models by comparison against results presented in the original Chord and Pastry papers.
Key concepts: Pastry, Chord (peer-to-peer), Distributed hash table, Hash table, Computer science, Hash function, Information retrieval, Theoretical computer science