Affiliation:
1. Bharati Vidyapeeth, Navi Mumbai, India
Abstract
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.
Reference10 articles.
1. Kogge, P.M. The Architecture of Symbolic Computers. McGraw-Hill, New York, 1991.
2. Peterson, L.L. and Davie, B.S. Computer Networks, a Systems Approach, Second Edition. Morgan Kaufmann, San Francisco, California, 2000.
3. Boole, G. An Investigation of the Laws of Thought, on Which Are Founded the Mathematical Theories of Logic and Probabilities. 1854.
4. Alderman, L.M. Molecular computation of solutions to combinatorial problems. Science, 266, 1021-1024 (1994).
5. Ouyang, Q., Kaplan, P.D., Liu, S., Libchaber, A. DNA solution of the maximal clique prob- lem. Science,278, 446-449 (1997).