A unicast-based multicasting algorithm is presented for arbitrary interconnection networks arising in switchbased networks of workstations. The algorithm is optimal with respect t...
Ran Libeskind-Hadas, Dominic Mazzoni, Ranjith Raja...
We introduce a protocol which routes on flat, locationindependent identifiers with guaranteed scalability and low stretch. Our design builds on theoretical advances in the area of...
Ankit Singla, Brighten Godfrey, Kevin R. Fall, Gia...
—Multicast is an important communication paradigm, also a problem well known for its difficulty (NP-completeness) to achieve certain optimization goals, such as minimum network ...
Existing multicast routing mechanisms were intended for use within regions where a group is widely represented or bandwidth is universally plentiful. When group members, and sende...
Stephen E. Deering, Deborah Estrin, Dino Farinacci...
We consider the problem of designing a compact communication network that supports efficient routing in an Euclidean plane. Our network design and routing scheme achieves 1+ stret...