Interval routing schemes allow broadcasting with linear message-complexity
From MaRDI portal
(Redirected from Publication:5138363)
Recommendations
Cites work
- A Distributed Algorithm for Minimum-Weight Spanning Trees
- A survey of gossiping and broadcasting in communication networks
- A survey on interval routing
- A trade-off between information and communication in broadcast protocols
- A trade-off between space and efficiency for routing tables
- Designing networks with compact routing tables
- scientific article; zbMATH DE number 1775430 (Why is no real title available?)
- scientific article; zbMATH DE number 1405786 (Why is no real title available?)
- Interval routing schemes
- Labelling and Implicit Routing in Networks
- Lower bounds for compact routing (extended abstract)
- Memory requirement for routing in distributed networks
- Methods and problems of communication in usual networks
- On Multi-Label Linear Interval Routing Schemes
- On the impact of sense of direction on message complexity
- Searching among intervals and compact routing tables
- Sense of direction in distributed computing
- Sense of direction: Definitions, properties, and classes
- The Compactness of Interval Routing
- The complexity of interval routing on random graphs
- Worst Case Bounds for Shortest Path Interval Routing
Cited in
(4)
This page was built for publication: Interval routing schemes allow broadcasting with linear message-complexity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5138363)
