Tue, 18 Aug 87 19:40:14 EDT
You have described the scheme used in the intrepid fuzzballs, although those
animals use a full 32-bit mask to allow arbitrary field geometries. The
problem is that the scheme is not particularly fast and is hard to hash.
The solution may be an algorithm that quickly turns a description such
as yours into a partition of the 32-bit space which can be hashed and
used in a match-once fashion.
The fuzzscheme, now indigenous to the NSFNET Backbone, provides a hand way
to build ARPANET tunnels through other nets, which has been found a handy
feature during times when routing is otherwise broken.
This archive was generated by hypermail 2.0b3 on Thu Mar 09 2000 - 14:39:14 GMT