Skip to main content

Distributed Object Location with Queue Management Provision in Peer-to-Peer Content Management Systems

  • Conference paper
Networking - ICN 2005 (ICN 2005)

Part of the book series: Lecture Notes in Computer Science ((LNCCN,volume 3421))

Included in the following conference series:

  • 547 Accesses

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. http://www.contentmanager.eu.com/

  2. http://www.napster.com

  3. Rowstron, A., Druschel, P.: Pastry: Scalable, decentralized object location, and routing for large-scale peer-to-peer systems. In: Guerraoui, R. (ed.) Middleware 2001. LNCS, vol. 2218, pp. 329–350. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  4. Zhao, B.Y., Kubiatowicz, J.D., Joseph, A.D.: Tapestry: An infrastructure for fault tolerant wide-area location and routing. Technical Report UCB/CSD-01-1141, UC Berkeley (2001)

    Google Scholar 

  5. Stoica, I., Morris, R., Karger, D., Kaashoek, M.F., Balakrishnan, H., C.: A scalable peer-to-peer lookup service for Internet applications. In: Proceedings of the 2001 ACM SIGCOMM Conference, San Diego, California, USA, pp. 149–160 (2001)

    Google Scholar 

  6. Ratnasamy, S., Francis, P., Handley, M., Karp, R., Shenker, S.: A scalable content-addressable network. In: Proceedings of ACM SIGCOMM, August 2001, pp. 161–172 (2001)

    Google Scholar 

  7. http://gnutella.wego.com

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Stathopoulos, V.M., Dragios, N.D., Mitrou, N.M. (2005). Distributed Object Location with Queue Management Provision in Peer-to-Peer Content Management Systems. In: Lorenz, P., Dini, P. (eds) Networking - ICN 2005. ICN 2005. Lecture Notes in Computer Science, vol 3421. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-31957-3_72

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-31957-3_72

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-25338-9

  • Online ISBN: 978-3-540-31957-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics