|
|
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. 00e0 52d9 0c24 000a 957e a0b4 0800 4500 003e ccaf 0000 4011 8c27 8e96 039a 8e96 0112 c1a7 0035 002a 2f6c d964 0100 0001 0000 0000 0000 0377 7777 0873 6c61 7368 646f 7403 6f72 6700 0001 0001 |
|
Math & Computational Sciences University of Toronto at Mississauga | |