Optimal routing in a small-world network
From MaRDI portal
Publication:2508396
DOI10.1007/s11390-006-0476-zzbMath1190.68010MaRDI QIDQ2508396
Publication date: 12 October 2006
Published in: Journal of Computer Science and Technology (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11390-006-0476-z
distributed systems; analysis of algorithms; small-world model; augmented local awareness; decentralized routing
90C35: Programming involving graphs or networks
05C80: Random graphs (graph-theoretic aspects)
68M10: Network design and communication in computer systems
Cites Work
- Unnamed Item
- The small-world phenomenon
- Know thy neighbor's neighbor
- The Diameter of a Cycle Plus a Random Matching
- Fault-tolerant routing in peer-to-peer systems
- Spatial gossip and resource location protocols
- Collective dynamics of ‘small-world’ networks
- Automata, Languages and Programming
- Eclecticism shrinks even small worlds
- Analyzing Kleinberg's (and other) small-world Models
- Models of the small world.