Supporting real-time applications in an Integrated Services Packet Network

ABSTRACT

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.

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	1	R. Chipalkatti, J. Kurose, and D. Towsley. Schedulin9 Policies/or Real-Time and Non-Real. Time Traffic in a Statistical Multiplewer, In Proceedings of GlobeCom '89, pp 774-783, 1989.
	2	S. Casner private communication, 1992.
	3	Ron Cocchi , Deborah Estrin , Scott Shenker , Lixia Zhang, A study of priority pricing in multiple service class networks, Proceedings of the conference on Communications architecture & protocols, p.123-130, September 03-06, 1991, Zurich, Switzerland
	4	A. Demers , S. Keshav , S. Shenker, Analysis and simulation of a fair queueing algorithm, Symposium proceedings on Communications architectures & protocols, p.1-12, September 25-27, 1989, Austin, Texas, United States
	5	J. DeTreville and D. Sincoskie. A Distributed Experimental Communications System, In IEEE $SAC, Vol. 1, No. 6, pp 1070-1075, December 1983.
	6	D. Ferrari. Distributed Delay Jitter Control in Packet- Switching Internetworks, preprint, 1991.
	7	D. Ferrari and D. Verma. A Scheme for Real-Time Channel Establishment in Wide-Area Networks, In IEEE JSAC, Vol. 8, No. 4, pp 368-379, April 1990.
	8	S. J. Golestani, A stop-and-go queueing framework for congestion management, Proceedings of the ACM symposium on Communications architectures & protocols, p.8-18, September 26-28, 1990, Philadelphia, Pennsylvania, United States
	9	S. J. Golestani. Duration-Limited Statistical Multiplexing o/Delay Sensitive Traffic in Packet Networks, In Proceedings of INFOCOM '91, 1991.
	10	Roch Guérin , Levent Gün, A unified approach to bandwidth allocation and access control in fast packet-switched networks, Proceedings of the eleventh annual joint conference of the IEEE computer and communications societies on One world through communications (Vol. 1), p.1-12, May 1992, Florence, Italy
	11	R. Gu~rin, H. Ahmadi, and M. Naghshineh. Equivalent Capacity and Its Application to Bandwidth Allocation in High-Speed Networks, In iEEE JSAC, Vol. 9, No. 9, pp 968-981, September 1991.
	12	Jay Hyman , Aurel A. Lazar , Giovanni Pacifici, MARS: the magnet II real-time scheduling algorithm, Proceedings of the conference on Communications architecture & protocols, p.285-293, September 03-06, 1991, Zurich, Switzerland
	13	J. Hyman, A. Lazar, and G. Pacifici. Real-Time Scheduling with Quality of Service Constraints, In IEEE JSAC, Vol. 9, No. 9, pp 1052-1063, September 1991.
	14	V. Jacobson and S. Floyd private communication, 1991.
	15	V. Jacobson private communication, 1991.
	16	C. Kalmanek, H. Kanakia, and S. Keshav. Rate Controlled Servers for Very High-Speed Networks, In Proceedings of GlobeCom '90, pp 300.3.1-300.3.9, 1990.
	17	C. L. Liu , James W. Layland, Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment, Journal of the ACM (JACM), v.20 n.1, p.46-61, Jan. 1973 [doi>10.1145/321738.321743]
	18	S. Lu and P. R. Kumar. Distributed Scheduling Based on Due Dates and Buffer Priorities, In IEEE Transactions on Automatic Control, 36, pp 1406-1416, 1991.
	19	A. Parekh and R. Gallager. A Generalized Processor Sharing Approach to Flow Control- The Single Node Case, In Technical Report LIDS-TR-2040, Laboratory for Information and Decision Systems, Massachusetts Institute of Technology, 1991.
	20	A. Parekh. A Generalized Processor Sharing Approach to Flow Control in Integrated Services Networks, In Technical Report LIDS-TR-2089, Laboratory for Information and Decision Systems, Massachusetts Institute of Technology, 1992.
	21	H. Schulzrinne, J. Kurose, and D. Towsley. Congestion Control .for Real-Time Traffic, In Proceedings of INFOCOM '90.
	22	D. Verma, H. Zhang, and D. Ferrari. Delay Jitter Control /or Real-Time Communication in a Packet Switching Network, In Proceedings of TriCom '91, pp 35-43, 1991.
	23	C. Weinstein and J. Forgie. Experience with Speech Communication in Packet Networks, In IEEE JSAC, Vol. 1, No. 6, pp 963-980, December 1983.
	24	Hui Zhang , Srinivasan Keshav, Comparison of rate-based service disciplines, Proceedings of the conference on Communications architecture & protocols, p.113-121, September 03-06, 1991, Zurich, Switzerland
	25	L. Zhang. A New Architecture/or Packet Switching Network Protocols, In Technical Report LCS-TR-455, Laboratory for Computer Science, Massachusetts Institute of Technology, 1989.
	26	Lixia Zhang, VirtualClock: a new traffic control algorithm for packet-switched networks, ACM Transactions on Computer Systems (TOCS), v.9 n.2, p.101-124, May 1991 [doi>10.1145/103720.103721]
	27	L. Zhang. A Comparison of Traffic Control Algorithms for High-Speed Networks, In 2rid Annual Workshop on Very High Speed Networks, 1991.