This Article 
 Bibliographic References 
 Add to: 
Distributed Route Selection for Establishing Real-Time Channels
March 2000 (vol. 11 no. 3)
pp. 318-335

Abstract—To guarantee the delivery of real-time messages before their deadline, a real-time channel or connection must be established before the transmission of any message belonging to the connection. During this channel establishment phase, one must first select a route between the source and destination of this channel and then reserve sufficient resources along this route so that the worst-case end-to-end delay over the selected route may not exceed the user-specified delay bound. We propose an efficient distributed route selection scheme that is guaranteed to find a “qualified” route, if any, satisfying the performance requirement of the requested channel without compromising any of the existing guarantees. The proposed scheme can also eliminate the common reliability/performance bottleneck of a centralized route selection scheme while improving efficiency over the centralized and other distributed schemes. Although the proposed solution starts with searching all possible routes in parallel, it prunes infeasible routes quickly, and its worst-case operational overhead is shown to be only a linear function of the number of links in the network. Several examples and simulation results are presented to demonstrate the effectiveness of the proposed distributed route selection scheme as compared to sequential route-search schemes.

[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] 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.)
[3] L. Zhang, S. Deering, D. Estrin, S. Shenker, and D. Zappala, "RSVP: A New Resource Reservation Protocol," IEEE Network, vol. 7, no. 5, pp. 8-18, Sept. 1993.
[4] D.D. Kandlur and K.G. Shin, “Design of a Communication Subsystem for HARTS,” Technical Report CSE-TR-109-91, CSE Division, Dept. of Electrical Eng. and Computer Science, Univ. of Michigan, 1991.
[5] K.G. Shin and C.-C. Chou, “Design and Evaluation of Real-Time Communication for Field Bus Based Manufacturing Systems,” Proc. 1992 IEEE Local Computer Network Symp., pp. 483-492, Sept. 1992.
[6] C.-C. Chou and K.G. Shin, “Statistical Real-Time Channels on Multiaccess Networks,” Proc. Int'l Conf. Computer Comm., pp. 29-34, Aug. 1995.
[7] C.-C. Chou and K.G. Shin, "Multiplexing Statistical Real-Time Channels on a Multiaccess Network," Proc. 16th Int'l Conf. Distributed Computing Systems, pp. 133-140, May 1996.
[8] C.-C. Chou and K.G. Shin, “Statistical Real-Time Video Channels over a Multiaccess Network,” Proc. High-Speed Networking and Multimedia Computing Symp., IS&T/SPIE Symp. Electronic Imaging Science and Technology, pp. 86-96, Feb. 1994.
[9] D.E. Comer, Internetworking with TCP/IP: Volume I, Principles, Protocols, and Architecture. Prentice Hall, 1995.
[10] PNNI Working Group, “ATM Forum 94-0471R13 PNNI Draft Specification,” available at
[11] D. Bertzekas and R. Gallager, Data Networks, second ed. Prentice-Hall, 1992.
[12] J. Walrand, Communication Networks: A First Course. Aksen Assoc., 1991.
[13] R.L. Cruz, “A Calculus for Network Delay and a Note on Topologies of Interconnection Networks,” PhD thesis, Univ. of Illinois at Urbana-Champaign, July 1987.
[14] D.P. Anderson, R. Wahbe, S. Tzou, R. Govindan, and M. Andrews, “Support for Continuous Media in the Dash System,” Proc. Int'l Conf. Distributed Computing Systems 10, pp. 54-61, May 1990.
[15] D.D. Kandlur, "Networking in Distributed Real-Time Systems," PhD thesis, Univ. of Michigan, 1991.
[16] D. C. Verma, “Guaranteed Performance Communication in High Speed Networks,” PhD thesis, Univ. of California, Berkeley, 1991.
[17] S. Daniel, K.G. Shin, and S. Yun, “A Router Architecture for Flexible Routing and Switching in Point-to-Point Networks,” IEEE Trans. Parallel and Distributed Systems, vol. 10, no. 1, pp. 62-75, Jan. 1999.
[18] A. Weintraub, “The Shortest and the$K$-Shortest Routes as Assignment Problems,” Networks, vol. 3, pp. 61-73, 1973.
[19] J. Lehoczky, L. Sha, and Y. Ding, The Rate Monotonic Scheduling Algorithm: Exact Characterization and Average Case Behavior Proc. IEEE Real-Time Systems Symp., pp. 166-171, 1989.

Index Terms:
Hard real-time communication systems, real-time channel/connection, deadline guarantees, distributed route selection, message scheduling.
Kang G. Shin, Chih-Che Chou, Seok-Kyu Kweon, "Distributed Route Selection for Establishing Real-Time Channels," IEEE Transactions on Parallel and Distributed Systems, vol. 11, no. 3, pp. 318-335, March 2000, doi:10.1109/71.841746
Usage of this product signifies your acceptance of the Terms of Use.