Andrew White wrote:

Leif Johansson wrote:


Great. Come back with an ID and running code. This increasingly
hypothetical thread is fast approaching amateur night in layer 7.



3 hours programming and 200 lines of Java later I have a simplistic but
working library that attempts multiple (in fact all applicable) source and
destination pairs in parallel and returns the one that first works.


Listen Andrew, I am sort of impressed by your tennacity (if that is the word I
am looking for) but writing a loop through a table does not quite constitute
"running code". You actually need to use this in an application and demonstrate
its utility on the Internet. My guess is that your application will be uselessly
slow when confronted with multiple choices to try if several of them are
unreachable. I look forward (sort of :-)) to hearing about your further explorations.


Cheers Leif

--------------------------------------------------------------------
IETF IPng Working Group Mailing List
IPng Home Page:                      http://playground.sun.com/ipng
FTP archive:                      ftp://playground.sun.com/pub/ipng
Direct all administrative requests to [EMAIL PROTECTED]
--------------------------------------------------------------------

Reply via email to