SKIP LIST SKIP GRAPH.pptVIP

* Load balancing Interested in average load on a node u. i.e. the number of searches from source s to destination t that use node u. Theorem: Let dist (u, t) = d. Then the probability that a search from s to t passes through u is 2/(d+1). where V = {nodes v: u = v = t} and |V| = d+1. * Nodes u Skip list restriction Level 0 Level 1 Level 2 Node u is on the search path from s to t only if it is in the skip list formed from the lists of s at each level. s * Tallest nodes Node u is on the search path from s to t only if it is in T = the set of k tallest nodes in [u..t]. u u t s u is not on path. t u u s u ? u is on path. Pr [u T] = Pr[|T|=k] ? k/(d+1) = E[|T|]/(d+1). k=1 d+1 Heights independent of position, so distances are symmetric. * Load on node u Start with n nodes. Each node goes to next set with prob. 1/2. We want expected size of T = last non-empty set. = T Average load on a node is inversely proportional to the distance from the destination. We show that: E[|T|] 2. Asymptotically: E[|T|] = 1/(ln 2) ? 2x10-5 ? 1.4427… [Trie analysis] We also show that the distribution of average load declines exponentially beyond this point. * Expected load Actual load Destination = 76542 76400 76450 76500 76550 76600 76650 0.1 0.2 0.3 0.4 0.5 0.6 0.7 0.8 0.9 1.0 1.1 0.0 Node location Load on node Experimental result * Fault tolerance How do node failures affect skip graph performance? Random failures: Randomly chosen nodes fail. Experimental results. Adversarial failures: Adversary carefully chooses nodes that fail. Bound on expansion ratio. * Random faults 131072 nodes * Searches with random failures 131072 nodes 10000 messages * Adversarial faults Theorem: A skip graph with n nodes has expansion ratio = (1/log n). A dA dA = nodes adjacent to