Download delays for 100 objects (HTTP 1.1 with browser 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, as shown below for the first of these 100 requests. initiate TCP connection RTT request file RTT file received time You can assume that any other HTTP message not containing an object sent by the client and server has a negligible (zero) transmission time. Suppose the client makes 100 requests, one after the other, waiting for a reply to a request before sending the next request. 352 secs Using HTTP 1.1, how much time elapses between the client transmitting the first request, and the receipt of the last requested object, assuming the client uses the IF- MODIFIED-SINCE header line, and 50% of the objects requested have not changed since the client downloaded them (before these 100 downloads are performed)? 350 secs 252 secs time to transmit file 150 secs time 203 secs Not quite. Your answer is incorrect.

Download delays for 100 objects (HTTP 1.1 with browser 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, as shown below for the first of these 100 requests. initiate TCP connection RTT request file RTT file received time You can assume that any other HTTP message not containing an object sent by the client and server has a negligible (zero) transmission time. Suppose the client makes 100 requests, one after the other, waiting for a reply to a request before sending the next request. 352 secs Using HTTP 1.1, how much time elapses between the client transmitting the first request, and the receipt of the last requested object, assuming the client uses the IF- MODIFIED-SINCE header line, and 50% of the objects requested have not changed since the client downloaded them (before these 100 downloads are performed)? 350 secs 252 secs time to transmit file 150 secs time 203 secs Not quite. Your answer is incorrect.

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

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.
Suppose within your Web browser you click on a link to obtain a Web page. The IP address for the associated URL isnot cached in your local host, so a DNS lookup is necessary to obtain the IP address. Suppose that n DNS servers arevisited 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 ofHTML text. Let RTT0 denote the RTT between the local host and the server containing the object. Assuming zerotransmission time of the object, how much time elapses from when the client clicks on the link until the client receivesthe object?
In this programming assignment, you will implement a decentralized peer-to-peer network architec-ture (P2P), including the basic implementation of the BitTorrent protocol (BTP). General P2P architec-tures can be classified into centralized and decentralized, In P2P centralized architectures, new peers senda request to the Traker (normally done via HTTP) requesting a list containing all the IP addresses ofthe peers that are already connected to the P2P network sharing the same file. The tracker then, replieswith a response containing such list. In P2P decentralized architecture, each peer is also a Traker, and itcan share only limited resources because it only sees the partial network. On the other hand, P2P decen-tralized networks avoid single point of failure since they do not depend of centralized trackers. Examplesof P2P applications that are/were implementing centralizing architectures are Nasper, the Berkeley OpenNetwork Infrastructure (BOINC) and some versions of BitTorrent.…
Consider a node called A that sends packets to an adjacent node called B. To control the packet flow to node B, node A employs a credit manager scheme in which parameters C=3(credits), C_max=4(credits) and \tao=6(msec), respectively. node A has an infinite buffer to temporarily store packets. When a packet arrives at node A, node A stores the packet at the bottom of the buffer. Node A also has a single server (transmitter). As soon as the server becomes idle, the server picks up a packet at the head of the buffer, if any, and serves the packet for packet transmission time T_p as far as there remains a credit. (The packet transmission time T_p = 4 (msec).) We observed the arrival times of the first 12 packets, denoted by aA(1)⋯A(12), which were as follows: n A(n) 1 0.5 msec 2 1.0 3 1.5 4 2.0 5 4.5 6 5.5 7 6.5 8 12.5 9 13.0 10 13.5 11 14.0 12 14.6 1. Let R(n) denote the departure time of the n th packet from the buffer for n∈{1,2,...}. Find R(n) for…
Consider a web page whose base file is of size S1 = 10 KB. Assume that the web page consists of N = 20 inline objects each of size S2 = 100 KB. Assume that the round-trip time to the web server is T = 100 ms and the bottleneck capacity is C = 10 Mbps. Ignore any packetization delays and header overhead.a. Assuming non-persistent HTTP is used with a single TCP connection, how long does it take to download the web page?b. Assuming non-persistent HTTP is used with 4 parallel TCP connections, how long does it take to download the web page?c. Assuming pipelined, persistent HTTP is used, how long does it take to download the web page? ”Pipelined” means requests for multiple objects can be sent back-to-back on the same connection.d. Assuming non-pipelined, persistent HTTP with 2 parallel TCP connections is used, how long does it take to download the web page? Assume that the 2 parallel connections equally share the total available bandwidth C.
We explore whether either UDP or TCP offers any level of end-point authentication in this problem. a. Consider a server that accepts a request via UDP and responds via UDP (for example, as done by a DNS server). Where would the server give its answer if a client with IP address X spoofs it with address Y? b. Assume a server receives a SYN with IP source address Y and responds with SYNACK. The server then receives an ACK with IP source address Y and the right acknowledgmentamount. Assuming the server selects a random initial sequence number and there is no "man-in-the-middle," how can the server be confident that the recipient is really at Y (and not at any other address X that spoofs Y)?
Suppose that the RTT delay between a client and an HTTP server is 30 msecs; the time a server needs totransmit an object into its outgoing link is 0.85 msecs; and any other HTTP message not containing an objecthas a negligible (zero) transmission time. Suppose the client again makes 100 requests, one after the other,waiting for a reply to a request before sending the next request.Assume the client is using HTTP 1.1 and the IF-MODIFIED-SINCE header line. Assume 50% of the objectsrequested have NOT changed since the client downloaded them (before these 90 downloads are performed)How much time elapses (in milliseconds) between the client transmitting the first request, and the completionof the last request?
If DNS looks up occur every 10 minutes and the HTTP file references 8 items each time, how long would Non-persistent HTTP and no concurrent TCP connections last?
If a DNS lookup happens every 10 minutes and an HTTP file references 8 objects each time, how long would Non-persistent HTTP with no concurrent TCP connections last?
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
In this problem, we use the useful dig tool available on Unix and Linux hosts to explore the hierarchy of DNS servers. Recall that in Figure 2.19, a DNS server in the DNS hierarchy delegates a DNS query to a DNS server lower in the hierarchy, by sending back to the DNS client the name of that lower-level DNS server. First read the man page for dig, and then answer the following questions. Starting with a root DNS server (from one of the root servers [a-m].root-servers.net), initiate a sequence of queries for the IP address for your department’s Web server by using dig. Show the list of the names of DNS servers in the delegation chain in answering your query. Please tell me how I should use dig and which part of output I should write for answer this question, best with picture example, thank you!
A link between two hosts can really pack a punch, carrying a boatload of packets all at once. Please spill the beans and lay out a schedule that spells out all the ins and outs of the tasks required to wrap up a single shipment. Is it believed that one delay will take a set amount of time while the other delay's duration can be played around with?