## Minimizing the Broadcast Routing in the Computer Networks

**Authors:** Ahmed Younes

In the computer networks, it is necessary for one device in the computer network to
send data to all the other devices. In this paper, broadcast routing algorithms that aim to minimize
the cost of the routing path are proposed. A minimum cost broadcast routing scheme based on
spanning tree algorithm is presented. Thus, we present a genetic algorithm to find the broadcast
routing tree of a given network in terms of its links for using it to solve this problem. The algorithm
uses the connection matrix of a given network to find the spanning trees, and also is based on the
weight of the links to obtain the minimum spanning tree. An example is provided to illustrate the
effectiveness of this algorithm over conventional algorithms.

**Comments:** 7 Pages.

**Download:** **PDF**

### Submission history

[v1] 2012-08-18 21:58:17

**Unique-IP document downloads:** 446 times

**Add your own feedback and questions here:**

*You are equally welcome to be positive or negative about any paper but please be polite. If you are being critical you must mention at least one specific error, otherwise your comment will be deleted as unhelpful.*

*
*