This Article 
 Bibliographic References 
 Add to: 
Aggressive Transmissions of Short Messages Over Redundant Paths
January 1994 (vol. 5 no. 1)
pp. 102-109

Fault-tolerant computer systems have redundant paths connecting their components.Given these paths, it is possible to use aggressive techniques to reduce the averagevalue and variability of the response time for short, critical messages. One technique is tosend a copy of a packet over an alternate path before it is known whether the first copyfailed or was delayed. A second technique is to split a single stream of packets overmultiple paths. The authors analyze both approaches and show that they can providesignificant improvements over conventional, conservative mechanisms.

[1] U. D. Black, inData Networks: concepts, theory, and practice, Englewood Cliffs, NJ: Prentice-Hall, 1989.
[2] G. J. Coviello, "Comparative discussion of circuit vs. packet switched voice,"IEEE Trans. Communic., vol. 27, pp. 1153-1160, 1979.
[3] F. Cristian, "Probabilistic clock synchronization,"Distributed Computing, vol. 3:3, 1989.
[4] H. Garcia-Molina, "Elections in a distributed computing system,"IEEE Trans. Comput., vol. C-31, pp. 48-59, 1982.
[5] H. Garcia-Molina, B. Kao, and D. Barbara, "Agressive transmissions over redundant paths,"Proc. 11th Int. Conf. Distrib. Computing Syst., pp. 198-207, 1991.
[6] H. Garcia-Molina, B. Kao, and D. Barbara, "Agressive transmissions over redundant paths for time critical messages," Tech. Rep. STAN-CS-92-1431, Stanford University, 1992.
[7] J. Gray, "Notes on database operation systems," inOperating Systems: An Advanced Course(Lecture Notes in Computer Science, vol. 60) Berlin: Springer-Verlag, 1978.
[8] R. Horst and T. Chou, "The hardware architecture and linear expansions of tandem nonstop systems," Tandem Tech. Rep. 85.3, Apr. 1985.
[9] K. Fitzgerald, "Vulnerability exposed in AT&T's 9-hour glitch,"IEEE Inst., vol. 14:3, Mar. 1990.
[10] L. Kleinrock, inQueueing Systems, vol. 2, New York: Wiley, 1976.
[11] J. F. Kurose, M. Schwartz, and Y. Yemini, "Multiple-access protocols and time-constrained communication,"ACM Computing Surveys, vol. 16, pp. 43-70, 1984.
[12] L. Lamport, "The mutual exclusion problem: Part II--Statement and solutions,"J. ACM, vol. 33, no. 2, pp. 327-348, Apr. 1986.
[13] L. Lamport, "The mutual exclusion problem: Part I--A theory of interprocess communication,"J. ACM, vol. 33, no. 2, pp. 313-326, 1986.
[14] S. Lin and D.J. Costello Jr.,Error Control Coding, Fundamentals and Applications, Prentice Hall, Englewood Cliffs, N.J., 1983.
[15] A. Orda and R. Rom, "Routing with packet duplication and elimination in computer networks,"IEEE Trans. Communic., vol. 36(7), pp. 860-866, July 1988.
[16] P. Ramanathan and K. G. Shin, "A multiple copy approach for delivering messages under deadline constraints," inProc. Fault-Tolerant Comput. Symp., 1991, pp. 300-307.
[17] J.A. Stankovic and K. Ramamritham,Hard Real-Time Systems, CS Press, Los Alamitos, Calif., 1984.
[18] A. Tanenbaum,Computer Networks. Englewood Cliffs, NJ: Prentice-Hall, 1988.
[19] K. S. Trivedi,Probability and Statistics with Reliability, Queueing and Computer Science Applications. Englewood Cliffs, NJ: Prentice-Hall, 1982.

Index Terms:
Index Termsfault tolerant computing; redundancy; message passing; packet switching; shortmessages; redundant paths; fault-tolerant computer systems; response time; packets;multiple paths; deadlines; real time communications; replicated transmissions
B. Kao, H. Garcia-Molina, D. Barbará, "Aggressive Transmissions of Short Messages Over Redundant Paths," IEEE Transactions on Parallel and Distributed Systems, vol. 5, no. 1, pp. 102-109, Jan. 1994, doi:10.1109/71.262594
Usage of this product signifies your acceptance of the Terms of Use.