Multi-Class PPP with Channel Preemption and Dynamic Fragmentation
draft-nunes-pppext-mcp-00
| Document | Type |
Expired Internet-Draft
(individual)
Expired & archived
|
|
|---|---|---|---|
| Author | Mario Nunes | ||
| Last updated | 2002-06-17 | ||
| 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 document defines the encapsulation and mechanisms that allows PPP packets to be transported over low-bitrate links such as modem lines, ISDN B-channels, and sub-T1 links with guarantee of quality of service for time sensitive services. A mechanism of channel preemption is defined, allowing the immediate occupation of the channel with the most priority packet, resuming the transmission of the lower priority frame without need to retransmit the octets already sent. This mechanism allows a dynamic packet fragmentation, guaranteeing simultaneously a low transmission delay for the services more sensitive to transmission delays and an efficient channel occupation. It is a recursive mechanism, which means that the packet that made the channel preemption can itself be preempted by another higher priority packet, and this process can be repeated whenever a higher priority packet requests transmission. The proposed mechanism is compatible with existing hardware and drivers for asynchronous and synchronous HDLC controllers.
Authors
(Note: The e-mail addresses provided for the authors of this Internet-Draft may no longer be valid.)