Support for RSVP-based Service over an ATM Network
draft-birman-ipatm-rsvpatm-00

Document Type Expired Internet-Draft (individual)
Last updated 1996-02-23
Stream (None)
Intended RFC status (None)
Formats
Expired & archived
pdf htmlized bibtex
Stream Stream state (No stream defined)
Consensus Boilerplate Unknown
RFC Editor Note (None)
IESG IESG state Expired
Telechat date
Responsible AD (None)
Send notices to (None)

This Internet-Draft is no longer active. A copy of the expired Internet-Draft can be found at
https://www.ietf.org/archive/id/draft-birman-ipatm-rsvpatm-00.txt

Abstract

In this document we focus on RSVP-based resource reservations in a heterogeneous environment which includes ATM networks. We describe a method for establishing 'shortcuts' through an ATM network which avoids the performance penalty associated with level 3 processing in a 'classical RSVP over ATM' approach. For the case of guaranteed service we show how to map the RSVP flow characteristics to ATM call parameters, and thus enable end-to-end performance guarantees. We also discuss the extensions to RSVP and to ATM signaling required for the implementation of these solutions.

Authors

Roch Guerin (guerin@ee.upenn.edu)
Dilip Kandlur (kandlur@watson.ibm.com)
Alex Birman (birman@watson.ibm.com)

(Note: The e-mail addresses provided for the authors of this Internet-Draft may no longer be valid.)