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

We examine the problem of broadcasting in a point-to-point computer network where a message, originated by one node, is transmitted to all nodes, subject to the restriction that an informed node can call only one of its neighbors Auring a given time unit. A dynamic programming formulation for optimal broadcasting in general networks is given, and an exact algorithm based on it is developed. Since this algorithm is not very efficient for larger networks, we present a number of heuristics for achieving efficient near-optimal algorithms. In particular, we discuss in detail a class of heuristics which require finding at each step a least-weight maximum matching in a bipartite graph.

[1]  S. Hakimi.  On Realizability of a Set of Integers as Degrees of the Vertices of a Linear Graph. I , 1962 .

[2]  E. J. COCKAYNE,et al.  Information Dissemination in Trees , 1981, SIAM J. Comput..

[3]  Michel Gien,et al.  A File Transfer Protocol (FTP) , 1978, Comput. Networks.

[4]  David W. Wall,et al.  Selective Broadcast in Packet-Switched Networks , 1982, Berkeley Workshop.

[5]  S. Louis Hakimi,et al.  A Graph-Theoretic Approach to a Class of Integer-Programming Problems , 1969, Oper. Res..

[6]  本田 公男.  Query Processing in Distributed Database Systems , 1980 .

[7]  N.R. Malik,et al.  Graph theory with applications to engineering and computer science , 1975, Proceedings of the IEEE.

[8]  Stephen R. Kimbleton,et al.  Computer Communication Networks: Approaches, Objectives, and Performance Considerations , 1975, CSUR.

[9]  Richard M. Karp,et al.  A n^5/2 Algorithm for Maximum Matchings in Bipartite Graphs , 1971, SWAT.

[10]  Arthur L. Liestman.  Fault-tolerant broadcast graphs , 1985, Networks.

[11]  Narsingh Deo,et al.  Graph Theory with Applications to Engineering and Computer Science , 1975, Networks.

[12]  Arthur M. Farley.  Minimum-time line broadcast networks , 1980, Networks.

[13]  Alan R. Hevner,et al.  Query Processing in Distributed Database System , 1979, IEEE Transactions on Software Engineering.

[14]  Arthur M. Farley,et al.  Minimum broadcast graphs , 1979, Discret. Math..

[15]  Andrzej Proskurowski,et al.  Minimum Broadcast Trees , 1981, IEEE Transactions on Computers.

[16]  D. R. Fulkerson,et al.  Flows in Networks. , 1964 .

[17]  A. M. Farley.  Minimal broadcast networks , 1979, Networks.