The Community for Technology Leaders
Green Image
<p><b>Abstract</b>—We consider the problem where packets are generated at each node of a network according to a Poisson process with rate λ, and each of them has to be broadcast to all the other nodes. The network topology is assumed to be an arbitrary bidirectional graph. We derive upper bounds on the maximum achievable broadcast throughput, and lower bounds on the average time required to complete a broadcast. These bounds apply to any network topology, independently of the scheme used to perform the broadcasts. We also propose two dynamic broadcasting schemes, called the indirect and the direct broadcasting scheme, that can be used in a general topology, and we evaluate analytically their throughput and average delay. The throughput achieved by the proposed schemes is equal to the maximum possible, if a half-duplex link model is assumed, and is at least equal to one half of the maximum possible, if a full-duplex model is assumed. The average delay of both schemes is of the order of the diameter of the trees used to perform the broadcasts. The analytical results obtained do not use any approximating assumptions.</p>
General graphs, edge-disjoint trees, dynamic broadcasting, queuing systems.

A. Banerjee and E. A. Varvarigos, "Routing Schemes for Multiple Random Broadcasts in Arbitrary Network Topologies," in IEEE Transactions on Parallel & Distributed Systems, vol. 7, no. , pp. 886-895, 1996.
82 ms
(Ver 3.3 (11022016))