Traffic prediction-based routing algorithm over structured P2P networks

https://doi.org/10.1016/S1005-8885(10)60215-4Get rights and content

Abstract

Routing has always been a great challenge for structured Peer-to-Peer (P2P) networks. There are a lot of representative structured routing algorithms for P2P networks, but these algorithms do not guarantee the quality of service (QoS) for real-time P2P applications. Addressing this challenge, a traffic prediction-based structured routing algorithm over P2P networks (TPSR) is proposed. Our contributions are described as below. We firstly analyze P2P traffic features and then build a wavelet neural-network predicting model. Secondly, we employ the traffic prediction model to predict the future state of each peer, such as normal or congestion, and let each peer update its routing table. In this way the requesting peers always get a resource list which contains the best resource peers. Simulation results demonstrate that TPSR has higher transmission success rate and lower end to end delay than other structured routing algorithms. Thus, TPSR can guarantee the QoS for real-time P2P applications.

References (10)

  • M Xu et al.

    A new and effective hierarchical overlay structure for Peer-to-Peer networks

    Computer Communications

    (2011)
  • Rowstron A I T, Druschel P. Pastry: scalable, decentralized object location, and routing for large scale peer-to-peer...
  • P Maymounkov et al.

    Kademlia: a peer-to-peer information system based on the XOR metric

    Proceedings of the 1st International Workshop on Peer-to-Peer Systems (IPTPS 2002), Springer-Verlag Berlin Heidelberg

    (2002)
  • I Stoica et al.

    Chord: a scalable peer-to-peer lookup service for internet applications

    Computer Communication Review

    (2001)
  • S Ratnasamy et al.

    A scalable content-addressable network

    Computer Communication Review

    (2001)
There are more references available in the full text version of this article.

Cited by (2)

View full text