This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
All-to-All Broadcast by Flooding in Communications Networks
September 1989 (vol. 38 no. 9)
pp. 1330-1333
ASCII Text
x 
 
D.M. Topkis, "All-to-All Broadcast by Flooding in Communications Networks," IEEE Transactions on Computers, vol. 38, no. 9, pp. 1330-1333, September, 1989.
 
 
BibTex
x
 
@article{ 10.1109/12.29474,
author = {D.M. Topkis},
title = {All-to-All Broadcast by Flooding in Communications Networks},
journal ={IEEE Transactions on Computers},
volume = {38},
number = {9},
issn = {0018-9340},
year = {1989},
pages = {1330-1333},
doi = {http://doi.ieeecomputersociety.org/10.1109/12.29474},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - JOUR
JO - IEEE Transactions on Computers
TI - All-to-All Broadcast by Flooding in Communications Networks
IS - 9
SN - 0018-9340
SP1330
EP1333
EPD - 1330-1333
A1 - D.M. Topkis,
PY - 1989
KW - flooding; communications networks; worst-case time complexity; all-to-all broadcast; simultaneous broadcast; adaptive routing; ARPANET; suboptimality; spanning subtree; FIFO; LIFO; computational complexity; computer networks.
VL - 38
JA - IEEE Transactions on Computers
ER -
 
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 p

[1] K. Bharath-Kumar and J. M. Jaffe, "Routing to multiple destinations in computer networks,"IEEE Trans. Commun., vol. COM-31, pp. 343-351, Mar. 1983.
[2] Y. K. Dalal and R. M. Metcalfe, "Reverse path forwarding of broadcast packets,"Commun. ACM, vol. 21, pp. 1040-1048, Dec. 1978.
[3] D. U. Friedman, "Communication complexity of distributed shortest path algorithms," Lab. Inform. Decision Syst., Massachussetts Instit. Technol., Cambridge, MA, 1979, paper LIDS-TH-886.
[4] J. M. McQuillan, "Enhanced message addressing capabilities for computer networks,"Proc. IEEE, vol. 66, pp. 1517-1527, Nov. 1978.
[5] J. M. McQuillan, I. Richer, and E. C. Rosen, "The new routing algorithm for the ARPANET,"IEEE Trans. Commun., vol. COM- 28, no. 5, pp. 711-719, May 1980.
[6] C. V. Ramamoorthy and W.-T. Tsai, "An adaptive hierarchical routing algorithm," inProc. 7th Int. Comput. Software Appl. Conf., 1983, pp. 93-104.
[7] E. C. Rosen, "The updating protocol of ARPANET's new routing algorithm,"Comput. Networks, vol. 4, pp. 11-19, Feb. 1980.
[8] A. Segall and B. Awerbuch, "A reliable broadcast protocol,"IEEE Trans. Commun., vol. COM-31, pp. 896-901, July 1983.
[9] A. S. Tanenbaum,Computer Networks, Englewood Cliffs, NJ: Prentice-Hall, 1981.
[10] D. M. Topkis, "Concurrent broadcast for information dissemination,"IEEE Trans. Software Eng., vol. SE-11, pp. 1107-1112, Oct. 1985.
[11] D. W. Wall and S. Owicki, "Construction of centered shortest-path trees in networks,"Networks, vol. 13, pp. 207-231, Summer 1983.
[12] D. B. West, "A class of solutions to the gossip problem, Part I,"Discrete Math., vol. 39, pp. 307-326, May 1982.

Index Terms:
flooding; communications networks; worst-case time complexity; all-to-all broadcast; simultaneous broadcast; adaptive routing; ARPANET; suboptimality; spanning subtree; FIFO; LIFO; computational complexity; computer networks.
Citation:
D.M. Topkis, "All-to-All Broadcast by Flooding in Communications Networks," IEEE Transactions on Computers, vol. 38, no. 9, pp. 1330-1333, Sept. 1989, doi:10.1109/12.29474
Usage of this product signifies your acceptance of the Terms of Use.