Skip to main content

Heuristic Solutions for a Mapping Problem in a TV-Anytime Server Network

  • Conference paper
  • First Online:
Parallel and Distributed Processing (IPDPS 2000)

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

Included in the following conference series:

  • 908 Accesses

Abstract

This paper presents a novel broadband multimedia service called TV-Anytime. The basic idea of this service is to store broadcast media assets onto media server systems and allow clients to access these streams at any time. We propose a hierarchical structure of a distributed server network to support a high quality TV-anytime service. A key issue, how to map the media assets onto such a hierarchical server network is addressed and formalized as a combinatorial optimization problem. In order to solve this optimization problem, a set of heuristic solutions by use of a parallel simulated annealing library is proposed and verified by a set of benchmark instances. Finally, the TV Cache is presented as a prototype of a scalable TV-Anytime system.

This research was partly supported by a grant from Siemens AG, München and Axcent Media AG, Paderborn in the framework of the project HiQoS - High Performance Multimedia Services with Quality of Service Guarantees.

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

Access this chapter

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

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.

Similar content being viewed by others

References

  1. F. Cortes Gomez, Reinhard Lüling. A Parallel Continuous Media Server for Internet Environments. Proc. of International Conference on High-Performance Computing and Networking(HPCN Europe’98), Lecture Notes in Computer Science, 1998, pp.78–86.

    Google Scholar 

  2. Reinhard Lüling. Hierarchical Video-on-Demand Servers for TV-Anytime Services, Proc. of 8th International Conference on Computer Communications and Networks (IC3N), Boston, Massachusetts, IEEE Press, 1999, pp.110–117.

    Google Scholar 

  3. ReplayTV: http://www.replay.com.

  4. Tivo: http://www.tivo.com.

  5. D.L. Eager, M.K. Vernon, J. Zahorjan. Minimizing Bandwidth Requirements for On-Demand Data Delivery. Tech. Report #4105, Computer Science Dept., University of Wisconsin-Madison, Aug. 1999.

    Google Scholar 

  6. L.W. Dowdy, D.V. Foster. Comparative Models of the File Assignment Problem. Computing Surveys, Vol.14, No.2, 1982.

    Google Scholar 

  7. S. Kirkpatrick, C.D. Gelatt, M.P. Vecchi. Optimization by Simulated Annealing. Science, Vol.220, No.4598, May 1983, pp.671–680.

    Article  MathSciNet  Google Scholar 

  8. S. Tschoeke, G. Kliewer. The parSA Parallel Simulated Annealing Library. Technical Report, Department of Mathematics and Computer Science, University of Paderborn, http://www.uni-paderborn.de/~parsa.

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2000 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Zhou, X., Lüling, R., Xie, L. (2000). Heuristic Solutions for a Mapping Problem in a TV-Anytime Server Network. In: Rolim, J. (eds) Parallel and Distributed Processing. IPDPS 2000. Lecture Notes in Computer Science, vol 1800. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45591-4_28

Download citation

  • DOI: https://doi.org/10.1007/3-540-45591-4_28

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-45591-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics