[chord] RPCs in recursive lookups

[Frank Dabek]

Curt,

	Intermediate nodes will retry if a packet is lost, or retransmit to a 
new node if a node fails.

	The originating node will also timeout the entire lookup (on a much 
coarser granularity) if it does not get an answer in a specified time.

--Frank

Curt Cramer wrote:
> Hi,
> 
> I am trying to understand how Chord actually implements RPCs for its 
> lookups. I could not find a definitive answer in the ToN and NSDI 
> papers, and since I have not used the code before, it takes a long time 
> digging through it. Maybe you might help me with this:
> 
> How does Chord handle RPC timeouts and retransmissions in recursive 
> lookups (find_successor)? Is the originating node the only node which 
> keeps track of a lookup and retransmits it if needed (i.e., if the final 
> node does not report back to it in time)? Or do intermediate nodes send 
> retransmissions (for their recursive find_successor calls) as well?
> 
> 
> Thank you very much,
> 
> regards,
> 
> 
> --Curt
> 
> 
> 
> 
> 
> ---
> 
> Curt Cramer
> 
> System Architecture Group
> 
> University of Karlsruhe (TH)
> 
> 76128 Karlsruhe
> 
> Germany
> 
> 
> Tel.: +49 (7 21) 6 08 - 67 29
> 
> Fax: +49 (7 21) 6 08 - 76 64
> 
> WWW: http://i30www.ira.uka.de/aboutus/people/personal/cramer
> 
> 
> 
> 
> ------------------------------------------------------------------------
> 
> _______________________________________________
> chord mailing list
> chord at amsterdam.lcs.mit.edu
> https://amsterdam.lcs.mit.edu/mailman/listinfo/chord