Browse > Article
http://dx.doi.org/10.9728/dcs.2011.12.1.133

Adaptive Link Recovery Period Determination Algorithm for Structured Peer-to-peer Networks  

Kim, Seok-Hyun (남서울대학교 멀티미디어학과)
Kim, Tae-Eun (남서울대학교 멀티미디어학과)
Publication Information
Journal of Digital Contents Society / v.12, no.1, 2011 , pp. 133-139 More about this Journal
Abstract
Structured P2P (peer-to-peer) networks have received much attention in research communities and the industry. The data stored in structured P2P networks can be located in a log-scale time without using central severs. The link-structure of structured P2P networks should be maintained for keeping log-scale search performance of it. When nodes join or leave structured P2P networks frequently, some links become unavailable and search performance is degraded by these links. To sustain search performance of structured P2P networks, periodic link recovery scheme is generally used. However, when the link recovery period is short or long compared with node join and leave rates, it is possible that sufficient number of links are not restored or excessive messages are used after the link-structure is restored. We propose the adaptive link recovery determination algorithm to maintain the link-structure of structured P2P networks when the rates of node joining and leaving are changed dynamically. The simulation results show that the proposed algorithm can maintain similar QoS under various node leaving rates.
Keywords
Structured Peer-to-peer networks; link recovery; adaptive algorithm;
Citations & Related Records
연도 인용수 순위
  • Reference
1 Kempe, D., Dobra, A. and Gehrke, J. Gossip-Based Computation of Aggregate Information, In Proceedings of Annual IEEE Symposium on Foundations of Computer Science (FOCS'03). IEEE Computer Society, Los Alamitos, CA, USA, 2003, 482.
2 Jelasity, M., Voulgaris, S., Guerraoui, R., Kermarrec, A., and van Steen, M. Gossip-based peer sampling. ACM Trans. Comput. Syst. 25, 3 (Aug. 2007), 2007, 8.
3 Ratnasamy, S., Francis, P., Handley, M., Karp, R., and Shenker, S. 2001. A scalable content-addressable network. In Proceedings of the 2001 Conferenceon Applications, Technologies, Architectures, and Protocols For Computer Communications (San Diego, California, United States). SIGCOMM '01. ACM, New York, NY, 161-172.
4 Rowstron, A., and Druschel, P. Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems. In Proceedings of the IFIP/ACM International Conference on Distributed Systems Platforms (MIDDLEWARE '01) (Heidelberg, Germany). Springer, LNCS 2218., 2001, 329-350.
5 Locher, T., Schmid, S. and Wattenhofer, R. eQuus: A Provably Robust and Locality-Aware Peer-to-Peer System. In Proceedings of the Sixth IEEE International Conference on Peer-to-Peer Computing (P2P '06), vol., no., Sept. 2006, 3-11.
6 Anceaume, E., Ludinard, R., Ravoaja, A. and Brasileiro, F. PeerCube: A Hypercube-Based P2P Overlay Robust against Collusion and Churn. In Proceedings of the Second IEEE International Conference on Self-Adaptive and Self-Organizing Systems, 2008 (SASO '08) , vol., no., Oct. 2008, 15-24.
7 Anceaume, E., Ludinard, R. and Sericola, B. Analytic Study of the Impact of Churn in Cluster-Based Structured P2P Overlays. In Proceedings of the IEEE International Conference on Communications (ICC' 10), vol., no., May 2010, 1-5.
8 Li, X., Misra, J., and Plaxton, CG., Active and Concurrent Topology Maintenance. In Proceedings of the 18th annual Conrference on Distributed Computing (DISC '04), (Trippenhuis, Amsterdam, Netherlands). Springer, LNCS 3274., 2004, 320-334.
9 Rhea, S., Geels, D., Roscoe, T., and Kubiatowicz, J. Handling churn in a DHT. In Proceedings of the Annual Conference on USENIX Annual Technical Conference (Boston, MA, June 27 - July 02, 2004). USENIX Annual Technical Conference. USENIX Association, Berkeley, CA, 2004, 10-10.
10 Ou, Z., Harjula, E., Kassinen, O., and Ylianttila, M. Performance Evaluation of a Kademlia-based Communication-oriented P2P System Under Churn, Computer Networks, Elsevier, Vol 54., 2010, 689-705.   DOI   ScienceOn
11 Shah, D. Gossip Algorithms. Found. Trends Netw. 3, 1 (Jan. 2009)
12 Ghodsi, A., Alima, L. O., and Haridi, S. Low-Bandwidth Topology Maintenance for Robustness in Structured Overlay Networks, In Proceedings of the 38th Annual Hawaii International Conference on System Sciences (HICSS'05), (Big Island, Hawaii). IEEE Computer Society, Los Alamitos, CA, USA, 2005, 302a.
13 Stoica, I., Morris, R., Karger, D., Kaashoek, M. F., and Balakrishnan, H. Chord: A scalable peer-to-peer lookup service for internet applications. SIGCOMM Comput. Commun. Rev. 31, 4 (Oct. 2001), 149-160.   DOI   ScienceOn