Cart (Loading....) | Create Account
Close category search window
 

All-to-all broadcast by flooding in communications networks

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

1 Author(s)
Topkis, D.M. ; Graduate Sch. of Manage., California Univ., Davis, CA, USA

The author establishes the worst-case time complexity of all-to-all broadcast, which involves the simultaneous broadcast of messages from each node in a network to each other node, as with the dissemination of network status information for adaptive routing in ARPANET, by flooding. It it shown to be almost two times the optimum. This suboptimality of flooding results from the selection method permitting some message(s) to be consistently blocked by others. It is possible to avoid such blocking and attain the optimal worst-case time complexity by flooding within a spanning subtree. Simulations examine the performance of all-to-all broadcast by flooding using different selection methods. The best overall performance came using random selection, with FIFO next best, followed by LIFO, and in-order last. This relative performance is consistent with the hypothesis that flooding will generally perform better if implemented with a selection method that tends to avoid having some message(s) consistently blocked by others. Simulations show that the optimal worst-case time complexity is rarely exceeded, and then by only a relatively small amount

Published in:

Computers, IEEE Transactions on  (Volume:38 ,  Issue: 9 )

Date of Publication:

Sep 1989

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.