-------------------------------------------------------------------------------
Mohamed G. Gouda                                        	CS 356
Summer 2007							Homework 2
-------------------------------------------------------------------------------
1. (3 points)

Generalize the simplex connection protocol in Section 6.1 to allow process p
to simultaneously establish up to v connections to process q.

-------------------------------------------------------------------------------
2. (4 points)

Modify the simplex connection protocol in Section 6.2 as follows. When process
q receives a crqst(x) message while its conq variable is false, then q can
decide nondeterministically whether to accept or reject the connection.
However if q decides to accept the connection, then q stores x in a new
variable sp in process q. Later, if q receives a crqst(x') message where x' is
different from the current value of sp, then q rejects this new connection x' 
and keeps the old connection x. Specify process q in the modified protocol.

-------------------------------------------------------------------------------
3. (3 points) 

Assume that a process p has a very long stream of data bits to send to a
process q using the corruption detection protocol in Section 8.1. Process q
needs to choose between two choices. First p can partition the data bits stream
into blocks of m*n bits each, add n parity bits to each block, and send the 
block. Second, p can partition the data bits stream into blocks of (m*n)/2 bits
each, add n/2 parity bits to each block, and send the block. Which of these two
choices is better to process p. Explain your answer.

-------------------------------------------------------------------------------