Skip to main content

The Structure of Logically Hierarchical Cluster for the Distributed Multimedia on Demand

  • Conference paper
Advances in Multimedia Information Processing - PCM 2004 (PCM 2004)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 3333))

Included in the following conference series:

  • 1174 Accesses

Abstract

In this paper, we propose the structure of the logical hierarchical cluster for the distributed multimedia on demand according to block the nodes cache. The structure of the logical hierarchy is lazily maintained by all members in the decentralized manner. The global load balance is achieved as the root of each LHC is mapped into the system randomly. The LHC is expanded dynamically with the two application policies. The local load balance is applied to fine-tune the load of nodes of different LHCs within a local region. The integration of topology with resource management simplifies the server selection largely.

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. Shahabi, C., Banaei-Kashani, F.: Decentralized Resource Management for a Distributed Continuous Media Server. IEEE Transactions on Parallel and Distributed Systems 13, 1183–1200 (2002)

    Article  Google Scholar 

  2. Boutaba, R., Hafid, A.: A generic platform for scalable access to multimedia-ondemand systems. IEEE Journal Selected Areas in Communications 17, 1599–1613 (1999)

    Article  Google Scholar 

  3. Cheng-Fu, C., Golubchik, L., Lui, J.C.S.: Striping Doesn’t Scale: How to Achieve Scalability for Continuous Media Servers with Replication. In: Int. Conf. on Distributed Computing Systems, pp. 64–71 (2000)

    Google Scholar 

  4. Rowstron, A., Druschel, P.: Pastry: Scalable, decentralized object location and routing for large-scale peer-to-peer systems. In: Proceeding IFIP/ACM Middleware (2001)

    Google Scholar 

  5. Francis, P.: Yoid: Extending the internet multicast architecture. Unpublished paper (2000), available at http://www.aciri.org/yoid/docs/index.html

  6. Hua, K.A., Cai, Y., Sheu, S.: Patching: A Multicast Technique for True Video-on- Demand Services. In: Sixth ACM Int. Conf. Multimedia, pp. 191–200 (1998)

    Google Scholar 

  7. Zegura, E.W., Calvert, K.L., Bhattacharjee, S.: How to model an internetwork. In: INFOCOM 1996 (1996)

    Google Scholar 

  8. Nussbaumer, J.-P., Patel, B.V., Schaffa, F.: Multimedia delivery on demand: capacity analysis and implications. In: The 19th Conf. on Local Computer Networks, pp. 380–386 (1994)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Xiong, X., Yu, S., Zhou, J. (2004). The Structure of Logically Hierarchical Cluster for the Distributed Multimedia on Demand. In: Aizawa, K., Nakamura, Y., Satoh, S. (eds) Advances in Multimedia Information Processing - PCM 2004. PCM 2004. Lecture Notes in Computer Science, vol 3333. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30543-9_41

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-30543-9_41

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-23985-7

  • Online ISBN: 978-3-540-30543-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics