The network of Fig. 5-37 uses RSVP with multicast trees for hosts 1 and 2 as shown. Suppose that host 3 requests a channel of bandwidth 2 MB/sec for a flow from host 1 and another channel of bandwidth 1 MB/sec for a flow from host 2. At the same time, host 4 requests a channel of bandwidth 2 MB/sec for a flow from host 1 and host 5 requests a channel of bandwidth 1 MB/sec for a flow from host 2. How much total bandwidth will be reserved for these requests at routers A, B, C, E, H, J, K, and L?
Answer to relevant QuestionsThe CPU in a router can process 2 million packets/sec. The load offered to it is 1.5 million packets/sec, if a route from source to destination contains 10 routers, how much time is spent being queued and serviced by the ...A router is blasting out IP packets whose total length (data plus header) is 1024 bytes. Assuming that packets live for 10 sec, what is the maximum line speed the router can operate at without danger of cycling through the ...The set of IP addresses from 22.214.171.124 to 126.96.36.199 has been aggregated to 188.8.131.52/17. However, there is a gap of 1024 unassigned addresses from 184.108.40.206 to 220.127.116.11 that are now suddenly assigned to a host using ...A person who lives in Boston travels to Minneapolis, taking her portable computer with her. To her surprise, the LAN at her destination in Minneapolis is a wireless IP LAN, so she does not have to plug in. Is it still ...Imagine that a two-way handshake rather than a three-way handshake were used to set up connections. In other words, the third message was not required. Are deadlocks now possible? Give an example or show that none exist.
Post your question