Delay Analysis of Broadcast Routing in Packet-Switching Networks
- 1 December 1981
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computers
- Vol. C-30 (12) , 915-922
- https://doi.org/10.1109/tc.1981.1675730
Abstract
Broadcast addressing is the capability to send a packet from a source node to all other nodes in the network. Store-and-forward, packet-switching networks are not inherently designed to carry broadcast packets, and broadcasting has to be implemented by some sort of routing algorithm. In this paper, the source based forwarding algorithm is considered. With this algorithm, a spanning tree is defined for each node, and broadcast packets are sent along the branches of these trees. Approximation methods are presented to obtain a lower bound and estimates of the mean broadcast time. The accuracy of these methods is evaluated by comparison with simulation.Keywords
This publication has 7 references indexed in Scilit:
- A Majority consensus approach to concurrency control for multiple copy databasesACM Transactions on Database Systems, 1979
- Concurrency Control and Consistency of Multiple Copies of Data in Distributed IngresIEEE Transactions on Software Engineering, 1979
- System level concurrency control for distributed database systemsACM Transactions on Database Systems, 1978
- The Concurrency Control Mechanism of SDD-1: A System for Distributed Databases (The Fully Redundant Case)IEEE Transactions on Software Engineering, 1978
- Distribution of end-to-end delay in message-switched networksComputer Networks (1976), 1978
- Technical Note—Expected Completion Time in Pert NetworksOperations Research, 1976
- An operational system for computer resource sharingPublished by Association for Computing Machinery (ACM) ,1975