Broadcasting, multicasting and gossiping in trees under the all-port line model
Johanne Cohen · 1998
This paper is devoted to multi-point communication problems under the all-port line model.The line model assumes long distance calls between non neighboring processors.In this sense, the line model is strongly related to circuit-switched networks, wormhole routing, optical networks supporting wavelength division multiplexing, ATM switching, and networks supporting connected mode routing protocols.Since tree-networks are basic tools for t,he management of multi-point applications in both parallel systems and computer networks, we propose polynomial algorithms to derive optimal or near optimal broadcast, multicast and gossip protocols in trees. 'Additional support