TTLs (was Re: [p2p-hackers] infinite loops)

[Will Morton]

     It's a trade-off between using memory on your machine and  
wasting bandwidth on the network... Why not use a hybrid approach?   
You can keep a suitably small message ID cache to prevent tight loops  
such as 'A->B->C->A' where the TTL would still be high enough for the  
message to go round the loop a few times - and if this is your goal,  
you'd only need to cache the ID for a few seconds so you'll only use  
a few K for your cache.  Then use a TTL as well to prevent more  
circuitous loops.

     HTH

     Will

On 24 Jun 2005, at 11:54, Davide Carboni wrote:

> I notice that most of p2p protocols use TTL to prevent infinite loops.
> I was wondering why they do not use the following technique:
>
> - each node stores a cache of all message IDs received from neighbors
> -if an incoming message has an ID not in the cache, then the ID is
> added and the message is relayed
> -else if the incoming message has an ID alraedy in the cache it is
> simply ignored.
>
>
>
>
>
> -- 
> I have made this letter longer than usual because I lack the time to
> make it shorter.
> B. Pascal
> _______________________________________________
> p2p-hackers mailing list
> p2p-hackers at zgp.org
> http://zgp.org/mailman/listinfo/p2p-hackers
> _______________________________________________
> Here is a web page listing P2P Conferences:
> http://www.neurogrid.net/twiki/bin/view/Main/PeerToPeerConferences
>

-------------- next part --------------
A non-text attachment was scrubbed...
Name: smime.p7s
Type: application/pkcs7-signature
Size: 2388 bytes
Desc: not available
Url : http://zgp.org/pipermail/p2p-hackers/attachments/20050624/1bed426a/smime.bin