HW1 for CSE/EE 461 (Winter 2005; Bershad)
Due: Friday, January 28,at the beginning of class.
Follow the homework grading criteria found on the course website.

1. Textbook problem 1.5

2. Textbook problem 1.8

3. Textbook problem 1.12

4. Textbook problem 1.14

5. Textbook problem 1.23

6. Textbook problem 2.3

7. Textbook problem 2.21

8. Fishnet problem

Let's consider the cost model for flooding to be directly proportional
to the total number of times nodes have to process a packet (either send
or receive). What is the order of the worst and best case cost of sending
a message from any node to any other node (not including reply messages)
within this model? What are the topologies that produces these two cases?
Assume there are N nodes in the Fishnet; the answers should be in terms of
O(f(N)).
	Trivial cases such as node A sends to node B, which is its only
neighbor, will not be accepted, because they cannot be generalized!

THE BELOW ARE OPTIONAL BUT HIGHLY RECOMMENDED:

9. For the TexTCP and Publish/Subscribe projects (Quake) we saw on
Wednesday, discuss:

    a. What problem was being solved?

    b. What technique was being used to solve the problem?

    c. How the work presented demonstrates the end-2-end argument

    d. How the work could be relevant to your current fishnet assignment.

Your answers should demonstrate that you were there and absorbed/considered
at least a portion of the material.