This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Fault-Tolerant Real-Time Communication in Distributed Computing Systems
May 1998 (vol. 9 no. 5)
pp. 470-480

Abstract—The delivery delay in a point-to-point packet switching network is difficult to control due to the contention among randomly-arriving packets at each node and multihops a packet must travel between its source and destination. Despite this difficulty, there are an increasing number of applications that require packets to be delivered reliably within prespecified delay bounds. This paper shows how this can be achieved by using real-time channels which make "soft" reservation of network resources to ensure the timely delivery of real-time packets. We first present theoretical results and detailed procedures for the establishment of real-time channels and then show how the basic real-time channels can be enhanced to be fault-tolerant using the multiple disjoint paths between a pair of communicating nodes. The contribution of the former is a tighter schedulability condition which makes more efficient use of network resources than any other existing approaches, and that of the latter is a significant improvement in fault tolerance over the basic real-time channel, which is inherently susceptible to component failures.

[1] D. Ferrari and D.C. Verma,“A scheme for real-time channel establishment in wide-area networks, IEEE J. Selected Areas in Comm., vol. 8, no. 3, pp. 368-379, Apr. 1990.
[2] C.L. Liu and J.W. Layland, “Scheduling Algorithms for Multiprogramming in a Hard Real-Time Environment,” J. ACM, vol. 20, no. 1, pp. 40-61, 1973.
[3] D.D. Kandlur, K.G. Shin, and D. Ferrari, "Real-Time Communication in Multi-Hop Networks," Proc. 11th Int'l. Conf. Distributed Computing Systems, pp. 300-307, 1991. (An improved version appeared in the Oct. 1994 issue of IEEE Trans. Parallel and Distributed Systems.)
[4] D.E. Comer, Internetworking with TCP/IP. Prentice-Hall, 1991.
[5] B. Chen, S. Kamat, and W. Zhao, "Fault-Tolerant Real-Time Communication in FDDI-Based Networks," Proc. IEEE Real-Time Systems Symp., pp. 141-150, 1995.
[6] P. Ramanathan and K.G. Shin, “Delivery of Time-Critical Messages Using a Multiple Copy Approach,” ACM Trans. Computer Systems, vol. 10, no. 2, pp. 144–166, May 1992.
[7] B. Kao, H. Garcia-Molina, and D. Barbara, "Aggressive Transmissions of Short Messages Over Redundant Paths," IEEE Trans. Parallel and Distributed Systems, vol. 5, no. 1, pp. 102-109, Jan. 1994.
[8] A. Banerjea, “Simulation Study of the Capacity Effects of Dispersity Routing for Fault Tolerant Realtime Channels,” Proc. ACM SIGCOMM, pp. 194–205, 1996.
[9] A. Banerjea, C.J. Parris, and D. Ferrari, "Recovering Guaranteed Performance Service Connections from Single and Multiple Faults," Technical Report TR-93-066, Computer Science Division, Univ. of California at Berkeley, 1993.
[10] I. Cidon, I. Gopal, G. Grover, and M. Sidi, "Real-Time Packet Switching: A Performance Analysis," IEEE J. Selected Areas Comm., vol. 6, no. 9, pp. 1,576-1,586, 1988.
[11] J. Rexford, J. Hall, and K.G. Shin, "A Router Architecture for Real-Time Point-to-Point Networks," Proc. 23rd Ann. Int'l Symp. Computer Architecture, pp. 237-246, May 1996.
[12] S. Han and K.G. Shin, "Fast Restoration of Real-Time Communication Service from Component Failures in Multi-Hop Networks," Proc. ACM SIGCOMM97, pp. 77-88, Sept. 1997.
[13] Q. Zheng and K.G. Shin,“On the ability of establishing real-time channelsin point-to-point packet-switched networks,” IEEE Trans. Comm. pp. 1,096-1,105, Feb./Mar./Apr. 1994.

Index Terms:
Real-time fault-tolerant communications, point-to-point packet switching networks, deadline scheduling, single-failure-immune (SFI) networks.
Citation:
Qin Zheng, Kang G. Shin, "Fault-Tolerant Real-Time Communication in Distributed Computing Systems," IEEE Transactions on Parallel and Distributed Systems, vol. 9, no. 5, pp. 470-480, May 1998, doi:10.1109/71.679217
Usage of this product signifies your acceptance of the Terms of Use.