Optimal routing in a small-world network

DOI10.1007/S11390-006-0476-ZMaRDI QIDQ2508396zbMATH OpenOpenAlexFDO

Authors Jianyang Zeng, Wen-Jing 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

analysis of algorithmsaugmented local awarenessdecentralized routingdistributed systemssmall-world model

Mathematics Subject Classification ID

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

Recommendations

• Eclecticism shrinks even small worlds
• Eclecticism shrinks even small worlds
• Greedy routing and the algorithmic small-world phenomenon
• Kleinberg's grid unchained
• Automata, Languages and Programming

Cites work

• Analyzing Kleinberg's (and other) small-world models
• Automata, Languages and Programming
• Collective dynamics of `small-world' networks
• Eclecticism shrinks even small worlds
• Fault-tolerant routing in peer-to-peer systems
• scientific article; zbMATH DE number 2006658 (Why is no real title available?)
• Know thy neighbor's neighbor: the power of lookahead in randomized P2P networks
• Models of the small world.
• Spatial gossip and resource location protocols
• The Diameter of a Cycle Plus a Random Matching
• The small-world phenomenon: an algorithmic perspective

Cited in

(17)

• Navigable small-world networks with few random bits
• Greedy routing and the algorithmic small-world phenomenon
• Kleinberg's grid unchained
• Greedy routing in small-world networks with power-law degrees
• Close to optimal decentralized routing in long-range contact networks
• Kleinberg's grid reloaded
• Networks Become Navigable as Nodes Move and Forget
• scientific article; zbMATH DE number 2112462 (Why is no real title available?)
• The effect of power-law degrees on the navigability of small worlds (extended abstract)
• Distributed routing in small-world networks
• Greedy routing and the algorithmic small-world phenomenon
• Distributed Computing
• Navigation in small-world networks: a scale-free continuum model
• Automata, Languages and Programming
• Eclecticism shrinks even small worlds
• Efficient routeing in Poisson small-world networks
• Asymptotically optimal solutions for small world graphs

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2508396)