Show simple item record

dc.contributor.authorClark, David D.
dc.contributor.authorShenker, Scott
dc.contributor.authorZhang, Lixia
dc.date.accessioned2002-07-23T16:25:44Z
dc.date.available2002-07-23T16:25:44Z
dc.date.issued1992-08
dc.identifier.urihttp://hdl.handle.net/1721.1/1543
dc.description.abstractThis 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 measured 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. en
dc.description.sponsorshipResearch at MIT was supported by DARPA through NASA Grant NAG 2-582, by NSF grant NCR-8814187, and by DARPA and NSF through Cooperative Agreement NCR-8919038 with the Corporation for National Research Initiatives. en
dc.format.extent232768 bytes
dc.format.mimetypeapplication/pdf
dc.language.isoen_US
dc.subjectfixed delay bounden
dc.subjectIntegrated Services Packet Networken
dc.subjectISPNen
dc.subjectreal-time applicationsen
dc.titleSupporting Real-Time Applications in an Integrated Services Packet Network: Architecture and Mechanismen


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record