Approximate solutions for M/G/1 fork/join synchronization
WSC '94 Proceedings of the 26th conference on Winter simulation
A reliable multicast framework for light-weight sessions and application level framing
SIGCOMM '95 Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
Scalable reliable multicast using multiple multicast groups
SIGMETRICS '97 Proceedings of the 1997 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Scoped hybrid automatic repeat reQuest with forward error correction (SHARQFEC)
Proceedings of the ACM SIGCOMM '98 conference on Applications, technologies, architectures, and protocols for computer communication
Bound Performance Models of Heterogeneous Parallel Processing Systems
IEEE Transactions on Parallel and Distributed Systems
Mean value technique for closed fork-join networks
SIGMETRICS '99 Proceedings of the 1999 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
pgmcc: a TCP-friendly single-rate multicast congestion control scheme
Proceedings of the conference on Applications, Technologies, Architectures, and Protocols for Computer Communication
Extending equation-based congestion control to multicast applications
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
Multicasting on the Internet and Its Applications
Multicasting on the Internet and Its Applications
Computing Performance Bounds of Fork-Join Parallel Programs Under a Multiprocessing Environment
IEEE Transactions on Parallel and Distributed Systems
PfHSN '96 Proceedings of the TC6 WG6.1/6.4 Fifth International Workshop on Protocols for High-Speed Networks V
Multimedia transport protocol and multicast communication
Proceedings of the 2nd International Workshop on Architecture and Protocols for High Performance Networks: High-Speed Networking for Multimedia Applications
Transport Layer Multicast: An Enhancement for XTP Bucket Error Control
Proceedings of the IFIP TC6/WG6.4 Fourth International Conference on High Performance Networking IV
Efficient congestion avoidance mechanism
LCN '00 Proceedings of the 25th Annual IEEE Conference on Local Computer Networks
Multicast Feedback Suppression Using Representatives
INFOCOM '97 Proceedings of the INFOCOM '97. Sixteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Driving the Information Revolution
RAMP: a reliable adaptive multicast protocol
INFOCOM'96 Proceedings of the Fifteenth annual joint conference of the IEEE computer and communications societies conference on The conference on computer communications - Volume 3
Reliable multicast transport protocol (RMTP)
IEEE Journal on Selected Areas in Communications
Hi-index | 0.00 |
We study a problem abstracted from modeling a multicast protocol. In our model, messages generated by a single source are simultaneously forwarded to a set of receivers where they are independently processed. We assume a state-dependent message arrival rate and memoryless service time distributions. The receivers may process messages at different average rates. Messages processed by all receivers are periodically acknowledged and cleared from the system. Due to finite buffer space, the total number of non-acknowledged messages in the system is limited. Our focus in this paper is on the number of messages cleared at acknowledgement time.The problem under consideration bears resemblance to a fork/join process with heterogeneous servers, used in the study of multiprocessing computer systems. Our model includes the additional features of finite buffer space and delayed periodic departure of completed jobs. Even without these features, the resulting type of queuing model has no known closed-form solution in the general case of more than two servers. Because the arrival processes to the servers are correlated, the model is difficult to decompose. We propose a relatively simple decomposition technique and a fixed-point iteration scheme. In our approach, we consider each receiver (server) in isolation, and we account for the influence of other receivers through the probability that a given number of messages can be cleared at acknowledgement time. We derive elementary differential equations for the number of messages processed by a receiver. These equations involve the conditional probability of the number of messages not yet processed given the number of messages waiting to be cleared. We compute an approximate solution using the conditional probability obtained from a model with exponentially distributed acknowledgement periods. Our numerical results for the average number of messages cleared at acknowledgment time are typically within a few percent of simulation midpoints.