This Article 
 Bibliographic References 
 Add to: 
V${\cal V}$-NET: A Versatile Network Architecture for Flexible Delay Guarantees in Real-Time Networks
August 2000 (vol. 49 no. 8)
pp. 841-858

Abstract—This paper proposes a Versatile Network Architecture (${\cal V}$-net) to support flexible delay guarantees for applications in real-time networks. Applications communicate over the ${\cal V}$-net by using end-to-end network connections which support real-time and reliability characteristics tailored to meet the application's specified requirements. ${\cal V}$-net differs from other proposed architectures in that, in addition to addressing the issue of quality of service (QoS) feasibility for a wide spectrum of real-time applications, it also provides a mechanism to determine a network state dependent range of feasible delay values at each switching node along the routing path. These delay ranges can be used to assign per-node delays that reflect the resource availability of the node, thereby reducing the likelihood of bottlenecks along the routing path. The ${\cal V}$-net delay guarantees are provided for a variety of packet scheduling algorithms and traffic policing mechanisms. This flexibility is an important design consideration as a real-time network architecture must accommodate existing and future multimedia applications, with hard-, soft-, and non-real-time traffic. The performance evaluation results demonstrate the efficiency of this scheme in handling different traffic scenarios and QoS requirements. We have shown that it is possible, and indeed efficient, to determine an upper-bound on the delay of real-time traffic, when using our per-node delay assignment policies.

[1] 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.
[2] J.C.R. Bennett and H. Zhang, “Why WFQ Is Not Good Enough for Integrated Services Networks?” Proc. Int'l Workshop Network and Operating Systems Suport for Digital Audio and Video '96, Apr. 1996.
[3] J.C.R. Bennett, D.C. Stephens, and H. Zhang, “High Speed, Scalable, and Accurate Implementation of Fair Queueing Algorithms in ATM Networks,” Proc. Int'l Conf. Network Protocols '97, 1997.
[4] D.D. Clark,S. Shenker,, and L. Zhang,“Supporting real-time applications inan integrated services packet network: Architecture and mechanism,” Proc. ACM SIGCOMM, pp. 14-26, 1992.
[5] D.E. Comer, Internetworking with TCP/IP: Volume I, Principles, Protocols, and Architecture. Prentice Hall, 1995.
[6] 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.
[7] D. Ferrari, Client Requirements for Real-Time Communication Services IEEE Comm. Magazine, vol. 28, no. 11, pp. 76-90, Nov. 1990.
[8] S. Jamaloddin Golestani, “Duration-Limited Statistical Multiplexing of Delay-Sensitive Traffic in Packet Networks,” Proc.Infocom '91, pp. 323-332, 1991.
[9] S. Jamaloddin Golestani, “A Framing Strategy for Congestion Management,” IEEE J. Selected Areas in Comm., vol. 9, no. 7, pp. 1,064-1,077, Sept. 1991.
[10] C.R. Kalmanek, H. Kanakia, and S. Keshav, “Rate Controlled Servers for Very High-Speed Networks,” Proc. GlobeCom '90, pp. 12-20, 1990.
[11] S. Keshav, An Engineering Approach to Computer Networks. Reading, Mass.: Addison-Wesley, 1997.
[12] S. Lauzac, R. Melhem, and D. Mosse, “An Efficient RMS Admission Control and Its Application to Multiprocessor Scheduling,” Proc. Int'l Parallel Processing Symp., pp. 511-518, 1998.
[13] A.A. Lazar and G. Pacifici, “Control of Resources in Broadband Networks with Quality of Service Guarantees,” IEEE Comm. Magazine, vol. 29, no. 10, pp. 66-73, Oct. 1991.
[14] 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.
[15] 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.
[16] E.P. Rathgeb, “Modeling and Performance Comparison of Policing Mechanisms for ATM Networks,” IEEE J. Selected Areas in Comm., vol. 9, no. 3, pp. 325-334, Apr. 1991.
[17] L. Sha, R. Rajkuma, and J.P. Lehoczky, "Priority Inheritance Protocols: An Approach to Real-Time Synchronization," IEEE Trans. Computers, vol. 39, no. 9, pp. 1,175-1,185, Sept. 1990.
[18] L. Trajkovic and S.J. Golestani,“Congestion control for multimedia services,” IEEE Network, Sept. 1992.
[19] J.S. Turner, "New Directions in Communications (Or Which Way to the Information Age)," IEEE Comm. Magazine, vol. 24, no. 10, pp. 8-15, Oct. 1986.
[20] 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.
[21] L. Zhang, “A New Architecture for Packet Switching Network Protocols,” PhD thesis, Dept. of Electrical Eng. and Computer Science, Massachusetts Inst. of Tech nology, July 1989.
[22] L. Zhang, “A Reservation Setup Protocol,” IEEE Network, 1993.

Index Terms:
Network architecture, integrated service, QoS guarantees, real-time scheduling, packet policing, channel admission control.
Brian Field, Taieb F. Znati, Daniel Mossé, "V${\cal V}$-NET: A Versatile Network Architecture for Flexible Delay Guarantees in Real-Time Networks," IEEE Transactions on Computers, vol. 49, no. 8, pp. 841-858, Aug. 2000, doi:10.1109/12.868029
Usage of this product signifies your acceptance of the Terms of Use.