Suppose the R-B link in the previous exercise changes from a bandwidth delay to a propagation delay, so that two packets now take 1 second to send. List what is sent and received during the first 8 seconds. Assume a static timeout value of 2 seconds, that slow start is used on a timeout, and that ACKS sent at about the same time are consolidated. Note that R's queue size is now irrelevant (why?).

Suppose the R-B link in the previous exercise changes from a bandwidth delay to a propagation delay, so that two packets now take 1 second to send. List what is sent and received during the first 8 seconds. Assume a static timeout value of 2 seconds, that slow start is used on a timeout, and that ACKS sent at about the same time are consolidated. Note that R's queue size is now irrelevant (why?).

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

We demand that a commit bit be evaluated to verify whether a read request needs wait under an updated version of the timestamp protocol. Explain how the commit bit may prevent aborts from cascading. Why isn't this test required while creating requests?
Please solve it correctly with a proper explanation of the calculation. Question: Given, you want to visit “welcomebacktophysicalexams.com”. Your network has alocal DNS server and is using a recursive lookup to fetch IP addresses and RTT of 29 ms.Others in your network have already visited the above website a few hours before yourvisit.After fetching the IP address, your PC sends a non-persistent HTTP request of size 109bytes to bring 13 objects of size 31 bytes each. In this particular connection, it requiresthe PC 67ms to send the TCP request to the server. I. What is the total RTT in ms in the DNS lookup?II. What is the total RTT in ms required (including DNS) to bring the full object toyour PC?III. What is the total file transmission time in ms after fetching the IP address?
Demonstrate that two red nodes in a route cannot be contiguous (e.g., parent and child). As a result, no more than half of the nodes in a path may be red.
Q3: With the aid of a diagram, show the sequence of query/response messages that are exchanged to carry out a recursive name-to-address resolution. Include in your diagram a root name server, a top-level name server, and lower-level name servers. Use a DNS of the following URL: http://www.coeng.uobaghdad.edu.iq
Suppose A, R, and B are as in the previous exercise, except that R's queue now has a size of three packets, in addition to the one being transmitted. A starts a connection using slow start, with an infinite receive window. Fast retransmit is done on the second duplicate ACK (that is, the third ACK of the same packet); the TimeOut interval is infinite. Ignore fast recovery; when a packet is lost, let the window size be 1. Give a table showing, for the first 15 seconds, what A receives, what A sends, what R sends, R's queue, and what R drops.
The figure depicts K sources which 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. Now suppose that source Si has an infinitely large file it wants to send to destination 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 the bottleneck links? b. If we now assume that K=10, RS = 100 Mbps, Rd= 100 Mbps, and R = 0.5 Gbps. What are the new throughputs between each source-destination pair? Where are the bottle-neck links? c. In scenario b above, suppose we increase the capacity of the destination links to 1 Gbps. Will this increase the throughput between sources and destinations? Briefly (in less than 5 sentences)…
25. When a file is transferred between two computers, two acknowledgement strategies are possible. In the first one, the file is chopped up into packets, which are individually acknowledged by the receiver, but the file transfer as a whole is not acknowledged. In the second one, the packets are not acknowledged individually, but the entire file is acknowledged when it arrives. Discuss these two approaches.
Describe the working of recursive and iterative queries in DNS. Use figures for the description. A file of F = 3 x 105 bits is distributed to N peers. The server has an upload rate of us = 1 x 105 bps. Each peer has a download rate of di = 1 x 105 bps and an upload rate of u = 30,000 bps. For N = 1 to 10, and for both client-server and P2P architectures, plot a single graph with minimum distribution time on the y-axis and N on the x-axis. Use a table to show all the values for N = 1 to 10 and use the values to plot the graph. Clearly show the calculation only for N = 1, 2, and 3. Explain at least one P2P application (BitTorrent or DHT) in detail.
Problem 4: Consider the tree Collision Resolution Protocol (CRP). Let exactly k collisions occur during a collision resolution phase. Determine the number of slots required for terminating the collision resolution phase as a function of k . Note that k does not represent the number of packets that have initially collided, but the number of collisions in the CRP feedback pattern (i.e., the number of e 's)
- Consider another carelessly written Web application, which uses a servlet that checks if there was an active session, but does not check if the user is authorized to access that page, instead depending on the fact that a link to the page is shown only to authorized users. What is the risk with this scheme? (There was a real instance where applicants to a college admissions site could, after logging into the Web site, exploit this loophole and view information they were not authorized to see; the unauthorized access was however detected, and those who accessed the information were punished by being denied admission.)