Algorithmic Support for Video-on-Demand Based on the Delayed-Multicast Protocol
UTSePress Research/Manakin Repository
JavaScript is disabled for your browser. Some features of this site may not work without it.
- UTSePress Research Home
- >
- 11 Medical and Health Sciences
- >
- Conference Papers
- >
- Closed
- >
- View Item
| dc.contributor.author | Glinos Nikolaos | en_US |
| dc.contributor.author | Hoang Doan | en_US |
| dc.contributor.author | Nguyen Dang Nam Chi | en_US |
| dc.contributor.author | Symvonis Antonios | en_US |
| dc.contributor.editor | NA | en_US |
| dc.date.accessioned | 2010-05-18T06:51:21Z | |
| dc.date.available | 2010-05-18T06:51:21Z | |
| dc.date.issued | 2002 | en_US |
| dc.identifier | 2004003445 | en_US |
| dc.identifier.citation | Glinos Nikolaos et al. 2002, 'Algorithmic Support for Video-on-Demand Based on the Delayed-Multicast Protocol', Carleton Scientific, Waterloo, Canada, pp. NA-NA. | en_US |
| dc.identifier.issn | 1-894145-12-7 | en_US |
| dc.identifier.other | E1 | en_US |
| dc.identifier.uri | http://hdl.handle.net/10453/7309 | |
| dc.description.abstract | In this paper, we examine algorithmic issues related to the delayed multicast technique [8] for Video-on-Demand delivery. We introduce the minimum total memory (MTM), minimum total traffic (MIT), and the minimum maximum 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 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. | en_US |
| dc.publisher | Carleton Scientific | en_US |
| dc.relation.isbasedon | http://www.carleton-scientific.com/sirocco/preface.html | en_US |
| dc.title | Algorithmic Support for Video-on-Demand Based on the Delayed-Multicast Protocol | en_US |
| dc.parent | Proceedings of the 9th International Colloquium on Structural Information and Communication Complexity | en_US |
| dc.journal.volume | en_US | |
| dc.journal.number | en_US | |
| dc.publocation | Waterloo, Canada | en_US |
| dc.identifier.startpage | NA | en_US |
| dc.identifier.endpage | NA | en_US |
| dc.cauo.name | Information Technology | en_US |
| dc.conference | en_US | |
| dc.conference.location | Andros, Greece | en_US |
| dc.for | 111711 | en_US |
