[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]
What is the big-O picture? (was: [RRG] Happiness; lack thereof)
- To: "Michael Meisel" <email@example.com>, "William Herrin" <firstname.lastname@example.org>, "RRG Mailing List" <email@example.com>, "Luigi Iannone" <firstname.lastname@example.org>
- Subject: What is the big-O picture? (was: [RRG] Happiness; lack thereof)
- From: "Victor Grishchenko" <email@example.com>
- Date: Wed, 12 Mar 2008 10:59:42 +0500
- Domainkey-signature: a=rsa-sha1; c=nofws; d=gmail.com; s=gamma; h=message-id:date:from:to:subject:mime-version:content-type:content-transfer-encoding:content-disposition; b=DAhFu866dGNn5d+at1FHAdfkAt1wK1WWViAk16wuaqLQXoDPh+fq1nmDPsPJ5iBhNUhyRcE8fxdxgyiKZ3FaMB+ml66aj5YC0nuKhcSNmc2mABGHKdN5aTvEkRVeEGCbKAtISm2q1fkOqEyStPUGqV8A0AbQqOt1+C2GwW+fvsI=
As it comes to summarizing/comparing proposals, could we focus on what
is the expected big-O gain?
If we'll assume unhindered network growth to be exponential and
equipment performance growth to be also exponential, the outcome is
mostly defined by the correspondence between the exponents. (Actually,
we don't want the routing table growth to consume all the performance
gains, so the former exponent better be much smaller than the latter.)
From that standpoint, a one-time gain is not truly significant. At
best, it delays the problem for several years.
Historically, once a flat routing space becomes unmanageable, it is
usually split in two layers (e.g. EGP vs IGP or OSPF areas or even
MAC-in-MAC). In a perfect world, that replaces one O(N) routing table
for two O(sqrt(N)) tables.
So, if a new split is introduced every k years, it solves all the
routing problems. Except for the fact each split adds a bit more of
stretch, complexity and opaqueness.
(I personally think that the prefix-bunch approach might bring new
rules, although that is still "a research".)
So, half-jokingly, let me propose a proposal evaluation scale.
Other things being equal, every O(N) -> O( sqrt(N) + sqrt(N) )
proposal might be considered as "normal", everything better is "a
breakthrough" and everything worse is "a regression".
On 07/03/2008, Luigi Iannone <firstname.lastname@example.org> wrote:
> Finally, I cannot find why EID-to-RLOC cache is significantly smaller
> (preferably, in terms of big-O) than the EID-to-RLOC database. Is
> there any study of that issue?
> You can get a look to:
> There you can find the size of a cache.
> The size of the database, assuming granularity of prefixes annonced by BGP,
> is just the size of a BGP table.
to unsubscribe send a message to email@example.com with the
word 'unsubscribe' in a single line as the message text body.
archive: <http://psg.com/lists/rrg/> & ftp://psg.com/pub/lists/rrg