HW1 for CSE/EE 461 (Autumn 2004; Bershad)
Due: Friday, October 22, 2004, at the beginning of class.

1. Textbook problem 1.5

2. Textbook problem 1.7

3. Textbook problem 1.12

4. Textbook problem 1.14

5. Textbook problem 1.23

6. Textbook problem 2.12

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 one node to another (not including any reply message) 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)).

THE BELOW ARE OPTIONAL BUT HIGHLY RECOMMENDED:

Textbook problems 1.6, 1.8, and 2.3