By Topic

A Solution to Select Multicast Service Nodes of Hierarchical Overlay Multicast Tree Based on Immune Evolution

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

3 Author(s)
Deqiang Cheng ; China Univ. of Min. & Technol., Xuzhou ; Jin Lu ; Jiansheng Qian

For the reliable real time video transmission of overlay network, optimal multicast service nodes (MSNs) should be selected to build highly efficient hierarchical overlay multicast tree. In this paper, a MSNs selection algorithm based on immune evolution is proposed. MSNs are encoded by real-coded mechanism, and the K-medoids clustering distance is used to measure the similarity between MSN and other nodes. In accordance with the actual characteristics of MSN, a fitness function including penalty factor is brought forward to prevent undesirable individuals participating in evolution. Also, on the base of SGA, immune vaccines are extracted and imported into the evolutionary population to improve the global optimizing capability of algorithm. Theoretical analysis and simulation results show that this algorithm is effective and feasible. As to select MSNs, it not only overcomes the imitation-sensitive problem and local convergence caused by the traditional K-medoids algorithm but also avoid degradation phenomenon appeared in standard genetic algorithm , and improve search capabilities and speed convergence.

Published in:

2008 Fourth International Conference on Natural Computation  (Volume:1 )

Date of Conference:

18-20 Oct. 2008