Database System Concepts
7th Edition
ISBN: 9780078022159
Author: Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher: McGraw-Hill Education
expand_more
expand_more
format_list_bulleted
Question
Suppose an HTML file references two very small objects on the same server (total 3 object including the HTML file). Neglecting transmission times, how much time elapses for all objects to be loaded/received in a non-persistent connection scenario. Assume that the round-trip delay is 10ms for each back and forth communication (even for establishing TCP connection)
Expert Solution
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
Step by stepSolved in 3 steps
Knowledge Booster
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.Similar questions
- Question 2 please (a,b,c,d included)arrow_forwardConsider one TCP connection on a path with a bottleneck link with capacity L. We have a file of size F(assume F is a very large file size). If TCP segment size is B bytes, the two-way propagation delay is tp and connection is always in congestion avoidance phase, find the following: A. Maximum window size that TCP can achieve B. Average window size and average throughput in this TCP connection C. Time it will take from connection establishment to reaching the maximum window size.arrow_forwardA connection that connects two hosts may transport many packets at the same time. Please provide a schedule that outlines all of the actions that need to be completed in order to successfully execute one shipment. Is it to be anticipated that one of the delays will take a certain amount of time, while the duration of the other delay may be adjusted in accordance with the circumstances?arrow_forward
- Consider the scenario in which a packet is sent from a source host to a destination host along a path that has been predetermined. Create a list of the delay components and include it in the end-to-end delay. Which of the delays is set in stone, and which ones are subject to change?arrow_forwardConsider a simple protocol for transferring files over a link. After some initial negotiation, A sends data packets of size 1 KB to B; B then replies with an acknowledgment. A always waits for each ACK before sending the next data packet; this is known as stop-and-wait. Packets that are overdue are presumed lost and are retransmitted. (a) In the absence of any packet losses or duplications, explain why it is not necessary to include any "sequence number" data in the packet headers. (b) Suppose that the link can lose occasional packets, but that packets that do arrive always arrive in the order sent. Is a 2-bit sequence number (that is, N mod 4) enough for A and B to detect and resend any lost packets? Is a 1-bit sequence number enough? (c) Now suppose that the link can deliver out of order and that sometimes a packet can be delivered as much as 1 minute after subsequent packets. How does this change the sequence number requirements?arrow_forwardConsider transferring an enormous file of L bytes from Host A to Host B. Assume an MSS of 536 bytes. a. What is the maximum value of L such that TCP sequence numbers are not exhausted? Recall that the TCP sequence number field has 4 bytes. b. For the L you obtain in (a), find how long it takes to transmit the file. Assume that a total of 66 bytes of transport, network, and data-link header are added to each segment before the resulting packet is sent out over a 155 Mbps link. Ignore flow control and congestion control so A can pump out the segments back to back and continuously.arrow_forward
- A connection that connects two hosts may transport many packets at the same time. Please provide a schedule that outlines all of the actions that need to be completed in order to successfully execute one shipment. Is it to be anticipated that one of the delays will take a certain amount of time, while the duration of the other delay may be adjusted in accordance with the circumstances?arrow_forwardCompare GBN, SR, and TCP (no delayed ACK). Assume that the timeout values for all three protocols are sufficiently long such that 5 consecutive data segments and their corresponding ACKs can be received (if not lost in the channel) by the receiving host (Host B) and the sending host (Host A) respectively. Suppose Host A sends 5 data segments to Host B, and the 3rd segment (sent from A) is lost. In the end, all 5 data segments have been correctly received by Host B. How many segments has Host A sent in total and how many ACKs has Host B sent in total? What are their sequence numbers? Answer this question for all three protocols. The previous expert did the wrong question and the answer was incorrect. The 3rd packet is lost not the 2nd packetarrow_forwardQuestion 1a and 1b pleasearrow_forward
- Given a M/M/1 queue, which has packets arriving at a rate 2 packets/sec, an output link rate R bps, and an average packet size of 1500 bytes, write down: the expression for T, the average delay for a packet (i.e., from arrival till completing transmission at the output). b. the expression for the output utilization c. the expression for average number of packets in the queue d. the expression for average number of packets in the output NICarrow_forwardIt is possible for a series of packets to be sent from one host to another over the same route. Please break down the time it takes for a single package to go from beginning to conclusion. Is it expected that one of the delays would last a certain period of time and the other delay's length will be more variable?arrow_forward22. 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?arrow_forward
arrow_back_ios
SEE MORE QUESTIONS
arrow_forward_ios
Recommended textbooks for you
- Database System ConceptsComputer ScienceISBN:9780078022159Author:Abraham Silberschatz Professor, Henry F. Korth, S. SudarshanPublisher:McGraw-Hill EducationStarting Out with Python (4th Edition)Computer ScienceISBN:9780134444321Author:Tony GaddisPublisher:PEARSONDigital Fundamentals (11th Edition)Computer ScienceISBN:9780132737968Author:Thomas L. FloydPublisher:PEARSON
- C How to Program (8th Edition)Computer ScienceISBN:9780133976892Author:Paul J. Deitel, Harvey DeitelPublisher:PEARSONDatabase Systems: Design, Implementation, & Manag...Computer ScienceISBN:9781337627900Author:Carlos Coronel, Steven MorrisPublisher:Cengage LearningProgrammable Logic ControllersComputer ScienceISBN:9780073373843Author:Frank D. PetruzellaPublisher:McGraw-Hill Education
Database System Concepts
Computer Science
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:McGraw-Hill Education
Starting Out with Python (4th Edition)
Computer Science
ISBN:9780134444321
Author:Tony Gaddis
Publisher:PEARSON
Digital Fundamentals (11th Edition)
Computer Science
ISBN:9780132737968
Author:Thomas L. Floyd
Publisher:PEARSON
C How to Program (8th Edition)
Computer Science
ISBN:9780133976892
Author:Paul J. Deitel, Harvey Deitel
Publisher:PEARSON
Database Systems: Design, Implementation, & Manag...
Computer Science
ISBN:9781337627900
Author:Carlos Coronel, Steven Morris
Publisher:Cengage Learning
Programmable Logic Controllers
Computer Science
ISBN:9780073373843
Author:Frank D. Petruzella
Publisher:McGraw-Hill Education