Robust Header Compression using Keyword-Packets
draft-miyazaki-rohc-kwhc-01
| Document | Type |
Expired Internet-Draft
(individual)
Expired & archived
|
|
|---|---|---|---|
| Authors | Rolf Hakenberg , Akihiro Miyazaki , Hidehiro Fukushima , Thomas Wiebke , Carsten Burmeister | ||
| Last updated | 2000-05-11 | ||
| 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
Header Compression has proven to be essential for using RTP over bandwidth limited links. While all of these links have only a limited bandwidth, some are additional extremely unreliable, e.g. wireless links. It is shown, that existing Header Compression schemes, that work well over reliable links, perform very bad, if many errors occur. This led to the development of a new robust Header Compression mechanism, that is introduced in this paper. The core idea is the definition of keyword packets, which reduces the amount of discarded packets at the decompressor. The Header Compression scheme, the used packet formats and the decompression algorithm, are described in detail.
Authors
Rolf Hakenberg
Akihiro Miyazaki
Hidehiro Fukushima
Thomas Wiebke
Carsten Burmeister
(Note: The e-mail addresses provided for the authors of this Internet-Draft may no longer be valid.)