MODEL-BASED STOCHASTIC SIMULATION OF SUPER PEER PROMOTION IN P2P VOIP USING GRAPH TRANSFORMATION

Ajab Khan, Reiko Heckel

Abstract

The concept of super peer has been introduced to improve the performance of popular P2P VoIP applications. A super peer is the strongest peer in the network that has the capacity to act as a server for a set of VoIP clients. There is no doubt that by taking benefit of heterogeneity, super peer can do improve the efficiency, without compromising the decentralised nature of P2P networks. The core issue in the formation of super peer based overlay network is the selection of super peer among the participant peers. To solve this problem a number of solutions have been proposed in the literature. Generally, super peer are selected among the best nodes in the network, for example those with the most abondant resources, such as bandwidth, CPU cycles or memory. The next issue is when the peer shall be selected for this extended role either as when peer joins the network, or at any time during the session or promotion to super peer should be subject to requirements. In order to validate these approaches of super peer selection, simulation would be an ideal choice, but most existing simulation approaches cannot cope with unbounded dynamic changes of network topology. We propose an approach to modelling and simulation of P2P systems based on graph transformations, a visual rule based formalism that has recently been supported by facilities for stochastic modelling and simulation. We are considering a P2P VoIP applications such as Skype, we model three alternative solutions to the problem of peer promotion to super peers and evaluate these through simulation.

