This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
CompuP2P: An Architecture for Internet Computing Using Peer-to-Peer Networks
November 2006 (vol. 17 no. 11)
pp. 1306-1320

Abstract—Internet computing is emerging as an important new distributed computing paradigm in which resource intensive computing is integrated over Internet-scale networks. Over these large networks, different users and organizations share their computing resources, and computations take place in a distributed fashion. In such an environment, a framework is needed in which the resource providers are given incentives to share their resources. CompuP2P is a lightweight architecture for enabling Internet computing. It uses peer-to-peer networks for sharing of computing resources. CompuP2P create dynamic markets of network accessible computing resources, such as processing power, memory storage, disk space, etc., in a completely distributed, scalable, and fault-tolerant manner. This paper discusses the system architecture, functionality, and applications of the proposed CompuP2P architecture. We have implemented a Java-based prototype, and our results show that the system is light-weight and can provide almost a perfect speedup for applications that contain several independent compute-intensive tasks.

[1] Kaaza, http:/www.kaaza.com, 2006.
[2] Gnutella, http:/gnutella.wego.com/, 2006.
[3] SETI@home, http:/setiathome.ssl.berkeley.edu, 2006.
[4] http://www-unix.globus.orgtoolkit/, Mar. 2005.
[5] I. Stoica, R. Morris, D. Karger, M.F. Kaashoek, and H. Balakrishnan, “Chord: A Scalable Peer-to-Peer Lookup Protocol for Internet Applications.” Proc. 2001 ACM SIGCOMM Conf., 2001.
[6] S. Ratnasamy, P. Francis, M. Handley, R. Karp, and S. Shenker, “A Scalable Content-Addressable Network,” Proc. ACM SIGCOMM, 2001.
[7] D.P. Anderson, “Boinc: A System for Public Resource Computing and Storage,” Proc. Fifth IEEE/ACM Int'l Workshop Grid Computing, Nov. 2004.
[8] I. Foster and C. Kesselman, The Grid: Blueprint for a New Computing Infrastructure, second ed. Morgan Kaufmann, 2004.
[9] M.J. Osborne, A Course in Game Theory. Cambridge, Mass: MIT Press, 1994.
[10] D. Karger, E. Lehman, T. Leighton, M. Levine, D. Lewin, and R. Panigrahy, “Consistent Hashing and Random Trees: Distributed Caching Protocols for Relieving Hot Spots on the World Wide Web,” Proc. 29th Ann. ACM Symp. Theory of Computing, pp. 654-663, May 1997.
[11] W. Vickrey, “Counterspeculation, Auctions, and Competitive Sealed Tenders,” J. Finance, pp. 8-37, 1961.
[12] M.R. Baye, Managerial Economics and Business Strategy, third ed. McGraw Hill, 2000.
[13] A. Chien, B. Calder, S. Elbert, and K. Bhatia, “Entropia: Architecture and Performance of an Enterprise Desktop Grid System.” J. Parallel and Distributed Computing, vol. 63, pp. 597-610, 2003.
[14] “Standard Performance Evaluation Corporation,” SPECjvm98 Documentation, Release 1.0, Aug. 1998, http://www.spec.org/osg/jvm98/jvm98/docindex.html .
[15] http://ecpe.ee.iastate.edu/dcnl/DCNLWEB/ Toolstools_ISTOS. htm, June 2005.
[16] GATSS, Genetic Algorithm Traveling Salesman Problem Solver, http://www.acc.umu.se/~toptravel_information.html , June 2005.
[17] TSPLIB, Library of Sample Instances for TSP (Traveling Salesman Problem), http://www.iwr.uni-heidelberg.de/groups/ comopt/software/TSPLIB95index.html, June 2005.
[18] L. Wang, A.A. Maciejewski, H.J. Siegel, and V.P. Roychowdhury, “A Comparitive Study of Five Parallel Genetic Algorithms Using Traveling Salesman Problem,” Proc. 12th Int'l Parallel Processing Symp. and Ninth Symp. Parallel and Distributed Processing, Mar. 1998.
[19] N. Nisan, S. London, O. Regev, and N. Camiel, “Globally Distributed Computation over Internet—The POPCORN Project,” Proc. 18th IEEE Int'l Conf. Distributed Computing Systems, pp. 592-601, May 1998.
[20] P. Wagstrom, An Overview of Condor. Feb. 2002.
[21] M. Senior and R. Deters, “Market Structures in Peer Computation Sharing,” Proc. Second Int'l Conf. Peer-to-Peer Computing (P2P '02), 2002.
[22] V. Vishnumurthy, S. Chandrakumar, and E.G. Sirer, “Karma: A Secure Economic Framework for Peer-to-Peer Resource Sharing,” Proc. Workshop Economics of Peer-to-Peer Systems, 2003.
[23] I. Foster and C. Kesselman, The Grid: Blueprint for a New Computing Infrastructure, second ed. Morgan Kaufmann, 2004.

Index Terms:
Peer-to-peer, distributed computing, selfishness, game theory, microeconomics.
Citation:
Rohit Gupta, Varun Sekhri, Arun K. Somani, "CompuP2P: An Architecture for Internet Computing Using Peer-to-Peer Networks," IEEE Transactions on Parallel and Distributed Systems, vol. 17, no. 11, pp. 1306-1320, Nov. 2006, doi:10.1109/TPDS.2006.149
Usage of this product signifies your acceptance of the Terms of Use.