Supporting Real-Time Applications in an Integrated Services Packet Network: Architecture and Mechanism

This paper considers the support of real-time applications in an Integrated Services Packet Network (ISPN). We first review the characteristics of real-time applications. We observe that, contrary to the popular view that real-time applications necessarily require a fixed delay bound, some real-time applications are more flexible and can adapt to current network conditions. We then propose an ISPN architecture that supports two distinct kinds of real-time service: guaranteed service, which is the traditional form of real-time service discussed in most of the literature and involves pre-computed worst-case delay bounds, and predicted service which uses the measure performance of the network in computing delay bounds. We then propose a packet scheduling mechanism that can support both of these real-time services as well as accommodate datagram traffic. We also discuss two other aspects of an overall ISPN architecture: the service interface and the admission control criteria.

[1]  Chung Laung Liu,et al.  Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment , 1989, JACM.

[2]  W. David Sincoskie,et al.  A Distributed Experimental Communications System , 1983, IEEE Journal on Selected Areas in Communications.

[3]  Clifford J. Weinstein,et al.  Experience with Speech Communication in Packet Networks , 1983, IEEE J. Sel. Areas Commun..

[4]  Lixia Zhang,et al.  A new architecture for packet switching network protocols , 1989 .

[5]  Scott Shenker,et al.  Analysis and simulation of a fair queueing algorithm , 1989, SIGCOMM 1989.

[6]  Dinesh C. Verma,et al.  A Scheme for Real-Time Channel Establishment in Wide-Area Networks , 1990, IEEE J. Sel. Areas Commun..

[7]  Srinivasan Keshav,et al.  Rate controlled servers for very high-speed networks , 1990, [Proceedings] GLOBECOM '90: IEEE Global Telecommunications Conference and Exhibition.

[8]  Henning Schulzrinne,et al.  Congestion control for real-time traffic in high-speed networks , 1990, Proceedings. IEEE INFOCOM '90: Ninth Annual Joint Conference of the IEEE Computer and Communications Societies@m_The Multiple Facets of Integration.

[9]  S. J. Golestani.  A stop-and-go queueing framework for congestion management , 1990, SIGCOMM 1990.

[10]  D.C. Verma,et al.  Delay jitter control for real-time communication in a packet switching network , 1991, Proceedings of TRICOMM `91: IEEE Conference on Communications Software: Communications for Distributed Applications and Systems.

[11]  Hamid Ahmadi,et al.  Equivalent Capacity and Its Application to Bandwidth Allocation in High-Speed Networks , 1991, IEEE J. Sel. Areas Commun..

[12]  P. R. Kumar,et al.  Distributed scheduling based on due dates and buffer priorities , 1991 .

[13]  Hui Zhang,et al.  Comparison of rate-based service disciplines , 1991, SIGCOMM '91.

[14]  Lixia Zhang.  VirtualClock: A New Traffic Control Algorithm for Packet-Switched Networks , 1991, ACM Trans. Comput. Syst..

[15]  S. Jamaloddin Golestani.  Duration-limited statistical multiplexing of delay-sensitive traffic in packet networks , 1991, IEEE INFCOM '91. The conference on Computer Communications. Tenth Annual Joint Comference of the IEEE Computer and Communications Societies Proceedings.

[16]  Deborah Estrin,et al.  A study of priority pricing in multiple service class networks , 1991, SIGCOMM '91.

[17]  Aurel A. Lazar,et al.  MARS: the magnet II real-time scheduling algorithm , 1991, SIGCOMM 1991.

[18]  Aurel A. Lazar,et al.  Real-Time Scheduling with Quality of Service Constraints , 1991, IEEE J. Sel. Areas Commun..

[19]  Roch Guérin,et al.  A unified approach to bandwidth allocation and access control in fast packet-switched networks , 1992, [Proceedings] IEEE INFOCOM '92: The Conference on Computer Communications.

[20]  Abhay Parekh,et al.  A generalized processor sharing approach to flow control in integrated services networks: the single-node case , 1993, TNET.