Optimum Multicast of Multimedia Streams
碩士 === 國立交通大學 === 資訊科學學系 === 84 === In a video on demand system, multicast is a good choice for saving networkbandwidth. Usually, we let the customers of requesting the same videoprogram in a time interval involve in a multicast tree and th...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | zh-TW |
| Published: |
1996
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/74942731946456147860 |
| Summary: | 碩士 === 國立交通大學 === 資訊科學學系 === 84 === In a video on demand system, multicast is a good choice for
saving networkbandwidth. Usually, we let the customers of
requesting the same videoprogram in a time interval involve in a
multicast tree and the videostream flow in this tree. In this
thesis, optimal multicast path findingmethods for a VoD system
are studied. Two branch and bound algorithms areproposed to
maximize the number of users for a VoD system with
bandwidthconstraint. To reduce the computational time, some
hureistic strategies aresuggested. The numerical results are
given to show the effectiveness of thealgorithms.
|
|---|