Video-on-demand based on delayed-multicast: Algorithmic support

Glinos, N; Hoang, DB; Nguyen, C; Symvonis, A

Video-on-demand based on delayed-multicast: Algorithmic support

Glinos, N Hoang, DB

Nguyen, C Symvonis, A

Permalink

Publication Type:: Journal Article
Citation:: Computer Journal, 2004, 47 (5), pp. 545 - 559
Issue Date:: 2004-09-21

Closed Access

	Filename	Description	Size
	2004000167.pdf		1.34 MB	Adobe PDF	View/Open

Copyright Clearance Process

Recently Added
In Progress
Closed Access

This item is closed access and not available.

Full metadata record

Field	Value	Language
dc.contributor.author	Glinos, N	en_US
dc.contributor.author	Hoang, DB https://orcid.org/0000-0003-1798-4926	en_US
dc.contributor.author	Nguyen, C	en_US
dc.contributor.author	Symvonis, A	en_US
dc.date.issued	2004-09-21	en_US
dc.identifier.citation	Computer Journal, 2004, 47 (5), pp. 545 - 559	en_US
dc.identifier.issn	0010-4620	en_US
dc.identifier.uri	http://hdl.handle.net/10453/3974
dc.description.abstract	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. © The British Computer Society; all rights reserved.	en_US
dc.relation.ispartof	Computer Journal	en_US
dc.relation.isbasedon	10.1093/comjnl/47.5.545	en_US
dc.subject.classification	Computation Theory & Mathematics	en_US
dc.title	Video-on-demand based on delayed-multicast: Algorithmic support	en_US
dc.type	Journal Article
utslib.citation.volume	5	en_US
utslib.citation.volume	47	en_US
utslib.for	0803 Computer Software	en_US
utslib.for	08 Information and Computing Sciences	en_US
pubs.embargo.period	Not known	en_US
pubs.organisational-group	/University of Technology Sydney
pubs.organisational-group	/University of Technology Sydney/Faculty of Engineering and Information Technology
pubs.organisational-group	/University of Technology Sydney/Faculty of Engineering and Information Technology/School of Electrical and Data Engineering
utslib.copyright.status	closed_access
pubs.issue	5	en_US
pubs.publication-status	Published	en_US
pubs.volume	47	en_US

Abstract:

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. © The British Computer Society; all rights reserved.

Please use this identifier to cite or link to this item:

http://hdl.handle.net/10453/3974