Modules

1. Design the Network Topology

• A certain number of nodes are defined in a network.
• A large network is developed.
• The nodes can be defined as a normal network or sensor network.

Multicast distribution routes are represented by a rooted, directed spanning tree. The problem of determining such a rooted tree which covers all subscribers is complicated by the need to balance network resources while optimizing the serving of the communication group.
This leads us to study the minimum average-latency degree-bounded directed spanning tree problem, a well known NP-hard problem

The multicast tree will be calculated on a particular set of nodes where the latency can be measured between all nodes, yielding a complete graph. We study the problem using a graph model where the input is a complete graph, with the graph represented as G = (V, E). V is the set of all vertices (end systems in the network) and E is the set of weighted, undirected edges between all nodes. We consider only networks in which all nodes are subscribers of the multicast group or one in which non-subscribers can be ignored. The edges in the graph are undirected, indicating that there is the potential for information to flow in either direction. Edges are assigned weights corresponding to the latency between the nodes they connect.
We are using the result of Kanemann et al. as a base case for experimentation in relation to the degree bounded minimum diameter spanning tree problem. A solution to this problem will return a spanning tree T over the graph G with a minimum diameter and a maximum out-degree of B at any node.