Labeling Algorithm and Compact Routing Scheme for a Small World Network Model

by   Santiago Viertel, et al.

This paper presents a small world networks generative model and a labeling algorithm for networks generated by this model. In the context of routing messages in networks, labeling algorithms process a network assigning labels, that are addresses, to the nodes. Our model is based on Kleinberg model, generating a 2-dimensional torus with additional random undirected long-range edges. The Kleinberg routing algorithm can forward messages in these networks, but it needs the vertices labels, that are positions in a n× n lattice, to make routing decisions. Finding these labels when they are not known a priori is a problem of routing in small world networks and labeling algorithms are possible solutions. The design of our labeling algorithm uses the approach of searching for induced 4-cycles to find the underlying torus. However, the generated graph may have 4-cycles with edges not in this torus. We show that the probability of these cycles appearing in a vertex is O(^-1n). This property allows the long-range edges removing through the detection of lattice patterns on combinations of 4-cycles, and the running of a breadth-first search in the resulting graph. Our labeling algorithm labels almost all vertices in O(|V|) expected time, where |V|=n^2. We also present a compact routing scheme, that is a combination of a preprocessing algorithm, that generates sub-linear structures per vertex, and a routing algorithm, that uses these structures for routing messages through paths with bounded length. Our preprocessing algorithm generates structures with expected size of O( n) bits per vertex in expected time O(|V|). The Kleinberg routing algorithm uses these structures, running in expected constant time in each vertex and performing an expected number of forwards O(^2 n).


page 1

page 2

page 3

page 4


Small World Model based on a Sphere Homeomorphic Geometry

We define a small world model over the octahedron surface and relate its...

Modeling the Small-World Phenomenon with Road Networks

Dating back to two famous experiments by the social-psychologist, Stanle...

Fault-Tolerant Labeling and Compact Routing Schemes

The paper presents fault-tolerant (FT) labeling schemes for general grap...

On the Spanning and Routing Ratio of Theta-Four

We present a routing algorithm for the Theta-4-graph that computes a pat...

Expected Complexity of Routing in Θ 6 and Half-Θ 6 Graphs

We study online routing algorithms on the Θ6-graph and the half-Θ6-graph...

Self-healing Routing and Other Problems in Compact Memory

This paper looks at the question of designing distributed algorithms for...

The idemetric property: when most distances are (almost) the same

We introduce the idemetric property, which formalises the idea that most...

Please sign up or login with your details

Forgot password? Click here to reset