Scalable and efficient broadcasting algorithms for very large internetworks

Computer Communications

Volumn 21, Issue 10, 1998, Pages 912-923

  Chatterjee, Samir ^a   Bassiouni, Mostafa A ^b  

^a GEORGIA STATE UNIVERSITY   (United States)

^b University of Central Florida   (United States)

Author keywords

Bipartite graphs; Broadcasting; Distributed algorithms; Hierarchical networks; Maximum matching; Minimum spanning tree; Routing

Indexed keywords

ALGORITHMS; BROADCASTING; HEURISTIC METHODS; NETWORK PROTOCOLS; PACKET NETWORKS; TREES (MATHEMATICS); WIDE AREA NETWORKS;

BIPARTITE GRAPHS; HIERARCHICAL NETWORKS; MINIMUM SPANNING TREES;

DATA COMMUNICATION SYSTEMS;

EID: 0032124267     PISSN: 01403664     EISSN: None     Source Type: Journal    
DOI: 10.1016/s0140-3664(98)00140-6     Document Type: Article

References (24)

1. J.M. McQuillan, I. Richer, E.C. Rosen, The new routing algorithm for the Arpanet, IEEE Transactions on Communications, COM28, May 1980.
2. A.M. Farley, Minimal broadcast networks, Networks 9 (1979) 313-333.
3. K.B. Kumar, J.M. Jaffe, Routing to multiple destinations in computer networks, IEEE Transactions on Communications, COM31, March 1983.
4. P. Scheuermann, G. Wu, Heuristic algorithms for broadcasting in point-to-point computer networks, IEEE Transactions on Computers, C-33(9), Sept. 1984.
5. P. Baran, On distributed communication networks, IEEE Transactions on Communication Systems 12(3) (1964).
6. M. Schwartz, T.E. Stern, Routing techniques used in communication networks, IEEE Transactions on Communications 28 (4) (1980) 265-279.
7. D.E. Sproule, F. Mellor, Routing, flow and congestion control in the Datapac network, IEEE Transactions on Communications 28 (4) (1981) 386-391.
8. W.T. Tsai, C.V. Ramamoorthy, W.K. Tsai, O. Nishiguchi, An adaptive hierarchical routing protocol, IEEE Transactions on Computers, 38(8), Aug. 1989.
9. A. Khanna, J. Zinky, The revised Arpanet routing metric, in: Proceedings of SIGCOMM'89, ACM, 1989, pp. 45-56.
10. P.F. Tsuchiya, Internet routing over large public data networks using shortcuts, in: Proceedings of SIGCOMM'92, 1992, p. 65.
11. D. Estrin, Y. Rekhter, S. Hotz, Scalable inter-domain routing architecture, in: Proceedings of SIGCOMM'92, 1992, p. 40.
12. S. Deering, Multicast routing in Internetworks and extended LANs, in: Proceedings of SIGCOMM'88, Stanford, CA, Aug. 1988.
13. Y. Dalal, R. Metcalfe, Reverse path forwarding of broadcast packets, Communications of the ACM 21 (1978) 1040-1048.
14. A. Gopal, I. Gopal, S. Kutten, Hardware flooding, in: Proceedings of SIGCOMM'91, Zurich, Switzerland, Sept. 1991.
15. N.F. Maxemchuk, Dispersity routing on ATM networks, in: Proceedings of IEEE INFOCOM, 1993, pp. 347-357.
16. F. Kamoun, L. Klienrock, Stochastic performance evaluation of hierarchical routing for large networks, Computer Networks 3 (1979) 337-353.
17. R.G. Gallager, P.A. Humblet, P.M. Spira, A distributed algorithm for minimum weight spanning, ACM Transactions on Programming Languages and Systems 5 (1) (1983) 66-77.
18. E.L. Lawler, Combinatorial Optimizations: Networks and Matroids, Holt, Rienhart and Winston, New York, 1976.
19. M. Syslo, N. Deo, J. Kowalik, Discrete Optimization Algorithms with Pascal Programs, Prentice Hall, Englewood Cliffs, NJ, 1983.
20. S. Chatterjee, M.A. Bassiouni, Hierarchical message dissemination in very large WANs, in: Proceedings of 17th IEEE Local Computer Network Conference, Minneapolis, MN, Sept. 1992.
21. T.N. Saadawi, M.H. Ammar. A. El Hakeeem, Fundamentals of Telecommunication Networks, Wiley, New York, 1994.
22. P.J. Slater, E. Cockayne, S.T. Heditniemi, Information dissemination in trees, SIAM Journal of Computing 10 (4) (1981) 692-701.
23. D.E. Comer, Internetworking with TCP/IP: Principles, Protocols and Architecture, 3rd ed., vol. 1, Prentice Hall, Englewood Cliffs, NJ, 1995.
24. R. Perlnan, Interconnections: Bridges and Routers, Addison-Wesley, Reading, MA, 1992.