Suppose that KJ sends 3596 back-to-back packets, with each packet composed of 14,000 bits, to TA over 5 links (shown below). Suppose that the transmission rate of each link is 70,000 bits/sec (bps). Consider the routers to be store-and-forward routers. In such a scenario, find the endto- end delay of sending all the packets to TA (i.e., the time needed for the last bit of the last packet to arrive at TA since KJ starts transmitting the first bit of the first packet). Note, consider only the transmission delay that occurs in sending packets in your analysis. Show the steps used for derivation in detail. 70,000 bps |70,000 bps 70,000 bps 70,000 bps 70,000 bps KJ Router 1 Router 2 Router 3 Router 4 TA

Suppose that KJ sends 3596 back-to-back packets, with each packet composed of 14,000 bits, to TA over 5 links (shown below). Suppose that the transmission rate of each link is 70,000 bits/sec (bps). Consider the routers to be store-and-forward routers. In such a scenario, find the endto- end delay of sending all the packets to TA (i.e., the time needed for the last bit of the last packet to arrive at TA since KJ starts transmitting the first bit of the first packet). Note, consider only the transmission delay that occurs in sending packets in your analysis. Show the steps used for derivation in detail. 70,000 bps |70,000 bps 70,000 bps 70,000 bps 70,000 bps KJ Router 1 Router 2 Router 3 Router 4 TA

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 a stop-and-wait protocol where the channel does not corrupt any packets (no bit errors) but can lose packets. Draw the sender and receiver FSM diagrams. Note that apart from being lost, the packets (data and ACKs) can also be delayed. We will assume a NAK-free operation in this part.
You are employed as a network engineer and have been asked to analyze a communication network to determine the current data rates and ensure that the links aren't at risk of "reaching capacity." In the following figure of the network, the sender is transmitting data at a total rate of 100+50 = 150 megabits per second (Mbps). The data is transmitted from the sender to the receiver over a network of five different routers. These routers are labeled A, B, C, D, and E. The connections and data rates between the routers are labeled as x1, x2, X3, x4, and x5. B (()) Sender 100 50 A X₂ c (()), X3 X₂ X₁ E (()). X5 X5 X₂ X₂ •D ((cp)), 120 Receiver Directions In this project, you will analyze the communication network and solve for the unknown data rates using a variety of techniques. The system can be modeled mathematically as a system of linear equations by writing an equation for each node/router in the network. Each of these equations can be written by noting that the sum of inputs must…
Consider a packet of length L that begins at end system A and travels over three links to a destination end system. These three links are connected by two packet switches. Let d, s, and R denotes the length, propagation speed, and the transmission rate of link i, for i=1,2,3 . The packet switch delays each packet by d . Assuming no queuing delays, in terms of d, s , R, (i=1,2,3), and L, what is the total end-to-end delay for the packet? Suppose now the packet is 1,500 bytes, and the propagation speed on all three links are 3125km/sec, 10000 km/sec, and 3333km/sec respectively. The transmission rates of all three links are 2 Mbps, the packet switch processing delay is 3 msec, the length of the first link is 5,000 km, the length of the second link is 4,000 km, and the length of the last link is 1,000 km. For these values, what is the end-to-end delay? In the above problem, suppose R1=R2=R3=R and dproc=0. Further, suppose the packet switch does not store-and-forward packets but…
Consider the following network with given line speeds and lengths: Assume the speed of light is 2×10^8 m/s, and that the processing and queuing delays are negligible. Node A sends a 1400-byte frame to node C through node B. Suppose Node A starts sending the first bit of the frame at t=0. Answer the following questions: a. At what time (t=?) node B receives the frame in full (i.e. the last bit)? b. After node B receives the frame in full, then it will start sending the frame to node C. Determine the time (t=?) when node C receives the frame in full. c. Suppose at this time node C sends a small acknowledgment back to node A. The transmission time for the acknowledgment is negligible. Calculate at what times (t=?) the acknowledgment arrives at nodes B and A. d. Assume after sending its frame, node A wait for the acknowledgment back from node C before sending the next frame. What is the average throughput (number of transmitted bits per second) of the data flow from node A to…
How would you write a system of linear equations based on the given scenario and directions? Scenario You are employed as a network engineer and have been asked to analyze a communication network to determine the current data rates and ensure that the links aren’t at risk of “reaching capacity.” In the following figure of the network, the sender is transmitting data at a total rate of 100+50 = 150 megabits per second (Mbps). The data is transmitted from the sender to the receiver over a network of five different routers. These routers are labeled A, B, C, D, and E. The connections and data rates between the routers are labeled as x1,x2, x3, x4, and x5 . Directions For this assignment, you will analyze the communication network and solve for the unknown data rates using a variety of techniques. The system can be modeled mathematically as a system of linear equations by writing an equation for each node/router in the network. Each of these equations can be written by noting that the sum…
Computer A is sending a 10 MByte long file to Computer B via packet-switching over two consecutive 100 Mbps links of 2000 km length each.Assume that the signal propagation speed on both links is 2 x 108 m/s.Furthermore, assume that the maximum length of a packet is 1480 bytes and that Computer A fills each packet to the max, if possible. How long (in seconds) does it take Computer A to send out one packet of maximum length on the first link?
. Let A and B be two stations attempting to transmit on an Ethernet. Each has a steady queue of frames ready to send; A's frames will be numbered A1, A2, and so on, and B's similarly. Let T= 51.2 µs be the exponential backoff base unit. Suppose A and B simultaneously attempt to send frame 1, collide, and happen to choose backoff times of 0 x and 1 x T, respectively, meaning A wins the race and transmits A₁ while B waits. At the end of this transmission, B will attempt to retransmit B₁ while A will attempt to transmit A2. These first attempts will collide, but now A backs off for either 0 × T or 1 x T, while B backs off for time equal to one of 0 x T,..., 3 x T. (a) Give the probability that A wins this second backoff race immediately after this first collision; that is, A's first choice of backoff time k x 51.2 is less than B's. (b) Suppose A wins this second backoff race. A transmits A3, and when it is finished, A and B collide again as A tries to transmit A4 and B tries once more to…
show step by step
In TCP Vegas, the calculation of Actual Rate is done by dividing the amount of data transmitted in one RTT interval by the length of the RTT. (a) Show that for any TCP, if the window size remains constant, then the amount of data transmitted in one RTT interval is constant once a full window-full is sent. Assume that the sender transmits each segment instantly upon receiving an ACK, packets are not lost and are delivered in order, segments are all the same size, and the first link along the path is not the slowest. (b) Give a timeline sketch showing that the amount of data per RIT above can be less than Congestion Window.
You are employed as a network engineer and have been asked to analyze a communication network to determine the current data rates and ensure that the links aren’t at risk of “reaching capacity.” In the following figure of the network, the sender is transmitting data at a total rate of 100+50 = 150 megabits per second (Mbps). The data is transmitted from the sender to the receiver over a network of five different routers. These routers are labeled A, B, C, D, and E. The connections and data rates between the routers are labeled as , , , , and . Directions In this project, you will analyze the communication network and solve for the unknown data rates using a variety of techniques. The system can be modeled mathematically as a system of linear equations by writing an equation for each node/router in the network. Each of these equations can be written by noting that the sum of inputs must equal the sum of outputs. To complete the project, work on the problems described below. As you…
In a two-phase, total-order multicast system, messages are sent in the following sequence from node S to G1 and G2. G1 and G2 are the members of the group. S sends m1 to G1 S sends m1 to G2 S sends m2 to G2 S sends m2 to G1 Use the basic implementation of the Lamport clock. The clock s at each node start at: S: 4, G1: 6, G2: 1. Show the exchange of messages and their acknowledgments in a clock diagram using the basic implementation of Lamport's clock. In which order and at what times are m1 and m2 delivered?