Data networks
Sharp approximation models of adaptive routing in mesh networks (preliminary report)
Proc. of the international seminar on Teletraffic analysis and computer performance evaluation
Parallel and distributed computation: numerical methods
Parallel and distributed computation: numerical methods
Multicast in hypercube multiprocessors
Journal of Parallel and Distributed Computing
Optimal communication algorithms for hypercubes
Journal of Parallel and Distributed Computing
Introduction to parallel algorithms and architectures: array, trees, hypercubes
Introduction to parallel algorithms and architectures: array, trees, hypercubes
Communication with few buffers: analysis and design
Communication with few buffers: analysis and design
Performance of hypercube routing schemes with or without buffering
IEEE/ACM Transactions on Networking (TON)
Partial multinode broadcast and partial exchange algorithms for d-dimensional meshes
Journal of Parallel and Distributed Computing
Dynamic Broadcasting in Parallel Computing
IEEE Transactions on Parallel and Distributed Systems
The Combinatorics of Network Reliability
The Combinatorics of Network Reliability
Multinode Broadcast in Hypercubes and Rings with Randomly Distributed Length of Packets
IEEE Transactions on Parallel and Distributed Systems
Efficient Routing Schemes for Multiple Broadcasts in Hypercubes
IEEE Transactions on Parallel and Distributed Systems
| Hi-index | 0.00 |
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.