Abstract

In this paper we propose a new structured overlay network, which is more efficient and scalable than previous ones. We call it Twins, because its routing table consists of two parts, one containing nodes with common prefix and the other containing nodes with common suffix. Twins routes messages to their destinations in just 2 hops even in a very large scale and the overhead is very low. When deployed in a peer-to-peer system with 5 000 000 nodes, each node receives only 6 messages per second for routing table maintenance. This cost, as well as routing table size, varies as a Ołeft( sqrt N right) function to the overlay scale, so Twins can also run well in an even larger environment.

Keywords

Cite this article

@article{cai-1432,
  author  = {Jinfeng Hu and Huanan Zhang and Weimin Zheng},
  title   = {Twins: Scalable 2-Hop Structured Overlay Network},
  journal = {Computing and Informatics},
  volume  = {24},
  number  = {3},
  pages   = {249--261},
  year    = {2005},
  issn    = {1335-9150},
  url     = {https://cai.type.sk/content/2005/3/twins-scalable-2-hop-structured-overlay-network/}
}
Download .bib