Distributed Hash Table This addendum discusses the experimental results that are expected from your programming assignment 2. We will test your code with multiple input files, in sequence. Each of the input files will look similar to the file1.txtshown below. file1.txt ADD_NODE 1 SLEEP 10 ADD_NODE 32 10 11 ADD_FILE f1 192.168.10.1 SLEEP 20 ADD_FILE f2 192.168.10.2 ADD_FILE f3 192.168.10.3 QUIT Each input file will include all the commands from the previous input file along with few additional commands. For instance, the input file, file2.txt, shown below contains all of the commands from file1.txtwith few additional commands. Similarly, file3.txt contains some additional commands including those from file2.txt, and so on. Note that there is only one QUIT command per file.file2.txt file3.txt ADD_NODE 1 ADD_NODE 1 SLEEP 10 SLEEP 10 ADD_NODE 32 10 11 ADD_NODE 32 10 11 ADD_FILE f1 192.168.10.1 ADD_FILE f1 192.168.10.1 SLEEP 20 SLEEP 20 ADD_FILE f2 192.168.10.2 ADD_FILE f2 192.168.10.2 ADD_FILE f3 192.168.10.3 ADD_FILE f3 192.168.10.3 SLEEP 5 SLEEP 5 FIND_FILE f1 FIND_FILE f1 FIND_FILE f2
This is the end of the preview.
access the rest of the document.