This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Routing Virtual Circuits with Temporal QoS Requirements in Virtual Path-Based ATM Networks
November 1999 (vol. 48 no. 11)
pp. 1228-1243

Abstract—Real-time communication with performance guarantees is expected to become an important feature of future computer networks used for embedded real-time systems and/or for interactive multimedia services. Given an ATM network topology, its virtual path (VP) layout, and its traffic demands, we consider in this paper the problem of selecting for each virtual circuit (VC) with user-specified end-to-end temporal QoS requirements a route (i.e., a sequence of VPs) along which sufficient resources are available to meet the delay requirements. Our objective is 1) to provide the temporal QoS guarantee for each VC to be established while not jeopardizing the QoS guarantees to other existing VCs and 2) to reduce the call blocking probability for future VCs by using the minimum possible resources. We adopt the real-time channel model [16], [33], [51] to characterize the traffic characteristics and the temporal QoS requirement of a VC. We impose a deterministic guarantee that every message generated at the source node be delivered to the destination node in a time period no longer than the relative deadline. We then propose a VC routing scheme based on the distributed Bellman-Ford algorithm [9], [41] to identify an “appropriate” route through the network. By “appropriate,” we mean that the route traverses a minimum number of VPs among all possible routes that have sufficient resources to fulfill the end-to-end temporal QoS requirement of the VC to be established. To ensure that sufficient bandwidth is available over all the VPs along the selected route, we incorporate in our proposed scheme a priority assignment method to calculate the worst-case delay which messages of a VC will experience on a VP along which the VC is routed. We study the performance of, and the message overhead incurred in, the proposed scheme. We also discuss how to extend the proposed routing scheme to accommodate multicast routing.

