Robust Header Compression using Keyword-Packets

Document Type Replaced Internet-Draft (rohc WG)
Last updated 2000-05-24
Replaced by RFC 3095
Stream IETF
Intended RFC status (None)
Expired & archived
pdf htmlized (tools) htmlized bibtex
Stream WG state WG Document
Document shepherd No shepherd assigned
IESG IESG state Replaced by draft-ietf-rohc-rtp
Consensus Boilerplate Unknown
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


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 update packets, which are referenced by non-update packets. This reduces the interdependency between the packets and with this the amount of discarded packets at the decompressor. The Header Compression scheme, the used packet formats and the decompression algorithm, are described in detail.


Akihiro Miyazaki (
Carsten Burmeister (
Hideaki Fukushima (
Rolf Hakenberg (
Thomas Wiebke (

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