1 / 20

How Much Independent Should Individual Contacts be to Form a Small-World?

The 17th International Symposium on Algorithms and Computation (ISAAC 2006). How Much Independent Should Individual Contacts be to Form a Small-World?. Gennaro Cordasco and Luisa Gargano University of Salerno. Outline. Small-World Graphs Features Kleinberg’s model

archer
Download Presentation

How Much Independent Should Individual Contacts be to Form a Small-World?

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. The 17th International Symposium on Algorithms and Computation (ISAAC 2006) How Much Independent Should Individual Contacts be to Form a Small-World? Gennaro Cordasco and Luisa Gargano University of Salerno Gennaro Cordasco - How Much Independent Should Individual Contacts be to Form a Small-World? - 19/12/2006

  2. Outline • Small-World Graphs • Features • Kleinberg’s model • Greedy Routing strategies • Our proposals • Why to reduce randomization? • Restricted Small-World • Small-World with communities • Conclusions Gennaro Cordasco - How Much Independent Should Individual Contacts be to Form a Small-World? - 19/12/2006

  3. Traditional models • Random Network (Erdös and Rényi) • edges are generated completely at random • low avg. path length L ≤ log n/log  • small clustering coefficient C ~ /n • Regular Network • edges follow a structure • high avg. path length • high clustering coefficient • where C(v) = clustering coefficient of node v (number of real links between neighbours of v divided by number of possible links) Gennaro Cordasco - How Much Independent Should Individual Contacts be to Form a Small-World? - 19/12/2006

  4. Small-World Networks Unfortunately, neither Random nor Regular Networks capture reality… • According to Watts and Strogatz [WS98]: • Large networks (n >> 1) • Sparse connectivity (avg degree << n) • Large clustering coefficient (larger than in an equivalent random graph) • Short average paths length (~log n, close to those of an equivalent random graph) Gennaro Cordasco - How Much Independent Should Individual Contacts be to Form a Small-World? - 19/12/2006

  5. Watts and Strogatz model [WS98] • Start with a ring, where every node is connected to the next  nodes • With probability p, rewire every edge to a uniformly chosen destination. 0<p<1 Order Randomness Gennaro Cordasco - How Much Independent Should Individual Contacts be to Form a Small-World? - 19/12/2006

  6. Watts and Strogatz model [WS98] • Clustering coefficient - Average Path length Small World log scale in p p Gennaro Cordasco - How Much Independent Should Individual Contacts be to Form a Small-World? - 19/12/2006

  7. Kleinberg’s model K(n,s,q,p) • Consider n nodes lying on a toroidal s-dimensional grid, for each node • (2s) short-range contacts • q long range contacts (Each node v establishes q directed links independently according to the probability distribution p(d(u,v))) • Usually p(d) is proportional to d-s with normalization factor  =vd(u,v)-s Gennaro Cordasco - How Much Independent Should Individual Contacts be to Form a Small-World? - 19/12/2006

  8. t s Greedy Routing: move to the neighbor that minimizes the distance to the target. Greedy Routing Strategies Gennaro Cordasco - How Much Independent Should Individual Contacts be to Form a Small-World? - 19/12/2006

  9. t s Greedy Routing Strategies Indirect Greedy Routing (IR): each node is aware of the long-range contacts of its closest neighbors Gennaro Cordasco - How Much Independent Should Individual Contacts be to Form a Small-World? - 19/12/2006

  10. t s Greedy Routing Strategies Neighbor-of-Neighbor (NoN) Greedy Routing: each node is aware of the long-range contacts of its long-range contacts Gennaro Cordasco - How Much Independent Should Individual Contacts be to Form a Small-World? - 19/12/2006

  11. Related Work • Kleinberg (2000) showed that each K(n,s,q,p) network is navigable (i.e. Greedy routing require O((log2n)/q) steps) • Barrière et al. (2001) showed that Kleinberg’s result is indeed optimal (Greedy routing require ((log2n)/q) steps) • Fraignaud et al. (2004) analyzed IR Routing (it requires ((log1+1/sn)/q1/s) steps) • Manku et al. (2004) provided an Overlay network which exploits the NoN Greedy Routing (it requires O(log2n /(q log q))) • s = O(1) • Optimal for q=log n • s = 1 Gennaro Cordasco - How Much Independent Should Individual Contacts be to Form a Small-World? - 19/12/2006

  12. Why to reduce randomization? • The use of randomization increases the difficulties in the implementation and testing of applications. • The smaller is the randomization the higher is the clustering coefficient of the considered network • Clustering represents a fundamental feature that a network model, designed to describe complex network, must hold • The resilience of a network grows with the clustering coefficient • An high clustering implies an improved ability to handle heavy traffic workload Gennaro Cordasco - How Much Independent Should Individual Contacts be to Form a Small-World? - 19/12/2006

  13. higher probability darker ~ Our Proposals: R(n,s,q) Restricted Small World: Long-range connections are allowed only with nodes that differ in exactly one coordinate Gennaro Cordasco - How Much Independent Should Individual Contacts be to Form a Small-World? - 19/12/2006

  14. Our Results: R(n,s,q) Theorem The average path length is O((log2n)/q) for the greedy routing on R(n,s,q) when 1q log n. Corollary The average path length is O((log1+1/sn)/q1/s) for the indirect routing on R(n,s,q) when each node is aware of the long-range contacts of its (es ln n)/q closest neighbors and 1<q  log n. Theorem The average path length is O((log2n)/(q log q)) for the NoN greedy routing on R(n,s,q) when 1<q log n. • s could be non-constant • s could be non-constant Gennaro Cordasco - How Much Independent Should Individual Contacts be to Form a Small-World? - 19/12/2006

  15. Our Results: R(n,s,q) Greedy Routing Theorem The average path length is O((log2n)/q) for the greedy routing on R(n,s,q) when 1q log n. Proof (Sketch) For each i = 1,…,s; let dithe distance between the current (c)and target node (t)on dimension i. Let fdenote the event that the current node is able to diminish the remaining distance, from dito at most di/2 in one hop Considering that each node has q long range, it is easy to show that that the probability that the event f occurs is (q/log n) di c t di/2 Gennaro Cordasco - How Much Independent Should Individual Contacts be to Form a Small-World? - 19/12/2006

  16. Our Results: R(n,s,q) Greedy Routing Theorem The average path length is O((log2n)/q) for the greedy routing on R(n,s,q) when 1q log n. Proof (Sketch) The expected number of nodes encountered before a successful event foccurs is O((log n) / q) By repeating for each dimension we have that the expected number of hops is O(s ((log n)/ q) (log n1/s))= O((log2n)/q) di c t di/2 Gennaro Cordasco - How Much Independent Should Individual Contacts be to Form a Small-World? - 19/12/2006

  17. Our Proposals: Rc(n,s,q) Small World with communities: Each node randomly chooses one of the communities to belong to and selects its long-range contacts only among a subset of nodes depending on the chosen community. • same community means same long-range distances • Same community means same long-range distances Gennaro Cordasco - How Much Independent Should Individual Contacts be to Form a Small-World? - 19/12/2006

  18. Our Results: Rc(n,s,q) Theorem The average path length is O((log2n)/q) for the greedy routing on Rc(n,s,q) when 1q log n and c (4 ln n)/q. Corollary The average path length is O((log1+1/sn)/q1/s) for the indirect routing on Rc(n,s,q) when each node is aware of the long-range contacts of its (es ln n)/q closest neighbors, 1<q log n and c (2es ln n)/q. Theorem The average path length is O((log2n)/(q log q)) for the NoN greedy routing on R(n,s,q) when 1<q log n and c > log n. Gennaro Cordasco - How Much Independent Should Individual Contacts be to Form a Small-World? - 19/12/2006

  19. Conclusions • We showed that it is not necessary to use a completely eclectic network in order to obtain a Small World environment. • Our networks presents a higher clustering coefficient, hence they can be used to model “real” complex networks. • Moreover, our networks can be used toward the design of efficient as well as easy to implement overlay network infrastructures based on the SW approach. Gennaro Cordasco - How Much Independent Should Individual Contacts be to Form a Small-World? - 19/12/2006

  20. Salerno ITALY Thanks for your attention Any questions? Gennaro Cordasco - How Much Independent Should Individual Contacts be to Form a Small-World? - 19/12/2006 Gennaro Cordasco - How Much Independent Should Individual Contacts be to Form a Small-World? - 19/12/2006

More Related