Scalable and efficient broadcasting algorithms for very large internetworks

Most dynamic broadcasting techniques for large networks including the Internet suffer from scalability problems, i.e., they are not efficient with respect to the tremendous size of today's networks. We propose a distributed scalable broadcast algorithm for the Internet. Moreover our scheme attempts to optimize both cost of routing and broadcast time performance measures. Utilizing the hierarchical structure of the Internet, cost optimal protocols are proposed using a distributed spanning tree algorithm while near-optimal time broadcast can be achieved by formulating the problem as finding maximum matching in bipartite graphs. Simulation results obtained prove the validity and feasibility of the scheme.