3. HTTP dlients and servers transfer requests and replies using a non-persistent connection and persistent connections. Suppose we have a basic .html web page that contains 64 objects. Assume all the transmission times for the basic html and the objects are negligible. Assume that the round-trip time between the server and client is RTT. In terms of RTT answer the following questions. b. How long does it take for HTTP with persistent pipelined connections to download the entire page including the objects? Assume that the maximum number of available pipelines at a time is 20 pipeline connections.

3. HTTP dlients and servers transfer requests and replies using a non-persistent connection and persistent connections. Suppose we have a basic .html web page that contains 64 objects. Assume all the transmission times for the basic html and the objects are negligible. Assume that the round-trip time between the server and client is RTT. In terms of RTT answer the following questions. b. How long does it take for HTTP with persistent pipelined connections to download the entire page including the objects? Assume that the maximum number of available pipelines at a time is 20 pipeline connections.

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Similar questions

Assume we have a client using a web browser that is directly connected to a web server. We are assuming there is a direct link between the client and the server. The RTT delay between the client and the server is 10 msec. The time it takes the server to transmit an object to its outgoing link is 2 msec. Now suppose that the client has the web page that it wants already cached locally. But the user wants to constantly check for updates and sends conditional get requests one after the other 20 times -- that is, once it gets a response and/or the updated object it sends out the next request. If we are using persistent HTTP and the cached object is up-to-date 40% of the time, how much time will elapse between sending the first request and the completion of the last one?
Consider the three-node network below, that uses flow-based generalized forwarding (e.g., as in OpenFlow) in the network's routers. In the question below, we'll want to create match+action entries in the flow table at router r2, with three ports labelled 1,2,3 (in black). In the question, matches are constrained to be over only four fields: the IP source address, the IP destination address, the upper-layer protocol field of the IP datagram, and the destination port number of the transport-layer segment. The actions are either to drop or to forward(i), that is, to forward a matching packet on port i. The default action (unless stated otherwise) is that if a packet doesn't match a rule, it will be dropped.Question: Suppose we want to implement the following rule: r2 should act as a firewall, only allowing TCP traffic into the 22.33/16 network from any network. Specify a single flow table row entry to implement this rule, indicating the column entries for the row below. The * is a…
Do HTTP streaming's TCP receive buffer and client application buffer match? How do they engage without talking?
Question 2 . The non-persistent HTTP protocol executes six main steps in order to establish a connection between a server and a client and transfer data between the client of the server. Pleaseenumerate these steps by clearly identifying the steps/actions of the sender and those of the Pleaseindicate the steps which are affected in case of persistent HTTP and how they are Aclient wants to download 45 documents of size 500 bits each from a server that has a transmission rate of 40bps. If the RTT between the client and server is 1 ms, please indicate the time needed to download the 45 movies if PersistentHTTP is used Non-persistentHTTP is used
2.2-3 HTTP 1.1 GET with an embedded object. Suppose an HTTP client makes a request to the xx web server. The client has never before requested a given base object, nor has it communicated recently with the xx server. You can assume, however, that the client host knows the IP address of xx Suppose also that after downloading the base file, the browser encounters a jpeg object in the base html file that is stored on xx, and therefore makes another GET request to xx for that referenced jpeg object. How many round trip times (RTTs) are needed from when the client first makes the request to when the base page and the jpeg file are completely downloaded, assuming the time needed by the server to transmit the base file, or the jpeg file into the server's link is (each) equal to 1/2 RTT and that the time needed to transmit the HTTP GET into the client's link is zero? You should assume that persistent HTTP 1.1 is being used. (You should take into account any TCP setup time required before an…
Consider the network scenario in the figure below. K sources are connected to the Internet via links of capacity RS, and within the network fairly share a common link of capacity R, to K destinations. Each destination is connected to the network by a link of capacity RD. You can assume that there are no other links or source-destination pairs in the network. Suppose that source Si has an infinitely large file it wants to send to destination Di (i.e., each sources sends to a different destination). Suppose that K=10, RS = 100 Mbps, RD= 54 Mbps, and R = 50 Gbps. What is the throughput between each source-destination pair?
The figure depicts K sources which are connected to the Internet via linksof capacity RS, and within the network fairly share a common link ofcapacity R to K destinations. Each destination is connected to the networkby a link of capacity RD. You can assume that there are no other links orsource-destination pairs in the network.Now suppose that source Si has an infinitely large file it wants to send todestination Di (i.e., each source sends to a different destination) a. In scenario b above, suppose we increase the capacity of the destinationlinks to 1 Gbps. Will this increase the throughput between sources anddestinations? Briefly (in less than 5 sentences) explain your answer.
Suppose within your Web browser you click on a link to obtain a Web page. The IP address for the associated URL is not cached in your localhost, so a DNS lookup is necessary to obtain the IP address. Suppose that n DNS servers are visited before your host receives the IP address from DNS; the successive visits incur an RTT of RTT1, . . ., RTTn. Further suppose that the Web page associated with the link contains exactly one object, consisting of a small amount of HTML text. Let RTT0 denote the RTT between the local host and the server containing the object. Assuming zero transmission time of the object, how much time elapses from when the client clicks on the link until the client receives the object? Justify your answer.
Download delays for 100 objects (HTTP 1.1 with local web caching). Consider an HTTP 1.1 client and server. The RTT delay between the client and server is 2 seconds. Suppose the time a server needs to transmit an object into its outgoing link is 3 seconds. There is also a local web cache, as shown in the figure below, with negligible (zero) propagation delay and object transmission time. The client makes 100 requests one after the other, waiting for a reply before sending the next request. All requests first go to the cache (which also has a 2.0 sec. RTT delay to the server but zero RTT to the client). How much time elapses between the client transmitting the first request, and the receipt of the last requested object, assuming no use of the IF-MODIFIED-SINCE header line anywhere, and assuming that 50% of the objects requested are "hits" (found) in the local cache? Your answer should be among the following list( 702 secs, 552 secs, 352 secs, 350 secs, 150 secs) . Show your…
The figure depicts K sources which are connected to the Internet via linksof capacity RS, and within the network fairly share a common link ofcapacity R to K destinations. Each destination is connected to the networkby a link of capacity RD. You can assume that there are no other links orsource-destination pairs in the network.Now suppose that source Si has an infinitely large file it wants to send todestination Di (i.e., each source sends to a different destination).a. If K=10, RS = 100 Mbps, Rd=10 Mbps, and R = 10 Gbps. What is thethroughput between each source-destination pair? Where are thebottleneck links?If we now assume that K=10, RS = 100 Mbps, Rd= 100 Mbps, and R = 0.5Gbps. What are the new throughputs between each source-destinationpair? Where are the bottle-neck links?
Suppose an HTTP client makes a request to the gaia.cs.umass.edu web server. The client has never before requested a given base object, nor has it communicated recently with the gaia.cs.umass.edu server. You can assume, however, that the client host knows the IP address of gaia.cs.umass.edu. How many round trip times (RTTs) are needed from when the client first makes the request to when the base page is completely downloaded, assuming the time needed by the server to transmit the base file into the server's link is equal to 1/2 RTT and that the time needed to transmit the HTTP GET into the client's link is zero? (You should take into account any TCP setup time required before the HTTP GET is actually sent by the client, the time needed for the server to transmit the requested object, and any propagation delays not accounted for in these amounts of time.) Choices A.0.5 RTT B.3.5 RTT C.1.5 RTT D.2.5 RTT E.0 RTT
Assume that a client can use UDP to obtain a file from a distant server at a known address. The client initiates the request for a file name, and the server responds with a sequence of data packets containing various file components. To ensure delivery reliability, the client and server use a stop-and-wait protocol. Is there anything else wrong with this protocol aside apparent performance issues? Consider the possibility of process failure.