Relay-Version: version B 2.10 5/3/83; site utzoo.UUCP
Path: utzoo!utgpu!water!watmath!clyde!rutgers!ames!ucbcad!ucbvax!FALINE.BELLCORE.COM!karn
From: karn@FALINE.BELLCORE.COM.UUCP
Newsgroups: comp.protocols.tcp-ip
Subject: Re:  Generalized Subnetting
Message-ID: <8708190304.AA04309@faline.bellcore.com>
Date: Tue, 18-Aug-87 23:04:14 EDT
Article-I.D.: faline.8708190304.AA04309
Posted: Tue Aug 18 23:04:14 1987
Date-Received: Fri, 21-Aug-87 04:38:06 EDT
Sender: daemon@ucbvax.BERKELEY.EDU
Distribution: world
Organization: The ARPA Internet
Lines: 16

I thought this probably wasn't original, but I'm glad to see somebody
else considers it worthwhile.

I too was concerned about the speed of the algorithm. I originally
implemented it in a totally brute-force fashion. A "for" loop searches
the hash table 32 times starting with the widest possible mask and
working down until it hits a match.  I assumed I would have to place a
cache on top of this to get decent performance.  To my delight, however,
I discovered that going all the way down to the default entry still took
only 6 milliseconds -- on a Taiwanese PC/XT turbo clone! Given the
channel speeds involved in the environment I wrote my software for, I
didn't consider further optimization to be a high priority task.

Sometimes brute force is good enough...

Phil