Parasitic computing

被引:36
作者
Barabási, AL [1 ]
Freeh, VW
Jeong, HW
Brockman, JB
机构
[1] Univ Notre Dame, Dept Phys, Notre Dame, IN 46556 USA
[2] Univ Notre Dame, Dept Comp Sci & Engn, Notre Dame, IN 46556 USA
关键词
D O I
10.1038/35091039
中图分类号
O [数理科学和化学]; P [天文学、地球科学]; Q [生物科学]; N [自然科学总论];
学科分类号
07 ; 0710 ; 09 ;
摘要
Reliable communication on the Internet is guaranteed by a standard set of protocols, used by all computers(1). 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(2).
引用
收藏
页码:894 / 897
页数:5
相关论文
共 14 条
[1]  
ALDERMAN LM, 1994, SCIENCE, V266, P1021
[2]  
[Anonymous], 1979, Computers and Intractablity: A Guide to the Theoryof NP-Completeness
[3]  
[Anonymous], PROBABILISTIC ALGORI
[4]  
Boole G., 1854, An investigation of the laws of thought on which are founded the mathematical theories of logic and probabilities
[5]   Breakdown of the internet under intentional attack [J].
Cohen, R ;
Erez, K ;
ben-Avraham, D ;
Havlin, S .
PHYSICAL REVIEW LETTERS, 2001, 86 (16) :3682-3685
[6]   Resilience of the Internet to random breakdowns [J].
Cohen, R ;
Erez, K ;
ben-Avraham, D ;
Havlin, S .
PHYSICAL REVIEW LETTERS, 2000, 85 (21) :4626-4628
[7]  
FOSTER I, 2000, NATURE WEB MATTERS
[8]   Accessibility of information on the web [J].
Lawrence, S ;
Giles, CL .
NATURE, 1999, 400 (6740) :107-109
[9]   Searching the World Wide Web [J].
Lawrence, S ;
Giles, CL .
SCIENCE, 1998, 280 (5360) :98-100
[10]   DNA solution of the maximal clique problem [J].
Ouyang, Q ;
Kaplan, PD ;
Liu, SM ;
Libchaber, A .
SCIENCE, 1997, 278 (5337) :446-449