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

"Miguel A. Garcia" <Miguel.A.Garcia@ericsson.com> Thu, 28 February 2002 07:43 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 CAA13789 for <rohc-archive@odin.ietf.org>; Thu, 28 Feb 2002 02:43:17 -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 CAA10444; Thu, 28 Feb 2002 02:41:35 -0500 (EST)
Received: from ietf.org (odin [132.151.1.176]) by optimus.ietf.org (8.9.1a/8.9.1) with ESMTP id CAA10411 for <rohc@ns.ietf.org>; Thu, 28 Feb 2002 02:41:33 -0500 (EST)
Received: from penguin-ext.wise.edt.ericsson.se (penguin-ext.wise.edt.ericsson.se [193.180.251.34]) by ietf.org (8.9.1a/8.9.1a) with ESMTP id CAA13759 for <rohc@ietf.org>; Thu, 28 Feb 2002 02:41:29 -0500 (EST)
Received: from fogerty.lmf.ericsson.se (fogerty.lmf.ericsson.se [131.160.11.6]) by penguin.wise.edt.ericsson.se (8.11.0/8.11.0/WIREfire-1.3) with ESMTP id g1S7fQB26287; Thu, 28 Feb 2002 08:41:27 +0100 (MET)
Received: from ericsson.com (3NJPI0013L1IJOG.lmf.ericsson.se [131.160.30.42]) by fogerty.lmf.ericsson.se (8.12.1/8.12.1/lmf.8.12.1.jcs) with ESMTP id g1S7fMmK017803; Thu, 28 Feb 2002 09:41:26 +0200 (EET)
Message-ID: <3C7DDF5E.E0AB8A3A@ericsson.com>
Date: Thu, 28 Feb 2002 09:42:22 +0200
From: "Miguel A. Garcia" <Miguel.A.Garcia@ericsson.com>
Organization: OY LM Ericsson AB
X-Mailer: Mozilla 4.74 [en] (Windows NT 5.0; U)
X-Accept-Language: es,en
MIME-Version: 1.0
To: zhigang.c.liu@nokia.com
CC: richard.price@roke.co.uk, cabo@tzi.org, Lars-Erik.Jonsson@epl.ericsson.se, rohc@ietf.org
Subject: Re: SigComp Requirements (was Re: [rohc] RE: Default decompression algorithms)
References: <DE0842B293FC4847992F9EDF8D72E1ED24A269@daebe005.NOE.Nokia.com>
Content-Type: text/plain; charset=us-ascii
Content-Transfer-Encoding: 7bit
Content-Transfer-Encoding: 7bit
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
Content-Transfer-Encoding: 7bit

zhigang.c.liu@nokia.com wrote:
> 
> Hi,
> 
> Just try to make things simple:
> 
> 1) The major (if not only one) requirement of SigComp
> is to reduce latency. I agree with Carsten.

I agree. But you need to be very carefull to not cause
an extra overhead when you implement the mechanisms to
dismiss that latency. 

I am referring to the algorithm upload. If every time 
I switch a mobile phone it has to send 500 bytes of 
algorithm to its proxy, and the proxy has to do the same
in the reverse side, even in the case that both the proxy
and the terminal already contain the algorithm, then we
are doing something wrong. We are generating a lot of 
unneeded traffic over the scarce air interface.

> 
> 2) Here we are talking about a simple optimization to
> reduce the latency. Does anyone has comment on it?
> http://www1.ietf.org/mail-archive/working-groups/rohc/current/msg00065.html

I like this text, and I think it should be covered somewhere
in the next version of the Sigcomp draft.

There is a minor thing for discussion though. In step 3 you
are assuming that the compressor selects the algorithm prior
to contacint the decompressor. However, I can envision another
model where the compressor selects the algorithm to upload
once it gets the list of algorithms from the decompressor.

An example: Terminal T contacts proxy P. P sends the list of
algorithms already uploaded, let's say, 1, 2 and 7. T supports
algorithms 2 and 8. 8 is preferred for the terminal, but 
because the compression performance in 2 and 8 are similar,
and because 2 is already uploaded in P, T decides to use 2.

 
> 3) Now, the question is cost/gain evaluation. I've
> made some attempt in
> http://www1.ietf.org/mail-archive/working-groups/rohc/current/msg00064.html.
> Comment? The hash size might be increased to 9 bytes (?).

That is Ok. Obviously, anything that requires a roundtrip is 
not for free. Still, if the algorithm cost is 500 bytes, there
is a saving in bandwidth if the number of algorithms already
uploaded are not extremely high.

> 
> 4) Also, what about security? I don't see it is a problem
> as long as the use of feedback (capability announcement)
> does not create new risk. But do I missed something?

I have no opinion on this subjec.

/Miguel


> 
> BR,
> Zhigang

-- 
Miguel-Angel Garcia                     Oy LM Ericsson AB
                                        Jorvas, Finland
mailto:Miguel.A.Garcia@ericsson.com     Phone:  +358 9 299 3553
mailto:Miguel.A.Garcia@piuha.net        Mobile: +358 40 5140002

_______________________________________________
Rohc mailing list
Rohc@ietf.org
https://www1.ietf.org/mailman/listinfo/rohc