Estimating operating conditions in a Peer-to-Peer Session Initiation Protocol overlay network

Distributed Hash Table (DHT) based peer-to-peer overlays are decentralized, scalable, and fault tolerant. However, due to their decentralized nature, it is very hard to know the state and prevailing operating conditions of a running overlay. If the system could figure out the operating conditions, it would be easier to monitor the system and re-configure it in response to changing conditions. Many DHT-based system such as the Peer-to-Peer Session Initiation Protocol (P2PSIP) would benefit from the ability to accurately estimate the prevailing operating conditions of the overlay. In this paper, we evaluate mechanisms that can be used to do this. We focus on network size, join rate, and leave rate. We start from existing mechanisms and show that their accuracy is not sufficient. Next, we show how the mechanisms can be improved to achieve a higher level of accuracy. The improvements we study include various mechanisms improving the accuracy of leave rate estimation, use of a secondary network size estimate, sharing of estimates between peers, and statistical mechanisms to process shared estimates.

[1]  Gade Krishna,et al.  A scalable peer-to-peer lookup protocol for Internet applications , 2012 .

[2]  Henning Schulzrinne,et al.  Peer-to-Peer Protocol (P2PP) , 2007 .

[3]  Bonnie A. Nardi,et al.  Interaction and outeraction: instant messaging in action , 2000, CSCW '00.

[4]  Yong Meng Teo,et al.  An adaptive stabilization framework for distributed hash tables , 2006, Proceedings 20th IEEE International Parallel & Distributed Processing Symposium.

[5]  Jure Leskovec,et al.  Planetary-scale views on a large instant-messaging network , 2008, WWW.

[6]  Miguel Castro,et al.  Controlling the Cost of Reliability in Peer-to-Peer Overlays , 2003, IPTPS.

[7]  Seif Haridi,et al.  A Practical Approach to Network Size Estimation for Structured Overlays , 2008, IWSOS.

[8]  David R. Karger,et al.  Observations on the Dynamic Evolution of Peer-to-Peer Networks , 2002, IPTPS.

[9]  Haining Wang,et al.  The Structure of an Instant Messenger Network and its Vulnerability to Malicious Codes , 2005 .

[10]  Indranil Gupta,et al.  Decentralized Schemes for Size Estimation in Large and Dynamic Groups , 2005, Fourth IEEE International Symposium on Network Computing and Applications.

[11]  Dahlia Malkhi,et al.  Estimating network size from local information , 2003, Information Processing Letters.

[12]  Chien-Ming Cheng,et al.  Unstructured Peer-to-Peer Session Initiation Protocol for Mobile Environment , 2007, 2007 IEEE 18th International Symposium on Personal, Indoor and Mobile Radio Communications.

[13]  Kenji Leibnitz,et al.  Estimating Churn in Structured P2P Networks , 2007, ITC.

[14]  Gonzalo Camarillo,et al.  Study on maintenance operations in a chord-based Peer-to-Peer session initiation protocol overlay network , 2009, 2009 IEEE International Symposium on Parallel & Distributed Processing.

[15]  Gonzalo Camarillo,et al.  Analysis of Delays in a Peer-to-Peer Session Initiation Protocol Overlay Network , 2010, 2010 7th IEEE Consumer Communications and Networking Conference.

[16]  Gerald Kunzmann,et al.  A scalable algorithm to monitor chord-based P2P systems at runtime , 2006, IPDPS.