IP Management Tool - Minimum Requirements

Michael van Elst writes:
 > There are various alogrithms (coming by memory or disk space allocators)
 > that try to get 'optimal' results by filling the holes. This tool does a
 > two phase search, first it looks for assignments that fill holes completely
 > and then it falls back and searches the first hole in the allocation that
 > is large enough.

This is suboptimal. Assuming 10.0.0.0/28, 10.0.2.0/23 and 10.0.4.0/25
are free and you search for a /26. The above algorithm will find
10.0.2.0/23 and break it up, whereas it is better to break up
10.0.4.0/25 in order to avoid excessive fragementation.

IMHO the algorithm should search for the first block of minimal size
which is large enough to hold the assignment.

Robert