Parasitic Computing
Thread Rating:
  • 0 Vote(s) - 0 Average
  • 1
  • 2
  • 3
  • 4
  • 5
computer science crazy
Super Moderator

Posts: 3,048
Joined: Dec 2008
22-09-2008, 10:33 AM

The net is a fertile place where new ideas/products surface quite often. We have already come across many innovative ideas such as Peer-to-Peer file sharing, distributed computing etc. Parasitic computing is a new in this category. Reliable communication on the Internet is guaranteed by a standard set of protocols, used by all computers. The Notre Dame computer scientist showed that these protocols could 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, known as "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, the scientists harnessed the power of several web servers across the globe, which-unknown to them-work together to solve an NP complete problem.

Sending a message through the Internet is a sophisticated process regulated by layers of complex protocols. For example, when a user selects a URL (uniform resource locator), requesting a web page, the browser opens a transmission control protocol (TCP) connection to a web server. It then issues a hyper-text transmission protocol (HTTP) request over the TCP connection. The TCP message is carried via the Internet protocol (IP), which might break the message into several packages, which navigate independently through

numerous routers between source and destination. When an HTTP request reaches its target web server, a response is returned via the same TCP connection to the user's browser. The original message is reconstructed through a series of consecutive steps, involving IP and TCP; it is finally interpreted at the HTTP level, eliciting the appropriate response (such as sending the requested web page). Thus, even a seemingly simple request for a web page involves a significant amount of computation in the network and at the computers at the end points.

In essence, a `parasitic computer' is a realization of an abstract machine for a distributed computer that is built upon standard Internet communication protocols. We use a parasitic computer to solve the well known NP-complete satisfiability problem, by engaging various web servers physically located in North America, Europe, and Asia, each of which unknowingly participated in the experiment. Like the SETI@home project and implimentation, parasitic computing decomposes a complex problem into computations that can be evaluated independently and solved by computers connected to the Internet; unlike the SETI project and implimentation, however, it does so without the knowledge of the participating servers. Unlike `cracking' (breaking into a computer) or computer viruses, however, parasitic computing does not compromise the security of the targeted servers, and accesses only those parts of the servers that have been made explicitly available for Internet communication.

The NP-Complete Problem

A problem is assigned to the NP (nondeterministic polynomial time) class if it is verifiable in polynomial time by a Nondeterministic Turing Machine (A nondeterministic Turing Machine is a "parallel" Turing Machine which can take many computational paths simultaneously, with the restriction that the parallel Turing machines cannot communicate.). A problem is NP-hard if an algorithm for solving it can be translated into one for solving any other NP-problem. NP-hard therefore means "at least as hard as any NP-problem", although it might, in fact, be harder. A problem which is both NP and NP-hard is said to be an NP-Complete problem. Examples of NP-Complete problems are the traveling salesman problem and the satisfiability problem.

The `satisfiability' (or SAT) problem involves finding a solution to a Boolean equation that satisfies a number of logical clauses. For example, (x1 XOR x2) AND (x2 AND x3) in principle has 23 potential solutions, but it is satisfied only by the solution x1 = 1, x2 = 0, and x3 = 1. This is called a 2-SAT problem because each clause, shown in parentheses, involves two variables. The more difficult 3-SAT problem is known to be NP complete, which in practice means that there is no known polynomial-time algorithm which solves it. Indeed, the best known algorithm for an n-variable SAT problem scales exponentially with n . Here we follow a brute-force approach by instructing target computers to evaluate, in a distributed fashion, each of the 2n potential solutions.
Use Search at wisely To Get Information About Project Topic and Seminar ideas with report/source code along pdf and ppt presenaion
seminar paper
Active In SP

Posts: 6,455
Joined: Feb 2012
05-03-2012, 11:13 AM

to get information about the topic PARASITIC COMPUTING full report ppt and related topic refer the link bellow

http://seminar and presentationproject and

http://seminar and presentationproject and

Important Note..!

If you are not satisfied with above reply ,..Please


So that we will collect data for you and will made reply to the request....OR try below "QUICK REPLY" box to add a reply to this page
Tagged Pages: parasitic computing 2012, parasitic computing, index points for parasitic computing, perisitic computing,
Popular Searches: parasitic computing seminar slides, ppt of seminar topic parasitic computing, seminar on parasitic power, parasitic power harvestig in shoes presentation, parasitic computing seminar presentation, download seminar topic parasitic computing ppt, future of parasitic computing,

Quick Reply
Type your reply to this message here.

Image Verification
Please enter the text contained within the image into the text box below it. This process is used to prevent automated spam bots.
Image Verification
(case insensitive)

Possibly Related Threads...
Thread Author Replies Views Last Post
  difference between soc and aoc in mobile computing jaseelati 0 310 20-12-2014, 01:12 PM
Last Post: jaseelati
  Cloud Computing abstract seminar tips 4 5,231 20-06-2014, 03:40 PM
Last Post:
  Towards Secure and Dependable Storage Services in Cloud Computing FULL REPORT seminar ideas 5 4,110 24-03-2014, 02:51 PM
Last Post: seminar project topic
  Introduction to Cloud Computing project uploader 4 4,624 22-03-2014, 05:27 PM
Last Post: navasfiroz
  Green computing; balancing energy in processing, storage, and Transport PPT seminar projects maker 0 502 26-09-2013, 04:09 PM
Last Post: seminar projects maker
  Report on Autonomic Computing  seminar projects maker 0 402 19-09-2013, 04:44 PM
Last Post: seminar projects maker
  Perceptive Computing ppt seminar projects maker 0 323 19-09-2013, 04:11 PM
Last Post: seminar projects maker
  Mobile Learning (mLearning) Based on Cloud Computing: mLearning as a Service (mLaaS) seminar projects maker 0 456 11-09-2013, 03:40 PM
Last Post: seminar projects maker
  Pervasive Computing: Vision and Challenges pdf study tips 0 400 14-08-2013, 02:58 PM
Last Post: study tips
  Green Cloud Computing in Developing Regions pdf study tips 0 442 12-08-2013, 04:59 PM
Last Post: study tips