Controlling Worst-case Performance of a Communication Protocol and Dynamic Resource Management
This paper raises a fundamental questions, neglected so far in the literature: how to make a distributed algorithm robust against input errors and wrong probabilistic assumptions about the distribution of the inputs or of the link delays. We introduce a notion of complexity-preserving protocol contr...
| Main Author: | |
|---|---|
| Published: |
2023
|
| Online Access: | https://hdl.handle.net/1721.1/149131 |