Consider Figure 2 for which there is an institutional network connected to the Internet. Suppose that the average object size is 80,000 bits and that the average request rate from the institution's browsers to the origin servers is 18 requests per second. Also suppose that the amount of time it takes from when the router on the Internet side of the access link forwards an HTTP request until it receives the response is 1.5 seconds on average. Let the average time be the sum of the average access delay and the average Internet delay. For average access delay, use A/(1 – AB), where A is the average time required to send an object over the access link and ß is the arrival rate of objects to the access link. origin servers public Intemet 1.6 Mbps access link institutional network 10 Mbps LAN Figure 2: Diagram for Problem 3 (a) -Find the average response time. (b) rate is 0.4. Find the response time. Note that the response time is close to zero if the request is satisfied by the cache. Now suppose a cache is installed in the institutional LAN. Suppose the miss

Consider Figure 2 for which there is an institutional network connected to the Internet. Suppose that the average object size is 80,000 bits and that the average request rate from the institution's browsers to the origin servers is 18 requests per second. Also suppose that the amount of time it takes from when the router on the Internet side of the access link forwards an HTTP request until it receives the response is 1.5 seconds on average. Let the average time be the sum of the average access delay and the average Internet delay. For average access delay, use A/(1 – AB), where A is the average time required to send an object over the access link and ß is the arrival rate of objects to the access link. origin servers public Intemet 1.6 Mbps access link institutional network 10 Mbps LAN Figure 2: Diagram for Problem 3 (a) -Find the average response time. (b) rate is 0.4. Find the response time. Note that the response time is close to zero if the request is satisfied by the cache. Now suppose a cache is installed in the institutional LAN. Suppose the miss

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 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?
Answer please..
Given a M/M/1 queue, if the average inter-arrival time is Z seconds, the average packet service time is P, find: a. The probability an arriving packet has to wait in the queue b. The variance (o}) of the inter-arrival time The variance (o) of the packet service time d. The average number of packets in the system (i.e., in the queue + in the NIC) c.
It is possible for a series of packets to be sent from one host to another over the same connection. 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 while the other delay's length will be more malleable?
Asap
Give a simple heuristic for finding two paths through a network from a given source to a given destination that can survive the loss of any communication line (assuming two such paths exist). The routers are considered reliable enough, so it is not necessary to worry about the possibility of router crashes.
We have looked at various settings for HTTP delays. Now, compare parallel downloads with non persistent HTTP versus persistent HTTP. Assuming you are downloading a web page that has N reference objects from a server which is located in a city called Seta. Will the distance to the Seta city from where you are , make a difference which HTTP connection is used? Set your scenario (such as speed of the link, size of the objects and N) and explain your answer
Suppose two TCP connections share a path through a router R. The router's queue size is six segments; each connection has a stable congestion window of three segments. No congestion control is used by these connections. A third TCP connection now is attempted, also through R. The third connection does not use congestion control either. Describe a scenario in which, for at least a while, the third connection gets none of the available bandwidth, and the first two connections proceed with 50% each. Does it matter if the third connection uses slow start? How does full congestion avoidance on the part of the first two connections help solve this?
A connection that connects two hosts may transport many packets at the same time. Please break down how much time is spent on each step of the processing of a freight load for me. Should the duration of one delay be predetermined, while the other delay's time might be flexible, depending on the situation?
Give a simple heuristic for finding two paths through a network from a given source to a given destination that can survive the loss of any communication line (assuming two such paths exist). The routers are considered reliable enough, so it is not necessary to worry about the possibility of router crashes.
Consider a long-lived TCP session with an end- to-end bandwidth of 1 Gbps (= 10⁹ bits-per- second). The session starts with a sequence number of 1234. The minimum time (in seconds, rounded to the closest integer) before this sequence number can be used again is
Consider a long-lived TCP session with an end- to-end bandwidth 500 Mb/s. The session starts with a sequence number of 3465. The minimum time (in seconds) before this sequence number can be used again is