A Persistent Structured Hierarchical Overlay Network to Counter Intentional Churn Attack

Algorithm 3

Peer join operation in the responsible tree of the proposed architecture.

.Join_Tree

Input: Tree has a root (Super peer),

: is responsible for a range of keys ( to ), where is the minimum key value and

is the maximum key value

: Range is divided into 4 almost equal chunks: (ch[], ch[], ch[] and ch[])

  () Repeat for to 4

  () If , then

  () If == NuLL, then

  () Set

  () Delegate ch[] values to node .

  () parent =

  ()  = parent() // is the grandparent of newly joined node

  () Initialize_fingers () // initialize all the child, parent and uncle’s pointer values

  () break

  () Else

  () Set

  () break.

  () End For.

  () .Join_Tree()

  () Return

Initialize_fingers

  () Divide_in_chunk()

  () Repeat for to 4

  () = Null

  () =

  () End for