102
Views
3
CrossRef citations to date
0
Altmetric
Articles

Performance analysis of structured peer-to-peer overlays for mobile networks

, &
Pages 522-548 | Received 17 May 2016, Accepted 16 Jun 2016, Published online: 20 Jul 2016

References

  • Ericsson, Ericsson mobility report, (2005). Available at http://www.ericsson.com/mobility-report. Accessed 10 October 2015.
  • J. Li, J. Stribling, R. Morris, M.F. Kaashoek, and T.M. Gil, A performance vs. cost framework for evaluating DHT design tradeoffs under churn, in INFOCOM 2005: 24th Annual Joint Conference of the IEEE Computer and Communications Societies. Proceedings IEEE. Vol. 1, Miami, FL, 2005, pp. 225–236.
  • H. Pucha, S.M. Das, and Y.C. Hu, How to implement DHTs in mobile ad hoc networks, in Proceedings of the 10th ACM International Conference on Mobile Computing and Network (MobiCom 2004), Philadelphia, PA, 2004.
  • I. Stoica, R. Morris, D. Karger, M.F. Kaashoek, and H. Balakrishnan, Chord: A scalable peer-to-peer lookup service for internet applications, in Proceedings of the 2001 Conference on Applications, Technologies, Architectures, and Protocols for Computer Communications,SIGCOMM ’01, San Diego, California, United States; ACM, New York, NY, USA, 2004.
  • A. Rowstron and P. Druschel, Pastry: Scalable, decentralized object location, and routing for large-scale peer-to-peer systems, in Middleware 2001, R. Guerraoui, ed., IFIP/ACM International Conference on Distributed Systems Platforms, Heidelberg, Germany, November 12--16, 2001, pp. 329–350.
  • P. Maymounkov and D. Mazi\‘{e}res, Kademlia: A peer-to-peer information system based on the XOR metric, in Revised Papers from the First International Workshop on Peer-to-Peer Systems, IPTPS ’01, Springer-Verlag, London, UK, 2002, pp. 53--65.
  • A.T. Gai and L. Viennot, Broose: A practical distributed hashtable based on the de-bruijn topology, in Proceedings of Fourth International Conference on Peer-to-Peer Computing, 2004, 2004, pp. 167--174.
  • B. Leong, B. Liskov, and E.D. Demaine, EpiChord: Parallelizing the chord lookup algorithm with reactive routing state management, Tech. Rep. MIT-LCS-TR-963, MIT, Cambridge, MA, 2004.
  • I. Baumgart, B. Heep, and S. Krause, OverSim: A flexible overlay network simulation framework, in Proceedings of 10th IEEE Global Internet Symposium (GI ’07) in Conjunction with IEEE INFOCOM 2007, Anchorage, AK, USA, May 2007, pp. 79–84.
  • F. Chowdhury and M. Kolberg, Performance evaluation of structured peer-to-peer overlays for use on mobile networks, in Proceedings of the 6th International Conference on Developments in eSystems Engineering, DeSe 2013, Abu Dhabi, UAE, 2007.
  • K. Dhara, Y. Guo, M. Kolberg, and X. Wu, Overview of structured peer-to-peer overlay algorithms, in Handbook of Peer-to-Peer Networking, Springer, USA, 2010, pp. 223–256.
  • A. Malatras, State-of-the-art survey on p2p overlay networks in pervasive computing environments, J. Network Comput. Appl. 55 (2015), pp. 1–23.
  • I. Baumgart and B. Heep, Fast but economical: A simulative comparison of structured peer-to-peer systems, in Proceedings of the 8th Euro-NF Conference on Next Generation Internet (NGI 2012), IEEE, June 2012.
  • H.N. Chan, K.N. Van, and G.N. Hoang, Characterizing Chord, and Kelips and Tapestry algorithms in P2P streaming applications over wireless network, in Second InternationalConference on Communications and Electronics, 2008. ICCE 2008, 2008, pp. 126-131.
  • J. Hautakorpi and G. Camarillo, Evaluation of DHTs from the viewpoint of interpersonal communications, in Proceedings of the 6th International Conference on Mobile and Ubiquitous Multimedia, 2007, pp. 74–83.
  • Z. Ou, E. Harjula, O. Kassinen, and M. Ylianttila, Performance evaluation of a Kademlia-based communication-oriented P2P system under churn, Comput. Netw. 54 (2010), pp. 689–705.
  • J. Cowie, A. Ogielski, and D. Nicol, The SSFNet network simulator, 2002; software available at http://www.ssfnet.org/homePage.html.
  • J. Furness, F. Chowdhury, and M. Kolberg, An evaluation of EpiChord in OverSim, in Networks and Communications (NetCom2013), Springer, 2014, pp. 3–19.
  • A. Montresor and M. Jelasity, PeerSim: A scalable P2P simulator, in IEEE 9th International Conference on Peer-to-Peer Computing, 2009, pp. 99–100.
  • T. Gil, F. Kaashoek, J. Li, R. Morris, and J. Stribling, P2Psim, A simulator for peer-to-peer protocols, 2003.
  • K. Shudo, Y. Tanaka, and S. Sekiguchi, Overlay weaver: An overlay construction toolkit, Comput. Commun. (2008), pp. 402–412.
  • P. Garc{\’{\i}}a, C. Pairot, R. Mond\’{e}jar, J. Pujol, H. Tejedor, and R. Rallo, Planetsim: A new overlay network simulation framework, Springer, 2005.
  • T. Issariyakul and E. Hossain, Introduction to Network Simulator NS2, Springer, 2011.
  • NS-3, NS-3 network simulator. Available at https://www.nsnam.org/. Accessed on 10 October 2015.
  • D. Stingl, C. Gross, J. Ruckert, L. Nobach, A. Kovacevic, and R. Steinmetz, Peerfactsim. kom: A simulation framework for peer-to-peer systems, in International Conference on High Performance Computing and Simulation (HPCS), 2011, pp. 577-584.
  • S. Sioutas, G. Papaloukopoulos, E. Sakkopoulos, K. Tsichlas, and Y. Manolopoulos, A novel distributed P2P Simulator Architecture: D-P2P-Sim, in Proceedings of the 18th ACM conference on Information and knowledge management, 2009, pp. 2069--2070.
  • A. Brown and M. Kolberg, Tools for peer-to-peer network simulation, draftirtf-p2prf-core-simulators-00. txt (2006).
  • S. Naicken, A. Basu, B. Livingston, and S. Rodhetbhai, A survey of peer-to-peer network simulators, in Proceedings of The Seventh Annual Postgraduate Symposium, Vol. 2, Liverpool, UK, 2006.
  • F. Dabek, B. Zhao, P. Druschel, J. Kubiatowicz, and I. Stoica, Towards a common API for structured peer-to-peer overlays, in Peer-to-Peer Systems II, Springer, 2003, pp. 33--44.
  • D. Hoch, Time in app increases by 21 across all apps. Available at http://info.localytics.com/blog/time-in-app-increases-by-21-across-all-apps. Accessed on 21 November 2014.
  • D. Stutzbach and R. Rejaie, Understanding churn in peer-to-peer networks, in Proceedings of the 6th ACM SIGCOMM Conference on Internet Measurement, 2006, pp. 189-202.
  • D. Wu, Y. Tian, and K.W. Ng, Analytical study on improving DHT lookup performance under churn, in Proceedings of the Sixth IEEE International Conference on Peer-to-Peer Computing, P2P ’06, IEEE Computer Society, Washington, DC, USA. 2006, pp. 249–258. doi: 10.1109/P2P.2006.4
  • K. Pawlikowski, H.D. Jeong, and J.S. Lee, On credibility of simulation studies of telecommunication networks, Commun. Mag. IEEE 40 (2002), pp. 132–139.

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.