Resource ReSerVation Protocol (RSVP) -- Version 1 Message Processing Rules
draft-lindell-rsvp-procrules-00
| Document | Type |
Expired Internet-Draft
(individual)
Expired & archived
|
|
|---|---|---|---|
| Authors | Lixia Zhang , Robert T. Braden , Bob Lindell | ||
| Last updated | 1999-03-03 | ||
| RFC stream | (None) | ||
| Intended RFC status | (None) | ||
| Formats | |||
| Stream | Stream state | (No stream defined) | |
| Consensus boilerplate | Unknown | ||
| RFC Editor Note | (None) | ||
| IESG | IESG state | Expired | |
| Telechat date | (None) | ||
| Responsible AD | (None) | ||
| Send notices to | (None) |
This Internet-Draft is no longer active. A copy of the expired Internet-Draft is available in these formats:
Abstract
This memo contains an algorithmic description of the rules used by an RSVP implementation for processing messages. It is intended to clarify the version 1 RSVP protocol specification [RFC 2205]. These rules are decomposed into pieces which are contained inside of an abstract processing architecture. This document provides an updated version of the previous processing rules [RFC 2209]. It attempts to provide a description that is less dependent on the particular design choices made in the ISI reference implementation of RSVP.
Authors
Lixia Zhang
Robert T. Braden
Bob Lindell
(Note: The e-mail addresses provided for the authors of this Internet-Draft may no longer be valid.)