Distributed object location with queue management provision in peer-to-peer content management systems

Authors:
Vassilios M. Stathopoulos;Nikolaos D. Dragios;Nikolas M. Mitrou
Affiliations:
National Technical University of Athens, Zographou, Athens, Greece;National Technical University of Athens, Zographou, Athens, Greece;National Technical University of Athens, Zographou, Athens, Greece
Venue:
ICN'05 Proceedings of the 4th international conference on Networking - Volume Part II
Year:
2005

Citing 4
Cited 0

Chord: A scalable peer-to-peer lookup service for internet applications

Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
A scalable content-addressable network

Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems

Middleware '01 Proceedings of the IFIP/ACM International Conference on Distributed Systems Platforms Heidelberg
Tapestry: An Infrastructure for Fault-tolerant Wide-area Location and

Tapestry: An Infrastructure for Fault-tolerant Wide-area Location and

Quantified Score

Hi-index	0.00

Visualization

Abstract

Content Management Systems (CMS) organize and facilitate collaborative content creation following a centralized approach to allow authorized requests from registered users. Distributed Content Management Systems (D-CMS) behave and manage content as a centralized system but they also identify remotely residing content inheriting properties from Peer-to-Peer systems. Herein the Tandem Search Algorithm is proposed as an efficient way to locate remote nodes that host requested data items in a D-CMS. Simulation shows the applicability of our algorithm and supports some architectural enhancements proposed for the network's nodes.