Deadlock in packet switching networks
From MaRDI portal
Publication:2145272
DOI10.1007/978-3-030-89247-0_9zbMATH Open1496.68043arXiv2101.06015OpenAlexW3208964046MaRDI QIDQ2145272FDOQ2145272
Authors: Anna Stramaglia, Jeroen J. A. Keiren, Hans Zantema
Publication date: 17 June 2022
Abstract: A deadlock in a packet switching network is a state in which one or more messages have not yet reached their target, yet cannot progress any further. We formalize three different notions of deadlock in the context of packet switching networks, to which we refer as global, local and weak deadlock. We establish the precise relations between these notions, and prove they characterize different sets of deadlocks. Moreover, we implement checking of deadlock freedom of packet switching networks using the symbolic model checker nuXmv. We show experimentally that the implementation is effective at finding subtle deadlock situations in packet switching networks.
Full work available at URL: https://arxiv.org/abs/2101.06015
Recommendations
Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Specification and verification (program logics, model checking, etc.) (68Q60) Network design and communication in computer systems (68M10)
Cites Work
Cited In (4)
Uses Software
This page was built for publication: Deadlock in packet switching networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2145272)