Heuristic Algorithms for Broadcasting in Point-to-Point Computer Networks

IEEE Transactions on Computers

Volumn C-33, Issue 9, 1984, Pages 804-811

  Scheuermann, Peter ^a   Wu, Geoffrey ^a  

^a NORTHWESTERN UNIVERSITY   (United States)

Author keywords

Bipartite graph; dynamic programming; heuristic algorithms; least weight maximum matching; minimum delay broadcasting; point to point computer networks

Indexed keywords

COMPUTER PROGRAMMING - ALGORITHMS; MATHEMATICAL PROGRAMMING, DYNAMIC; MATHEMATICAL TECHNIQUES - GRAPH THEORY;

BIPARTITE GRAPH; HEURISTIC ALGORITHMS; POINT-TO-POINT COMPUTER NETWORKS;

COMPUTER NETWORKS;

EID: 0021494627     PISSN: 00189340     EISSN: None     Source Type: Journal    
DOI: 10.1109/TC.1984.1676496     Document Type: Article

References (20)

1. N. Deo, Graph Theory with Applications to Engineering and Computer Science. Englewood Cliffs, NJ: Prentice-Hall, 1974.
2. F. Desler and S. L. Hakimi, “A graph-theoretic approach to a class of integer-programming problems,” Oper. Res., vol. 17, no. 16, pp. 1017—1033, 1969.
3. S. Even, Graph Algorithms. Rockville, MD: Computer Science Press, 1979.
4. A.M. Farley, “Minimal broadcast networks,” Networks, vol. 9, pp. 313–332, 1979.
5. A.M. Farley, “Minimum-time line broadcast networks,” Networks, vol. 10, pp. 59–70, 1980.
6. F. Farley, S. Hedetniemi, S. Mitchell, and A. Proskurowski, “Minimum broadcast graphs,” Discrete Math., vol. 25, pp. 189–193, 1979.
7. L. R. Ford and D.R. Fulkerson, Flows in Networks. Princeton, NJ: Princeton University Press, 1962.
8. M. Gien, “A file transfer protocol (FTP),” Comput. Networks, vol. 2, pp. 312–319, 1978.
9. S. L. Hakimi, “On the realizability of a set of integers as degrees of the vertices of a linear graph: I,” J. SIAM, vol. 10, pp. 496–502, 1962.
10. A. Hevner and B. Yao, “Query processing in distributed database systems,” IEEE Trans. Software Eng., vol. SE-5, no. 3, pp. 177–187, May 1979.
11. J. Hopcroft and R. Karp, “An n5/2 algorithm for maximum matchings in bipartite graphs,” SIAM J. Comput., vol. 2, no. 4, pp. 225–231, Dec. 1973.
12. S. R. Kimbleton and G. M. Schneider, “Computer communications networks: Approaches, objectives and performance considerations,” ACM Comput. Surveys, vol. 7, no. 3, pp. 129–173, Sept. 1975. r.
13. A. L. Liestman, “Fault-tolerant broadcast graphs,” Dep. Comput. Sci., Univ. Illinois at Urbana-Champaign, IL, Tech. Rep., 1980.
14. W. Lipski Jr. and F. P. Preparata, “Efficient algorithms for finding maximum matchings in convex bipartite graphs and related problems,” Acta Informatica, vol. 15, pp. 329–346, 1981.
15. A. Proskurowski, “Minimum broadcast trees,” IEEE Trans. Comput., vol. C-30, pp. 363–366, May 1981.
16. A. Rosenthal, “Broadcasting in a tree network,” Dep. Inform. Sci., Sperry Res. Center, Sudbury, MA, Tech. Rep. SRC-RP-81-29, July 1981.
17. J. B. Rothnie, N. Goodman, and T. Marrill, “Database management in distributed networks,” in Protocols and Techniques for Data Communication Networks, F. Kuo, Ed. Englewood Cliffs, NJ: Prentice-Hall, 1981, pp. 433–461.
18. P. J Slater, E. J. Cockayne, and S. T. Heditniemi, “Information dissemination in trees,” SIAM J. Comput., vol. 10, no. 4, pp. 692–701, Nov. 1981.
19. P. Scheuermann and M. Edelberg, “Optimal broadcasting in point-to-point computer networks,” Dep. Elec. Eng. Comput. Sci., Northwestern Univ., Evanston, IL, Tech. Rep., 1981.
20. D. Wall, “Selective broadcast in packet-switched networks,” in Proc. 7th Berkeley Workshop Distrib. Data Comput. Networks, Feb. 1982, pp. 239–258.