Advertisement

Evaluating Super Node Selection and Load Balancing in P2P VoIP Networks Using Stochastic Graph Transformation

  • Ajab Khan
  • Reiko Heckel
Part of the Communications in Computer and Information Science book series (CCIS, volume 314)

Abstract

Super nodes have been introduced to improve the performance of structured P2P networks. The resulting heterogeneity benefits efficiency without compromising the decentralised nature. However, this only works as long as there are enough super nodes and the distribution of clients among them is roughly even. With the increase in the number of users or organisations preventing the use of their clients as super nodes, the overall number of candidate super nodes is limited. Thus selection and load balancing strategies are critical, especially in voice-over-IP (VoIP) networks where poor connectivity results in immediate loss of audio quality.

To evaluate different strategies we model the dynamics of P2P systems by graph transformations, a visual rule-based formalism supported by stochastic simulation. Considering P2P VoIP applications such as Skype, we model two alternative strategies one with static super node selection and load balancing and one based on dynamic selection and promotion, and compare their performance in ensuring client satisfaction.

Keywords

P2P VoIP networks Load balancing Static and dynamic super node selection Stochastic modelling and simulation Graph transformation 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Li, Y., Cheng, D., Jhang-Li, J.: Building cooperation in VoIP network through a reward mechanism. In: Proc. 12th Pacific Asia Conference on Information Systems (PACIS 2008), Suzhou, China, pp. 799–808 (July 2008)Google Scholar
  2. 2.
    Chun Ji, L.: Computation in Peer-to-Peer Networks. Department of Computer Science, University of Saskatchewan, Canada, Tech. Report (2001)Google Scholar
  3. 3.
    Dabek, F., Brunskill, E., Frans Kaashoek, M., Karger, D., Morris, R., Stoica, I., Balakrishnan, H.: Building Peer-to-Peer Systems with Chord, a Distributed Lookup Service. In: Proc. of the 8th IEEE Workshop on Hot Topics in Operating Systems, HotOS-VIII (2001)Google Scholar
  4. 4.
    Montresor, A.: A robust Protocol for Building Superpeer Overlay Topologies. Department of Computer Science, University of Bologna, Italy, Technical Report UBLCS-2004-8 (May 2004)Google Scholar
  5. 5.
    Rowstron, A., Druschel, P.: Pastry: Scalable, Decentralized Object Location and Routing for Large-Scale Peer-to-Peer Systems. In: Proc. of the 18th Int. Conf. on Distributed Systems Platforms, Germany (November 2001)Google Scholar
  6. 6.
    Baset, S.A., Schulzrinne, H.G.: An analysis of the skype Peer-to-Peer internet telephony protocol. In: Proc. of the 25th IEEE International Conference on Computer Communications, pp. 1–11 (April 2006)Google Scholar
  7. 7.
    Zhao, B.Y., Huang, L., Stribling, J., Rhea, S.C., Joseph, A.D., Kubiatowicz, J.D.: Tapestry: A Resilient Global-scale Overlay for Service Deployment. IEEE Journal on Selected Areas in Communications 22, 41–53 (2003)CrossRefGoogle Scholar
  8. 8.
    Torrini, P., Heckel, R., Ráth, I.: Stochastic Simulation of Graph Transformation Systems. In: Rosenblum, D.S., Taentzer, G. (eds.) FASE 2010. LNCS, vol. 6013, pp. 154–157. Springer, Heidelberg (2010)CrossRefGoogle Scholar
  9. 9.
    Gao, L., Rexford, J.: Stable Internet routing without global coordination. In: Proceedings of SIGMETRICS, Santa Clara, CA (June 2000)Google Scholar
  10. 10.
    Seetharaman, S., Ammar, M.: Characterizing and mitigating inter-domain policy violations in overlay routes. In: Proc. of the 2006 IEEE International Conference on Network Protocols (2006)Google Scholar
  11. 11.
    Paul, R.: More Universities banning Skype (September 2006), http://arstechnica.com/news.ars/post/20060924-7814.html
  12. 12.
  13. 13.
    Guha, S., Daswani, N., Jain, R.: An Experimental Study of the Skype Peer-to-Peer VoIP System. In: Proc. of the IPTPS 2006 (2006)Google Scholar
  14. 14.
    Biondi, P., Desclaux, F.: Silver Needle in the Skype. EADS Corporate Research Centre, Suresnes, France (2006)Google Scholar
  15. 15.
    Heckel, R.: Stochastic Analysis of Graph Transformation Systems: A Case Study in P2P Networks. In: Van Hung, D., Wirsing, M. (eds.) ICTAC 2005. LNCS, vol. 3722, pp. 53–69. Springer, Heidelberg (2005)CrossRefGoogle Scholar
  16. 16.
    Karger, D.R., Ruhl, M.: Simple Efficient Load Balancing Algorithms for Peer-to-Peer Systems. In: Proc. of the Sixteenth Annual ACM Symposium on Parallelism in Algorithms and Architectures (2004)Google Scholar
  17. 17.
    Surana, S., Godfrey, B., Lakshminarayanan, K., Karp, R., Stoica, I.: Load balancing in dynamic structured peer-to-peer systems. Performance Evaluation 63(3) (March 2006)Google Scholar
  18. 18.
    Murata, Y., Inaba, T., Takizawa, H.: A distributed and cooperative load balancing mechanism for large-scale P2P systems. In: Proc. of the International Symposium on Applications on Internet Workshops (2006)Google Scholar
  19. 19.
    Khan, A., Torrini, P., Heckel, R.: Model-based simulation of VoIP network reconfigurations using graph transformation systems. In: ICGT-DS 2009. ECEASST, vol. 16 (2009)Google Scholar
  20. 20.
    Lo, V., Zhou, D., Liu, Y., Dickey, C.G., Li, J.: Scalable super node selection in peer-to-peer overlay networks. In: Proc. of the Second International Workshop on Hot Topics in Peer-to-Peer Systems (2005)Google Scholar
  21. 21.
    Pournaras, E., Exarchakos, G., Antonopoulos, N.: Load-driven neighbourhood reconfiguration of gnutella overlay. Computer Communications 31(13), 3030–3039 (2008)CrossRefGoogle Scholar
  22. 22.
    ISI, University of Southern California. The Network Simulator-NS2 (2008)Google Scholar
  23. 23.
    Khan, A., Heckel, R., Torrini, P., Ráth, I.: Model-Based Stochastic Simulation of P2P VoIP Using Graph Transformation System. In: Al-Begain, K., Fiems, D., Knottenbelt, W.J. (eds.) ASMTA 2010. LNCS, vol. 6148, pp. 204–217. Springer, Heidelberg (2010)CrossRefGoogle Scholar
  24. 24.
    de Lara, J., Bardohl, R., Ehrig, H., Ehrig, K., Prange, U., Taentzer, G.: Attributed graph transformation with node type inheritance. Theor. Comput. Sci. 376(3), 139–163 (2007)zbMATHCrossRefGoogle Scholar
  25. 25.
    Heckel, R., Lajios, G., Menge, S.: Stochastic Graph Transformation Systems. In: Ehrig, H., Engels, G., Parisi-Presicce, F., Rozenberg, G. (eds.) ICGT 2004. LNCS, vol. 3256, pp. 210–225. Springer, Heidelberg (2004)CrossRefGoogle Scholar
  26. 26.
    Bergmann, G., Őkrős, A., Ráth, I., Varró, G.: Incremental pattern matching in the VIATRA model transformation system. In: Proc. of the Third International Workshop on Graph and Model Transformations. ACM, New York (2008)Google Scholar
  27. 27.
    Skype Statistics, http://aaytch.com
  28. 28.
    Khan, A., Heckel, R.: Model-based Stochastic Simulation of Super Peer Promotion in P2P VoIP using Graph Transformation. In: Proc. of the DCNET 2011 in Seville Spain (2011)Google Scholar
  29. 29.
    Khan, A.: Stochastic Simulation of P2P VoIP Network Reconfiguration using Graph Transformation, PhD Thesis, University of Leicester, UK (2011)Google Scholar
  30. 30.
    Cassandras, C.G., Lafortune, S.: Introduction to discrete event systems. Kluwer (2008)Google Scholar
  31. 31.
    Wolff, P.: 1.4 Million Skype supernodes crashed, http://skypejournal.com/blog/?s=skype+crashed (accessed on October 10, 2011)
  32. 32.
    Sargent, R.G.: Verifying and Validating Simulation Models. In: Proc. of the 28th Conference on Winter Simulation. IEEE Computer Society, Washington (1996)Google Scholar
  33. 33.
    Whitner, B., Balci, O.: Guidelines for selecting and using Simulation model verification techniques. In: Proc. of the 21st Conference on Winter Simulation (1989)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2012

Authors and Affiliations

  • Ajab Khan
    • 1
  • Reiko Heckel
    • 2
  1. 1.Department of Computer ScienceUniversity of MalakandPakistan
  2. 2.Department of Computer ScienceUniversity of LeicesterU.K.

Personalised recommendations