The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.11 - November (2011 vol.22)
pp: 1834-1841
Zhongmei Yao , The University of Dayton, Dayton
Dmitri Loguinov , Texas A&M, College Station
ABSTRACT
Several models of user churn, resilience, and link lifetime have recently appeared in the literature [13], [14], [36], [37]; however, these results do not directly apply to classical Distributed Hash Tables (DHTs) in which neighbor replacement occurs not only when current users die, but also when new users arrive into the system, and where replacement choices are often restricted to the successor of the failed zone in the DHT space. To understand neighbor churn in such networks, which we call switching DHTs, this paper proposes a simple, yet accurate, model for capturing link dynamics in structured P2P systems and obtains the distribution of link lifetimes for fairly generic DHTs. Similar to [9], our results show that deterministic networks (e.g., Chord [30], CAN [25]) unfortunately do not extract much benefit from heavy-tailed user lifetimes since link durations are dominated by small remaining lifetimes of newly arriving users that replace the more reliable existing neighbors. We also examine link lifetimes in randomized DHTs equipped with multiple choices for each link and show that selecting the best neighbor in these scenarios is rather complicated as it depends on the desired load balancing, link resilience, and overhead. We offer insight into the various selection algorithms, their performance, and possibilities for improvement.
INDEX TERMS
Distributed hash tables, link lifetimes, neighbor churn.
CITATION
Zhongmei Yao, Dmitri Loguinov, "Analysis of Link Lifetimes and Neighbor Selection in Switching DHTs", IEEE Transactions on Parallel & Distributed Systems, vol.22, no. 11, pp. 1834-1841, November 2011, doi:10.1109/TPDS.2011.101
REFERENCES
[1] J. Abate and P.P. Valkó, "Multi-Precision Laplace Transform Inversion," Int. J. Numerical Methods in Eng., vol. 60, pp. 979-993, 2004.
[2] R. Bhagwan, S. Savage, and G.M. Voelker, "Understanding Availability," Proc. Int'l Workshop Peer-to-Peer Systems (IPTPS), pp. 256-267, Feb. 2003.
[3] J.T. Bradley, N.J. Dingle, P.G. Harrison, and W.J. Knottenbelt, "Distributed Computation of Passage Time Quantiles and Transient State Distributions in Large Semi-Markov Models," Proc. Int'l Parallel and Distributed Processing Symp. (IPDPS), Apr. 2003.
[4] F.E. Bustamante and Y. Qiao, "Friendships that Last: Peer Lifespan and Its Role in P2P Protocols," Proc. Int'l Workshop Web Content Caching and Distribution (WCW), Sept. 2003.
[5] M. Castro, M. Costa, and A. Rowstron, "Performance and Dependability of Structured Peer-to-Peer Overlays," Proc. Int'l Conf. Dependable Systems and Networks (DSN), June 2004.
[6] E. Çinlar, Introduction to Stochastic Processes. Prentice Hall, 1997.
[7] L. Devroye, "Law of the Iterated Logarithm for Order Statistics of Uniform Spacings," Annals of Probability, vol. 9, pp. 860-867, 1981.
[8] Gnutella, http:/www.gnutella.com/, 2011.
[9] P.B. Godfrey, S. Shenker, and I. Stoica, "Minimizing Churn in Distributed Systems," Proc. ACM SIGCOMM, Sept. 2006.
[10] P.B. Godfrey, "Personal Communication," 2006.
[11] K. Gummadi, R. Gummadi, S. Gribble, S. Ratnasamy, S. Shenker, and I. Stoica, "The Impact of DHT Routing Geometry on Resilience and Proximity," Proc. ACM SIGCOMM, pp. 381-394, Aug. 2003.
[12] S. Krishnamurthy, S. El-Ansary, E. Aurell, and S. Haridi, "A Statistical Theory of Chord under Churn," Proc. Fourth Int'l Workshop Peer-to-Peer System (IPTPS), pp. 93-103, Feb. 2005.
[13] D. Leonard, V. Rai, and D. Loguinov, "On Lifetime-Based Node Failure and Stochastic Resilience of Decentralized Peer-to-Peer Networks," Proc. ACM SIGMETRICS Int'l Conf. Measurement and Modeling of Computer Systems (SIGMETRICS '05), pp. 26-37, June 2005.
[14] D. Leonard, Z. Yao, X. Wang, and D. Loguinov, "On Static and Dynamic Partitioning Behavior of Large-Scale Networks," Proc. IEEE 13th Int'l Conf. Network Protocols (ICNP '05), pp. 345-357, Nov. 2005.
[15] J. Li, J. Stribling, T.M. Gil, R. Morris, and M.F. Kaashoek, "Comparing the Performance of Distributed Hash Tables under Churn," Proc. Third Int'l Workshop Peer-to-Peer Systems (IPTPS), pp. 87-99, Feb. 2004.
[16] J. Li, J. Stribling, R. Morris, and M.F. Kaashoek, "Bandwidth-Efficient Management of DHT Routing Tables," Proc. Second Conf. Symp. Networked Systems Design Implementation (NSDI '05), pp. 1-11, May 2005.
[17] J. Li, J. Stribling, R. Morris, M.F. Kaashoek, and T.M. Gil, "A Performance versus Cost Framework for Evaluating DHT Design Tradeoffs under Churn," Proc. IEEE INFOCOM, pp. 225-236, Mar. 2005.
[18] D. Liben-Nowell, H. Balakrishnan, and D. Karger, "Analysis of the Evolution of the Peer-to-Peer Systems," Proc. 21st Ann. Symp. Principles of Distributed Computing (PODC '02), pp. 233-242, July 2002.
[19] D. Loguinov, A. Kumar, V. Rai, and S. Ganesh, "Graph-Theoretic Analysis of Structured Peer-to-Peer Systems: Routing Distances and Fault Resilience," Proc. ACM SIGCOMM, pp. 395-406, Aug. 2003.
[20] G. Manku, M. Bawa, and P. Raghavan, "Symphony: Distributed Hashing in a Small World," Proc. Fourth Conf. USENIX Symp. Internet Technologies and Systems (USITS '03), pp. 127-140, Mar. 2003.
[21] G.S. Manku, M. Naor, and U. Weider, "Know Thy Neighbor's Neighbor: The Power of Lookahead in Randomized P2P Networks," Proc. ACM 36th Ann. Symp. Theory of Computing (STOC '04), pp. 54-63, June 2004.
[22] P. Maymounkov and D. Mazieres, "Kademlia: A Peer-to-Peer Information System Based on the XOR Metric," Proc. First Int'l Workshop Peer-to-Peer Systems (IPTPS), pp. 53-65, Mar. 2002.
[23] M. Naor and U. Wieder, "Novel Architectures for P2P Applications: The Continuous-Discrete Approach," Proc. 15th Ann. ACM Symp. Parallel Algorithms and Architectures (SPAA '03), pp. 50-59, June 2003.
[24] G. Pandurangan, P. Raghavan, and E. Upfal, "Building Low-Diameter Peer-to-Peer Networks," IEEE J. Selected Areas Comm., vol. 21, no. 6, pp. 995-1002, Aug. 2003.
[25] S. Ratnasamy, P. Francis, M. Handley, R. Karp, and S. Shenker, "A Scalable Content-Addressable Network," Proc. ACM SIGCOMM, pp. 161-172, Aug. 2001.
[26] S.I. Resnick, Adventures in Stochastic Processes. Birkhäuser, 2002.
[27] S. Rhea, D. Geels, T. Roscoe, and J. Kubiatowicz, "Handling Churn in a DHT," Proc. Ann. Conf. USENIX Ann. Technical Conf. (ATEC '04), pp. 127-140, June 2004.
[28] A. Rowstron and P. Druschel, "Pastry: Scalable, Decentralized Object Location and Routing for Large-Scale Peer-to-Peer Systems," Proc. IFIP/ACM Int'l Conf. Distributed Systems Platforms Heidelberg (Middleware '01), pp. 329-350, Nov. 2001.
[29] S. Saroiu, P.K. Gummadi, and S.D. Gribble, "A Measurement Study of Peer-to-Peer File Sharing Systems," Proc. SPIE Multimedia Computing and Networking, vol. 4673, pp. 156-170, Jan. 2002.
[30] I. Stoica, R. Morris, D. Karger, M.F. Kaashoek, and H. Balakrishnan, "Chord: A Scalable Peer-to-Peer Lookup Service for Internet Applications," Proc. ACM SIGCOMM, pp. 149-160, Aug. 2001.
[31] D. Stutzbach and R. Rejaie, "Understanding Churn in Peer-to-Peer Networks," Proc. ACM SIGCOMM Conf. Internet Measurement (IMC '06), pp. 189-202, Oct. 2006.
[32] G. Tan and S. Jarvis, "Stochastic Analysis and Improvement of the Reliability of DHT-Based Multicast," Proc. IEEE INFOCOM, pp. 2198-2206, May 2007.
[33] X. Wang, Z. Yao, and D. Loguinov, "Residual-Based Measurement of Peer and Link Lifetimes in Gnutella Networks," Proc. IEEE INFOCOM, pp. 391-399, May 2007.
[34] X. Wang, Y. Zhang, X. Li, and D. Loguinov, "On Zone-Balancing of Peer-to-Peer Networks: Analysis of Random Node Join," Proc. Joint Int'l Conf. Measurement and Modeling of Computer Systems (SIGMETRICS '04), pp. 211-222, June 2004.
[35] R.W. Wolff, Stochastic Modeling and the Theory of Queues. Prentice Hall, 1989.
[36] Z. Yao, D. Leonard, X. Wang, and D. Loguinov, "Modeling Heterogeneous User Churn and Local Resilience of Unstructured P2P Networks," Proc. IEEE Int'l Conf. Network Protocols (ICNP '06), pp. 32-41, Nov. 2006.
[37] Z. Yao, X. Wang, D. Leonard, and D. Loguinov, "On Node Isolation under Churn in Unstructured P2P Networks with Heavy-Tailed Lifetimes," Proc. IEEE INFOCOM, pp. 2126-2134, May 2007.
[38] B.Y. Zhao, L. Huang, J. Stribling, S.C. Rhea, A.D. Joseph, and J. Kubiatowicz, "Tapestry: A Resilient Global-Scale Overlay for Service Deployment," IEEE J. Selected Areas in Comm., vol. 22, no. 1, pp. 41-53, Jan. 2004.
17 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool