Interval routing schemes allow broadcasting with linear message-complexity

DOI10.1007/S004460100058zbMATH Open1448.68045OpenAlexW2069153881MaRDI QIDQ5138363FDOQ5138363

Cyril Gavoille, Bernard Mans, Pierre Fraigniaud

Publication date: 3 December 2020

Published in: Distributed Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s004460100058

zbMATH Keywords

distributed computingbroadcastingcompact routinginterval routing

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Distributed systems (68M14)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• A trade-off between information and communication in broadcast protocols
• A survey of gossiping and broadcasting in communication networks
• The Compactness of Interval Routing
• On the impact of sense of direction on message complexity
• A Distributed Algorithm for Minimum-Weight Spanning Trees
• Designing networks with compact routing tables
• Methods and problems of communication in usual networks
• A survey on interval routing
• Memory requirement for routing in distributed networks
• Labelling and Implicit Routing in Networks
• A trade-off between space and efficiency for routing tables
• Sense of direction in distributed computing
• Sense of direction: Definitions, properties, and classes
• Interval routing schemes
• Worst Case Bounds for Shortest Path Interval Routing
• On Multi-Label Linear Interval Routing Schemes
• The complexity of interval routing on random graphs
• Lower bounds for compact routing
• Searching among intervals and compact routing tables

Cited In (2)

• Compact and localized distributed data structures
• Setting port numbers for fast graph exploration

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)