Beefy Boxes and Bandwidth Generously Provided by pair Networks
No such thing as a small change
 
PerlMonks  

Re: Network Mapping Among Racked Suns

by samtregar (Abbot)
on Apr 14, 2009 at 18:37 UTC ( [id://757456] : note . print w/replies, xml ) Need Help??


in reply to Network Mapping Among Racked Suns

I don't know of anything like this, but I don't think that's how I'd solve the problem. Is there an easier solution? Perhaps you could pick an interface by pinging the destination host (possibly using Net::Ping) and/or looking at the number of hops found by traceroute.

-sam

Replies are listed 'Best First'.
Re^2: Network Mapping Among Racked Suns
by cmv (Chaplain) on Apr 16, 2009 at 14:23 UTC
    Sam-

    Thanks for the suggestion, but that solution won't help me as much as I need. In this case, the most efficient route between servers may not be the best choice since different interfaces can be running at different speeds.

    To extend your solution a bit, I'm looking to find the largest-bandwidth pipe between endpoints balanced against the most efficient route between servers.

    Even better would be to find the largest-bandwidth pipe whose recent history shows little usage, against the most efficient route between servers.

    The reality of what I'm trying to do is to find a place to shovel some data, where it has least impact. This seems to be a difficult thing to do.

    Thanks

    -Craig