Efficient routing schemes for multiple broadcasts in hypercubes
George D. Stamoulis, John N. Tsitsiklis · IEEE Transactions on Parallel and Distributed Systems · 1993
The authors analyze the problem in which each node of the binary hypercube independently generates packets according to a Poisson process with rate lambda ; each of the packets is to be broadcast to all other nodes. Assuming unit packet length and no other communications taking place, it is observed that the system can be stable in steady-state only if the load factor rho identical to lambda (2/sup d/-1)/d satisfies rho>