Parasitic computing.

by: AL Barabási, VW Freeh, H Jeong, JB Brockman

Nature, Vol. 412, No. 6850. (30 August 2001), pp. 894-897.

View FullText article

DOI, Nature, Pubmed, Hubmed

Reviews [Write a review of this article]

There are no reviews of this article

Find related articles from these CiteULike users

chad_davis, dullhunk, dhein1030

Find related articles with these CiteULike tags

algorithm, client-server, distributed, distributed-computing, grid-computing, key-length, np, np-complete, parasitic-computing

Abstract

Reliable communication on the Internet is guaranteed by a standard set of protocols, used by all computers. Here we show that these protocols can be exploited to compute with the communication infrastructure, transforming the Internet into a distributed computer in which servers unwittingly perform computation on behalf of a remote node. In this model, which we call 'parasitic computing', one machine forces target computers to solve a piece of a complex computational problem merely by engaging them in standard communication. Consequently, the target computers are unaware that they have performed computation for the benefit of a commanding node. As experimental evidence of the principle of parasitic computing, we harness the power of several web servers across the globe, which-unknown to them-work together to solve an NP complete problem.

@article{citeulike:1067088, abstract = {Reliable communication on the Internet is guaranteed by a standard set of protocols, used by all computers. Here we show that these protocols can be exploited to compute with the communication infrastructure, transforming the Internet into a distributed computer in which servers unwittingly perform computation on behalf of a remote node. In this model, which we call 'parasitic computing', one machine forces target computers to solve a piece of a complex computational problem merely by engaging them in standard communication. Consequently, the target computers are unaware that they have performed computation for the benefit of a commanding node. As experimental evidence of the principle of parasitic computing, we harness the power of several web servers across the globe, which-unknown to them-work together to solve an NP complete problem.}, address = {Department of Physics, University of Notre Dame, Notre Dame, Indiana 46556, USA. alb@nd.edu}, author = {Barab\'{a}si, A. L. and Freeh, V. W. and Jeong, H. and Brockman, J. B. }, citeulike-article-id = {1067088}, doi = {10.1038/35091039}, issn = {0028-0836}, journal = {Nature}, keywords = {client-server, distributed-computing, np, np-complete}, month = {August}, number = {6850}, pages = {894--897}, posted-at = {2007-10-15 13:41:02}, priority = {3}, title = {Parasitic computing.}, url = {http://dx.doi.org/10.1038/35091039}, volume = {412}, year = {2001} }

RIS record

TY - JOUR ID - citeulike:1067088 L3 - citeulike-article-id:1067088 TI - Parasitic computing. JF - Nature VL - 412 IS - 6850 SP - 894 EP - 897 AD - Department of Physics, University of Notre Dame, Notre Dame, Indiana 46556, USA. alb@nd.edu SN - 0028-0836 N2 - Reliable communication on the Internet is guaranteed by a standard set of protocols, used by all computers. Here we show that these protocols can be exploited to compute with the communication infrastructure, transforming the Internet into a distributed computer in which servers unwittingly perform computation on behalf of a remote node. In this model, which we call 'parasitic computing', one machine forces target computers to solve a piece of a complex computational problem merely by engaging them in standard communication. Consequently, the target computers are unaware that they have performed computation for the benefit of a commanding node. As experimental evidence of the principle of parasitic computing, we harness the power of several web servers across the globe, which-unknown to them-work together to solve an NP complete problem. KW - client-server KW - distributed-computing KW - np KW - np-complete AU - Barabási, AL AU - Freeh, VW AU - Jeong, H AU - Brockman, JB PY - 2001/08/30/ UR - http://dx.doi.org/10.1038/35091039 ER -

RIS BibTeX