Algorithmic Support for Video-on-Demand based on the Delayed-multicast Protocol

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

dc.contributor.author	Glinos, N	en
dc.contributor.author	Hoang, D	en
dc.contributor.author	Nguyen, C	en
dc.contributor.author	Symvonis, A	en
dc.date.accessioned	2014-03-01T02:49:08Z
dc.date.available	2014-03-01T02:49:08Z
dc.date.issued	2002	en
dc.identifier.uri	https://dspace.lib.ntua.gr/xmlui/handle/123456789/34328
dc.relation.uri	http://www.informatik.uni-trier.de/~ley/db/conf/sirocco/sirocco2002.html#GlinosHNS02	en
dc.relation.uri	http://147.102.205.75/~symvonis/publications/conferences/ghns-sirocco02.pdf	en
dc.subject	Bandwidth Allocation	en
dc.subject	Heuristic Method	en
dc.subject	Polynomial Time Algorithm	en
dc.subject	Tree Network	en
dc.subject	Video On Demand	en
dc.title	Algorithmic Support for Video-on-Demand based on the Delayed-multicast Protocol	en
heal.type	conferenceItem	en
heal.publicationDate	2002	en
heal.abstract	In this paper, we examine algorithmic issues related to the delayed multi- cast technique (8) for Video-on-Demand delivery. We introduce the minimum total memory (MTM), minimum total traffic (MTT),and the minimum max- imum memory per node (MMMN)delayed-multicast allocation problems. We provide polynomial time algorithms for solving the MTM and the MTT problems on the chandelier network and the MTM problem	en
heal.journalName	Colloquium on Structural Information & Communication Complexity	en