Wireless Personal Communications

, Volume 85, Issue 3, pp 1471–1486 | Cite as

De Bruijn Graph Based Solution for Lookup Acceleration and Optimization in P2P Networks

  • Mourad Amad
  • Djamil Aïssani
  • Ahmed Meddahi
  • Makhlouf Benkerrou
  • Farouk Amghar
Article

Abstract

There is no doubt that P2P traffic mainly video traffic (e.g. P2P streaming, P2P file sharing, P2P IPTV) increases and will represent a significant percent of the total IP video traffic (80 percent by 2018 of the global IP traffic according forecasts). Peer-to-peer (P2P) is based on some main concepts such as mutualization of resources (e.g. data, programs, service) at Internet scale. It is also considered as one of the most important models able to replace the client-server model (e.g. for media streaming). Nevertheless, one of the fundamental problems of P2P networks is to locate node emplacements or resources and service location. Localisation problem is critical as there is no central server and churn rate can be high in some environments (high dynamicity). Lookup optimization in terms of number of hops or delay is not well considered in existing models, and still represents a real challenge. In this context and according to their specific characteristics and properties, De Bruijn graph based solutions constitute good candidates for lookup optimization. In this paper, we propose a new optimized model for lookup acceleration on P2P networks based on De Bruijn graph. Performance evaluations and simulation results show that our proposed approach is performant, compared to the main existing model.

Keywords

P2P Resource localization Lookup acceleration  De Bruijn graphs 

References

  1. 1.
    Ratnasamy, S., Francis, P., Handley, M., Karp, R., & Shenker, S. (2001). A scalable content addressable network. New York: ACM SIGCOMM.CrossRefGoogle Scholar
  2. 2.
    Shah, B., & Kim, K.-I. (2014). Towards enhanced searching architecture for unstructured peer-to-peer over mobile ad hoc networks. Journal of Wireless Personal Communications, 77(2), 1167–1189.CrossRefGoogle Scholar
  3. 3.
    Stoica, I., Morris, R., Karger, D., Kaashoek, M. F., & Balakrishnan, H. (2001). Chord: A scalable peer-to-peer lookup service for internet application. In Proceeding of the ACMSIGCOMM’01 (pp. 149–160). San Diego, CA, USA.Google Scholar
  4. 4.
    Rowstron, A. I. T., & Druschel, P. (2001). Pastry: Scalable, decentralized object location, and routing for large-scale peer-to-peer systems. In Proceedings of the IFIP/ACM international conference on distributed systems platforms heidelberg (pp. 329–350). London, UK.Google Scholar
  5. 5.
    Amad, M., Meddahi, A., Aïssani, D., & Zhang, Z. (2012). HPM: A novel hierarchical peer-to-peer model for lookup acceleration with provision of physical proximity. Journal of Network and Computer Applications, 35(6), 1818–1830.CrossRefGoogle Scholar
  6. 6.
    Amad, M., & Meddahi, A. (2008). DV-Flood: An optimized flooding and clustering based approach for lookup acceleration in P2P networks. In The international wireless communications and mobile computing conference, IWCMC08 (pp. 559–564). Greece.Google Scholar
  7. 7.
    Goodrich, M. T., Nelson, M. J., & Sun, J. Z. (2006). The rainbow skip graph: A fault-tolerant constant-degree P2P relay structure. In Proceedings of the seventeenth annual ACM-SIAM symposium on discrete algorithms, SODA 2006. Miami, Florida, USA.Google Scholar
  8. 8.
    Shi, C. Q., Wang D. W., Huang H., & Huang Y. (2009). A clustering route algorithm of P2P networks based on Knödel graph. In Proceeding of 2009 international conference on signal processing systems (pp. 837–838), Singapore.Google Scholar
  9. 9.
    Ryu, J., Noel, E., & Tang, K. W. (2012). Distributed and fault-tolerant routing for borel cayley graphs. International Journal of Distributed Sensor Networks, 2012, Article ID 124245. doi:10.1155/2012/124245.
  10. 10.
    Yasuto, S., & Keiichi, K. (2003). An algorithm for node-disjoint paths in Pancake graphs. IEICE Transactions on Information and Systems, E86–D(12), 2588–2594.Google Scholar
  11. 11.
    Mandal, S., Chakraborty, S., & Karmakar, S. (2015). Distributed deterministic 1–2 skip list for peer-to-peer system. Journal of Peer-to-Peer Networking and Applications, 8(1), 63–86.CrossRefGoogle Scholar
  12. 12.
    Fraigniaud, P., & Gauron, P. (2006). D2B: A de Bruijn based content-addressable network. Journal of Theoretical Computer Science, 355(1), 65–79.MathSciNetCrossRefMATHGoogle Scholar
  13. 13.
    Kaashoek, F., & Karger, D. R. (2003). Koorde: A simple degree-optimal hash table. In Proceeding of the 2nd international workshop on peer-to-peer systems (IPTPS ’03), LNCS 2735 (pp. 98–107).Google Scholar
  14. 14.
    Loguinov, D., Casas, J., & Wang, X. (2005). Graph-theoretic analysis of structured peer-to-peer systems: Routing distances and fault resilience. IEEE/ACM Transactions on Networking, 13(5), 395–406.CrossRefGoogle Scholar
  15. 15.
    Spinsante, S., Andrenacci, S., & Gambi, E. (2011). Binary De Bruijn sequences for DS-CDMA systems: Analysis and results. EURASIP Journal on Wireless Communications and Networking,. doi:10.1186/1687-1499-2011-4.Google Scholar
  16. 16.
    Naor, M., & Wieder, U. (2003). Novel architectures for P2P applications: The continuous-discrete approach. In Fifteenth ACM symposium on parallelism in algorithms and architectures (SPAA) (pp. 50–59). New York, NY, USA.Google Scholar
  17. 17.
    Naor, M., & Wieder, U. (2007). Novel architectures for P2P applications: The continous-discrete approach. ACM Transactions on Algorithms, 3(3), 50–59.Google Scholar
  18. 18.
    El-Ansary, S., & Haridi, S. (2006). An overview of structured P2P overlay networks. In Handbook on theoretical and algorithmic aspects of sensor, ad hoc wireless, and peer-to-peer networks. ISBN: 978-0-8493-2832-9, Auerbach.Google Scholar

Copyright information

© Springer Science+Business Media New York 2015

Authors and Affiliations

  • Mourad Amad
    • 1
  • Djamil Aïssani
    • 1
  • Ahmed Meddahi
    • 2
  • Makhlouf Benkerrou
    • 3
  • Farouk Amghar
    • 3
  1. 1.LaMOS Research Unit, Faculty of Exact SciencesUniversity of BejaiaBejaïaAlgeria
  2. 2.Institut Mines TelecomTelecom LilleLilleFrance
  3. 3.Bejaia UniversityBejaïaAlgeria

Personalised recommendations