RE: SigComp Requirements (was Re: [rohc] RE: Default decompressio n algorithms)

"Price, Richard" <richard.price@roke.co.uk> Thu, 28 February 2002 15:01 UTC

Received: from optimus.ietf.org (ietf.org [132.151.1.19] (may be forged)) by ietf.org (8.9.1a/8.9.1a) with ESMTP id KAA26772 for <rohc-archive@odin.ietf.org>; Thu, 28 Feb 2002 10:01:29 -0500 (EST)
Received: from optimus.ietf.org (localhost [127.0.0.1]) by optimus.ietf.org (8.9.1a/8.9.1) with ESMTP id JAA04232; Thu, 28 Feb 2002 09:58:22 -0500 (EST)
Received: from ietf.org (odin [132.151.1.176]) by optimus.ietf.org (8.9.1a/8.9.1) with ESMTP id JAA04205 for <rohc@optimus.ietf.org>; Thu, 28 Feb 2002 09:58:20 -0500 (EST)
Received: from rsys000a.roke.co.uk (rsys000a.roke.co.uk [193.118.201.102]) by ietf.org (8.9.1a/8.9.1a) with SMTP id JAA26527 for <rohc@ietf.org>; Thu, 28 Feb 2002 09:58:16 -0500 (EST)
Received: by rsys002a.roke.co.uk with Internet Mail Service (5.5.2653.19) id <1S9WNV8C>; Thu, 28 Feb 2002 14:55:08 -0000
Message-ID: <76C92FBBFB58D411AE760090271ED4186F9FDD@rsys002a.roke.co.uk>
From: "Price, Richard" <richard.price@roke.co.uk>
To: "'Dr. Carsten Bormann'" <cabo@tzi.org>, zhigang.c.liu@nokia.com, Miguel.A.Garcia@ericsson.com
Cc: Lars-Erik.Jonsson@epl.ericsson.se, rohc@ietf.org
Subject: RE: SigComp Requirements (was Re: [rohc] RE: Default decompressio n algorithms)
Date: Thu, 28 Feb 2002 14:55:04 -0000
MIME-Version: 1.0
X-Mailer: Internet Mail Service (5.5.2653.19)
Content-Type: multipart/mixed; boundary="------------InterScan_NT_MIME_Boundary"
Sender: rohc-admin@ietf.org
Errors-To: rohc-admin@ietf.org
X-Mailman-Version: 1.0
Precedence: bulk
List-Id: Robust Header Compression <rohc.ietf.org>
X-BeenThere: rohc@ietf.org

> this is not state referencing in the sense it is being used in the UDVM draft.
> (It's not a hash, either.)

Carsten,

I don't understand - what did I propose that contradicts the current SigComp/UDVM
draft?

The key point of my suggestion for how to do algorithm negotiation is that it
only uses mechanisms that are already contained in SigComp (namely "state
referencing" and "state claim"). In fact the mechanisms were originally introduced
for other reasons, but if we can use them to provide algorithm negotiation as well
then so much the better.

> I'm not quite sure I understand your mechanism, but it seems to be the
> worst-of-worlds between the existing state identifier mechanism and a
> registration-based mechanism, in the sense that it inherits all problems of
> both and then some more.

I'm not proposing a new mechanism per se; I'm simply configuring SigComp to
support algorithm negotiation by setting the application-defined parameters of
Section 3.2. In particular, this means that the final decision on whether to use
algorithm negotiation is made by 3GPP.

I make no statement as to whether algorithm negotiation is a good idea or a bad
idea. However, it's important to point out that algorithm negotiation can already
be done within the existing SigComp framework, so that we avoid a debate on
whether we need to add it or not.

> I'm strongly opposed to adding new mechanisms of this kind at this stage.

Nothing needs to be added to SigComp in order to support my proposal.

> (I also have a lot of problems with the approach, which I already have
> detailed on this list, but this does not matter at this point.)

Agreed. Algorithm negotiation is a controversial issue within the ROHC WG, and
we'll end up delaying SigComp if we debate its merits at this late stage.

Regards,

Richard