Abstract
We consider routing in delay-tolerant networks like satellite constellations with known but intermittent contacts, random message loss, and resource-constrained nodes. Using a Markov decision process model, we seek a forwarding strategy that maximises the probability of delivering a message given a bound on the network-wide number of message copies. Standard probabilistic model checking would compute strategies that use global information, which are not implementable since nodes can only act on local data. In this paper, we propose notions of distributed schedulers and good-for-distributed-scheduling models to formally describe an implementable and practically desirable class of strategies. The schedulers consist of one sub-scheduler per node whose input is limited to local information; good models additionally render the ordering of independent steps irrelevant. We adapt the lightweight scheduler sampling technique in statistical model checking to work for distributed schedulers and evaluate the approach, implemented in the Modest Toolset, on a realistic satellite constellation and contact plan.
Original language | English |
---|---|
Title of host publication | NASA Formal Methods |
Subtitle of host publication | 12th International Symposium, NFM 2020, Moffett Field, CA, USA, May 11–15, 2020, Proceedings |
Editors | Ritchie Lee, Susmit Jha, Anastasia Mavridou |
Publisher | Springer |
Pages | 291-310 |
Number of pages | 20 |
ISBN (Electronic) | 978-3-030-55754-6 |
ISBN (Print) | 978-3-030-55753-9 |
DOIs | |
Publication status | Published - 10 Aug 2020 |
Event | 12th NASA Formal Methods Symposium, NFM 2020 - Virtual Conference Duration: 11 May 2020 → 15 May 2020 Conference number: 12 https://ti.arc.nasa.gov/events/nfm-2020/ |
Publication series
Name | Lecture Notes in Computer Science |
---|---|
Publisher | Springer |
Volume | 12229 |
Conference
Conference | 12th NASA Formal Methods Symposium, NFM 2020 |
---|---|
Abbreviated title | NFM 2020 |
Period | 11/05/20 → 15/05/20 |
Internet address |