By Topic

An efficient evolutionary algorithm for (near-) optimal Steiner tree calculation: an approach to routing of multipoint connections

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 $13
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

4 Author(s)
Saltouros, M. ; Nat. Tech. Univ. of Athens, Greece ; Theologou, M. ; Angelopoulos, M. ; Ricudis, C.S.

One of the most prevalent problems in modern telecommunication networks is the efficient routing of multicast connections. The formal formulation of this problem reduces to a graph-theoretical problem known as the Steiner tree problem, that is proved to be NP-complete. We present an efficient solution for the Steiner tree problem with application to multicast routing, based on a hybridized genetic algorithm with a hill-climbing technique that facilitates better local exploration of the search space. Moreover, an adaptive policy that is used to control the genetic algorithm parameters renders the proposed scheme efficient and adaptive under static and dynamic environment conditions. Using simulation, we came to the conclusion that our proposed algorithm compares favourably to some of the most effective deterministic approaches already known

Published in:

Computational Intelligence and Multimedia Applications, 1999. ICCIMA '99. Proceedings. Third International Conference on

Date of Conference:

1999