anchor.diff:  
   handle_custom_message({rt_get_node_response, NewNode}, State) ->
       OldRT = rt_loop:get_rt(State),
  -    NewRT = add_normal_entry(NewNode, OldRT),
  -    check(OldRT, NewRT, rt_loop:get_neighb(State), true),
  +    NewRT = case rt_lookup_node(node:id(NewNode), OldRT) of
  +        none -> RT = add_normal_entry(NewNode, OldRT),
  +                check(OldRT, RT, rt_loop:get_neighb(State), true),
  +                RT;
  +        _Else ->  OldRT
  +    end,
  +
       rt_loop:set_rt(State, NewRT)
       ;
  -
   
   handle_custom_message(_Message, _State) -> unknown_event.
   %% userdevguide-end rt_frtchord:handle_custom_message
  
positive.code: filter_dead_node(RT, DeadPid) -> 
      % find the node id of DeadPid and delete it from the RT
      [Node] = [N || N <- internal_to_list(RT), node:pidX(N) =:= DeadPid],
      entry_delete(node:id(Node), RT)
      .
  %% userdevguide-end rt_frtchord:filter_dead_node
  
negative.code:                 gb_trees:enter(SuccId, NewSucc, Tree))
      end,
  
      RT#rt_t{nodes=UpdatedTree}
      .
  
  % @doc Create an rt_entry and return the entry together with the Pred und Succ node, where
  % the adjacent fingers are changed for each node.
  