Near optimal routing in a small-world network with augmented local awareness

Authors:
Jianyang Zeng;Wen-Jing Hsu;Jiangdian Wang
Affiliations:
Center for Advanced Information Systems, Nanyang Technological University, Singapore;Center for Advanced Information Systems, Nanyang Technological University, Singapore;School of Electrical Electronic Engineering, Nanyang Technological University, Singapore
Venue:
ISPA'05 Proceedings of the Third international conference on Parallel and Distributed Processing and Applications
Year:
2005

Citing 13
Cited 0

The diameter of a cycle plus a random matching

SIAM Journal on Discrete Mathematics
The small-world phenomenon: an algorithmic perspective

STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Spatial gossip and resource location protocols

STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
The diameter of long-range percolation clusters on finite cycles

Random Structures & Algorithms
Fault-tolerant routing in peer-to-peer systems

Proceedings of the twenty-first annual symposium on Principles of distributed computing
The diameter of a long-range percolation graph

Random Structures & Algorithms
Efficient Routing in Networks with Long Range Contacts

DISC '01 Proceedings of the 15th International Conference on Distributed Computing
Small Worlds, Locality, and Flooding on Landscapes

Small Worlds, Locality, and Flooding on Landscapes
Know thy neighbor's neighbor: the power of lookahead in randomized P2P networks

STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Eclecticism shrinks even small worlds

Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
Analyzing Kleinberg's (and other) small-world Models

Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
Analyzing and characterizing small-world graphs

SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Symphony: distributed hashing in a small world

USITS'03 Proceedings of the 4th conference on USENIX Symposium on Internet Technologies and Systems - Volume 4

Quantified Score

Hi-index	0.00

Visualization

Abstract

In order to investigate the routing aspects of small-world networks, Kleinberg [13] proposes a network model based on a d-dimensional lattice with long-range links chosen at random according to the d-harmonic distribution. Kleinberg shows that the greedy routing algorithm by using only local information performs in O(log2n) expected number of hops, where n denotes the number of nodes in the network. Martel and Nguyen [17] have found that the expected diameter of Kleinberg’s small-world networks is Θ(log n). Thus a question arises naturally: Can we improve the routing algorithms to match the diameter of the networks while keeping the amount of information stored on each node as small as possible?