Efficient management of transient station failures in linear radio communication networks with bases

DOI10.1016/J.JPDC.2005.11.002MaRDI QIDQ2497724zbMATH OpenOpenAlexFDO

Authors Carlo Gaibisso, Guido Proietti, Richard B. Tan

Publication date 4 August 2006

Published in Journal of Parallel and Distributed Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.jpdc.2005.11.002

zbMATH Keywords

fault-toleranceradio networksswap algorithmsstation failures

Mathematics Subject Classification ID

Reliability, testing and fault tolerance of networks and computer systems (68M15) Communication networks in operations research (90B18)

Recommendations

• Linear time distributed swap edge algorithms
• Swapping a failing edge of a single source shortest paths tree is good and fast
• Mathematical models for failure reconfiguration of telecommunication networks: Part 2
• scientific article; zbMATH DE number 1305082
• Finding best swap edges minimizing the routing cost of a spanning tree

Cited in

(1)

• The minimum broadcast range assignment problem on linear multi-hop wireless networks.

This page was built for publication: Efficient management of transient station failures in linear radio communication networks with bases

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2497724)