The Community for Technology Leaders
RSS Icon
Issue No.12 - December (2008 vol.19)
pp: 1683-1694
Xueyan Tang , Nanyang Technological University, Singapore
Jianliang Xu , Hong Kong Baptist University, Kowloon
Wang-Chien Lee , Penn State University, University Park
Consistency maintenance is important to the sharing of dynamic contents in peer-to-peer (P2P) networks. The TTL-based mechanism is a natural choice for maintaining freshness in P2P content sharing. This paper investigates TTL-based consistency maintenance in unstructured P2P networks. In this approach, each replica is assigned an expiration time beyond which the replica stops serving new requests unless it is validated. While TTL-based consistency is widely explored in many client-server applications, there has been no study on TTL-based consistency in P2P networks. Our main contribution is an analytical model that studies the search performance and the freshness of P2P content sharing under TTL-based consistency. Due to the random nature of request routing, P2P networks are fundamentally different from most existing TTL-based systems in that every node with a valid replica has the potential to serve any other node. We identify and discuss the factors that affect the performance of P2P content sharing under TTL-based consistency. Our results indicate a tradeoff between search performance and freshness: the search cost decreases sublinearly with decreasing freshness of P2P content sharing. We also compare two types of unstructured P2P networks and find that clustered P2P networks improve the freshness of content sharing over flat P2P networks under TTL-based consistency.
unstructured P2P network, TTL-based consistency, replication, consistency maintenance, content distribution
Xueyan Tang, Jianliang Xu, Wang-Chien Lee, "Analysis of TTL-Based Consistency in Unstructured Peer-to-Peer Networks", IEEE Transactions on Parallel & Distributed Systems, vol.19, no. 12, pp. 1683-1694, December 2008, doi:10.1109/TPDS.2008.44
[1] S. Androutsellis-Theotokis and D. Spinellis, “A Survey of Peer-to-Peer Content Distribution Technologies,” ACM Computing Surveys, vol. 36, no. 4, pp. 335-371, Dec. 2004.
[2] A. Datta, M. Hauswirth, and K. Aberer, “Updates in Highly Unreliable, Replicated Peer-to-Peer Systems,” Proc. IEEE Int'l Conf. Distributed Computing Systems (ICDCS '03), May 2003.
[3] X. Chen, S. Ren, H. Wang, and X. Zhang, “SCOPE: Scalable Consistency Maintenance in Structured P2P Systems,” Proc. IEEE INFOCOM '05, Mar. 2005.
[4] X. Liu, J. Lan, P. Shenoy, and K. Ramaritham, “Consistency Maintenance in Dynamic Peer-to-Peer Overlay Networks,” Computer Networks, vol. 50, no. 6, pp. 859-876, Apr. 2006.
[5] Q. Lv, P. Cao, E. Cohen, K. Li, and S. Shenker, “Search and Replication in Unstructured Peer-to-Peer Networks,” Proc. ACM Int'l Conf. Supercomputing (ICS '02), June 2002.
[6] E. Cohen and H. Kaplan, “Aging through Cascaded Caches: Performance Issues in the Distribution of Web Content,” Proc. ACM SIGCOMM '01, pp. 41-53, Aug. 2001.
[7] G. Coulouris, J. Dollimore, and T. Kindberg, Distributed Systems: Concepts and Design, fourth ed., Addison-Wesley, 2005.
[8] J. Jung, E. Sit, H. Balakrishnan, and R. Morris, “DNS Performance and the Effectiveness of Caching,” IEEE/ACM Trans. Networking, vol. 10, no. 5, pp. 589-603, Oct. 2002.
[9] J. Liang, R. Kumar, and K.W. Ross, “The FastTrack Overlay: A Measurement Study,” Computer Networks, vol. 50, no. 6, pp.842-858, Apr. 2006.
[10] V. Cate, “Alex—A Global File System,” Proc. USENIX File System Workshop, pp. 1-12, May 1992.
[11] Y. Chawathe, S. Ratnasamy, L. Breslau, N. Lanham, and S. Shenker, “Making Gnutella-Like P2P Systems Scalable,” Proc. ACM SIGCOMM '03, Aug. 2003.
[12] X. Tang and S.T. Chanson, “The Minimal Cost Distribution Tree Problem for Recursive Expiration-Based Consistency Management,” IEEE Trans. Parallel and Distributed Systems, vol. 15, no. 3, pp. 214-227, Mar. 2004.
[13] E. Cohen and S. Shenker, “Replication Strategies in Unstructured Peer-to-Peer Networks,” Proc. ACM SIGCOMM '02, Aug. 2002.
[14] S. Tewari and L. Kleinrock, “Proportional Replication in Peer-to-Peer Networks,” Proc. IEEE INFOCOM '06, Apr. 2006.
[15] J. Kangasharju, K. Ross, and D. Turner, “Adaptive Content Management in Structured P2P Communities,” Proc. Int'l ICST Conf. Scalable Information Systems (INFOSCALE '06), June 2006.
[16] 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 '01, pp. 149-160, Aug. 2001.
[17] B. Zhao, L. Huang, J. Stribling, S. Rhea, A. Joseph, and J. Kubiatowicz, “Tapestry: A Resilient Global-Scale Overlay for Service Deployment,” IEEE J. Selected Areas in Comm., vol. 22, no. 1, Jan. 2004.
[18] J. Dilley, “The Effect of Consistency on Cache Response Time,” IEEE Network, vol. 14, no. 3, pp. 24-28, May/June 2000.
[19] J. Jung, A.W. Berger, and H. Balakrishnan, “Modeling TTL-Based Internet Caches,” Proc. IEEE INFOCOM '03, Apr. 2003.
[20] S. Iyer, A. Rowstron, and P. Druschel, “Squirrel: A Decentralized Peer-to-Peer Web Cache,” Proc. ACM Symp. Principles of Distributed Computing (PODC '02), July 2002.
[21] L. Xiao, X. Zhang, A. Andrzejak, and S. Chen, “Building a Large and Efficient Hybrid Peer-to-Peer Internet Caching System,” IEEE Trans. Knowledge and Data Eng., vol. 16, no. 6, pp. 754-769, June 2004.
[22] Y.T. Hou, J. Pan, B. Li, and S. Panwar, “On Expiration-Based Hierarchical Caching Systems,” IEEE J. Selected Areas in Comm., vol. 22, no. 1, pp. 134-150, Jan. 2004.
[23] X. Tang and S.T. Chanson, “Analysis of Replica Placement under Expiration-Based Consistency Management,” IEEE Trans. Parallel and Distributed Systems, vol. 17, no. 11, pp. 1253-1263, Nov. 2006.
[24] C. Gkantsidis, M. Mihail, and A. Saberi, “Random Walks in Peer-to-Peer Networks,” Proc. IEEE INFOCOM '04, Mar. 2004.
[25] L. Kleinrock, Queueing Systems, Volume I: Theory. John Wiley & Sons, 1975.
6 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool