Reliable communication in the presence of failures
ACM Transactions on Computer Systems (TOCS)
The design of the UNIX operating system
The design of the UNIX operating system
Mathematica: a system for doing mathematics by computer
Mathematica: a system for doing mathematics by computer
Congestion avoidance and control
SIGCOMM '88 Symposium proceedings on Communications architectures and protocols
Performance of the world's fastest distributed operating system
ACM SIGOPS Operating Systems Review
SIGMETRICS '88 Proceedings of the 1988 ACM SIGMETRICS conference on Measurement and modeling of computer systems
Decentralizing a global naming service for improved performance and fault tolerance
ACM Transactions on Computer Systems (TOCS)
Finite buffers for fast multicast
SIGMETRICS '89 Proceedings of the 1989 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Multicast tree construction in bus-based networks
Communications of the ACM
Multicast routing in datagram internetworks and extended LANs
ACM Transactions on Computer Systems (TOCS)
The multicast policy and its relationship to replicated data placement
ACM Transactions on Database Systems (TODS)
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
Protocol design for large group multicasting: the message distribution protocol
Computer Communications
Ordered and reliable multicast communication
ACM Transactions on Computer Systems (TOCS)
SIGCOMM '93 Conference proceedings on Communications architectures, protocols and applications
Distributed process groups in the V Kernel
ACM Transactions on Computer Systems (TOCS)
ACM Transactions on Computer Systems (TOCS)
User-Process Communication Performance in Networks of Computers
IEEE Transactions on Software Engineering
Optimally selecting the parameters of adaptive backoff algorithms for computer networks and multiprocessors
Theory, Volume 1, Queueing Systems
Theory, Volume 1, Queueing Systems
On General Results for All-to-All Broadcast
IEEE Transactions on Parallel and Distributed Systems
H-RMC: a hybrid reliable multicast protocol for the Linux kernel
SC '99 Proceedings of the 1999 ACM/IEEE conference on Supercomputing
Design and implementation of multicast operations for ATM-based high performance computing
Proceedings of the 1994 ACM/IEEE conference on Supercomputing
Efficient rate-controlled bulk data transfer using multiple multicast groups
IEEE/ACM Transactions on Networking (TON)
An empirical study of reliable multicast protocols over Ethernet-connected networks
Performance Evaluation
Linux-HA heartbeat system design
ALS'00 Proceedings of the 4th annual Linux Showcase & Conference - Volume 4
Efficient reconciliation and flow control for anti-entropy protocols
LADIS '08 Proceedings of the 2nd Workshop on Large-Scale Distributed Systems and Middleware
Hi-index | 0.00 |
Analyses a multiround flow control algorithm that attempts to minimize the time required to multicast a message to a group of recipients and receive responses directly from each group member. Such a flow control algorithm may be necessary because the hurry of responses to the multicast can overflow the buffer space of the process that issued the multicast. The condition that each recipient directly respond to the multicast prevents the use of reliable multicast protocols based on software combining trees or negative-acknowledgments. The flow control analysed algorithm directs the responding processes to hold their responses for some period of time, called the backoff time, before sending them to the originator. The backoff time depends on the number of recipients that respond, the originator's available buffer space and buffer service time distribution, and the number of times that the originator is willing to retransmit its message. This paper develops an approximate analysis of the service time distribution of the limited-buffer preemptive queuing process that occurs within the protocol processing layers of a multiprogrammed operating system. It then uses this model to calculate multicast backoff times. The paper reports experimental verification of the accuracy of this service time model and discusses its application to the multicast flow control problem.