References

  1. Adami, D., Callegari, C., Giordano, S., Pagano, M., and Pepe, T. (2009). A real-time algorithm for skype traffic detection and classification. In Lecture Notes in Computer Science.
  2. Baset, S. A. and Schulzrine, H. G. (2006). An analysis of the skype peer-to-peer internet telephony protocol. In 25th INFOCOM'06.
  3. Bergmann, G., O? kro?s, A., Ráth, I., and Varró, G. (2008). Incremental pattern matching in the VIATRA model transformation system. In GraMoT'08.
  4. Biondi, P. and Desclaux, F. (2006). Silver needle in the skype. Technical report, EADS Corporate Research Centre, Suresnes, France.
  5. Dabek, F. (2001). Building peer-to-peer systems with chord, a distributed lookup service. In Proceedings of the Eighth Workshop on Hot Topics in Operating Systems. 8th HotOS, IEEE Computer Society.
  6. Guha, S., Daswani, N., and Jain, R. (2006). An experimental study of the skype peer-to-peer voip system. In 5th IPTPS06.
  7. Gupta, R. and Somani, A. K. (2004). Pricing strategy for incentivizing selfish nodes to share resources in peerto-peer (p2p) networks. In 12th (ICON04).
  8. Heckel, R. (2005). Stochastic analysis of graph transformation systems: A case study in p2p networks. In ICTAC05. Springer-Verlag.
  9. Heckel, R., Lajios, G., and Menge, S. (2006). Stochastic graph transformation systems. Fundamenta Informaticae.
  10. Idrees, F. and Khan, U. A. (2008). A generic technique for voice over internet protocol (voip) traffic detection. International Journal of Computer Science and Network Security.
  11. Ji, L. C. (2004). Computation in peer-to-peer networks. Technical report, Department of Computer Science, University of Saskatchewan, Canada.
  12. Khan, A., Heckel, R., Torrini, P., and Rth, I. (2010). Modelbased stochastic simulation of p2p voip using graph transformation system. In 17th Int. Conf. Analytical and Stochastic Modeling Techniques and Applications, ASMTA (2010).
  13. Khan, A., Torrini, P., and Heckel, R. (2009). Modelbased simulation of voip network reconfiguration using graph transformation system. In Vol.17,(ICGT)EASST.
  14. Lara, J. D. (2007). Attributed graph transformation with node type inheritance. Theor. Comput. Sci. In Fundamental Aspects of Software Engineering.
  15. L'Ecuyer, P. L., Meliani, L., and Vaucher, J. (2002). SSJ:a framework for stochastic simulation in Java. In Winter Simulation Conference.
  16. Lo, V., Zhou, D., Liu, Y., Dickey, C. G., and Li, J. (2005). Scalable super node selection in peer-to-peer overlay networks. In 2nd HOT-P2P Workshop.
  17. Lysne, O., Montaana, J., Pinkston, T., Duato, J., Skeie, T., and Flich, J. (2005). Simple deadlock-free dynamic network reconfiguration. In Boug, L. and Prasanna, V., editors, High Performance Computing - HiPC 2004, volume 3296 of Lecture Notes in Computer Science, pages 277-316. Springer Berlin / Heidelberg.
  18. Milojicic, D. S. (2002). Peer-to-peer computing. Technical report, HP Labs, Palo Alto.
  19. Montresor, A. (2004). A robust protocol for building super peer overlay topologies. Technical report, University of Bologna, Italy.
  20. NS2 (2008). The Network Simulator-NS2, http://www.isi.edu/nsnam/ns/.
  21. Oneil, H., Jeong, J. K., and Kwon, D. (2000). Transport layer identification of p2p super node. In hhhhhhhh.
  22. Ren, S., Guo, L., and Zhang, X. (2006). Asap: an as-aware peer-relay protocol for high quality voip. In 26th Int. Conf. on Distributed Computing Systems (ICDCS'06), Lisbon, Portugal.
  23. Rowstron, A. and Druschel, P. (Nov. 2001). Pastry:scalable, decentralized object location and routing for largescale peer-to-peer systems. In 8th Int. Conf. on Distributed Systems Platforms. Heidelberg, Germany.
  24. Sargent, R. G. (1996). Verifying and validating simulation models. In Winter Simulation Conference.
  25. Skype (2011). The Skype Ltd, http://www.skype.com.
  26. SkypeJournal (2010). Skype sn crashed. http://skypejournal.com.
  27. SkypeStatistics (2011). Skype statistics. http://aaytch.com.
  28. Stutzbach, D. and Rejaie, R. (2006). Understanding churn in peer-to-peer networks. In Proceedings of the 6th ACM SIGCOMM conference on Internet measurement.
  29. Torrini, P., Heckel, R., and Rath, I. (2010). Stochastic simulation of graph transformation systems. In FACE2010.
  30. Whitner, B. and Balci, O. (1989). Guidelines for selecting and using simulation model verification techniques. In Winter Simulation Conference.
  31. Yang, B. and Garcia-Molina, H. (2003). Designing a superpeer network. In 19th Int. Conf. on Data Engineering (ICDE),Bangalore, India.
  32. Zhao, B. (2003). Tapestry: A resilient global-scale overlay for service deployment. IEEE Journal on Selected Areas in Communications.
Download


Paper Citation


in Harvard Style

Khan A. and Heckel R. (2011). MODEL-BASED STOCHASTIC SIMULATION OF SUPER PEER PROMOTION IN P2P VOIP USING GRAPH TRANSFORMATION . In Proceedings of the International Conference on Data Communication Networking and Optical Communication System - Volume 1: DCNET, (ICETE 2011) ISBN 978-989-8425-69-0, pages 32-42. DOI: 10.5220/0003526000320042


in Bibtex Style

@conference{dcnet11,
author={Ajab Khan and Reiko Heckel},
title={MODEL-BASED STOCHASTIC SIMULATION OF SUPER PEER PROMOTION IN P2P VOIP USING GRAPH TRANSFORMATION},
booktitle={Proceedings of the International Conference on Data Communication Networking and Optical Communication System - Volume 1: DCNET, (ICETE 2011)},
year={2011},
pages={32-42},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0003526000320042},
isbn={978-989-8425-69-0},
}


in EndNote Style

TY - CONF
JO - Proceedings of the International Conference on Data Communication Networking and Optical Communication System - Volume 1: DCNET, (ICETE 2011)
TI - MODEL-BASED STOCHASTIC SIMULATION OF SUPER PEER PROMOTION IN P2P VOIP USING GRAPH TRANSFORMATION
SN - 978-989-8425-69-0
AU - Khan A.
AU - Heckel R.
PY - 2011
SP - 32
EP - 42
DO - 10.5220/0003526000320042