Communication and privacy in dynamic message-passing systems
Dariusz Rafal Kowalski · 2012
Dynamic large scale systems pose a great challenge to designers of efficient communication algorithms. Processors cannot rely any more on the gathered knowledge, as it may be entirely inadequate to the current state of the system and to the incoming events. They should not send too many messages either, to avoid buffer overflow. Therefore, one of the natural questions could be: what is the tradeoff between the Quality of Service guaranteed by a communication protocol and its communication complexity?