[1] G. Agrawal,B. Chen,W. Zhao,, and S. Davari,“Guaranteeing synchronous message deadlines with the timed token mediumaccess control protocol,” IEEE Trans. Computers, vol. 43, no. 3, pp. 327-339, Mar. 1994.
[2] S. Ahn, R. Tsang, S.-R. Tong, and D. Du, “Virtual Path Layout Design on ATM Networks,” Proc. IEEE INFOCOM '94, pp. 192-200, 1994.
[3] D. Anderson, R. Herrtwich, and C. Schaefer, “SRP: A Resource Reservation Protocol for Guaranteed-Performance Communications in the Internet,” tech. report, The Int’l Computer Science Inst., Berkeley, Calif., 1991.
[4] N.G. Aneroussis and A.A. Lazar, “Virtual Path Control for ATM Networks with Call Level Quality of Service Guarantees,” Proc. IEEE INFOCOM '96, Mar. 1996.
[5] D. Anick, D. Mitra, and M.M. Sondhi, “Stochastic Theory of a Data-Handling System with Multiple Sources,” Bell Systems Technical J., vol. 61, pp. 1,871-1,894, 1982.
[6] C.M. Aras, J.F. Kurose, D.S. Reeves, and H. Schulzrinne, “Real-Time Communication in Packet-Switched Networks,” Proc. IEEE, vol. 82, no. 1, pp. 122-139, Jan. 1994.
[7] A. Banerjea, D. Ferrari, B. Mah, M. Moran, D.C. Verma, and H. Zhang, “The Tenet Real-Time Protcol Suite: Design, Implementation, and Experiences,” IEEE/ACM Trans. Networking, vol. 4, no. 2, Mar. 1996.
[8] J. Bennett and H. Zhang, “$\big. WF^2Q\bigr.$: Worst-Case Fair Weighted Fair Queueing,” Proc. IEEE INFOCOM 96, pp. 120-128, Mar. 1996.
[9] D. Bertzekas and R. Gallager, Data Networks, second ed. Prentice-Hall, 1992.
[10] J. Boudec, “The Asynchronous Transfer Mode: A Tutorial,” Computer Networks and ISDN Systems, Vol. 24, 1992, pp. 279–309.
[11] B. Chen,G. Agrawal,, and W. Zhao,“Optimal synchronous capacity allocation for hard real-time communicationswith the timed token protocol,” Proc. Real-Time Systems Symp., pp. 198-207, Dec. 1992.
[12] I. Chlamtac, A. Farago, and T. Zhang, “Optimizing the System of Virtual Path,” IEEE/ACM Trans. Networking, vol. 2, no. 6, pp. 581-587, Dec. 1994.
[13] R. Cohen and A. Segall, "Connection Management and Rerouting in ATM Networks," Proc. Infocom '94, Apr. 1994.
[14] A. Demers, S. Keshav, and S. Shenkar, “Analysis and Simulation of a Fair Queueing Algorithm,” Proc. SIGCOMM, pp. 1-12, 1989.
[15] A. Elsaadany, M. Singhal, and M. Liu, "Priority Communication Schemes on Local Area Networks for Multimedia Traffic," Proc. 19th Conf. Local Computer Networks, pp. 372-379, Oct. 1994.
[16] 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.
[17] O. Gerstel and A. Segall, “Dynamic Maintenance of the Virtual Path Layout,” Proc. IEEE INFOCOM '95, pp. 330-337, 1995.
[18] S.J. Golestani,“A stop-and-go queueing framework for congestion management,” Proc. SIGCOMM Symp., ACM, pp. 8-18, Sept. 1990.
[19] S.J. Golestani, “Congestion-Free Communication in High-Speed Packet Networks,” IEEE Trans. Comm., vol. 39, no. 12, pp. 1,802-1,812, 1991.
[20] S.J. Golestani,“A Framing Strategy for Congestion Management,” IEEE J. Selected Areas Comm., vol. 9, no. 7, pp. 1,065-1,077, Sept. 1991.
[21] S.J. Golestani, A Self-Clocked Fair Queueing Scheme for Broadband Applications Proc. IEEE INFOCOM, pp. 636-646, June 1994.
[22] R. Guerin, H. Ahmadi, and M. Naghshineh, “Equivalent Capacity and Its Application to Bandwidth Allocation in High-Speed Networks,” IEEE J. Selected Areas in Comm., vol. 9, no. 7, pp. 968-981, Sept. 1991.
[23] S. Gupta and K.W. Ross, “Routing in Virtual Path Based ATM Network,” Proc. IEEE GLOBECOM '92, pp. 571-575, 1992.
[24] C.-C. Han, K.-J. Lin, and C.-J. Hou, “Distance-Constrained Scheduling and Its Applications in Real-Time Systems,” IEEE Trans. Computers, vol. 45, no. 7, pp. 814-826, July 1996.
[25] C.-J. Hou, “Design of a Fast Restoration Mechanism for Virtual Path Based ATM Networks,” Proc. IEEE INFOCOM '97, 1997.
[26] J.Y. Hui, M.B. Gursoy, N. Moayeri, and R.D. Yates, “A Layered Broadband Switching Architecture with Physical or Virtual Path Networks,” IEEE J. Selected Areas Comm., vol 9, pp. 1,416-1,426, Sept. 1991.
[27] K. Chakrabarty, "Design of System-on-a-Chip Test Access Architectures under Place-and-Route and Power Constraints," Proc. 37th Design Automation Conf. (DAC 00), ACM Press, 2000, pp. 432-437.
[28] J.M. Hyman, A.A. Lazar, and G. Pacifici, “Real-Time Scheduling with Quality of Service Constraints,” IEEE J. Selected Areas Comm., vol. 9, pp. 1,052-1,063, Sept. 1991.
[29] J.M. Hyman, A.A. Lazar, and G. Pacifici, “A Separation Principle between Scheduling and Admission Control for Broadband Switching,” IEEE J. Selected Areas Comm., vol. 11, no. 4, pp. 605-616, May 1993.
[30] J.M. Hyman, A.A. Lazar, and G. Pacifici, “A Methodology for Virtual Path and Virtual Network Bandwidth Assignment in Broadband Networks with QOS Guarantees,” Proc. IEEE GLOBECOM '94, pp. 165-169, 1994.
[31] C.R. Kalmanek, H. Kanakia, and S. Keshav, “Rate Controlled Servers for Very High-Speed Networks,” Proc. GlobeCom '90, pp. 12-20, 1990.
[32] D.D. Kandlur, "Networking in Distributed Real-Time Systems," PhD thesis, Univ. of Michigan, 1991.
[33] D.D. Kandlur, K.G. Shin, and D. Ferrari, “Real-Time Communication in Multi-Hop Networks,” IEEE Trans. Parallel and Distributed Systems, vol. 5, no. 12, pp. 1,044-1,056, Dec. 1994.
[34] R. Kawamura, K. Sato, and I. Tokizawa, “Self-Healing ATM Networks Based on Virtual Path Concept,” IEEE J. Selected Areas in Comm., vol. 12, no. 1, pp. 120–127, Jan. 1994.
[35] M. Kawarasaki and B. Jabbari, “B-ISDN Architecture and Protocol,” IEEE J. Selected Areas in Communications, Vol. 9 No. 9 Dec. 1991, pp. 1405–1415.
[36] A.A. Lazar, A. Orda, and D. Pendarakis, “Virtual Path Allocation in Multi-User Networks: A Noncooerative Approach,” Proc. IEEE INFOCOM '95, Boston, Apr. 1995.
[37] W.C. Lee, M.G. Hluchyj, and P.A. Humblet, "Routing Subject to Quality of Service Constraints in Integrated Communication Networks," IEEE Network, pp. 46-55, July/Aug. 1995.
[38] 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.
[39] F. Lin and K.-T. Cheng, “Virtual Path Assignment and Virtual Circuit Routing in ATM Networks,” Proc. IEEE GLOBECOM '93, pp. 436-441, 1993.
[40] N. Malcolm and W. Zhao, “The Timed-Token Protocol for Real-Time Communications,” Computers, vol. 27, no. 1, pp. 35-41, Jan. 1994.
[41] J.M. McQuillan, G. Falk, and I. Richer, “A Review of the Development and Performance of the ARPANET Routing Algorithm,” IEEE Trans. Comm., vol. 26, no. 12, pp. 1,802-1,811, Dec. 1978.
[42] “Coding of Moving Pictures and Associated Audio,” SC29/WG11 Committee (MPEG) Draft of Standard ISO-IEC/JTC1 SC29, Nov. 1991.
[43] A. Parekh and R.G. Gallager, “A Generalized Processor Sharing Approach to Flow Control in Integrated Services Networks: The Single-Node Case,” IEEE/ACM Trans. Networking, vol. 1, no. 3, pp. 344-357, June 1993.
[44] A.K. Parekh and R.G. Gallager, “A Generalized Processor Sharing Approach to Flow Control in Integrated Services Networks: The Multiple Node Case,” IEEE/ACM Trans. Networking, vol. 2, no. 2, pp. 137-150, Apr. 1994.
[45] K. Sato, S. Ohta, and I. Tokizawa, “Broad-Band ATM Network Architecture Based on Virtual Paths,” IEEE Trans. Comm., vol. 38, no. 8, pp. 1,212-1,222, Aug. 1990.
[46] L. Sha, S. Sathaye, and J.K. Strosnider, "Scheduling Real-Time Communication on Dual-Link Networks," Proc. IEEE Real-Time Systems Symp., pp. 188-197, Dec. 1992.
[47] S. Suri, G. Varghese, and G. Chandranmenon, “Leap Forward Virtual Clock: An O(log log N) Queuing Scheme with Guaranteed Delays and Throughput Fairness,” Proc. IEEE INFOCOM, Apr. 1997.
[48] D. Verma, H. Zhang, and D. Ferrari, “Delay Jitter Control for Real-Time Communication in a Packet Switching Network,” Proc. TriComm '91, pp. 35-43, 1991.
[49] C. Yang and S. Hasegawa, "FITNESS: Failure Immunization Technology for Network Services Survivability," Proc. IEEE GLOBECOM, pp. 1,549-1,554, 1988.
[50] L. Zhang,“Virtual Clock: A new traffic control algorithm forpacket-switched networks,” ACM Trans. Computer Systems, vol. 9, no. 2, pp. 101-124, May 1991.
[51] 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:
Virtual paths, virtual circuits, virtual circuit setup, unicast/multicast, temporal QoS, real-time channel model, distributed shortest path algorithms.
Citation:
Chao-Ju Jennifer Hou, "Routing Virtual Circuits with Temporal QoS Requirements in Virtual Path-Based ATM Networks," IEEE Transactions on Computers, vol. 48, no. 11, pp. 1228-1243, Nov. 1999, doi:10.1109/12.811111
Usage of this product signifies your acceptance of the Terms of Use.