A Minimum Cost Multicast Routing Algorithmwith the Consideration of Dynamic User Membership
碩士 === 國立臺灣大學 === 資訊管理學研究所 === 92 === In this thesis, we try to model the problem of constructing a multicast tree with minimum cost. Unlike the other minimum cost multicast tree algorithms, this model consists of one multicast group of fixed members. Each destination member d is dynamic and has a p...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_US |
| Published: |
2004
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/78739492184379760782 |
| Summary: | 碩士 === 國立臺灣大學 === 資訊管理學研究所 === 92 === In this thesis, we try to model the problem of constructing a multicast tree with minimum
cost. Unlike the other minimum cost multicast tree algorithms, this model consists of one
multicast group of fixed members. Each destination member d is dynamic and has a
probability of being active as d q which was gathered by observation over some period of time.
With the omission of node join/leave handling, this model is suitable for prediction and
planning purpose than for online maintenance of multicast trees. Lagrangean relaxation
method is applied to speed up the solution procedure.
|
|---|