Abstract
Resources search has become a very important area in light of the proliferation of peer-to-peer (P2P) networks and Grids, which heavily rely on effectiveness of forwarding algorithms to propagate queries among peers. Since none of any forwarding algorithms is perfect, Most existed search techniques exhibit varying performances when applying homogeneousforwarding logic in each peer. This paper proposes a promising approach to improve search through heterogeneous forwarding algorithms mixing, named Cocktail Search (CS) technique. Itscore principle is that available forwarding algorithms are selected probabilistically in each peer to avoid the drawback of single algorithm. In this paper, the basic principle of CS technique is presented and Game theory is employed to verify its feasibility. The simulation results demonstrate that this technique shows significant advantages over others.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Foster, I., Iamnitchi, A.: On death, taxes, and the convergence of peer-to-peer and grid computing. In: 2nd International Workshop on Peer-to-Peer Systems (2003)
Stavrou, A., Rubenstein, D., Sahu, S.: A lightweight, robust P2P system to handle flash crowds. Selected Areas in Communications, IEEE Journal 22(1), 6–17 (2004)
Xiu-guo, B., Ming-zheng, H., Bin-xing, F.: A method of actively resource publishing based on P2P. Chinese Mini-micro Systems 25(4), 526–530 (2004)
Talia, D., Trunfio, P.: Toward a synergy between P2P and Grids. IEEE Internet Computing 7(4), 94–96 (2003)
Adamic, L.A., Humberman, B., Lukose, R., Puniyani, A.: Search in power law networks. Physical Review 64, 46135–46143 (2001)
Marius, P., Aruna, S.: Cost-effective broadcast for fully decentralized peer-to-peer networks. Computer Communications 26(11), 1159–1167 (2003)
Jan, M., Burkhard, S.: A methodology for the design of distributed search in P2P middleware. IEEE Network 18(1), 30–37 (2004)
Lv, C., Cao, P., Cohen, E., Li, K., Shenker, S.: Search and replication in unstructured peerto- peer networks. In: ICS (2002)
Menasce, D.A.: Scalable P2P search. Internet Computing 7(2), 83–87 (2003)
Tsoumakos, D., Roussopoulos, N.: A comparison of peer-to-peer search methods. In: Proceedings of the Sixth International Workshop on the Web and Databases, San Diego, USA (2003)
Lin, T., Wang, H.: Search performance analysis in peer-to-peer networks. In: Proceedings of Third Peer-to-Peer Computing International Conference, pp. 204–205 (2003)
Xiu-guo, B., Ming-zheng, H., Hong-li, Z., Bing-bing, X.: A self-organizing timekeeping network. Chinese Journal of China Institute of Communications 25(1), 150–157 (2004)
Mills, D.: A brief history of NTP time: confessions of an Internet timekeeper. ACM Computer Communications Review 33(2), 9–22 (2003)
Nash, J.: Noncooperative games. Math. Ann. 54, 286–295 (1951)
Bagrodia, R., Meyer, R., Takai, M., Chan, Y.A., Zeng, X., Marting, J., Song, H.Y.: Parsec: a parallel simulation environment for complex systems. Computer 31(10), 77–85 (1998)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bao, X., Fang, B., Hu, M. (2004). Cocktail Search in Unstructured P2P Networks. In: Jin, H., Pan, Y., Xiao, N., Sun, J. (eds) Grid and Cooperative Computing - GCC 2004 Workshops. GCC 2004. Lecture Notes in Computer Science, vol 3252. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30207-0_36
Download citation
DOI: https://doi.org/10.1007/978-3-540-30207-0_36
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-23578-1
Online ISBN: 978-3-540-30207-0
eBook Packages: Springer Book Archive