Thanks for the help but I think you misunderstood the problem :)<br><br>I'm trying to determine if machine 'X' could communicate more quickly to machine 'Y' or machine 'Z' (and you're on machine 'A'). 'A' pinging 'Z' won't tell you the time for 'X' pinging 'Z'. etc.<br>
<br>I could:<br><br>Get machine X to ping machine Y and Z. This algorithm would be "here's a list of machines, you figure it out." If there are a lot of machines in the list this could be problematic and very slow to discover good connections.<br>
<br>or <br><br>Machine 'A' tracert's machine 'X', 'Y', and 'Z'. It now knows the physical layout of the network and can calculate how many hops there are between the machines (assuming there's only one path between any two points on the internet). This algorithm would be "here's my best guess about which machines will get the best response time from your machine"<br>
<br>The second algorithm is based on some assumptions that may be wrong and uses the assumption "more hops = bad". Some combination of the two might be better. <br><br><br><div class="gmail_quote">On Mon, Jan 11, 2010 at 7:36 AM, Ruud van Gaal <span dir="ltr"><<a href="mailto:ruud@racer.nl">ruud@racer.nl</a>></span> wrote:<br>
<blockquote class="gmail_quote" style="border-left: 1px solid rgb(204, 204, 204); margin: 0pt 0pt 0pt 0.8ex; padding-left: 1ex;">
<div>
<div dir="ltr" align="left"><span><font size="2" face="Arial" color="#0000ff">Ping is what most, if not all games use to determine
client-server 'distance'. The number of hops doesn't say anything since the
hardware involved can be different greatly, resulting in processing times that
vary in many magnitudes.</font></span></div>
<div dir="ltr" align="left"><span><font size="2" face="Arial" color="#0000ff">The only way to be sure is to use ping, which is in fact
relatively stable in practice. Keep pinging as things progress so you always
update the latest ping time (taking care to avoid spikes, so slowly progressing
ping time to a stable value). Don't just calculate ping time
once.</font></span></div>
<div dir="ltr" align="left"><span><font size="2" face="Arial" color="#0000ff"></font></span> </div>
<div dir="ltr" align="left"><span><font size="2" face="Arial" color="#0000ff">I would not know of any method that relates X hops to any
useful time value. If one route is 9 hops, the other 20, it's certainly not sure
whether one is faster than the other...</font></span></div>
<div dir="ltr" align="left"><span><font size="2" face="Arial" color="#0000ff"></font></span> </div>
<div dir="ltr" align="left"><span><font size="2" face="Arial" color="#0000ff">Ruud</font></span></div>
<div dir="ltr" align="left"><span><font size="2" face="Arial" color="#0000ff"></font></span> </div><br>
<blockquote style="border-left: 2px solid rgb(0, 0, 255); padding-left: 5px; margin-left: 5px; margin-right: 0px;">
<div dir="ltr" align="left" lang="nl">
<hr>
<font size="2" face="Tahoma"><div class="im"><b>Van:</b> <a href="mailto:enet-discuss-bounces@cubik.org" target="_blank">enet-discuss-bounces@cubik.org</a>
[mailto:<a href="mailto:enet-discuss-bounces@cubik.org" target="_blank">enet-discuss-bounces@cubik.org</a>] <b>Namens </b>Jay
Sprenkle<br></div><b>Verzonden:</b> Monday, January 11, 2010 14:12<div class="im"><br><b>Aan:</b>
Discussion of the ENet library<br></div><b>Onderwerp:</b> Re: [ENet-discuss]
icmp/tracert/discovering network topology?<br></font><br></div><div><div></div><div class="h5">
<div></div>I would think the actual ping time would not be that useful. It
would vary considerably over time. What I was thinking was the length of the
route in routed hops, not physical distance, was what I needed to sort by.
These might measure roughly the same thing but physical organization only
needs one measurement.<br><br><br>
<div class="gmail_quote">On Mon, Jan 11, 2010 at 3:37 AM, Ruud van Gaal <span dir="ltr"><<a href="mailto:ruud@racer.nl" target="_blank">ruud@racer.nl</a>></span>
wrote:<br>
<blockquote class="gmail_quote" style="border-left: 1px solid rgb(204, 204, 204); margin: 0pt 0pt 0pt 0.8ex; padding-left: 1ex;">
<div>
<div>
<div dir="ltr" align="left"><span><font size="2" face="Arial" color="#0000ff">Hi,</font></span></div>
<div dir="ltr" align="left"><span><font size="2" face="Arial" color="#0000ff"></font></span> </div>
<div dir="ltr" align="left"><span><font size="2" face="Arial" color="#0000ff">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><font size="2" face="Arial" color="#0000ff">I
wouldn't say the distance in computers is of much use for most
situations.</font></span></div>
<div dir="ltr" align="left"><span><font size="2" face="Arial" color="#0000ff"></font></span> </div>
<div dir="ltr" align="left"><span><font size="2" face="Arial" color="#0000ff">Cheers,</font></span></div>
<div dir="ltr" align="left"><span><font size="2" face="Arial" color="#0000ff">Ruud</font></span></div><br></div>
<blockquote style="border-left: 2px solid rgb(0, 0, 255); padding-left: 5px; margin-left: 5px; margin-right: 0px;">
<div>
<div dir="ltr" align="left" lang="nl">
<hr>
<font size="2" face="Tahoma"><b>Van:</b> <a href="mailto:enet-discuss-bounces@cubik.org" target="_blank">enet-discuss-bounces@cubik.org</a> [mailto:<a href="mailto:enet-discuss-bounces@cubik.org" target="_blank">enet-discuss-bounces@cubik.org</a>] <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></div>
<div>
<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></div></div></blockquote></div><br>_______________________________________________<br>ENet-discuss
mailing list<br><a href="mailto:ENet-discuss@cubik.org" target="_blank">ENet-discuss@cubik.org</a><br><a href="http://lists.cubik.org/mailman/listinfo/enet-discuss" target="_blank">http://lists.cubik.org/mailman/listinfo/enet-discuss</a><br>
<br></blockquote></div><br><br clear="all"><br>-- <br>Cause united breaks guitars<br><a href="http://www.youtube.com/watch?v=5YGc4zOqozo" target="_blank">http://www.youtube.com/watch?v=5YGc4zOqozo</a><br><br></div></div></blockquote>
</div>
<br>_______________________________________________<br>
ENet-discuss mailing list<br>
<a href="mailto:ENet-discuss@cubik.org">ENet-discuss@cubik.org</a><br>
<a href="http://lists.cubik.org/mailman/listinfo/enet-discuss" target="_blank">http://lists.cubik.org/mailman/listinfo/enet-discuss</a><br>
<br></blockquote></div><br><br clear="all"><br>-- <br>Cause united breaks guitars<br><a href="http://www.youtube.com/watch?v=5YGc4zOqozo">http://www.youtube.com/watch?v=5YGc4zOqozo</a><br><br>