Skip Navigation

The Computer Journal 2004 47(5):545-559; doi:10.1093/comjnl/47.5.545
© 2004 by British Computer Society
This Article
Right arrow Full Text (PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Glinos, N.
Right arrow Articles by Symvonis, A.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

Video-on-Demand Based on Delayed-Multicast: Algorithmic Support

N. Glinos1 *, D. B. Hoang2 §, C. Nguyen2 ¶ and A. Symvonis3 {ddagger}

1 Department of Mathematics, University of Ioannina, 45110 Ioannina, Greece, 2 Department of Computer Systems, University of Technology, Sydney NSW 2007, Australia, 3 Department of Mathematics, National Technical University of Athens, Zografou Campus, 15780 Athens, Greece

In this paper, we examine algorithmic issues related to the delayed multicast technique for video-on-demand delivery. We introduce the minimum total memory (MTM), minimum total traffic (MTT) and the minimum maximum memory per node (MMMN) delayed-multicast allocation problems. We examine these problems on two networks of practical interest, namely, the chandelier and the broom networks. We provide polynomial time algorithms for solving the MTM and the MTT problems on the chandelier network and the MTM problem on the broom network. We also show that a version of the decision-MMMN problem on a general graph is NP-complete. Finally, we present a heuristic method for obtaining a solution for the MTM problem on tree networks.

Received 10 February 2003. Revised 17 February 2004.

* Email: nglinos{at}cc.uoi.gr

§ Email: dhoang{at}it.uts.edu.au

Email: chi{at}it.uts.edu.au

{ddagger} Email: symvonis{at}math.ntua.gr


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?




Disclaimer:
Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.