Advertisement

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

  • Xiaobo Zhou
  • Reinhard Lüling
  • Li Xie
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1800)

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.

Keywords

Server Network Access Pattern Heuristic Solution Mapping Problem Benchmark Instance 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [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. [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. [3]
  4. [4]
  5. [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. [6]
    L.W. Dowdy, D.V. Foster. Comparative Models of the File Assignment Problem. Computing Surveys, Vol.14, No.2, 1982.Google Scholar
  7. [7]
    S. Kirkpatrick, C.D. Gelatt, M.P. Vecchi. Optimization by Simulated Annealing. Science, Vol.220, No.4598, May 1983, pp.671–680.CrossRefMathSciNetGoogle Scholar
  8. [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.

Copyright information

© Springer-Verlag Berlin Heidelberg 2000

Authors and Affiliations

  • Xiaobo Zhou
    • 1
  • Reinhard Lüling
    • 1
  • Li Xie
    • 2
  1. 1.Paderborn Center for Parallel ComputingUniversity of PaderbornPaderbornGermany
  2. 2.Department of Computer ScienceNanjing UniversityP.R.China

Personalised recommendations