Throughput-optimal multi-hop broadcast algorithms
In this paper we design throughput-optimal dynamic broadcast algorithms for multi-hop networks with arbitrary topologies. Most of the previous broadcast algorithms route packets along spanning trees, rooted at the source node. For large time-varying networks, computing and maintaining a set of spann...
| Main Authors: | , , |
|---|---|
| Other Authors: | |
| Format: | Article |
| Language: | en_US |
| Published: |
Association for Computing Machinery (ACM)
2017
|
| Online Access: | http://hdl.handle.net/1721.1/109125 https://orcid.org/0000-0001-7220-0691 https://orcid.org/0000-0001-8238-8130 |