2. Packet transmission. a. Consider a packet of length L that begins at end system A and travels over 2 links to a destination end system B. These two links are connected by one packet switch. Let d₁, S₁, and R₁ denote the length, propagation speed and transmission rate of link I, for i in {1, 2}. The packet switch delays each packet by dproc b. There is a queuing delay of 100 msec at the switch (but no queuing delay at A). The packet is 1500 bits in length, the propagation speed on all links is 2.5 x 108 m/sec, the transmission rate on both links is 1 Mbps, and the packet switch processing delay is 3 msec. The length of the first link is 4000 km and the second link is 1000 km. What is the end-to-end delay from A to B? c. The switch fails and is replaced. This changes the following information for the switch only. The packet switch processing delay is reduced from 3 msec to 2 msec, the queuing delay is reduced from 100 msec to 40 msec but the second transmission link increases to 8,500 km from 1000 km. What is the new end-to-end delay from A to B?

2. Packet transmission. a. Consider a packet of length L that begins at end system A and travels over 2 links to a destination end system B. These two links are connected by one packet switch. Let d₁, S₁, and R₁ denote the length, propagation speed and transmission rate of link I, for i in {1, 2}. The packet switch delays each packet by dproc b. There is a queuing delay of 100 msec at the switch (but no queuing delay at A). The packet is 1500 bits in length, the propagation speed on all links is 2.5 x 108 m/sec, the transmission rate on both links is 1 Mbps, and the packet switch processing delay is 3 msec. The length of the first link is 4000 km and the second link is 1000 km. What is the end-to-end delay from A to B? c. The switch fails and is replaced. This changes the following information for the switch only. The packet switch processing delay is reduced from 3 msec to 2 msec, the queuing delay is reduced from 100 msec to 40 msec but the second transmission link increases to 8,500 km from 1000 km. What is the new end-to-end delay from A to B?

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 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 denote 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, , and L, what is the total end-to-end delay for the packet? Suppose now the packet is 1,500 bytes, the propagation speed on all three links is 2.5⋅108m/s 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 this problem, we consider sending real-time voice from Host A to Host B over a packet switched network (VoIP). Host A converts analog voice to a digital 64 kbps bit stream on the fly. Host A then groups the bits into 56-byte packets. There is one link between Hosts A and B; its transmission rate is 2 Mbps and its propagation delay is 10 msec. As soon as Host A gathers a packet, it sends it to Host B. As soon as Host B receives an entire packet, it converts the packet's bits to an analog signal. How much time elapses from the time a bit is created (from the original analog signal at Host A) until the bit is decoded (as part of the analog signal at Host B)?
QUESTION 4 Consider a router buffer preceding an outbound link that has a transmission capacity of 1000 packets/second. Assume that the router is operating in a steady-state with no packet losses. Suppose packets arrive at the router an average rate of 600 packets/second to use the outbound link. Calculate the following values. The traffic intensity is A packet uses the outbound link for seconds. The average delay (queuing and transmission) experienced by a packet is seconds. The average number of packets in the router waiting to use or using the outbound link is
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 ТА
as a possible congestion control mechanism in a subnet using virtual circuits internally, a router could refrain from acknowledging a received packet until (1) it knows its last transmission along the virtual circuit was received successfully and (2) it has a free buffer. for simplicity, assume that the routers use a stop-and-wait protocol and that each virtual circuit has one buffer dedicated to it for each direction of traffic. if it takes 7 sec to transmit a packet (data or acknowledgement) and there are n routers on the path, what is the rate at which packets are delivered to the destination host? assume that transmission errors are rare and that the host-router connection is infinitely fast.
TCP a. Consider two TCP connections, one between Hosts A (sender) and B (receiver), and another between Hosts C (sender) and D (receiver). The RTT between A and B is half that of the RTT between C and D. Suppose that the senders' (A's and C's) congestion window sizes are identical. Is their throughput (number of segments transmitted per second) the same? Explain. b. Now suppose that the average RTT between A and B, and C and D are identical. The RTT between A and B is constant (never varies), but the RTT between C and D varies considerably. Will the TCP timer values of the two connections differ, and if so, how are they different, and why are they different? Give one reason why TCP uses a three-way (SYN, SYNACK, ACK) handshake rather than a two-way handshake to initiate a connection. a.
Consider the subnet in Fig. 3.11.5. Distance vector routing is used and the following vectors have just come in to router C: from B (5, 0, 8, 12, 6, 2); from D(16, 12, 06, 0, 9, 10) and from E(7, 6, 3, 9, 0, 4). The measured delays to B, D and E are 6, 3 and 5 respectively. What is C's new routing table? Give both the outgoing line to used and the expected delay ? A B E Fig. 3.11.5 F D
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.
2. Consider a bus-topology network with five stations. A reservation access method is used. Each station has infinite data to transmit. Each reservation slot has 10 microseconds (note that 1 microsecond = 106 second). For each station, one data transmission sends 1000 bits. The transmission rate over the medium is 10 Mbps. For a station, which is its throughput (in unit "Mbps")?
4) Host A and B are communicating over a TCP connection, and Host B has already received from A all bytes up through byte 130. Suppose Host A then sends two segments to Host B back-to-back. The first and second segments contain 80 and 40 bytes of data, respectively. In the first segment, the sequence number is 131, the source port number is 301, and the destination port number is 80. Host B sends an acknowledgment whenever it receives a segment from Host A. a. In the second segment sent from Host A to B, what are the sequence number, source port number, and destination port number? b. If the first segment arrives before the second segment, in the acknowledgment of the first arriving segment, what is the acknowledgment number, the source port number, and the destination port number? c. If the second segment arrives before the first segment, in the acknowledgment of the first arriving segment, what is the acknowledgment number?
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…
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?