By Topic

Scalable and efficient broadcasting algorithms for very large internetworks

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Chatterjee, S. ; Dept. of Comput. Inf. Syst., Georgia State Univ., Atlanta, GA, USA ; Bassiouni, M.A.

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

Published in:

Communications, 1996. ICC '96, Conference Record, Converging Technologies for Tomorrow's Applications. 1996 IEEE International Conference on  (Volume:3 )

Date of Conference:

23-27 Jun 1996