By Topic

Learning algorithms for minimum cost, delay bounded multicast routing in dynamic environments

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $31
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Reeve, J. ; Sch. of Eng., Durham Univ., UK ; Mars, P. ; Hodgkinson, T.

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

Published in:

Electronics Letters  (Volume:35 ,  Issue: 1 )