Abstract
In addition to searching, browsing is yet another requirement of P2P file sharing systems. Nevertheless, none of the recent P2P DHTs can closely connect peers with the same interests together so that it is not practical to provide browsing service in such systems. In this paper, we define a new cayley graph to support logical grouping, and based on this cayley graph, a set of P2P DHT protocols which is suitable for providing file browsing service is also designed. Performance evaluation indicates that the new protocols can reach the theoretical lower bound of routing table size and query path length. Furthermore, the robustness of ComNET is also better than most of the P2P DHTs recently proposed.
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.
References
Kumar, A., Merugu, S., Xu, J., Yu, X.: Ulysses: A robust, low-diameter, low-latency peer-to-peer network. European transaction on telecommunications 15(6), 571–587 (2004)
Malkhi, D., Naor, M., Ratajczak, D.: Viceroy: A scalable and dynamic emulation of the butterfly. In: Proc. of ACM PODC 2002, ACM Press, New York (2002)
Xu, J.: On the fundamental tradeoffs between routing table size and network diameter in peer-to-peer networks. In: Proc. of IEEE Infocom 2003, vol. 1-3, pp. 2177–2187 (2003)
Watts, D.J., Strogatz, S.H.: Collective dynamics of ‘small-world’ networks. Nature (1998)
Aberer, K., Alima, L.O., Ghodsi, A., Girdzijauskas, S., Haridi, S., Hauswirh, M.: The essence of p2p: a reference architecture for overlay networks. In: Fifth IEEE International Conference on Peer-to-Peer Computing (2005)
Sripanidkulchai, K., Maggs, B., Zhang, H.: Effcient content location using interest-based locality in peer-to-peer systems. In: Proc. of IEEE Infocom 2003: The conference on computer communications, vol. 1-3, pp. 2166–2176 (2003)
Xiao, W., Parhami, B.: Cayley graph as models of deterministic small-world networks. Information Processing Letters 97(3), 115–117 (2006)
Qu, C., Nejdl, W., Kriesell, M.: Cayley dhts - a group-theoretic framework for analyzing dhts based on cayley graphs. In: Cao, J., Yang, L.T., Guo, M., Lau, F. (eds.) ISPA 2004. LNCS, vol. 3358, Springer, Heidelberg (2004)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Sun, Z., Xiao, W. (2007). ComNET: A P2P Community Network. In: Xu, M., Zhan, Y., Cao, J., Liu, Y. (eds) Advanced Parallel Processing Technologies. APPT 2007. Lecture Notes in Computer Science, vol 4847. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-76837-1_31
Download citation
DOI: https://doi.org/10.1007/978-3-540-76837-1_31
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-76836-4
Online ISBN: 978-3-540-76837-1
eBook Packages: Computer ScienceComputer Science (R0)