Approximate analysis of open networks of queues with blocking: Tandem configurations
IEEE Transactions on Software Engineering
Multicast routing in internetworks and extended LANs
SIGCOMM '88 Symposium proceedings on Communications architectures and protocols
Queueing analysis of finite buffer token networks
SIGMETRICS '88 Proceedings of the 1988 ACM SIGMETRICS conference on Measurement and modeling of computer systems
Distributed process groups in the V Kernel
ACM Transactions on Computer Systems (TOCS)
The structuring of systems using upcalls
Proceedings of the tenth ACM symposium on Operating systems principles
ACM Transactions on Computer Systems (TOCS)
Introduction to Stochastic Dynamic Programming: Probability and Mathematical
Introduction to Stochastic Dynamic Programming: Probability and Mathematical
User-Process Communication Performance in Networks of Computers
IEEE Transactions on Software Engineering
An analytical model of operating system protocol processing including effects of multiprogramming
SIGMETRICS '91 Proceedings of the 1991 ACM SIGMETRICS conference on Measurement and modeling of computer systems
Reliability and scaling issues in multicast communication
SIGCOMM '92 Conference proceedings on Communications architectures & protocols
EW 4 Proceedings of the 4th workshop on ACM SIGOPS European workshop
Flow Control for Limited Buffer Multicast
IEEE Transactions on Software Engineering
Necessary and sufficient conditions for broadcast consensus protocols
Distributed Computing
ACM SIGCOMM: A mechanism for scalable concast communication
Computer Communications
A note on monotonicity results in multicasting
Operations Research Letters
Hi-index | 0.00 |
When many or all of the recipients of a multicast message respond to the multicast's sender, their responses may overflow the sender's available buffer space. Buffer overflow is a serious, known problem of broadcast-based protocols, and can be troublesome when as few as three or four recipients respond. We develop analytical models that calculate the expected number of buffer overflows that can be used to estimate the number of buffers necessary for an application. The common cure for buffer overflow requires that recipients delay their responses by some random amount of time in order to increase the minimum spacing between response messages, eliminate collisions on the network, and decrease the peak processing demand at the sender. In our table driven algorithm, the sender tries to minimize the multicast's latency, the elapsed time between its initial transmission of the multicast and its reception of the final response, given the number of times (rounds) it is willing to retransmit the multicast. It includes in the multicast the time interval over which it anticipates receiving the response, the round timeout. We demonstrate that the latency of single round multicasts exceeds the latency of multiple round multicasts. We show how recipients minimize the sender's buffer overflows by independently choosing their response times as a function of the round's timeout, sender's buffer size, and the number of other recipients.