For hierarchical routing with 4800 routers, what region and cluster sizes should be chosen to minimize the size of the routing table for a three-layer hierarchy? A good starting place is the hypothesis that a solution with k clusters of k regions of k routers is close to optimal, which means that k is about the cube root of 4800 (around 16). Use trial and error to check out combinations where all three parameters are in the general vicinity of 16.
Answer to relevant QuestionsIn the text it was stated that when a mobile host is not at home, packets sent to its home LAN are intercepted by its home agent on that LAN. For an IP network on an 802.3 LAN, how does the home agent accomplish this ...Suppose that node B in Fig. 5-20 has just rebooted and has no routing information in its tables. It suddenly needs a route to H. It sends out broadcasts with TTL set to 1, 2, 3, and so on. How many rounds does it take to ...The byte-counting variant of the leaky bucket algorithm is used in a particular system. The rule is that one 1024-byte packet, or two 512-byte packets, etc., may be sent on each tick. Give a serious restriction of this ...Tunneling through a concatenated virtual-circuit subnet is straightforward: the multi protocol router at one end just sets up a virtual circuit to the other end and passes packets through it. Can tunneling also be used in ...The set of IP addresses from 220.127.116.11 to 18.104.22.168 has been aggregated to 22.214.171.124/17. However, there is a gap of 1024 unassigned addresses from 126.96.36.199 to 188.8.131.52 that are now suddenly assigned to a host using ...
Post your question