|
CSE 461: Computer Communication and Networks (Autumn 2005) |
|
 CSE Home |
About Us |
Search |
Contact Info |
|
|
Homework 1
Textbook problems: 1.5, 1.7, 1.13, 1.14, 1.15, 1.28, 2.2, 2.11, 2.23, 2.24 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! Bonus packet problem: The following hexadecimal sequence is a packet that I captured off of a department ethernet. To the extent that you can, decode the packet. For each applicable layer of the network stack, such as link / network / transport / application, you might want to identify headers, fields within headers, and packet payload. You might need to refer to various protocol specifications in order to complete this problem; google should help you with this. 00b0 d0f0 17e8 000a 956f 1c32 0800 4500 0039 11e1 0000 4011 62c2 80d0 0270 80d0 0201 c0a4 0035 0025 039c 04c5 0100 0001 0000 0000 0000 0357 4542 036e 7975 0365 6475 0000 0100 01 |
||||||||||||||||||||||||||||||||||||||
 |
Computer Science & Engineering University of Washington Box 352350 Seattle, WA 98195-2350 (206) 543-1695 voice, (206) 543-2969 FAX [comments to gribble] |
