Computer Networking A Top-Down Approach 5th edition James F. Kurose, Keith W. Ross - Solutions

Consider a datagram network using 32-bit host addresses. Suppose a router has four links, numbered 0 through 3, and packets are to be forwarded to the link intelfaces as follows: Destination Address Range Link Interfacea) Provide a forwarding table that has four entries, uses longest prefix
Why is an ARP query sent within a broadcast frame? Why is an ARP response sent within a frame with a specific destination MAC address?
Suppose that N switches supporting K VLAN groups are to be connected via a trunking protocol. How many ports are needed to connect the switches? Justify your answer.
If all the links in the Internet were to provide reliable delivery service, would the TCP reliable delivery service be redundant? Why or why not?
What are some of the possible services that a link-layer protocol can offer to the network layer? Which of these link-layer services have corresponding services in IP? In TCp?
Describe polling and token-passing protocols using the analogy of cocktail party interactions.
Why would the token-ring protocol be inefficient if a LAN had a very large perimeter?
Suppose nodes A, B, and C each attach to the same broadcast LAN (through their adapters).If A sends thousands of IP datagrams to B with each encapsulating frame addressed to the MAC address of B, will C's adapter process these frames? If so, will C's adapter pass the IP datagrams in these frames to
Suppose the information content of a packet is the bit pattern 1110 10 II 100 I 1101 and an even parity scheme is being used, What would the value of the field containing the parity bits be for the case of a two-dimensional parity scheme?
Consider two nodes, A and B, that use the slotted ALOHA protocol to contend for a channel. Suppose node A has more data to transmit than node B. and node A's retransmission probability PAis greater than node B's retransmission probability, PB a. Provide a formula for node A's average throughput.
Suppose four active nodes-nodes A, B, C and D-are competing for access to a channel using slotted ALOHA. Assume each node has an infinite number of packets to send. Each node attempts to transmit in each slot with probability p. The first slot is numbered slot 1, the second slot is numbered slot 2,
Graph the efficiency of slotted ALOHA and pure ALOHA as a function p for the following values of N: a. N=15. b. N=20. c. N=30.
Consider a broadcast channel with N nodes and a transmission rate of R bps. Suppose the broadcast channel uses polling (with an additional polling node) for multiple access. Suppose the amount of time from when a node completes transmission until the subsequent node is permitted to transmit (that
Consider three LANs interconnected by two routers, as shown in Figure 5JX.a. Assign IP addresses to all of the interfaces. For Subnet I use addresses of the form 192.168. I .xxx; for Subnet 2 uses addresses of the form 192.168.2.xxx; and for Subnet 3 use addresses of the form 192.168J.xx.b. Assign
Consider Figure 5.38. Now we replace the router between subnets I and 2 with a switch S l, and label the router between subnets 2 and 3 as R l. a. Consider sending an IP datagram from Host E to Host F. Will Host E ask router R l to help forward the datagram? Why? In the Ethernet frame containing
Consider the previous problem, but suppose now that the router between subnets 2 and 3 is replaced by a switch. Answer questions (a)-(c) in the previous problem in this new context.
Recall that with the CSMA/CD protocol, the adapter waits K· 512 bit times after a collision, where K is drawn randomly. For K = 100, how long does the adapter wait until returning to Step 2 for a 10 Mbps Ethernet? For a 100 Mbps Ethemet')
Suppose nodes A and B are on the same 10 Mbps Ethernet bus, and the propagation delay between the two nodes is 325 bit times. Suppose node A begins transmitting a frame and, before it finishes, node B begins transmitting a frame. Can A finish transmitting before it detects that B has transmitted?
Explain why a minimum frame size is required for Ethernet. For example, I OBase Ethernet imposes a minimum frame size constraint of 64 bytes. (If you have done the previous problem, you might have realized the reason). Now suppose that the distance between two ends of an Ethernet LAN is d. Can you
Show (give an example other than the one in Figure 5,6) that two-dimensional parity checks can correct and detect a single bit error. Show (give an example) of a double-bit error that can be detected but not corrected.
Suppose that you would like to increase the link speed of your Ethernet cable, how would this upgrade affect the minimum required packet sizes? If you upgrade your cable to a higher speed and realize that you cannot change packet size, what else can you do in maintain correct operation?
Suppose nodes A and B are on the same 10 Mbps Ethernet bus, and the propagation delay between the two nodes is 245 bit times. Suppose A and B send frames at the same time, the frames collide, and then A and B choose different values of K in the CSMA/CD algorithm. Assuming no other nodes are active,
Consider a 100 Mbps 100BASE-T Ethernet with all nodes directly connected to a hub. To have an efficiency of 0.50, what should be the maximum distance between a node and the hub? Assume a frame length of 1000 bytes and that there are no repeaters. Does this maximum distance also ensure that a
Suppose four nodes, A, B, C, and D, are all connected to a hub via 10Mbps Ethernet cables. The distances between the hub and the 'e four nodes are 300m, 400111, 500m, and 700m, respectively. Recall that the CSMNCD protocol is used for this Ethernet. Assume that the signal propagation speed is 2 .
[n this problem you will derive the efficiency of a CSMNCD-like multiple access protocol. [n this protocol, time is slotted and all adapters are synchronized to the slots. Unlike slotted ALOHA, however, the length of a slot (in seconds) is much less than a frame time (the time to transmit a frame).
Suppose two nodes, A and B, are attached to opposite ends of an 800 m cable, and that they each have one frame of I,SOO bits (including all headers and preambles) to send to each other. Both nodes attempt to transmit at time t =O. Suppose there are four repeaters between A and B, each inserting a
In the Ethernet standard, a sender pauses 96 bit times between sending consecutive frames. This pausing time is referred to as inter-frame gap, and it is used to allow a receiving device to complete the processing of a received frame and to prepare for the reception of the next frame. Since the
Consider Figure S.38 in problem P14. Provide MAC addresses and IP addresses for the interfaces at Host A, both routers, and Host F. Suppose Host A sends a datagram to Host F. Give the source and destination MAC addresses in the frame encapsulating this lP datagram as the frame is transmitted (i)
Suppose now that the leftmost router in Figure S.38 is replaced by a switch. Hosts A, B, C, and D and the right router are all star-connected into this switch. Give the source and destination MAC addresses in the frame encapsulating this IP datagram as the frame is transmitted (i) from A to the
Suppose the information portion of a packet (D in Figure SA) contains 10 bytes consisting of the 8-bit unsigned binary ASCII representation of string "Link Layer." Compute the Internet checksum for this data,
Suppose the three departmental switches in Figure 5.26 All links are 100 Mbps. Now answer the questions posed in problem P29.
Suppose that all the Switches In FIgure S .16 are replaced by hubs. All links are 100 Mbps. Now answer the questions posed in problem P29.
Let's consider the operation of a learning switch in the context of Figure 5.24. Suppose that (i) B sends a frame to E, (ii) E replies with a frame to B, (iii) A sends a frame to B, (iv) B replies with a frame to A. The switch table is initially empty. Show the state of the switch table before and
In this problem, we ex.plore the use of small packets for Voice-over IP applications. One of the drawbacks of a small packet size is that a large fraction of link bandwidth is consumed by overhead bytes. To this end, suppose that the packet consists of P bytes and 5 bytes of header. a. Consider
Consider the single switch VLAN in Figure 5.30, and assume an external router is connected to switch port 1. Assign IP addresses to the EE and CS hosts and router interface. Trace the steps taken at both the network layer and the link layer to transfer an IP datagram from an EE host to a CS host
Consider the MPLS network shown in Figure 5.36, and suppose that routers R5 and R6 are now MPLS enabled. Suppose that we want to perform traffic engineering so that packets from R6 destined for A are switched to A via R6-R4-R3-RI, and packets from R5 destined for A are switched via R5-R4-R2-R1.
Consider again the same scenario as in the previous problem, but suppose that packets from R6 destined for 0 are switched via R6-R4-R3, while packects from R5 destined to D are switched via R4-R2-Rl-R3. Show the MPLS tables in all routers that would make this possible.
In this problem, you will put together much of what you have learned about Internet protocols. Suppose you walk into a room, connect to Ethernet, and want to download a web page. What are all the protocol steps that take place. starting from powering on your PC to getting the web page? Assume there
Consider the previous problem, but instead of containing the binary of the numbers 0 through 9 suppose these 10 bytes contain a, the binary representation of the numbers I through 10, b, the ASCII representation of the letters A through J (uppercase), c, the ASCII representation of the letters a
Consider the previous problem, but suppose that D has the value a. 1001000101. b. 1010001111 . c. 0101010101.
In this problem, we explore some of the properties of the CRC. For the generator G (=1001) given in Section 5.2.3, answer the following questions. a. Why can it detect any single bit error in data D? b. Can the above G detect any odd number of bit errors? Why?
In Section 5.3, we provided an outline of the derivation of the efficiency of slotted ALOHA, in this problem we'll complete the derivation, a, Recall that when there are N active nodes, the efficiency of slotted ALOHA is Np( 1- p)N-I. Find the value of p that maximizes this expression. Using the
Show that the maximum efficiency of pure ALOHA is 1/(2e). Note: This problem is easy if you have completed the problem above!
What does it mean for a wireless network to be operating in "infrastructure mode"? If the network is not ill infrastructure mode, what mode of operation is it in, and what is the different between that mode of operation and infrastructure mode?
Suppose the IEEE 802.11 RTS and CTS frames were as long as the standard DATA and ACK frames. Would there be any advantage to using the CTS and RTS frames? Why or why not')
Section 6.3.4 discusses 802.11 mobility, in which a wireless station moves from one BSS to another within the same subnet. When the APs are interconnected with a switch, an AP may need to send a frame with a spoofed MAC address to get the switch to forward the frame properly. Why?
What is meant by "opportunistic scheduling" in WiMAX?
If a node has a wireless connection to the Internet, does that node have to be mobile? Explain. Suppose that a user with a laptop walks around her house with her laptop, and always accesses the Internet through the same access point. Is this user mobile from a network standpoint? Explain.
What is the difference between a permanent address and a care-of address'? Who assigns a care-of address?
What are the purposes of the HLR and VLR in GSM networks? What elements of mobile IP are similar to the HLR and VLR?
What are the four type of wireless networks identified in our taxonomy in Section 6.1 Which of these types of wireless networks have you used?
What are three approaches that can be taken to avoid having a single wireless link degrade the performance of an end-end transport-layer TCP connection?
What are the differences between the following types of wireless channel impairments: path loss, multi path propagation, interference from other sources?
Describe how the RTS threshold works.
Consider the following idealized WiMAX scenario. The downstream sub-frame (see Figure 6.17) is slotted in time, with N downstream slots per sub-frame, with all time slots of equal length in time. There are four nodes, A, B, e. and D, reachable from the base station at rates of 10 Mbps, 5 Mbps, 2.5
In Section 6.5, one proposed solution that allowed mobile users to maintain their IP addresses as they moved among foreign networks was to have a foreign network advertise a highly specific route to the mobile user and use the existing routing infrastructure to propagate this information throughout
Suppose the correspondent in Figure 6.22 were mobile. Sketch the additional network-layer infrastructure that would be needed to route the datagram from the original mobile user to the (now mobile) correspondent. Show the structure of the datagram(s) between the original mobile user and the (now
In mobile IP, what effect will mobility have on end-to-end delays of data-grams between the source and destination?
Consider the chaining example discussed at the end of Section 6.7.2. Suppose a mobile user visits foreign networks A, B, and C, and that a correspondent begins a connection to the mobile user when it is resident in foreign network A. List the sequence of messages between foreign agents, and between
Consider two mobile nodes in a foreign network having a foreign agent. Is it possible for the two mobile nodes to use the same care-of address in mobile IP? Explain your answer.
In our discussion of how the VLR updated the HLR with information about the mobile s current location, what are the advantages and disadvantages of providing the MSRN as opposed to the address of the VLR to the HLR?
Suppose that the receiver in Figure 6.6 wanted to receive the data being sent by sender 2. Show (by calculation) that the receiver is indeed able to recover sender 2's data from the aggregate channel signal by using sender 2's code.
Suppose there are two ISPs providing WiFi access in a particular cafe, with each ISP operating its own AP and having its own IP address block. a. Further suppose that by accident, each ISP has configured its AP to operate over channel II. Will the 802. 11 protocol completely break down in this
In step 4 of the CSMA/CA protocol, a station that successfully transmits a frame begins the CSMAJCA protocol for a second frame at step 2, rather than at step 1. What rationale might the designers of CSMA/CA have had in mind by having such a station not transmit the second frame immediately (if the
Suppose an 802.11 b station is configured to always reserve the channel with the RTS/CTS sequence. Suppose this station suddenly wants to transmit 1,000 bytes of data, and all other stations are idle at this time. As a function of SIPS and DIFS, and ignoring propagation delay and assuming no bit
Consider the scenario shown in Figure 6.33, in which there are four wireless nodes, A, B, C, and D. The radio coverage of the four nodes is shown via the shaded ovals; all nodes share the same frequency. When A transmits, it can only be heard/received by B; when B transmits, both A and C can
Three RTCP packet types are described in Section 7.4. Briefly summarize the information contained in each of these packet types.
What is the role of a SIP registrar? How is the role of an SIP registrar different from that of a home agent in Mobile IP?
In Section 7.5, we discllssed nonpreemptive priority queuing. What would be preemptive pliority queuing? Does preemptive priority queuing make sense for computer networks?
Three camps were discussed for improving the Internet so that it better supports multimedia applications. Briefly summarize the views of each camp. In which camp do you belong?
What are some typical compression ratios (ratio of the number of bits in an uncompressed object to the number of bits in the compressed version of that object) for image and audio applications, and the compression techniques discussed in Section 7.1?
Figures 7.1 and 7.2 present two schemes for streaming stored media. What are the advantages and disadvantages of each scheme?
What is the difference between end-to-end delay and packet jitter? What are the causes of packet jitter?
Section 7.3 describes two FEC schemes. Briefly summarize them. Both schemes increase the transmission rate of the stream by adding overhead. Does interleaving also increase the transmission rate?
What is the role of the DNS in a CON? Does the DNS have to be modified to support a CON? What information, if any, must a CON provide to the DNS?
What information is needed to dimension a network so that a given quality of service is achieved?
Consider the figure below (which is similar to Figure 7.5). A sender begins sending packetized audio periodically at f =I. The first packet arrives at the receiver at f =8.a. What are the delays (from sender to receiver, ignoring any playout delays) of packets 2 through 8? Note that each vertical
Consider again the figure in PI 0, showing packet audio transmission and reception times. a. Compute the estimated delay for packets 2 through 8, using the formula for d. from Section 7.3.2. Use a value of u = 0.1I b. Compute the estimated deviation of the delay from the estimated average for
Recall the two FEC schemes for Internet phone described in Section 7.3. Suppose the first scheme generates a redundant chunk for every four original chunks. Suppose the second scheme uses a low-bit rate encoding whose transmission rate is 25 percent of the transmission rate of the nominal
Given that a CON does not increase the amount of link capacity in a network (assuming the CON uses existing links to distribute its content among CON nodes), how does a CON improve the pert'ormance seen by hosts? Give an example.
Is it possible for a CON to provide worse performance to a host requesting a multimedia object than if the host has requested the object from the distant origin server'? Explain.
How is the interarrival time jitter calculated in the RTCP reception report? (Hint: Read the RTP RFC.)
a. Suppose we send into the Internet two IP datagrams, each carrying a different UOP segment. The first datagram has source IP address AI, destination IP address B, source port PI , and destination port T. The second datagram has source lP address A2, destination IP address B, source port P2, and
Consider an RTP session consisting of four users, all of which are sending and receiving RTP packets into the same multicast address. Each user sends v ideo at 100 kbps. a. RTCP will limit its traffic to what rate? b. A particular receiver will be allocated how much RTCP bandwidth? c. A particular
a. How is RTSP similar to HTTP? Does RTSP have methods? Can HTTP be used to request a stream? b. How is RTSP different from HTTP? For example, is HTTP in-band or out-of-band? Does RTSP maiutain state information about the client (consider the pause/resume function)?
True or false: a. If stored video is streamed directly from a Web server to a media player, then the application is using TCP as the underlying transport protoco\' b. When using RTP, it is possible for a sender to change encoding in the middle of a session. c. All applications that use RTP must
Consider the client buffer shown in Figure 7.3. Suppose that the streaming system uses the third option; that is, the server pllshes the media into the socket as quickly as possible. Suppose the available TCP bandwidth » d most of the time. Also suppose that the client buffer can hold only about
Suppose that the WFQ scheduling policy is applied to a buffer that supports three classes, and suppose the weights are 0.5, 0.25, and 0.25 for the three classes. a. Suppose that each class has a large number of packets in the buffer. In what sequence might the three classes be served in order to
Consider the figure on the next page, which is similar to Figures 7.22-7.25. Answer the following questions:a. Assuming FIFO service, indicate the time at which packets 2 through 12 each leave the queue. For each packet, what is the delay between its arrival and the beginning of the slot in which
Consider again the figure for P21.a. Assume a priority service, with packets 1,4, 5, 6, and 11 being highpriority packets. The remaining packets are low priority. Indicate the slots in which packets 2 through 12 each leave the queue.b. Now suppose that round robin service is used, with packets 1,4,
Consider the figure below, which shows a leaky bucket policer being fed by a stream of packets. The token buffer can hold at most two tokens, and is initially full at t =O. New tokens (uTive at a rate of one token per slot. The output link speed is such that if two packets obtain tokens at the
Repeat P23 but assume that r =2. Assume again that the bucket is initially full.
Consider the leaky-bucket policer (discussed in Section 7.5) that polices the average rate and burst size of a packet flow. We now want to police the peak rate, p , as well. Show how the output of this leaky-bucket policer can be fed into a second leaky bucket policer so that the two leaky buckets
Show that as long as r l < R w/(∑wj), then d max is indeed the maximum delay that any packet in flow I will ever experience in the WFQ queue.
Are the TCP receive buffer and the media player's client buffer the same thing? If not, how do they interact?
In the Internet phone example in Section 7.3, let h be the total number of header bytes added to each chunk, including UDP and IP header. a. Assuming an IP datagram is emitted every 20 msecs, find the transmission rate in bits per second for the datagrams generated by one side of this
Consider the procedure described in Section 7.3 for estimating average delay di · Suppose that u = 0.1. Let r[ - II be the most recent sample delay, let r2 - f2 be the next most recent sample delay, and so on. a. For a given audio application suppose four packets have arrived at the receiver with
Repeat Parts a and b in Question 6 for the estimate of average delay deviation.
For the Internet phone example in Section 7.3, we introduced an online procedure (exponential moving average) for estimating delay. In this problem we will examine an alternative procedure. Let '; be the timestamp of the ith packet received; let r; be the time at which the ith packet is received.
Compare the procedure described in Section 7.3 for estimating average delay with the procedure in Section 3.5 for estimating round-trip time. What do the procedures have in common? How are they different?

Showing 600 - 700 of 744

Computer Networking A Top-Down Approach 5th edition James F. Kurose, Keith W. Ross - Solutions

Step by Step Answers