AWCC 2004: Content Computing pp 88-93 | Cite as
Construct Campus Peer-to-Peer Networks
Abstract
The campus peer-to-peer networks, called CP2P networks, are proposed based on the existing Chord protocol. According to colleges’ IP address ranges and users’ interests, every college network constructs a CP2P network. The performance parameters we got are as follows: The average maximum lookup length of the first node in the CP2P network is O(log2 N– log2 k). And other nodes’ lookup lengths are O(log2 m i ). Here N is the total number of nodes in the whole network; k is the total number of CP2P networks; m i is nodes’ number of each CP2P network. CP2P networks enable the transfer locally and reduce the traffic in the campus network backbone. Meanwhile, nodes join and leave only in the local CP2P network. Security problems such as DDOS can be traced back to the attackers’ source colleges.
Preview
Unable to display preview. Download preview PDF.
References
- 1.Stoica, R.M., Karger, D., Kaashoek, F., Balakrishnan, H.: Chord: A Peer-to-Peer Lookup Service for Internet Applications. In: Proceedings of the ACM SIGCOMM Conference, San Diego, CA, September 2001, pp. 149–160 (2001)Google Scholar
- 2.Ratnasamy, S., Francis, P., Handley, M., Karp, R., Shenker, S.: A scalable contentaddressable network. In: Proceedings of the ACM SIGCOMM Conference, San Diego, CA, August 2001, pp. 161–172 (2001)Google Scholar
- 3.Rowstron, A., Druschel, P.: Pastry: Scalable, distributed object location and routing for large-scale peer-to-peer systems. In: Proceedings of International Conference on Distributed Systems Platforms, November 2001, pp. 329–350 (2001)Google Scholar
- 4.Zhao, B.Y., Kubiatowicz, J.D., et al.: Tapestry: An infrastructure for fault-resilient wide-area location and routing. Technical Report UCB//CSD-01-1141, UC Berkeley (April 2001)Google Scholar
- 5.Karger, D., Lehman, E., et al.: Consistent hashing and random trees: Distributed caching protocols for relieving hot spots on the World Wide Web. In: Proceedings of the 29th Annual ACM Symposium on Theory of Computing, El Paso, TX, pp. 654–663 (1997)Google Scholar
- 6.Douceur, J.R.: The Sybil Attack. In: Druschel, P., Kaashoek, M.F., Rowstron, A. (eds.) IPTPS 2002. LNCS, vol. 2429, pp. 251–260. Springer, Heidelberg (2002)CrossRefGoogle Scholar
- 7.Sit, E., Morris, R.: Security Considerations for Peer-to-Peer Distributed Hash Tables. In: Druschel, P., Kaashoek, M.F., Rowstron, A. (eds.) IPTPS 2002. LNCS, vol. 2429, pp. 261–269. Springer, Heidelberg (2002)CrossRefGoogle Scholar