Consider an HTTP 1.0 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. initiate TCP connection RTT request file RTT time to transmit file file received. time 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 10 requests, one after the other, waiting for a reply to a request before sending the next request." Using HTTP 1.0, how much time elapses between the client transmitting the first request, and the receipt of the last requested object?

Consider an HTTP 1.0 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. initiate TCP connection RTT request file RTT time to transmit file file received. time 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 10 requests, one after the other, waiting for a reply to a request before sending the next request." Using HTTP 1.0, how much time elapses between the client transmitting the first request, and the receipt of the last requested object?

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

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…
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
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)?
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?
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.
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.…
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?
The problem below involves the UDP protocol.DescriptionClientSend an integer in the range 0 to 100 representing a student’s score in COMP2602 to the server.Use a loop to send five score to the server in all. Each score is sent one at a time so that theserver can respond to each score sent.ServerThe server receives each integer score from the client and returns the letter grade for that score tothe client where it is printed. Note: THE GRADE IS PRINTED AT THE CLIENT.Grade scheme 0-49 F, 50-70 C, 71-80 B, 81-100 AYou may use any reasonable IP addresses and port numbers in your program.Notes: Name the client client.py and the server server.py
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?
Given the following topology of a network where the router connecting the two subnets together, Nodes 1 and 2 are ’inside’ of the subnet neta, Nodes 4 and 5 are ’outside’ of neta and Node 3 with a firewall is the gateway of neta. Try to write rules as general as possible. For example, although there are only two nodes outside, try to write rules such that the policy is achieved even if there were more than two nodes outside. Suppose the default policy is ACCEPT in the firewall on Node 3. Write packet filtering rules for the following goals (each of which is treated separately): Rule 1. Block ping (icmp) packets being forwarded between the two subnets; Rule 2. Block ping packets coming into the firewall;Rule 3. Prevent Node1 from SSHing to any outside nodes; Change the default policy as DROP and write packet filtering rules for the following golas: Rule 4. Allow inside hosts can access outside websites;Rule 5. Allow outside hosts can SSH into Node1. No other access should be allowed.…
Let's pretend a computer sends a packet to another computer on the Internet at the network layer. A problem has occurred with the packet's logical destination address. Where should I send the package? When this occurs, how will the original computer find out?
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?