+- Free Academic Seminars And Projects Reports (https://easyreport.in)
+-- Forum: Seminars Topics And Discussions (https://easyreport.in/forumdisplay.php?fid=30)
+--- Forum: Engineering Seminars Topics (https://easyreport.in/forumdisplay.php?fid=7)
+---- Forum: Computer Science Seminar Topics (https://easyreport.in/forumdisplay.php?fid=12)
+---- Thread: Parasitic computing (/showthread.php?tid=13476)
Pages:
1
2
Parasitic computing - surya s nair - 08-16-2017
Parasitic computing refers to the technique of using the resources of one computer by another computer without the knowledge of the former . Distributed computing networks turn home users computers into part of a virtual super computer that can perform time-intensive operations. cont Parasitic computing uses computation power of the computers connected to the internet in solving complex mathematical problem. Eg: Traveling salesman problem satisfiability problem theory To solve problems Generate large number of candidate solutions. Send the solutions to destination node. Test the candidates for their adequacy. If result is true, the solution is valid. else drop. The result from each were used to build a solution. cont The mathematical problem is split into a large number of simple logic problems. They tag a logic problem onto check sum. Web server would process the request. If the check sum is false, then server would not respond to the request. The whole result combine to form the result of the mathematical problem. cont The target nodes are answering logical questions without knowing of doing so. This does not violate the security of the unknowing server. Potential candidate protocol include TCP,HTTP, or encryption/decryption with secure socket layer. how to trick other computer s? NIF ALU NIF ALU NIF ALU levels of communication Parasite node VALID Target web server HTTP TCP IP Network DROP HTTP TCP IP Network cont A single parasite node coordinates the computations occurring remotely in the internet protocols. Each target node consist of Arithmetic and Logic Unit (ALU) Network InterFace (NIF) A single home parasite initiates the computation, sends messages to the targets directing them to test and tabulates the result. Checksum computation Information sent across the internet is split it into small chunks, or packets, that travel-often independently of each other-to their destination. Each packet bears a header that contains Source address Destination address A numerical value related to the packet s content When a computer receives a packet, it checks for errors by performing a calculation and comparing the result with the numerical value in the packet s header. key Component establishing a TCP connection cont A connection is established with 3 messages, The initiator sends a SYN to a remote node. If the remote node is willing to accept a new connection, it responds with a SYN/ACK message. Finally, the initiator sends an ACK message. computing with TCP checksum The message received by the target server contains an IP header a TCP header a candidate solution cont Is a + b equal to c??? The checksum value in a TCP packet is determined by c. The data contains 16 bit words a and b. If a + b! =c, then TCP rejects the segment. A message is valid only if a + b=c. cont The targeted computers are various web servers physically located in North America, Europe, and Asia. There is no negative acknowledgement. The sender will keep a copy of the message. In distributed system, it is not possible to distinguish between a lost message and delayed message. So a message is assumed to lost after some time out period. checksum computation The sender breaks the message consisting of N bits into 16 bit words. The K words are added together using binary arithmetic. The sender then performs a bit-wise complement on the checksum. The sender incorporates the complement of the checksum into the header of the message. cont The receiving computer again breaks the received message into 16-bit segments and add them together. The checksum obtained by the receiver has to be 1111111111111111. If any bit along the message has been corrupted during transmission, the checksum obtained by the target will be different from all ones, in which case target drops the message. a N bits s1 s2 S1 Sk + + b S2 Sk sump 1110101011011011 0001010100100100 S2 = SUM p c sump sum p Create a new message of length N+16 s1 SUM T sk +S1+S2+ ..+Sk : : Message correct To HTTP d IF SUM = 1111111111111111 othrwise Message corrupt drop 2-SAT Problem cont The 2-SAT problem involves 16 variables and the operations AND and XOR. In order to get a TRUE answer for P, each clause shown in separate parentheses needs to be independently TRUE. To evaluate the vale of we generate a 32 bit message M that contains all 16 variables, each preceded by a zero. TCP groups the bits in two 16 bit segments and add them together. The sum can have 4 outcomes. cont If the clause has an XOR operator, is true only when the checksum is (01). If the clause has an AND operator, is true only when the checksum is (10). To turn a package into parasitic message the parasitic node prepares a package, preceded by a checksum, and continued by a 32 bit sequence(S1,S2). algorithm S=create TCP segment S. checksum = checksum For each x S. pad= pad with zeros (x) send S receive answer if answer=true write x is a solution implementation There are several ways to implement the basic algorithm. concurrency: Each concurrent computation requires a separate a TCP connection to http host. connection reuse: Before a TCP connection can be used, it must be established. Once established TCP segments can be sent to remote host. how it differs from others? In cluster computing, many computers pool in their resources willingly. Parasitic computing does not require the willingness of any target machine. In cluster computing, special softwares are needed. Here not needed. features Parasitic computing theoretically offers the chance to use the vast computational power of the whole internet. Several large computational problems can be solved by engaging various web servers physically located in different parts of the world, each of which unknowingly participated in the experiment. cont Ethically challenging alternative for cluster computing, as it uses resources without consent of the computer s owner Parasitic computing does not compromise the security of the targeted servers, and access only those parts of the servers that have been made explicitly available for Internet Communication problems For parasites Several computational cycles are taken to process the possible solutions Possibility of false negatives Possibility of false positives problems For servers Delays due to processing the parasitic messages could cause a denial of service Almost impossible to prevent someone from running a parasitic job on your server history Parasitic computing was developed by the scientist at the Notre Dame University, Indiana(USA). First Reported in journal Nature in 2001 by Barabasi, Freech, Feong and Brockman. future Enabling all the computers to swap information and services they are needed could lead to unparalleled emergent behavior, drastically altering the current use of the internet. summary Parasitic computing moves computation onto what is logically the communication infrastructure of the internet, blurring the distinction between computing and communication. The current internet infrastructure permits one computer to instruct other computer to perform computational tasks that are beyond the target s immediate scope
Parasitic computing - bratg2r - 08-16-2017
Definition
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, 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, 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.
Parasitic computing - itsarichmansworld - 08-16-2017
Parasitic Computing
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.
Parasitic computing - ganeshprasad1410 - 08-16-2017
[attachment=202]
[attachment=203]
The Net is a fertile place and where new ideas/products surface quite often. We have already come across many innovative ideas such as Peer-to-Peer file sharing, distributed computing and the like. Parasitic computing, which harnesses the computing power of machines that spread across the Net to accomplish complex computing tasks, is new in this category. The successor to distributed computing has opened up a whole new can of worms. It works by exploiting a weakness in the TCP/IP system's error checking system. The problem is that forcing target machines into performing calculations puts a greater load on them than a regular packet would, and the server owner has not agreed to take part - in effect the technique is stealing processing power, but without breaking any laws. Although the technique is too slow to have much practical value at present, it does raise questions for the future
Parasitic computing - master - 08-16-2017
to get information about the topic PARASITIC COMPUTING full report ppt and related topic refer the page link bellow
http://seminarsprojects.in/attachment.php?aid=203
http://seminarsprojects.net/Thread-parasitic-computing-full-report
http://seminarsprojects.in/attachment.php?aid=202
http://seminarsprojects.net/Thread-ppt-on-parasitic-computing
http://seminarsprojects.net/Thread-parasitic-computing--4303
http://seminarsprojects.net/Thread-parasitic-computing
http://seminarsprojects.net/Thread-parasitic-computing--3785
Parasitic computing - sujith.boss01 - 08-16-2017
Hello,Parasitic computing is an example of a potential technology that could be viewed simultaneously as a threat or healthy addition to the online universe. On the Internet, reliable communication is guaranteed by a standard set of protocols, used by all computers. 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.
Parasitic computing - kirandasmd - 08-16-2017
to get information about the topic "parasitic computing" refer the page link bellow
http://seminarsprojects.in/attachment.php?aid=203
http://seminarsprojects.net/Thread-parasitic-computing-full-report
http://seminarsprojects.in/attachment.php?aid=202
http://seminarsprojects.net/Thread-parasitic-computing--4303
Parasitic computing - viswa-mesce - 08-16-2017
i need a semiar report on parasitic computing as soon as possible .i need to know the format of the report as well..please send me the ppt along with it.
Parasitic computing - madhavikumar22 - 08-16-2017
please follow the below thread for more details on ' parasitic computing'
http://seminarsprojects.net/Thread-parasitic-computing-full-report?pid=8286
Parasitic computing - akheel - 08-16-2017
hi ,
i hope seminar report on Parasitic Computing is available on this page link http://seminarsprojects.net/Thread-parasitic-computing-full-report