Browse > Article

Distributed Construction of the Recrystallization Topology and Efficient Searching in the Unstructured Peer-to-Peer Network  

Park, Jae-Hyun (중앙대학교 컴퓨터공학과)
Publication Information
Journal of KIISE:Information Networking / v.35, no.4, 2008 , pp. 251-267 More about this Journal
Abstract
In this paper, we present a distributed topology control algorithm for constructing an optimized topology having a minimal search-time in unstructured peer-to-peer network. According to the proposed algorithm, each node selects the best nodes having higher hit-ratio than other nodes as many as the number being exponentially proportional to the hit-ratio of the node itself, and then it connects to them. The ensemble behavior of the proposed algorithm is very similar to the recrystrallizing phenomenon that is observed in nature. There is a partial order relationship among the hit-ratios of most nodes of constructed topology. Therefore once query message visits a node, it has a higher hit-ratio than the node that was visited last by the message. The query message even sent from freeloader can escape to the node having high hit-ratio by one hop forwarding, and it never revisits any freeloader again. Thus the search can be completed within a limited search time. We also propose the Chain-reactive search scheme using the constructed topology. Such a controlled multicasting reduces the query messages by 43 percent compared to that of the naive Gnutella using broadcasting, while it saves the search time by 94 percent. The search success rate of the proposed scheme is 99 percent.
Keywords
Topology Control Protocol; Peer-to-peer Network; Recrystallization Topology; Search;
Citations & Related Records
연도 인용수 순위
  • Reference
1 Saurabh Tewari and Leonard Kleinrock, "Optimal search performance in unstructured peer-to-peer networks with clustered demands," IEEE Journal on Selected Areas in Communications, Vol.25, No. 1, pp. 84-95, 2007
2 ASDF호1Alexander Loser, Steffen Staab, and Christoph Tempich, "Semantic social overlay networks," IEEE Journal on Selected Areas in Communications, Vol. 25, No. 1, pp. 5-14, 2007   DOI   ScienceOn
3 H. Guclu and M. Yuksel, "Scale-Free Overlay Topologies with Hard Cutoffs for Unstructured Peer-to-Peer Networks," 27th International Conference on Distributed Computing Systems (ICDCS'07), USA, pp. 32, 2007
4 S. Merugu, S. Srinivasan, and E. Zegura, "Adding structure to unstructured peer-to-peer networks: The use of small-world graphs," J. Parallel and Distributed Computing, pp. 142-153, 2005
5 A. Medina, A. Lakhina, I. Matta, and J. Byers, "Brite: An approach to universal topology generation," Proc. of International Workshop on Modeling, Analysis and Simulation of Computer and Telecommunications Systems (MASCOTS) 2001, pp. 346-356, 2001
6 Reka Albert and Albert-Laszlo Barabasi, "Topology of evolving networks: local events and universality," Phys. Rev. Lett., Vol. 85, No. 24, pp. 5234-5237, 2000   DOI   ScienceOn
7 H. Tian, S. Zou, W. Wang and S. Cheng, "Constructing efficient peer-to-peer overlay topologies by adaptive connection establishment," Computer Communications, Vol. 29, No. 17, pp. 3567-3579, 2006   DOI   ScienceOn
8 R. Matei, A. Iamnitchi, and P.Foster, "Mapping the Gnutella network," IEEE Internet Computing, Vol. 6, No. 1, pp. 50-57, 2002
9 Xiaoyan Song, and Markus Rettenmayr, "Modeling recrystallization in a material containing fine and coarse particles," Computational Materials Science, Available online, 2006
10 R. Cohen and S. Havlin, "Scale-free networks are ultrasmall," Physical Review Letters, 90:058701, 2003
11 P. Dasgupta, "A Multi-agent Mechanism for Topology Balancing in Unstructured P2P Networks," Proceedings of the IEEE/WIC/ACM international Conference on intelligent Agent Technology, IAT 2006, Washington DC, pp. 389-392, 2006
12 S. Amari, K. Kurata, and H. Nagaoka, "Information geometry of Boltzmann machines," IEEE Transactions on Neural Networks, Vol.3, No.2, pp. 260-271, 1992   DOI   ScienceOn
13 Krishna P. Gummadi, Richard J. Dunn, Stefan Saroiu, Steven D. Gribble, Henry M. Levy, and John Zahorjan, "Measurement, modeling, and analysis of a peer-to-peer file-sharing workload," Proceedings of the nineteenth ACM symposium on Operating systems principles 2003, USA, pp. 314-329, October, 2003
14 D. Hughes, G. Coulson, and J. Walkerdine, "Free riding on Gnutella revisited: the bell tolls?," IEEE Distributed Systems Online, Vol. 6, No. 6, 2005
15 J. D Vicente, J. Lanchares, and R. Hermida, "Annealing placement by thermodynamic combinatorial optimization," ACM Trans. Des. Autom. Electron. Syst., Vol. 9, No. 3, pp. 310-332, 2004   DOI   ScienceOn
16 T. Condie, S. Kamvar, and H. Garcia-Molina, "Adaptive peer-to-peer topologies," Proc. 4th Int. Conf. Peer-to-Peer Comput., pp. 53-62, 2004
17 W. Feller, An Introduction to Probability Theory and Its Applications, vol. 1, Reading Mass., New York: John Wiley & Sons, Inc., 1950, pp. 344-349
18 M. Fleischer, "Simulated annealing: past, present, and future," Proceedings of the 1995 Winter Simulation Conference, pp. 155-161, 3-6 Dec. 1995
19 C. Kittel and H. Kroemer, Thermal Physics, 2nd ed., Reading Mass., New York: W.H. Freeman, 1980, pp. 42-64
20 Lada A. Adamic, Rajan M. Lukose, Amit R. Puniyani, and Bernardo A. Huberman, "Search in power-law networks," Physical Review E, Vol. 64, No. 4, pp. 046135, 2001   DOI
21 C. Blum and A. Roli, "Metaheuristics in combinatorial optimization: overview and conceptual comparison," ACM Comput. Surv., Vol. 35, No. 3, pp. 268-308, 2003   DOI   ScienceOn
22 E. Aarts and J. Korst, Simulated annealing and Boltzmann machines: a stochastic approach to combinatorial optimization and neural computing, Reading Mass., New York: John Wiley & Sons, Inc., 1989, pp. 126-177
23 Q. He, M. Ammar, G. Riley, H. Raj, and R. Fujimoto, "Mapping peer behavior to packet-level details: a framework for packet-level simulation of peer-to-peer systems," Proceedings of 11th IEEE/ ACM International Symposium on Modeling, Analysis and Simulation of Computer Telecommunications Systems, MASCOTS 2003, USA, pp. 71-78, October, 2003