|Problems? Is your data what you think it is?|
Lookahead algorithm for IP subroutineby hok_si_la (Curate)
|on May 10, 2005 at 18:23 UTC||Need Help??|
hok_si_la has asked for the
wisdom of the Perl Monks concerning the following question:
I need to come up with an algorithm to find $j sequential IP addresses within a single $vlan if. It is possible that there is not $j sequential address within the table. In that case $j addresses will be selected by the lowest value of difference between the highest octet4 and lowest octet4.
The code below selects $j IPs from $vlan according to their location within the table. I should also add that although there are many things that may need be changed regarding syntax, I really only have 30 mins to get this cranking.
Any ideas? Is there a quick way to do this?
Each $vlan contains about 250 or so address & $j <= 5
Thanks in advance,