WBW THEORY PAPER OUTLINE    Fri Apr 13 10:27:33 EDT 2001

The following is the current outline of the WBW Theory
assignment paper being cooperatively written by the
students of CS254.

1. Termination with arbitrary legal message order.
	- Tom

    1.1 Create/Update/Delete Link
	1.1.1 Quick Symmetric Algorithm
	1.1.2 Conservative Symmetric Algorithm
	1.1.3 Independent Symmetric Algorithm
 
2. Termination with crashes
	- Ben
   If there are timeouts whenever possible, what
   indefinite non-termination situations can
   crashes cause.

    2.1 Create/Update/Delete Link
	2.1.1 Quick Symmetric Algorithm
	2.1.2 Conservative Symmetric Algorithm
	2.1.3 Independent Symmetric Algorithm
 
3. Termination with Byzantine server or client
	- Ben
   If one server or the client is Byzantine, or
   both are Byzantine, what non-terminating states
   can they drive the good server into.  (A
   Byzantine process tries to drive good processes
   into undesirable states by sending perfectly
   perverse messages).

    3.1 Create/Update/Delete Link
	3.1.1 Quick Symmetric Algorithm
	3.1.2 Conservative Symmetric Algorithm
	3.1.3 Independent Symmetric Algorithm
 

4. Agreement

    If all servers operate correctly, none crash,
    and only message delays are considered, then
    is disagreement possible?  In other words,
    if we assume one server finds an operation to
    succeed, what can we prove about the other
    server, and can we prove the other server
    does not find the operation to fail?

    4.1 Create/Update/Delete Link
	4.1.1 Quick Symmetric Algorithm
		- Candace and James
	4.1.2 Conservative Symmetric Algorithm
		- Candace and James
	4.1.3 Independent Symmetric Algorithm
		- Richard
 
5. Race Conditions
	- Jeff
    If two operations are done simultaneously,
    both succeed, and both servers operate
    correctly, what unfortunate situations are
    possible.

    5.1 Create Link/Create Link
	5.1.1 Quick Symmetric Algorithm
	5.1.2 Conservative Symmetric Algorithm
	5.1.3 Independent Symmetric Algorithm
    5.2 Update Link/Create Link
	5.2.1 Quick Symmetric Algorithm
	5.2.2 Conservative Symmetric Algorithm
	5.2.3 Independent Symmetric Algorithm
    5.3 Update Link/Update Link
	5.3.1 Quick Symmetric Algorithm
	5.3.2 Conservative Symmetric Algorithm
	5.3.3 Independent Symmetric Algorithm
    5.4 Delete Link/Update Link
	5.4.1 Quick Symmetric Algorithm
	5.4.2 Conservative Symmetric Algorithm
	5.4.3 Independent Symmetric Algorithm
    5.5 Delete Link/Delete Link
	5.5.1 Quick Symmetric Algorithm
	5.5.2 Conservative Symmetric Algorithm
	5.5.3 Independent Symmetric Algorithm

6. Efficiency
	- nobody yet

    What is the efficiency of the algorithms?

    6.1 Create/Update/Delete Link
	6.1.1 Quick Symmetric Algorithm
	6.1.2 Conservative Symmetric Algorithm
	6.1.3 Independent Symmetric Algorithm