Skip to main content
Fig. 8 | EURASIP Journal on Wireless Communications and Networking

Fig. 8

From: SHAM: Scalable Homogeneous Addressing Mechanism for structured P2P networks

Fig. 8

Depiction of routing in SHAM vs. Torus. a In 2-d torus: the longest path is between nodes A1 and D4. It requires the lookup six hops to reach D4 from A1 (solid line). Another possible same length route is the dashed line. b In case of SHAM: the longest path is also between A1 and D4. It requires the lookup two hops to reach D4 (solid line). Another same length route is the dashed line

Back to article page