Suppose we have a web page which contains 10 objects including: a html main file, 8 jpg image, and a .mp3 background music. For simplicity, assume each of the 10 objects has a size of 4 Kbits and that each object can be completely transferred in one TCP packet. Furthermore, assume the round-trip time between the server and client is RTT= 250 ms, and the download rate is 1 Mbps. What will be the time it takes to complete transferring the web page running in the non-persistent mode? Total delay = ms

Suppose we have a web page which contains 10 objects including: a html main file, 8 jpg image, and a .mp3 background music. For simplicity, assume each of the 10 objects has a size of 4 Kbits and that each object can be completely transferred in one TCP packet. Furthermore, assume the round-trip time between the server and client is RTT= 250 ms, and the download rate is 1 Mbps. What will be the time it takes to complete transferring the web page running in the non-persistent mode? Total delay = ms

Systems Architecture

7th Edition

ISBN:9781305080195

Author:Stephen D. Burd

Publisher:Stephen D. Burd

Chapter13: Internet And Distributed Application Services

Section: Chapter Questions

Problem 15VE

See similar textbooks

Similar questions

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)?
Consider a short, 10-meter link, over which a sender can transmit at a rate of 150 bits/sec in both directions. Suppose that packets containing data are 100,000 bits long, and packets containing only control (e.g., ACK or handshaking) are 200 bits long. Assume that N parallel connections each get 1/N of the link bandwidth. Now consider the HTTP protocol, and suppose that each downloaded object is 100 Kbits long, and that the initial downloaded object contains 10 referenced objects from the same sender. Would parallel downloads via parallel instances of non-persistent HTTP make sense in this case? Now consider persistent HTTP. Do you expect significant gains over the non-persistent case? Justify and explain your answer
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 Figure 2.12, for which there is an institutional network connected to the Internet. Suppose that the average object size is 1,000,000 bits and that the average request rate from the institution’s browsers to the origin servers is 16 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 three seconds on average (see Section 2.2.5). Model the total average response time as the sum of the average access delay (that is, the delay from Internet router to institution router) and the average Internet delay. For the average access delay, use ∆/(1 - ∆b), where ∆ is the average time required to send an object over the access link and b is the arrival rate of objects to the access link. Find the total average response time. I get ∆=1000000/15000000= 1/15, then ∆/(1 - ∆b)= (1/15)/(1-(1/15)*16)=-1, so the finally answer is : 3+(-1)=2s or 3+0=3s?
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…
Suppose Alice, with a Web-based e-mail account (such as Hotmail or Gmail), sends a message to Bob, who accesses his mail from his mail server using POP3. Discuss how the message gets from Alice’s host to Bob’s host. Be sure to list the series of application-layer protocols that are used to move the message between the two hosts.
Suppose Alice with a Web-based e-mail account (such as Gmail) sends it message to Bob, who accesses his mail from his mail server using POP3. Discuss how the message gets from Alice's host to Bob's host. Be sure to list the series of application -layer protocols that are used to movethe message between the two hosts.
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.
Consider an HTTP client that wants to retrieve a Web document at a given URL. The IP address of the HTTP server is initially unknown. What transport and application-layer protocols besides HTTP are needed in this scenario?
so given two printer, one of IP address is 200.23.16.202 and subnet mask is 255.255.255.224, and other one IP address is 200.23.16.170 and subnet mask is 255.255.255.224. Suppose the network that hosts the above printer is re-configured with other networks in the building. After re-configuration, the printer's IP address would remain the same but its network is changed with a new subnet mask, which is changed to 255.255.255.128. This means, even the printer's IP address looks the same, its network ID and host ID are different from those before re-configuration. Find the new network ID and host ID of this printer. You must write both in the standard dot-decimal format without attaching the subnet mask.
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.…