RSVP Refresh Overhead Reduction by State Compression
draft-ietf-rsvp-state-compression-04
| Document | Type |
Expired Internet-Draft
(rsvp WG)
Expired & archived
|
|
|---|---|---|---|
| Authors | Lixia Zhang , Andreas Terzis , Lan Wang | ||
| Last updated | 2000-03-16 | ||
| RFC stream | Internet Engineering Task Force (IETF) | ||
| Intended RFC status | (None) | ||
| Formats | |||
| Additional resources | Mailing list discussion | ||
| Stream | WG state | WG Document | |
| Document shepherd | (None) | ||
| IESG | IESG state | Expired | |
| Consensus boilerplate | Unknown | ||
| 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
As a soft-state protocol, RSVP specifies that each RSVP node sends peri- odic RSVP messages for each existing RSVP session. The overhead due to such periodic state refreshes goes up linearly with the number of active RSVP sessions. One can reduce the overhead by using a longer refresh period, which unfortunately leads to longer delays in re-synchronizing RSVP state in face of packet losses. To overcome the dilemma, this specification describes the use of a 'state-compression' approach to soft-state protocol refreshes. In the absence of state changes this compression mechanism has a constant message overhead while retaining the soft-state nature of RSVP.
Authors
Lixia Zhang
Andreas Terzis
Lan Wang
(Note: The e-mail addresses provided for the authors of this Internet-Draft may no longer be valid.)