Optimal routing in a small-world network

DOI10.1007/S11390-006-0476-ZzbMath1190.68010OpenAlexW2069070712MaRDI QIDQ2508396

Jianyang Zeng, Wenjing Hsu

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

zbMATH Keywords

distributed systemsanalysis of algorithmssmall-world modelaugmented local awarenessdecentralized routing

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Random graphs (graph-theoretic aspects) (05C80) Network design and communication in computer systems (68M10)

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.

This page was built for publication: Optimal routing in a small-world network