PARASITIC COMPUTING

PARASITIC COMPUTING

• 1.
  WELCOME….
• 2.
  SEMINAR ON THETOPIC… “PARASITIC COMPUTING..” PRESENTED BY, ATHULYA.S
• 3.
  CONTENTS........... 1.Introduction 2.how the Communicationthrough internet is done 3.Internet Communication 4.Implementation 5.Proof of Concept 6.Creating parasitic message 7.Problem for Servers 8.Future 9.Conclusion 10.Reference
• 4.
  What is ParasiticComputing?
• 5.
  … First Reported injournal ‘Nature’ in 2001 by Barabasi, Freech, feong and Brockman A form of Distributed Computer Architecture Used for solving Complex Computational Problems
• 6.
  … Target could neverknow Exploit Standard set of communication protocol in internet. Potential standard protocols are TCP, HTTP, IP
• 7.
  … How The Communication through Internetis done?
• 8.
  When a userselects a URL…. Actions at Sender Open a TCP connection to web server Issues a HTTP request over TCP connection TCP message is carried via IP
• 9.
  When a userselects a URL…. Receives message through IP Validate checksum at TCP Validated pushed to HTTP Not validated discard the packet Actions at receiver
• 10.
  Implementation Implementation takes placeat many layers in inter net Several protocols may be exploited to perform parasitic computing Implementation made using TCP or higher levels
• 11.
  Implementation Using TCP TCPChecksum Provide enough logic to compute any Boolean function. HTTP Service Protocol always send a response to any message received.
• 12.
  TCP Checksum
• 13.
  How it works… ASingle home parasite node initiates the computation Sends a specially created TCP packet containing a possible solution. If the possible solution is correct, the HTTP server returns an error message. If the solution is wrong, then packet is dropped at TCP Layer
• 14.
  Creating Parasitic Message Theproblem is constructed as the data part TCP checksum sent is a representation of expected answer Parasitic checksum and the variable string are sent to the remote machine for verification
• 15.
  Algorithm S= create TCPsegments (x1, x2, x3, x4……….x15) S.checksum = checksum for each x S.data = pad with zeros (x) send S receive answer if answer = true
• 16.
  Prototype of ParasiticComputing
• 17.
  Problem for Parasite Severalcomputational cycles are taken to process the solutions Possibility of false negative Possibility of false positive
• 18.
  Problem for Servers Delaydue to the parasitic message could cause a denial of service. Almost impossible to prevent. Removing or changing the exploited functions would cause the server unable to communicate.
• 19.
  Future… Computation to communicationratio must increase. Exploiting HTTP or encryption / decryption could execute in an efficient manner. The ethical dilemma could lead it to a vulnerable future..
• 20.
  CONCLUSION.. Parasitic Computing logicallymoves compution onto the communication infrastructure of internet,blurring the distance between compution and communication
• 21.
  References Barabasi et.al. ParasiticComputing, NATURE 412, 30 Aug 2001. Barabasi et.al. Supplement material for Parasitic Computing: http://www.nd.edu/~parasite/ Barger N. Robert & Crowell R. Charles, The ethics of Parasitic Computing, Sept 2003 : www.nd.edu/~ccrowell/Parasitic%20Computing.pdf Ivars Peterson, Sneaky Calculations, Science News 160, 17 Nov 2001. www.hindu.com/thehindu/2001/09/13/stories/08130001.htm
• 22.
  ANY QUESTIONS……????
• 23.
  THANK YOU….