Power-law chord architecture in P2P overlays

ABSTRACT

In this paper, we propose to extend the topology of Chord to a bidirectional graph to provide a super-peer based lookup algorithm and an efficient resource localization service at a very little additional cost.

REFERENCES

• 1: Virginia Lo , Dayi Zhou , Yuhong Liu , Chris GauthierDickey , Jun Li, Scalable Supernode Selection in Peer-to-Peer Overlay Networks, Proceedings of the Second International Workshop on Hot Topics in Peer-to-Peer Systems, p.18-27, July 21-21, 2005 [doi>10.1109/HOT-P2P.2005.17]
• 2: Diestel, Reinhard (2005), Graph Theory (3rd ed.), Berlin, New York: Springer-Verlag, ISBN 978-3-540-26183-4.
• 3: Ion Stoica , Robert Morris , David Karger , M. Frans Kaashoek , Hari Balakrishnan, Chord: A scalable peer-to-peer lookup service for internet applications, Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications, p.149-160, August 2001, San Diego, California, United States
• 4: Barabási, Albert-László "Scale-Free Networks". Scientific American, 288: 60--69, May 2003.

INDEX TERMS

Primary Classification:
  C. Computer Systems Organization
  C.2 COMPUTER-COMMUNICATION NETWORKS
      C.2.1 Network Architecture and Design

Additional Classification:
  C. Computer Systems Organization
  C.2 COMPUTER-COMMUNICATION NETWORKS
      C.2.0 General
          Subjects: Data communications
      C.2.4 Distributed Systems

General Terms:
Design, Experimentation, Measurement, Performance

Keywords:
DHT, flooding, scale free network, super peer