Analysis of Link Reversal Routing Algorithms
From MaRDI portal
Publication:5470692
DOI10.1137/S0097539704443598zbMath1092.68005WikidataQ60148602 ScholiaQ60148602MaRDI QIDQ5470692
Srikanta Tirthapura, Costas Busch
Publication date: 1 June 2006
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Analysis of algorithms and problem complexity (68Q25) Analysis of algorithms (68W40) Network design and communication in computer systems (68M10) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Distributed algorithms (68W15)
Related Items (2)
Pioneering the Establishment of the Foundations of the Internet of Things ⋮ New transience bounds for max-plus linear systems
This page was built for publication: Analysis of Link Reversal Routing Algorithms
