This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Heuristic Algorithms for Broadcasting in Point-to-Point Computer Networks
September 1984 (vol. 33 no. 9)
pp. 804-811
P. Scheuermann, Departrmient of Electrical Engineering and Computer Science, Northwestern University
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.
Index Terms:
point-to-point computer networks, Bipartite graph, dynamic programming, heuristic algorithms, least-weight maximum matching, minimum-delay broadcasting
Citation:
P. Scheuermann, G. Wu, "Heuristic Algorithms for Broadcasting in Point-to-Point Computer Networks," IEEE Transactions on Computers, vol. 33, no. 9, pp. 804-811, Sept. 1984, doi:10.1109/TC.1984.1676496
Usage of this product signifies your acceptance of the Terms of Use.