Distributed stochastic learning automata (SLA) are used to ‘grow’ minimum cost delay bounded multicast trees in a dynamic membership environment. It is found that learning automata, which use minimal state information and require only local connectivity knowledge, provide reduced costs over shortest path approaches and comparable static costs to alternative algorithms, by learning to minimise the number of hops taken to join the tree, thereby minimising its resource consumption.
References
-
-
1)
-
L. Kou ,
G. Markowsky ,
L. Berman
.
A fast algorithm for Steiner trees.
Acta Informatica
,
141 -
145
-
2)
-
J. Reeve ,
P. Mars ,
T. Hodgkinson
.
Learning algorithms for quality of servicemulticast routing.
Electron. Lett.
,
12 ,
1195 -
1197
-
3)
-
H.F. Salama ,
D.S. Reeves ,
Y. Viniotis
.
Evaluation of multicast routingalgorithms for real-time communication on high-speed networks.
IEEE J. Sel. Areas Commun.
,
3 ,
332 -
345
-
4)
-
P. Winter
.
Steiner problem in networks : a survey.
IEEE Netw.
,
2 ,
129 -
167
-
5)
-
K.A. Narendra ,
M.A.L. Thathachar
.
(1989)
Learning automata - An introduction.
http://iet.metastore.ingenta.com/content/journals/10.1049/el_19990019
Related content
content/journals/10.1049/el_19990019
pub_keyword,iet_inspecKeyword,pub_concept
6
6