-------------------------------------------------------------------------------
M. G. Gouda                                                   CS 356
Summer 2006                                                   Homework 2
-------------------------------------------------------------------------------

1. (4 points)
   Redesign the connection protocol that uses timeout in Section 6.1 as follows.
   Replace the drply messages, sent by process q, by two types of messages: 
   fin messages and rst messages. Process q sends a fin message to indicate a 
   timely termination of the current connection from p to q. Process q sends a
   rst message to indicate an abrupt termination of the current connection from
   p to q. Note that once process q starts to send a fin or rst message in a 
   connection, q continues to send the same message in the connection until the 
   connection is terminated. 

-------------------------------------------------------------------------------
   
2. (3 points)
   
   A network consists of a process array p[i:0..n-1] and process q. Each 
   process p[i] can establish a connection, using the identifier protocol in 
   Section 6.2, to process q such that the following condition holds. At each 
   instance, process q is involved in at most one connection. Design processes 
   p[i:0..n-1] and process q.
-------------------------------------------------------------------------------

3. (3 points)
     
   A corruption burst in a sent block is called “odd” if and only if the number
   of corrupted bits in the corruption burst is odd. What is the length of the
   longest odd burst that can be detected by the corruption detection protocol that
   uses parity bits in Section 8.1? Assume that each sent block consists of m*n
   data bits followed by n parity bits. 
-------------------------------------------------------------------------------