-----BEGIN PGP SIGNED MESSAGE-----
Hash: SHA1
Anthony,
Let me try and say this kindly (since after it is pointed out several
hundred times it gets quite frustrating). If you don't see the
processing requirements then you have *no* understanding of how
routing works. Forwarding packets is easy. Routers basically have
two related but completely seperate functions.
The *second* function is to take an incoming packet, look at its
destination address, compare it to its forwarding table, and forward
the packet. This is easy in the whole scheme of things.
The *first* function is to calculate that forwarding table used
above. This is the place that processing power is needed. On busy
routers this calculation can be necessary hundreds of times a second.
The more routes the larger the process of recalculating the
forwarding table when a change *anywhere* in the topology occurs.
- ---> Phil
P.S. Go find the CIDRD archives, or (if you want even earlier) try
the big-ip list to see the debate dozens of times.
-----Original Message-----
From: Anthony Atkielski [mailto:anthony(_at_)atkielski(_dot_)com]
Sent: Friday, August 11, 2000 9:38 PM
To: ietf(_at_)ietf(_dot_)org
Subject: Re: Sequentially assigned IP addresses--why not?
We seem to be talking 5-6 orders of magnitude in
speed here. Even Moore's Law doesn't help in that range.
I don't see why all this processing power is required. You look at
the incoming address, you figure out which outbound path can handle
that address, and you forward it. Simple. Even if the full
address is a thousand digits long, you only have to look at the
digits around
your level
to determine the next step in routing.
-----BEGIN PGP SIGNATURE-----
Version: PGP 6.5.3
iQA/AwUBOZT4YR8Cp2AdP9rUEQKQIwCfQUa6eJOLwwXGgXEgcxw4cMHQ/NYAnAwx
ZLxXZHam4Ns5cxWJy4zaA5sB
=Rdyp
-----END PGP SIGNATURE-----