Degree-Constrained Minimum Spanning Tree Problem using Genetic Algorithm
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F61989100%3A27740%2F12%3A86084781" target="_blank" >RIV/61989100:27740/12:86084781 - isvavai.cz</a>
Result on the web
<a href="http://dx.doi.org/10.1109/NaBIC.2012.6402214" target="_blank" >http://dx.doi.org/10.1109/NaBIC.2012.6402214</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1109/NaBIC.2012.6402214" target="_blank" >10.1109/NaBIC.2012.6402214</a>
Alternative languages
Result language
angličtina
Original language name
Degree-Constrained Minimum Spanning Tree Problem using Genetic Algorithm
Original language description
Computer network technology has been growing explosively and the multicast technology has become a hot Internet research topic. The main goal of multicast routing algorithm is seeking a minimum cost multicast tree in a given network, also known as the Steiner tree problem, which is a classical NP-Complete problem. We measure the multicast capability of each node through the degree-constraint for each node and discuss the problem of multicast in the case of degree-constraint, which has an important significance in the communication network. Limiting the capacity of each node during the replication process of information transmission can improve the speed of the network, which has an important significance in real-time service. In this paper, we solve constrained multicast routing algorithm based on genetic algorithm. The idea is to simulate the Darwinian theory of biological evolution. At the same time, we improve the generating random tree and replace the variation by the combination o
Czech name
—
Czech description
—
Classification
Type
D - Article in proceedings
CEP classification
IN - Informatics
OECD FORD branch
—
Result continuities
Project
<a href="/en/project/ED1.1.00%2F02.0070" target="_blank" >ED1.1.00/02.0070: IT4Innovations Centre of Excellence</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)
Others
Publication year
2012
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Article name in the collection
Proceedings of the 2012 4th World Congress on Nature and Biologically Inspired Computing, NaBIC 2012
ISBN
978-1-4673-4768-6
ISSN
—
e-ISSN
—
Number of pages
7
Pages from-to
8-14
Publisher name
IEEE
Place of publication
New York
Event location
Mexico City
Event date
Nov 5, 2012
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
—