Consider the network depicted in the below figure. Suppose that router R1receives a packet Pktl from host PC1. The length of packet Pktl is L= 25 Mbit. Router R1takes 0.4 msec to determine the output link of packet Pktl. Packet Pktl is to be forwardedthrough the output link to router R2. Packet Pktl waits 136 ms at the output link fortransmission. The transmission link of the link between router R1 and router R2 is R = 5Mbps. The distance between router R1 and router R2 is 400 Km and the propagation speedover the link is 2*108 m/s.4PC1a.b.router R2.R1R2R3MKFind the queuing delay of packet Pktl at router R1.Find the propagation delay of packet Pktl over the link from router R1 to

Answered: Image /qna-images/answer/20bf690a-08a6-4454-9d4a-b58e97c8fbc6.jpg

Answered: Consider the network depicted in the…

Computer Networking: A Top-Down Approach (7th Edition)

7th Edition

ISBN:9780133594140

Author:James Kurose, Keith Ross

Publisher:James Kurose, Keith Ross

Chapter1: Computer Networks And The Internet

Section: Chapter Questions

Problem R1RQ: What is the difference between a host and an end system? List several different types of end...

See similar textbooks

Similar questions

Consider the network illustrated in the Figure below, B. Propagation Nodal Queuing Transmission processing (waiting for transmission) Assume the two hosts on the left of the figure start transmitting packets of 1200 bytes at the same time (at time=0) towards Router B. Suppose the link rates between the hosts and Router A are 3Mbps and the link rate between router A and router B is 4Mbps. One host link has a 2ms propagation delay and the other has a 3ms propagation delay. Router A has a nodal processing delay of 0.2ms. A. Calculate the time router A receives the last bit of the first packet: ms B. Calculate the time router A receives the last bit of the second packet: ms C. Calculate the time the last bit of the first packet leaves router A: ms D. Calculate the queueing delay (if any) of the second packet: ms E. Calculate the time the last bit of the second packet leaves router A: ms Please calculate the delays in ms (millisecond), and fill in the blank spaces with numbers only. For…
Consider the network depicted in the below figure. Suppose that router R1 receives a packet Pktl from host PC1. The length of packet Pktl is L = 25 Mbit. Router R1 takes 0.4 msec to determine the output link of packet Pktl. Packet Pktl is to be forwarded. through the output link to router R2. Packet Pktl waits 136 ms at the output link for transmission. The transmission link of the link between router R1 and router R2 is R = 5 Mbps. The distance between router R1 and router R2 is 400 Km and the propagation speed over the link is 2*108 m/s. PC1 a. b router R2. R1 R2 R3 Find the queuing delay of packet Pktl at router R1. Find the propagation delay of packet Pktl over the link from router R1 to
1. Consider a path from host A to host B through a router X as follows: A- -X-B The capacity of the link AX is denoted Ra, while the capacity of the link XB is denoted Rb in units of [bits/s]. Assume that Ra Ri. Is it possible that the second packet queues at input queue of the second link? Explain. Now suppose that host A sends the second packet T seconds after sending the first packet. How large must T be to ensure no queueing before the second link? Explain.
Consider the network shown below, and Dijkstra's link-state algorithm. Suppose that Dijkstra's algorithm has been run to compute the least cost paths from node E to all other nodes. Now suppose that source node E has a packet to send to destination node A. What is the first router to which E will forward this packet on its path to A? O C O O O LL B A 3 2 B 8 D 10 E 4 2 F
Suppose A is connected to B via an intermediate router R, as in the previous problem. The A-R link is instantaneous, but the R–B link transmits only one packet each second, one at a time (so two packets take 2 seconds). Assume A sends to B using the sliding window protocol with SWS = 4. For Time = 0, 1, 2, 3, 4, state what packets arrive at and are sent from A and B. How large does the queue at R grow?
Given what we know about transmission delay and the following: A web client and a web server separated by one intermediary router. • Each link carries data at 1Mbps with an MTU of 8192 bytes • Each link is 1000 km long with a propagation speed of 250000 km/s • Zero processing and queueing delays • Connection management packets (packets used for opening a connection, confirming a connection and acknowledging receipt of information) contain no data and all packets have 125 bytes of overhead on top of any data they may contain. • The web client makes an HTTP request to the server that is 250 bytes long. • The requested data is 4 kilobytes in size with 500 bytes of overhead for the HTTP status and headers What is the RTT to open the connection? а. b. How long would it take for a web client to complete the request? You can ignore any time needed to close the connection.
An Internet user would like to transfer a message from his computer (host A) to another computer (host B). The size of the message passed to the IP layer is 3800 bytes. The datagram(s) carrying the message will have to cross two routers (R1 and R2) and 3 networks (NET1, NET2, and NET3) as described in the above figure. Each of these networks has a specific MTU (for example the MTU of network 1 is 1500 bytes. MTU here stands for Maximum Transmission Unit, the largest data that a frame can carry). Fill the table with the IP datagram(s) needed right after passing through NET3 (no need to show your fragmentation for N1 or N2). Assume a 2-byte options in the header. Show all your details (for partial points in case your numbers are incorrect). NET1 MTU=1500 R1 NET2 MTU=640 R2 NET3 MTU 1500 V BIU Fragment # Format Offset Flag (3 bits) Data Length Total Length ...
I need help
Suppose A is connected to B via an intermediate router R, as in the previous problem. The A-R link is instantaneous, but the R–B link transmits only one packet each second, one at a time (so two packets take 2 seconds). Assume A sends to B using the sliding window protocol with SWS = 4. For Time = 0, 1, 2, 3, 4, state what packets arrive at and are sent from A and B. How large does the queue at R grow?
2. Consider a slotted TDM hierarchical network in which there are 8 computers sharing a 10 Mbps channel to a router R1, sending packets to R1 which must all be forwarded by R1 over an outgoing link (called the MAN link), as shown in Figure 1. Computers A-H always have packets waiting to be sent, so no timeslot on the shared LAN is idle. Ignore the propagation delay on the LAN. The MAN link outgoing from R1 is a 100 Mbps link. The network layer protocol in use has a PDU with exactly 40 bytes of header and exactly 200 bytes of payload (SDU). The DLC layer protocol in use on the LAN has a PDU with exactly 40 bytes of header and 20 bytes of trailer. The DLC layer protocol in use on the outgoing link from R1 has a PDU with 40 bytes of header and no trailer. The physical layer does not impose any bit overhead in either channel. Use 1 Mbps = 1000000 bps. B D E F G H R1 R2 Figure 1 (a) What is the transmission delay of a bit for Computer A? (b) What is the transmission delay of a DLC PDU for…
In this problem you will be doing some elementary calculations oftransmission and propagation delays.Consider two hosts, A and B that are connected by a transmissions link of2.1 Mbps. Assume that packets are of length 2.0 Kb (Kilobits) and thelength of the link is 100Km. a). Now suppose that node C is connected to node B also by a 2 Mbps, 100Km link. How long does it take from when the first bit is transmitted by Ato when the last bit is received at C, assuming B operates in a store-andforward manner?

