Flow Control Schemes for a Fault-Tolerant Multicast Protocol
Raimundo José de Araújo Macêdo, Paul Ezhilchelvan, Santosh Kumar Shrivastava · 1995
This paper addresses the problem of flow control in an asynchronous, symmetric, total order group communication protocol. Two algorithms that guarantee that the number of unstable messages does not exceed the stated bound are developed. They are shown to be safe (no buffer overflows) as well as lively (a sender will be eventually permitted to send). Proofs of correctness and experimental results are presented.