Abstract
Autonomy, efficiency, robustness and load balancing are four desirable features for Peer-to-Peer (P2P) systems. These four features however, are often in conflict with each other. We present a novel P2P architecture, called FISH, based on the Hyper-deBruijn topology. FISH provides flexibility in terms of connections per node and the level of fault-tolerance, and possesses a low diameter. We further address the challenge of dynamic operations of peers by introducing a novel set of algorithms. We also design two variants of Hyper-deBruijn topology for achieving an asymptotical optimal diameter. Comprehensive experiments show that FISH has a good trade-off among the four expected features.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Chawathe, Y., Ratnasamy, S., Breslau, L., et al.: Making gnutella-like P2P systems scalable. In: Proceedings of ATAPCC 2003 (2003)
Aberer, K.: P-Grid: A self-organizing access structure for P2P information systems. In: Batini, C., Giunchiglia, F., Giorgini, P., Mecella, M. (eds.) CoopIS 2001. LNCS, vol. 2172, p. 179. Springer, Heidelberg (2001)
Ratnasamy, S., Francis, P., Handley, M., Karp, R., Shenker, S.: A Scalable Content-Addressable Network. In: Proceedings of the ACM SIGCOMM (2001)
Rowstron, A., Druschel, P.: Pastry: Scalable, distributed object ocation and routing for large-scale peer-to-peer systems. In: Guerraoui, R. (ed.) Middleware 2001. LNCS, vol. 2218, p. 329. Springer, Heidelberg (2001)
Stoica, I., Morris, R., Karger, D., Kaashoek, F., Balakrishnan, H.: Chord: A Scalable Peer-To-Peer Lookup Service for Internet Applications. In: Proceedings of the ACM SIGCOMM (2001)
Zhao, B.Y., Kubiatowicz, J., Joseph, A.D.: Tapestry: An infrastructure for fault-tolerant wide-area location and routing. In: Proceedings of the ACM SIGCOMM
Schlosser, M., Sintek, M., Decker, S., Nejdl, W.: HyperCuP-Hypercubes, Ontologies and P2P Networks. In: Moro, G., Koubarakis, M. (eds.) AP2PC 2002. LNCS (LNAI), vol. 2530, pp. 112–124. Springer, Heidelberg (2003)
Kaashoek, F., Karger, D.R.: Koorde: A simple degreeoptimal hash table. In: Kaashoek, M.F., Stoica, I. (eds.) IPTPS 2003. LNCS, vol. 2735. Springer, Heidelberg (2003)
Fraigniaud, P., Gauron, P.: The content-addressable network d2b. Technical Report LRI 1349, Univ. Paris-Sud (2003)
Naor, M., Wieder, U.: A Simple Fault Tolerant Distributed Hash Table. In: Kaashoek, M.F., Stoica, I. (eds.) IPTPS 2003. LNCS, vol. 2735. Springer, Heidelberg (2003)
Ganesan, E., Pradhan, D.K.: The Hyper-deBruijn Multiprocessor networks. IEEE Transaction (1991)
Loguinov, D., Kumar, A., Rai, V., Ganesh, S.: Graph-Theoretic Analysis of Structured Peer-to-Peer Systems: Routing Distances and Fault Resilience. Texas A&M Technical Report (2003)
Seitz, C.L.: The cosmic cube. Commun. ACM 28, 22–33 (1985)
de Bruijn, N.D.: A combinatorial problem. Koninklijke Nederlandse academie van Wetenschappen 49, 758–764 (1946)
Schlumberger, M.L.: De Bruijn communication networks. Doctoral Dissertation, Dept. of Computer Science, Stanford University, PALO Alto, CA (1974)
Imase, M., Itoh, M.: Design to minimized diameter on build-block network. IEEE Transactions on Computers C30(6), 439–443 (1981)
Ganesan, E., Pradhan, D.K.: Wormhole routing in de Bruijn networks and hyper-de Bruijn networks. In: Circuits and Systems, ISCAS 2003 (2003)
Bridges, W.G., Toueg, S.: On the Impossibility of Directed Moore Graphs. Journal of Combinatorial Theory, series B29(3) (1980)
Steinmetz, Wehrle: Peer-to-Peer System and Applications. Springer, Heidelberg (2005)
Malkhi, D., Naor, M., Ratajczak, D.: Viceroy: A scalable and dynamic emulation of the butterfly. In: Proceedings of the 21st ACM Symposium on Principles of Distributed Computing (2002)
Crainiceanu, A., Linga, P., et al.: P-Ring: An efficient and roubust P2P range index structure. In: Proceedings of SIGMOD 2007 (2007)
Adamic, L.A., Lukose, R.M., Puniyani, A.R., Huberman, B.A.: Search in power-law networks. Physical Review E 64(046135) (2001)
Manku, G.S., Naor, M., Wieder, U.: Know thy neighbor’s neighbor: the power of lookahead in randomized P2P networks. In: STOC 2004 (2004)
Caro, G.D., Ducatelle, F., Heegaard, P., Jelasity, M., Montemanni, R., Montresor, A.: Evaluation of basic services in ahn, p2p and grid networks (February 2005), http://www.cs.unibo.it/bison/deliverables/D07.pdf
Aiello, W., Chung, F., Lu, L.: A random graph model for massive graphs. In: Proceedings of the 32nd Annual ACM Symposium on Theory of Computing, pp. 171–180. ACM Press, New York (2000)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Yuan, Y., Wang, G., Sun, Y. (2010). FISH: A Novel Peer-to-Peer Overlay Network Based on Hyper-deBruijn. In: Chen, L., Tang, C., Yang, J., Gao, Y. (eds) Web-Age Information Management. WAIM 2010. Lecture Notes in Computer Science, vol 6184. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-14246-8_8
Download citation
DOI: https://doi.org/10.1007/978-3-642-14246-8_8
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-14245-1
Online ISBN: 978-3-642-14246-8
eBook Packages: Computer ScienceComputer Science (R0)