A Splay Tree-Based Approach for Efficient Resource Location in P2P Networks

Algorithm 1

// Splay Finger Table Lookup

// Return the successor of key

n·slookup(key)

(1) if (key is between S·id and T·id)

(2)  𝑛^′ = splay_search(𝑆𝑇, key)

(3)  if (𝑛^′ is sentinel)

(4)     remove_sentinel_root(𝑆𝑇)

(5)  n′ = 𝑆𝑇·root

(6)  if (𝑛^′·id == key)

(7)     return 𝑛^′

(8)  𝑛^′ = 𝑛^′·slookup(key)

(9) else

(10)   𝑛^′ = T·slookup(key)

(11)    if (Count < CACHE_MAX)

(12)     splay_insert(𝑆𝑇, 𝑛^′)

(13)    𝑆=min𝑆,𝑛^′

(14)    𝑇=max𝑇,𝑛^′

(15)  return 𝑛^′