The Algorithm (cont.)

case recv((s’,T),l):

L= C.read

if (s’<s) or (s’=s & T <= L)

continue to loop (without setting TP);

if (s’=s) &(T>L)

C.adjust(L,T); forward( (s,T), l);

if (s’>s) &(T<L)

s=s’; bcast((s,L)) --I am faster

if (s’>s) &(T>=L)

s=s’; C.adjust( L,T ); forward( (s,T),l)

-- synchronizing my time.