Finds the left child of this peer
The algorithm is as follows:
we should find a successor with this.level+1
We should find the closest hash value to me (clockwise closest to me)
provided that it has a level higher than mine by one.
Returns True if a search for a relative (from the given type)
was not initated, i.e., True if this is the first time to search for this relative
False otherwise.
Join this peer to the network:
changes its state to joining
selects an id
the communication manager adds the correct listeners
the communication manager finds my successor ("discover me").
Performs a lookup operation on this peer
Note: this method is used when this peer recieves a lookup
a lookup message that was initiated by another peer.