Network-assisted or end-end congestion control? Which of the following actions are used in network-assisted congestion control (say versus end-end congestion control) to signal congestion. Check all that apply. A sender decreases its sending rate in response to packet loss detected via its transport- layer ACKing. The transport-layer receiver informs sender of the size of its (transport-payer receiver) receive window. A router drops a packet at a congested router. The sender decreases its sending rate in response to a measured increase in the RTT. A datagram experiences delay at a congested network router, which is then measured by the sender and used to decrease the sending rate. A router sends an ICMP message to a host telling it to slow down its sending rate. A router marks a field in the datagram header at a congested router.

Network-assisted or end-end congestion control? Which of the following actions are used in network-assisted congestion control (say versus end-end congestion control) to signal congestion. Check all that apply. A sender decreases its sending rate in response to packet loss detected via its transport- layer ACKing. The transport-layer receiver informs sender of the size of its (transport-payer receiver) receive window. A router drops a packet at a congested router. The sender decreases its sending rate in response to a measured increase in the RTT. A datagram experiences delay at a congested network router, which is then measured by the sender and used to decrease the sending rate. A router sends an ICMP message to a host telling it to slow down its sending rate. A router marks a field in the datagram header at a congested router.

Comptia A+ Core 1 Exam: Guide To Computing Infrastructure (mindtap Course List)

10th Edition

ISBN:9780357108376

Author:Jean Andrews, Joy Dark, Jill West

Publisher:Jean Andrews, Joy Dark, Jill West

Chapter8: Network Infrastructure And Troubleshooting

Section: Chapter Questions

Problem 8TC

See similar textbooks

Similar questions

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.
2. Now suppose there are two links between source and destination, with one router connecting the two links. Each link is 5,000 km long. Again suppose the MP3 file is sent as one packet. Suppose there is no congestion, so that the packet is transmitted onto the second link as soon as the router receives the entire packet. What is the end-to-end delay?
A packet switch receives a packet and determines the outbound link to which the packet should be forwarded. When the packet arrives, one other packet is halfway done being transmitted on this outbound link and four other packets are waiting to be transmitted. Packets are transmitted in order of arrival. Suppose all packets are 1,200 bytes and the link rate is 2 Mbps. What is the queuing delay for the packet? More generally, what is the queuing delay when all packets have length L, the transmission rate is R, x bits of the currently-being-transmitted packet have been transmitted, and n packets are already in the queue?
22. A datagram subnet allows routers to drop packets whenever they need to. The probability of a router discarding a packet is p. Consider the case of a source host connected to the source router, which is connected to the destination router, and then to the destination host. If either of the routers discards a packet, the source host eventually times out and tries again. If both host-router and router-router lines are counted as hops, what is the mean number of a. (a) hops a packet makes per transmission? b. (b) transmissions a packet makes? (c) hops required per received packet?
Suppose that between a sending host and a receiving host there is exactly one packet switch. The transmission rates between the sending host and the switch and between the switch and the receiving host are R 1 and R2, respectively. Assuming that the router uses store-and-forward packet switching, what is the total end-to-end delay to send a packet of length L. (Ignore queuing and propagation delay.)
In packet switching: A. Dissembling and re-assembling of data is not required. B. Every chunk of data may select a different route. C. The bandwidth will be allocated for a route which is defined by the router algorithm. D. Every chunk of data have to select a different route. E. None is true. 18-
Hop-by-hop congestion control. We learned about end-to-end and network-assisted congestion control. A third type of congestion control (mostly deployed only in internal data-center networks) is hop-by-hop congestion control. In this approach a downstream router/host explicitly informs the previous hop upstream router/host about the amount of free buffer space it has available, and the upstream router will only forward a packet when it knows the downstream router has buffer space. Consider the three-hop scenario shown below, where the first and third links have capacity R, and the link between the routers has capacity R/2. With hop-by-hop congestion control, will the sender need to retransmit due to buffer overflow? O Yes O No Host A Host B -in: original data R in original plus retransmitted R/2 R -λout
Question 5 We've learned in class about end-to-end and network-assisted congestion control. A third type of congestion control (mostly deployed only in internal data-center networks) is hop-by-hop congestion control. In this approach a downstream router/host explicitly informs the previous hop upstream router/host about the amount of free buffer space it has available, and the upstream router will only forward a packet when it knows the downstream router has buffer space. A. Consider the three-hop scenario shown below, where the first and third links have capacity R, and the link between the routers has capacity R/2. What is the maximum throughput of the red connection, given that the red and blue connections are similarly controlled, and therefore have the same maximum throughput*? Host A Host B -2-in: original data Ain: original plus retransmitted R R/2 R -hour ww B. With hop-by-hop congestion control, will the sender need to retransmit due to buffer overflow*? C. With hop-by-hop…
In the figure below a router is transferring packets, each of length L= 5 000 bits over a link with a transmission Rate R= 1 Mbps to another router at the other end of the link. The speed prorogation of the light signal on the link is 3x108 m/s. The length of the link is 1 Km. L: packet length (in bits) R: link transmission rates (Mbps) Queue of packets waiting for output link 1-Calculate the total transmission delay. 2- How many packets can be transmitted in one second.
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.
Multi-hop network: Given two hosts A and B, and one router between them. Packet size is L bits and the link bandwidth is R bps for both links.Suppose A has two packet to send to B.How long does it take starting from A sending the first bit of first packettill B receives the last bit of the last packet?
4. If delays are recorded as 8-bit numbers in a 50-router network, and delay vectors are exchanged twice a second, how much bandwidth per (full-duplex) line is chewed up by the distributed routing algorithm? Assume that each router has three lines to other routers.