Supporting real-time applications in an Integrated Services Packet Network
Authors:
- David D. ClarkDCDavid D. Clark
- Scott ShenkerSSScott Shenker
- Lixia ZhangLZLixia Zhang
Open Access
- 1 October 1992
- journal article
- Published by Association for Computing Machinery (ACM) in ACM SIGCOMM Computer Communication Review
- Vol. 22 (4) , 14-26
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.Keywords
This publication has 9 references indexed in Scilit:
- Delay jitter control scheme for packet-switching internetworksComputer Communications, 1992
- Distributed scheduling based on due dates and buffer prioritiesIEEE Transactions on Automatic Control, 1991
- MARS1991
- A study of priority pricing in multiple service class networks1991
- Comparison of rate-based service disciplines1991
- VirtualClockACM Transactions on Computer Systems, 1991
- A stop-and-go queueing framework for congestion management1990
- Analysis and simulation of a fair queueing algorithm1989
- Scheduling Algorithms for Multiprogramming in a Hard-Real-Time EnvironmentJournal of the ACM, 1973