A Mechanism for Enhanced Performance of Chord DHT in Mobile Environment

Conference paper
Part of the Lecture Notes in Electrical Engineering book series (LNEE, volume 131)

Abstract

With the growth of advanced networking technologies and capable terminals, it is very convenient for mobile operators to develop new service contents for mobile phones such as mobile Internet services, mobile television, and context-aware mobile services. Meanwhile, peer to peer (P2P) technology has made great success in multimedia services in the fixed networks such as Skype, PPlive, and Sopcast. Besides, demand for using P2P applications over PDAs and smartphone is increasing. So that, mobility in P2P networking has become a popular research area in recent years. However, mobile environment is different from the fixed networks in that it is limitation for process capability, memory, battery of mobile terminal, intermittent nature of wireless link and high churn rate of mobile users. In this paper, we focus on study drawbacks of Chord DHT algorithm in mobile environment. After that, we propose a mechanism for improving performance of Chord DHT algorithm based on the idea that is immediately stability of network topology when there is any node joining and leaving the network. Our simulation results show that our algorithm is better than previous studies about performance improvement of Chord DHT in mobile environment.

Keywords

Distributed hash table Chord DHT DHT performance High churn rate Mobile peer to peer Mobile peer to peer networks 

Notes

Acknowledgments

The authors express the VLIR project key program ZEIN2011Z099 for supporting this research.

References

  1. 1.
    Yrjö R (2005) Mobile peer-to-peer in cellular networks. In: Proceedings of HUTT-110.51 seminar on internetworking, Helsinki Institute of Technology, pp 4–26Google Scholar
  2. 2.
    Beijar N et al (2005) Mobile peer-to-peer content sharing services in IMS. In: International conference on telecommunication systems, modelling and analysis, USAGoogle Scholar
  3. 3.
    Wang I, Saxlund K (2007) Peer2Me—rapid application framework for mobile peer-to-peer applications. In: International symposium on collaborative technologies and systemsGoogle Scholar
  4. 4.
    Hung NC, Vinh VT et al (2009) Challenges in the development of mobile P2P applications and services. J Inf Technol Commun, VietNam ministry of information and communicationsGoogle Scholar
  5. 5.
    Motta R, Pasquale J (2010) Wireless P2P: problem or opportunity?. In: The second international conference on advances in P2P systemsGoogle Scholar
  6. 6.
    Li J et al (2004) Comparing the performance of distributed hash tables under churn. In: LNCS 3279, Springer-Verlag, Berlin, Heidelberg, pp 87–99Google Scholar
  7. 7.
    Li B et al (2007) An empirical study of the coolstreaming + system. J Sel Area Commun 25(9):1627Google Scholar
  8. 8.
    Shen X et al (2010) Handbook of peer-to-peer networking. Springer, New York. ISBN 978-0-387-09750-3Google Scholar
  9. 9.
    Stoica I et al (2001) Chord: a scalable peer-to-peer lookup service for internet applications. In: Proceedings of the 2001 ACM SIGCOMM conference, pp 149–160Google Scholar
  10. 10.
    Gupta I et al (2003) Kelips: building an efficient and stable P2P DHT through increased memory and background overhead. In: Proceedings of the 2nd IPTPSGoogle Scholar
  11. 11.
    Zhao BY et al (2004) Tapestry: a resilient globalscale overlay for service deployment. IEEE J Sel Areas Commun 22(1):41–53Google Scholar
  12. 12.
    Ghodsi A (2006) Distributed k-ary system: algorithms for distributed hash tables, PhD dissertation, KTH-Royal Institute of TechnologyGoogle Scholar
  13. 13.
    Rhea S et al (2004) Handling churn in a DHT. In: Proceedings of the 2004 USENIX technical conferenceGoogle Scholar
  14. 14.
    Chan HN, Vinh VT et al (2009) Performance improvement of Chord distributed hash table under high churn rate. In: Proceeding of international conferences on advanced technologies for communication, VietnamGoogle Scholar
  15. 15.
    Hung NC, Vinh VT et al (2010) Improvement of successful lookup ratio of chord distributed hash table (DHT) in wireless communication environment. In: Proceedings of international conference on advanced technologies for communications (ATC), VietnamGoogle Scholar
  16. 16.
  17. 17.
  18. 18.
    Ou Z et al (2010) Performance evaluation of a Kademlia-based communication-oriented P2P system under churn. Comput Netw 54:689–705Google Scholar

Copyright information

© Springer Science+Business Media New York 2013

Authors and Affiliations

  1. 1.Thai Nguyen University of Information and Communication Technology, Quyet ThangThai Nguyen cityVietnam
  2. 2.Vietnam Research Institute of ElectronicsInformatics and AutomationHanoiVietnam

Personalised recommendations