Recommended textbooks for you

Computer Networking: A Top-Down Approach (7th Edi…

Computer Engineering

ISBN:

9780133594140

Author:

James Kurose, Keith Ross

Publisher:

PEARSON

Computer Organization and Design MIPS Edition, Fi…

Computer Engineering

ISBN:

9780124077263

Author:

David A. Patterson, John L. Hennessy

Publisher:

Elsevier Science

Network+ Guide to Networks (MindTap Course List)

Computer Engineering

ISBN:

9781337569330

Author:

Jill West, Tamara Dean, Jean Andrews

Publisher:

Cengage Learning

Computer Networking: A Top-Down Approach (7th Edi…

Computer Engineering

ISBN:

9780133594140

Author:

James Kurose, Keith Ross

Publisher:

PEARSON

Computer Organization and Design MIPS Edition, Fi…

Computer Engineering

ISBN:

9780124077263

Author:

David A. Patterson, John L. Hennessy

Publisher:

Elsevier Science

Network+ Guide to Networks (MindTap Course List)

Computer Engineering

ISBN:

9781337569330

Author:

Jill West, Tamara Dean, Jean Andrews

Publisher:

Cengage Learning

Concepts of Database Management

Computer Engineering

ISBN:

9781337093422

Author:

Joy L. Starks, Philip J. Pratt, Mary Z. Last

Publisher:

Cengage Learning

Prelude to Programming

Computer Engineering

ISBN:

9780133750423

Author:

VENIT, Stewart

Publisher:

Pearson Education

Sc Business Data Communications and Networking, T…

Computer Engineering

ISBN:

9781119368830

Author:

FITZGERALD

Publisher:

WILEY

SEE MORE TEXTBOOKS