A Minimum Cost Multicast Routing Algorithm with the Consideration of Dynamic User Membership
Date Issued
2004
Date
2004
Author(s)
Yeh, Jung-Yao
DOI
en-US
Abstract
本研究的目的在於建立最小成本的的群播樹。跟一般群播樹建立演算法不同的是，
本問題的模型包含一組固定的群播接收者，而群組中的成員具有的變動性是以觀察而來
的活動機率d q 來含括。由於此模型是用來評估與預測群播樹所需的成本，所以不考慮節
點實際的加入跟退出。因為模型近似於史坦那樹問題，所以利用拉格蘭日鬆弛法來加快求解的過程。
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.
Subjects
拉格蘭日鬆弛法
史坦那樹
群播樹
Lagrangean relaxation
Steiner tree problem
Multicast
Type
other
File(s)![Thumbnail Image]()
Loading...
Name
ntu-93-R91725031-1.pdf
Size
23.31 KB
Format
Adobe PDF
Checksum
(MD5):e4cd9f2baf3387652a66b738990db05f