Computer Communication Networks: Approaches, Objectives, and Performance Considerations
ACM Computing Surveys (CSUR)
Graph Algorithms
Graph Theory with Applications to Engineering and Computer Science (Prentice Hall Series in Automatic Computation)
IEEE Transactions on Computers
Query Processing in Distributed Database System
IEEE Transactions on Software Engineering
A genetic algorithm for the minimum broadcast time problem using a global precedence vector
SAC '96 Proceedings of the 1996 ACM symposium on Applied Computing
Faster Gossiping on Butterflies
ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
Personalized broadcasting in banyan-hypercube networks
ICCCN '95 Proceedings of the 4th International Conference on Computer Communications and Networks
An efficient heuristic for broadcasting in networks
Journal of Parallel and Distributed Computing
Scalable and efficient broadcasting algorithms for very large internetworks
Computer Communications
Linear algorithm for broadcasting in unicyclic graphs
COCOON'07 Proceedings of the 13th annual international conference on Computing and Combinatorics
| Hi-index | 14.98 |
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.