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

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

dc.contributor.author	Glinos, N	en
dc.contributor.author	Hoang, DB	en
dc.contributor.author	Nguyen, C	en
dc.contributor.author	Symvonis, A	en
dc.date.accessioned	2014-03-01T01:21:41Z
dc.date.available	2014-03-01T01:21:41Z
dc.date.issued	2004	en
dc.identifier.issn	0010-4620	en
dc.identifier.uri	https://dspace.lib.ntua.gr/xmlui/handle/123456789/16316
dc.subject	Heuristic Method	en
dc.subject	Polynomial Time Algorithm	en
dc.subject	Tree Network	en
dc.subject	Video On Demand	en
dc.subject.classification	Computer Science, Hardware & Architecture	en
dc.subject.classification	Computer Science, Information Systems	en
dc.subject.classification	Computer Science, Software Engineering	en
dc.subject.other	Algorithms	en
dc.subject.other	Computational complexity	en
dc.subject.other	Graph theory	en
dc.subject.other	Heuristic methods	en
dc.subject.other	Multicasting	en
dc.subject.other	Multimedia systems	en
dc.subject.other	Polynomials	en
dc.subject.other	Resource allocation	en
dc.subject.other	Telecommunication traffic	en
dc.subject.other	Delayed multicast	en
dc.subject.other	Minimum maximum memory per node	en
dc.subject.other	Minimum total memory	en
dc.subject.other	Minimum total traffic	en
dc.subject.other	Video on demand	en
dc.title	Video-on-demand based on delayed-multicast: Algorithmic support	en
heal.type	journalArticle	en
heal.identifier.primary	10.1093/comjnl/47.5.545	en
heal.identifier.secondary	http://dx.doi.org/10.1093/comjnl/47.5.545	en
heal.language	English	en
heal.publicationDate	2004	en
heal.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
heal.publisher	OXFORD UNIV PRESS	en
heal.journalName	Computer Journal	en
dc.identifier.doi	10.1093/comjnl/47.5.545	en
dc.identifier.isi	ISI:000223426300003	en
dc.identifier.volume	47	en
dc.identifier.issue	5	en
dc.identifier.spage	545	en
dc.identifier.epage	559	en