<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.0 Transitional//EN">
<HTML><HEAD>
<META http-equiv=Content-Type content="text/html; charset=us-ascii">
<META content="MSHTML 6.00.6000.16890" name=GENERATOR></HEAD>
<BODY>
<DIV dir=ltr align=left><SPAN class=984063609-11012010><FONT face=Arial
color=#0000ff size=2>Hi,</FONT></SPAN></DIV>
<DIV dir=ltr align=left><SPAN class=984063609-11012010><FONT face=Arial
color=#0000ff size=2></FONT></SPAN> </DIV>
<DIV dir=ltr align=left><SPAN class=984063609-11012010><FONT face=Arial
color=#0000ff size=2>Isn't the ping time more important? In that case, keep ping
times on the server (probably already done by ENet, search the ENetPeer class)
and get the list from the server ordered by ping.</FONT></SPAN></DIV>
<DIV dir=ltr align=left><SPAN class=984063609-11012010><FONT face=Arial
color=#0000ff size=2>I wouldn't say the distance in computers is of much use for
most situations.</FONT></SPAN></DIV>
<DIV dir=ltr align=left><SPAN class=984063609-11012010><FONT face=Arial
color=#0000ff size=2></FONT></SPAN> </DIV>
<DIV dir=ltr align=left><SPAN class=984063609-11012010><FONT face=Arial
color=#0000ff size=2>Cheers,</FONT></SPAN></DIV>
<DIV dir=ltr align=left><SPAN class=984063609-11012010><FONT face=Arial
color=#0000ff size=2>Ruud</FONT></SPAN></DIV><BR>
<BLOCKQUOTE
style="PADDING-LEFT: 5px; MARGIN-LEFT: 5px; BORDER-LEFT: #0000ff 2px solid; MARGIN-RIGHT: 0px">
<DIV class=OutlookMessageHeader lang=nl dir=ltr align=left>
<HR tabIndex=-1>
<FONT face=Tahoma size=2><B>Van:</B> enet-discuss-bounces@cubik.org
[mailto:enet-discuss-bounces@cubik.org] <B>Namens </B>Jay
Sprenkle<BR><B>Verzonden:</B> Sunday, January 10, 2010 20:09<BR><B>Aan:</B>
Discussion of the ENet library<BR><B>Onderwerp:</B> [ENet-discuss]
icmp/tracert/discovering network topology?<BR></FONT><BR></DIV>
<DIV></DIV>Good morning,<BR><BR>I'm considering adding some extra features to
my enet based peer to peer application. I'd like the main server to be smart
enough to discover which peers have the shortest connection path to each
other. When a peer requests a list of other peers to connect to then the
server can deliver an optimal list. The only way I could think of to implement
this would be to do a tracert to each peer and sort the list of peers by what
common paths they share. Has anyone done icmp packets with enet? I know it's
not it's intended function but it doesn't seem like it would be difficult to
hack together. If anyone has any better ideas on how to implement this I'd
love to hear them.<BR><BR>Thanks!<BR>Have a good
weekend<BR><BR><BR></BLOCKQUOTE></BODY></HTML>