Contact: Warren R. Froelich
froelich@sdsc.edu
858-822-3622
University of California - San Diego

Observable Network Topology

Caption: How the hidden metric space guides communication. If node A wants to reach node F, it checks the hidden distances between F and its two neighbors B and C. Distance CF (green dashed line) is smaller than BF (red dashed line), therefore A forwards information to C. Node C then performs similar calculations and selects its neighbor D as the next hop on the path to F. Node D is directly connected to F. The result is path ACDF shown by green edges in the observable topology.

Credit: CAIDA, San Diego Supercomputer Center, UC San Diego.

Usage Restrictions: None

Related news release: 'Six Degrees of Kevin Bacon' game provides clue to efficiency of complex networks