Chord: a scalable peer-to-peer lookup protocol for internet applications
IEEE/ACM Transactions on Networking (TON)
One hop lookups for peer-to-peer overlays
HOTOS'03 Proceedings of the 9th conference on Hot Topics in Operating Systems - Volume 9
Efficient routing for peer-to-peer overlays
NSDI'04 Proceedings of the 1st conference on Symposium on Networked Systems Design and Implementation - Volume 1
D1HT: a distributed one hop hash table
IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
Hi-index | 0.00 |
In todays Internet, a trend towards distributed content delivery systems can be observed. These systems still have to offer the same functionality as centralized architectures, e.g. content localization. While several advantages like load distribution and cost reduction could be gained by using a decentralized distribution platform, they come with a tradeoff in resource consumption. In this paper, we analyze and evaluate a decentralized Content Distribution Application (CDA) with respect to the time needed to locate specific content. We introduce a node model based on queueing theory and provide methods to compute important characteristics like the mean search time. In this model, we do not only consider the external offered load, but also the internal traffic created as a consequence of decentralization.