Full metadata record
DC FieldValueLanguage
dc.contributor.authorWang, CFen_US
dc.contributor.authorLai, BRen_US
dc.contributor.authorJan, RHen_US
dc.date.accessioned2014-12-08T15:46:45Z-
dc.date.available2014-12-08T15:46:45Z-
dc.date.issued1999-04-01en_US
dc.identifier.issn0305-0548en_US
dc.identifier.urihttp://dx.doi.org/10.1016/S0305-0548(98)00075-6en_US
dc.identifier.urihttp://hdl.handle.net/11536/31438-
dc.description.abstractIn a VOD system, multicast is a preferred method for saving network bandwidth. That is, customers requesting the same video program over a small time interval can be arranged in a multicast tree (group), and then the video server sends a video stream via this tree to customers. In this research, we considered how to arrange a set of multicast trees such that the number of customers served is maximized and the link capacity constraint is maintained. For a directed acyclic graph (DAG), we proposed a branch-and-bound algorithm to solve this problem and the solution method is illustrated by example. Next, we extended the algorithm to find an approximate solution for a general graph case. It is shown, through simulations on randomly generated graphs that the solution for our approximation method is very close to the optimal solution. (C) 1999 Elsevier Science Ltd. All rights reserved.en_US
dc.language.isoen_USen_US
dc.subjectinteger programmingen_US
dc.subjectbranch-and-bound algorithmen_US
dc.subjectnetwork optimizationen_US
dc.subjectmulticast routingen_US
dc.titleOptimum multicast of multimedia streamsen_US
dc.typeArticleen_US
dc.identifier.doi10.1016/S0305-0548(98)00075-6en_US
dc.identifier.journalCOMPUTERS & OPERATIONS RESEARCHen_US
dc.citation.volume26en_US
dc.citation.issue5en_US
dc.citation.spage461en_US
dc.citation.epage480en_US
dc.contributor.department資訊工程學系zh_TW
dc.contributor.departmentDepartment of Computer Scienceen_US
dc.identifier.wosnumberWOS:000078565800002-
dc.citation.woscount11-
Appears in Collections:Articles


Files in This Item:

  1. 000078565800002.pdf

If it is a zip file, please download the file and unzip it, then open index.html in a browser to view the full text content.