This Article 
 Bibliographic References 
 Add to: 
Flow Control for Limited Buffer Multicast
January 1994 (vol. 20 no. 1)
pp. 1-12

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.

[1] S. Armstrong, A. Freier, and K. Marzullo, "Multicast transport protocol," RFC 1301, Feb. 1992.
[2] M. J. Bach,Design of the UNIX Operating System. Englewood Cliffs, NJ: Prentice-Hall, 1986.
[3] A. Ballardi, P. Tsuchiya, and J. Crowcroft, "Core based trees (cbt),"SIGCOMM '93, Aug. 1993.
[4] K.P. Birman and T.A. Joseph, "Reliable Communication in the Presence of Failures,"ACM Trans. Computer Systems, Vol. 5, No. 1, Feb. 1987, pp. 47-76.
[5] L. F. Cabrera, E. D. Hunter, M. J. Karels, and D. Mosher, "User-process communication performance in networks of computers,"IEEE Trans. Software Eng., vol. 14, pp. 38-53, Jan. 1988.
[6] J. Chang and N. F. Maxemchuk, "Reliable broadcast protocols,"ACM Trans. Comput. Syst., vol. 2, no. 3, pp. 251-273, Aug. 1984.
[7] D.R. Cheriton and T.P. Mann, "Decentralizing a Global Naming Service for Improved Performance and Fault Tolerance,"ACM Trans. Computer Systems, Vol. 7, No. 2, May 1989, pp. 147-183.
[8] D. R. Cheriton and W. Zwaenepoel, "Distributed process groups in the V kernel,"ACM Trans. Comput. Syst., vol. 3, no. 2, pp. 77-107, May 1985.
[9] P. B. Danzig, "Optimally selecting the parameters of adaptive backoff algorithms for computer networks and multiprocessors," Ph.D. dissertation, Dep. Comput. Sci., University of California, Berkeley, CA, 1989.
[10] P. B. Danzig, "Flow control for fast multicast,"1989 ACM SIGMETRICS, pp. 108-117, May 1989.
[11] P. B. Danzig, "An analytical model of operating system protocol processing including effects of multiprogramming,"1991 ACM SIGMETRICS, pp. 11-20, May, 1991.
[12] S. E. Deering and D. R. Cheriton, "Multicast routing in datagram internetworks and extended LAN's,"ACM Trans. Comput. Syst., vol. 8, no. 2, pp. 85-110, May 1990.
[13] Advanced Micro Devices,Local Area Network Controller Am 7990 (LANCE) Technical Manual, 1986.
[14] Advanced Micro Devices,The SUPERNET Family for FDDI, 1989.
[15] W. Feller,An Introduction to Probability Theory and Its Applications. Vol. 1. New York: Wiley, 1970.
[16] W. Feller,An Introduction to Probability Theory and Its Applications. Vol. 2. New York: Wiley, 1970.
[17] H. Garcia-Molina and A. Spauster, "Ordered and reliable multicast communication,"ACM Trans. Comput. Syst., vol. 9, pp. 242-271, Aug. 1991.
[18] V. Jacobson, "Congestion avoidance and control,"ACM SIGCOMM '88, pp. 273-288, 1988.
[19] M. G. W. Jones, S.-A. Sorensen, and S. R. Wilbur, "Protocol design for large group multicasting: the message distribution protocol,"Comput. Communic., vol. 14, pp. 287-298, June 1991.
[20] L. Kleinrock,Queueing Systems. Vol. 1. New York: Wiley, 1975.
[21] S. S. Lam and J. W. Wong, "Queueing network models of packet switching networks part 2: Networks with population size constraints,"Performance Evaluation, pp. 161-180, 1982.
[22] P.K. McKinley and J.W.S. Liu, "Multicast Tree Construction in Bus-Based Computer Networks,"Comm. ACM, Vol. 33, No. 1, Jan. 1990, pp. 29-42.
[23] S.W. Melvin and Y.N. Patt, "The Use of Microcode Instrumentation for Development, Debugging, and Tuning of Operating System Kernels,"Proc. ACM SIGMetrics Conf., 1988.
[24] O. Wolfson and A. Milo, "The multicast policy and its relationship to replicated data placement,"ACM Trans. Databases, vol. 16, pp. 181-205, 1991.
[25] S. M. Ross,Stochastic Processes. New York: Wiley, 1983.
[26] M. M. Theimer and K. A. Lantz, "Finding idle machines in a workstation-based distributed system," inProc. 8th IEEE Distrib. Comput. Conf.(San Jose, CA), June 1988, pp. 112-122.
[27] R. van Renesse, H. van Staveren, and A. S. Tannenbaum, "Performance of the world's fastest distributed operating system,"Operat. Syst. Rev., vol. 2, no. 4, pp. 25-34, Oct. 1988.
[28] R. Wolf,Stochastic Modeling and the Theory of Queues. Englewood Cliffs, NJ: Prentice-Hall, 1989.
[29] K. B. Gallagher and J. R. Lyle, "A program decomposition scheme with applications to software modification and testing," inProc. 22nd Int. Conf. System Sciences(Hawaii), Jan. 1989, vol. II, pp. 479-485.

Index Terms:
telecommunications control; protocols; storage management; queueing theory; buffer storage; multiprogramming; network operating systems; multiround flow control algorithm; limited buffer multicast; buffer overflow; response holding; backoff time; recipients; available buffer space; buffer service time distribution; message retransmission; approximate analysis; service time distribution; limited-buffer preemptive queuing process; protocol processing layers; multiprogrammed operating system; accuracy
P.B. Danzig, "Flow Control for Limited Buffer Multicast," IEEE Transactions on Software Engineering, vol. 20, no. 1, pp. 1-12, Jan. 1994, doi:10.1109/32.263751
Usage of this product signifies your acceptance of the Terms of Use.