Reference no: EM133234838

Since they became very popular and successful, the US Women's Gymnastics team has been trying to build a peer to peer network to connect their current players with aspiring gymnasts. They want to use Chord, but they want to modify the Chord DHT rules to make it topologically aware of the underlying network latencies (like Pastry is). Design a variant of Chord that is topology- aware and yet preserves the O(log(N)) lookup cost and O(log(N)) memory cost. Use examples or pseudocode - whatever you chose, be clear! Make the least changes possible. You should only change the finger selection algorithm to select "nearby" neighbors, but without changing the routing algorithm. Show that (formal proof or informal argument):

a. Lookup cost is O(log(N)) hops.

b. Memory cost is O(log (N)).

c. The algorithm is significantly more topologically aware than Chord, and almost as topology aware as Pastry.