Find in Library

Multicast routing is the basic demand to provide QOS (Quality of service) in multimedia streaming on peer to peer networks. Making multicast trees optimizing their delay cost and considering nodal and links limited bandwidth (load balance constraints) is a NP-hard (Nondeterministic Polynomial time hard) problem. In this paper we have used Co-evolutionary Algorithm to make multicast trees with optimized average delay from source to the clients considering the limited capacity of nodes and links in application layer. The numeric results obtained are shown that the costs have been much improved comparing with other existent non-GA (Genetic Algorithm) approaches. Also we have used only a portion of every nodal outage degree and this has improved the results comparing to use of the entire outage degree.