[sip-overload] A modest (and new) proposal on multiple algorithms for overload control
"Vijay K. Gurbani" <vkg@bell-labs.com> Mon, 27 June 2011 21:46 UTC
Return-Path: <vkg@bell-labs.com>
X-Original-To: sip-overload@ietfa.amsl.com
Delivered-To: sip-overload@ietfa.amsl.com
Received: from localhost (localhost [127.0.0.1]) by ietfa.amsl.com (Postfix)
with ESMTP id 972B011E8178 for <sip-overload@ietfa.amsl.com>;
Mon, 27 Jun 2011 14:46:01 -0700 (PDT)
X-Virus-Scanned: amavisd-new at amsl.com
X-Spam-Flag: NO
X-Spam-Score: -106.599
X-Spam-Level:
X-Spam-Status: No, score=-106.599 tagged_above=-999 required=5
tests=[BAYES_00=-2.599, RCVD_IN_DNSWL_MED=-4, USER_IN_WHITELIST=-100]
Received: from mail.ietf.org ([64.170.98.30]) by localhost (ietfa.amsl.com
[127.0.0.1]) (amavisd-new, port 10024) with ESMTP id pxBGJb4W615X for
<sip-overload@ietfa.amsl.com>; Mon, 27 Jun 2011 14:46:00 -0700 (PDT)
Received: from ihemail2.lucent.com (ihemail2.lucent.com [135.245.0.35]) by
ietfa.amsl.com (Postfix) with ESMTP id 8D5E811E8177 for
<sip-overload@ietf.org>; Mon, 27 Jun 2011 14:46:00 -0700 (PDT)
Received: from usnavsmail2.ndc.alcatel-lucent.com
(usnavsmail2.ndc.alcatel-lucent.com [135.3.39.10]) by ihemail2.lucent.com
(8.13.8/IER-o) with ESMTP id p5RLjxqJ002027 (version=TLSv1/SSLv3
cipher=DHE-RSA-AES256-SHA bits=256 verify=OK) for <sip-overload@ietf.org>;
Mon, 27 Jun 2011 16:46:00 -0500 (CDT)
Received: from umail.lucent.com (umail-ce2.ndc.lucent.com [135.3.40.63]) by
usnavsmail2.ndc.alcatel-lucent.com (8.14.3/8.14.3/GMO) with ESMTP id
p5RLjxAI006781 (version=TLSv1/SSLv3 cipher=DHE-RSA-AES256-SHA bits=256
verify=NOT) for <sip-overload@ietf.org>; Mon, 27 Jun 2011 16:45:59 -0500
Received: from shoonya.ih.lucent.com (shoonya.ih.lucent.com [135.185.238.235])
by umail.lucent.com (8.13.8/TPES) with ESMTP id p5RLjxWj019742 for
<sip-overload@ietf.org>; Mon, 27 Jun 2011 16:45:59 -0500 (CDT)
Message-ID: <4E08FA57.7040807@bell-labs.com>
Date: Mon, 27 Jun 2011 16:47:03 -0500
From: "Vijay K. Gurbani" <vkg@bell-labs.com>
Organization: Bell Laboratories, Alcatel-Lucent
User-Agent: Mozilla/5.0 (X11; U; Linux i686; en-US;
rv:1.9.2.17) Gecko/20110428 Fedora/3.1.10-1.fc14 Lightning/1.0b2
Thunderbird/3.1.10
MIME-Version: 1.0
To: "sip-overload@ietf.org" <sip-overload@ietf.org>
Content-Type: text/plain; charset=ISO-8859-1; format=flowed
Content-Transfer-Encoding: 7bit
X-Scanned-By: MIMEDefang 2.57 on 135.245.2.35
X-Scanned-By: MIMEDefang 2.64 on 135.3.39.10
Subject: [sip-overload] A modest (and new) proposal on multiple algorithms for
overload control
X-BeenThere: sip-overload@ietf.org
X-Mailman-Version: 2.1.12
Precedence: list
List-Id: SIP Overload <sip-overload.ietf.org>
List-Unsubscribe: <https://www.ietf.org/mailman/options/sip-overload>,
<mailto:sip-overload-request@ietf.org?subject=unsubscribe>
List-Archive: <http://www.ietf.org/mail-archive/web/sip-overload>
List-Post: <mailto:sip-overload@ietf.org>
List-Help: <mailto:sip-overload-request@ietf.org?subject=help>
List-Subscribe: <https://www.ietf.org/mailman/listinfo/sip-overload>,
<mailto:sip-overload-request@ietf.org?subject=subscribe>
X-List-Received-Date: Mon, 27 Jun 2011 21:46:01 -0000
Folks: I am trying to close the conversation on SIP overload
control algorithms.
To recap, we had a decision on making loss-based as the default
mandatory-to-implement algorithm and had agreed to allow the
choice of rate- and windows-based algorithms.
This is what's currently reflected in the protocol draft [1].
During the Prague IETF, it was suggested that we revisit this
decision and use only one algorithm. This suggestion lead to
a subsequent thread [2] about which algorithm should be
chosen --- loss-, rate- or windows-based one.
I think we have to be realistic here in recognizing that
the relative performance of all the algorithms is about the same.
So therefore, if the relative performance is the same then there
may be certain network deployments where the choice of one algorithm
seems better than the other.
Rate-based one will work well in managed networks where the set of
upstream clients sending requests is bounded and rather static; this
also makes it easier to apply capacity guarantees. Loss-based one
works well where the set of upstream clients sending traffic is
unbounded and frequently changing.
The loss-based algorithm is less complex than the rate-based one
or the windows-based one.
Phil Williams has put out a proposal [3] to support all three
algorithms simultaneously, thereby eliminating the need for protocol
machinations to choose one. However, issues still remain: first,
this will force implementations to implement all of the algorithms,
and this I believe is a heavy burden.
Second, it does not eliminate the need or the desire to change
algorithms mid stream, and finally, this decision forces an overloaded
server to maintain considerable state as to which particular
algorithm has been chosen with the paired upstream client.
It seems that we are at an impasse.
So, let me suggest another concrete proposal, which will help move
the work forward expeditiously if all agree.
I propose that draft-ietf-soc-overload-control continue as it
is now with the following exception:
1) Take window class out of the mix, leaving rate and
loss. No one is explicitly championing the windows-based
one; it could be added later if desired.
2) Invite Phil Williams, Eric Noel, or Janet Gunn to start
working on a rate-based draft that uses the agreement
mechanisms defined in draft-ietf-soc-overload-control
and fleshes out how rate-based mechanism will function.
3) Move draft-ietf-soc-overload-control and the new draft
in (2) as a bundle so that no one algorithm gets an
undue advantage of being specified first.
Note that (2) and (3) effectively mitigate Phil's concern that
"proceeding with a single mandated algorithm would result in
non-adoption of the other algorithms by suppliers and in effect the
alternatives would become redundant."
Personally I do not think that the market will favour a sub-optimal
algorithm and if loss-based does not work I am sure it will
be replaced in short order. But I do empathize with the perceived
advantage that loss-based one seems to benefit from if it is made the
only mandatory-to-implement algorithm in [1]. Therefore, (2) and
(3) above should mitigate this particular concern.
I suspect what will end up happening is that implementations geared
to managed network providers will end up supporting both loss-
and rate-based algorithms while other implementations can support
only the loss-based one.
Do folks think that this is an agreeable compromise? It is no
worse off than what we had agreed to before, and in fact it is
much better since we have eliminated windows-based one and are
moving loss-based and rate-based ahead at the same time.
I do note that the chairs may have to re-negotiate the charter
deliverables with the ADs, but modifying the charter or deciding
to make the rate-based draft as an extension to the second
deliverable ("2. A specification for an SIP overload control
mechanism based on implicit/explicit feedback.") is a minor
detail once everyone agrees to this proposal.
Please comment. Thank you.
[1] http://tools.ietf.org/html/draft-ietf-soc-overload-control-02
[2] http://www.ietf.org/mail-archive/web/sip-overload/current/msg00616.html
[3] http://www.ietf.org/mail-archive/web/sip-overload/current/msg00629.html
- vijay
--
Vijay K. Gurbani, Bell Laboratories, Alcatel-Lucent
1960 Lucent Lane, Rm. 9C-533, Naperville, Illinois 60566 (USA)
Email: vkg@{bell-labs.com,acm.org} / vijay.gurbani@alcatel-lucent.com
Web: http://ect.bell-labs.com/who/vkg/
- [sip-overload] A modest (and new) proposal on mul… Vijay K. Gurbani
- Re: [sip-overload] A modest (and new) proposal on… phil.m.williams
- Re: [sip-overload] A modest (and new) proposal on… Volker Hilt
- Re: [sip-overload] A modest (and new) proposal on… Volker Hilt
- Re: [sip-overload] A modest (and new) proposal on… Shida Schubert
- Re: [sip-overload] A modest (and new) proposal on… Salvatore Loreto
- Re: [sip-overload] A modest (and new) proposal on… Hadriel Kaplan
- Re: [sip-overload] A modest (and new) proposal on… Volker Hilt
- Re: [sip-overload] A modest (and new) proposal on… phil.m.williams
- Re: [sip-overload] A modest (and new) proposal on… NOEL, ERIC C (ERIC C)
- Re: [sip-overload] A modest (and new) proposal on… Volker Hilt
- Re: [sip-overload] A modest (and new) proposal on… Volker Hilt
- Re: [sip-overload] A modest (and new) proposal on… NOEL, ERIC C (ERIC C)
- Re: [sip-overload] A modest (and new) proposal on… phil.m.williams