EBK COMPUTER NETWORKING
7th Edition
ISBN: 8220102955479
Author: Ross
Publisher: PEARSON
expand_more
expand_more
format_list_bulleted
Question
Chapter 2, Problem P23P
a)
Program Plan Intro
Given Information:
Consider a distribution scheme in which the server sends the file to each client, in parallel, at a rate of a rate of us/N.
b)
Program Plan Intro
Given Information:
Consider a distribution scheme in which the server sends the file to each client, in parallel, at a rate of a rate of us/N.
c)
Program Plan Intro
Given Information:
A file of F bits to N peers using client-server architecture is present. A fluid model where the server can simultaneously transmit to multiple peers, transmitting to each peer at different rates, as long as the combined rate does not exceed us is also present.
Expert Solution & Answer
Want to see the full answer?
Check out a sample textbook solutionStudents have asked these similar questions
Consider sending a file of F bits over a path of Q links. Each link transmits at R bits per second
(bps). The network is lightly loaded so that there are no queueing delays. When a form of packet
switching is used, the F
bits are broken up into packets, each packet with L bits, of which h bits of it are header.
Propagation delay is
negligible. Let F = 5x104, Q = 20, R = 1 Mbps, L = 1000, and h = 10.
c. Suppose the network is a packet-switched virtual circuit network. Denote the VC set-up time
by ts = 250
milliseconds. How long does it take to send the file from source to destination?
Suppose that the average object size is 850,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 – Δ ), where Δ is the average time required to send an object over the access link and is the arrival rate of objects to the access link.
a. Find the total average response time.b. Now suppose a cache installed in the institutional LAN, Suppose the miss rate is 0.4. Find the total response time.
Copy from chegg == Report!
A communication line capable of transmitting at a rate of 50 Kbits/secwill be used to accommodate 10 sessions each generating Poisson traffic at a rate 150 packets/min.Packet length are exponentially distributed with mean 1000 bits.
For each session, find the averagenumber of packets in queue, the average number in the system, and the average delay per packetwhen the line is allocated to the sessions by using:
i) 10 equal-capacity time-division multiplexed channels;ii) statistical multiplexing
Chapter 2 Solutions
EBK COMPUTER NETWORKING
Ch. 2 - List five nonproprietary Internet applications and...Ch. 2 - Prob. R2RQCh. 2 - Prob. R3RQCh. 2 - Prob. R4RQCh. 2 - Prob. R5RQCh. 2 - Prob. R6RQCh. 2 - Prob. R7RQCh. 2 - Prob. R8RQCh. 2 - Prob. R9RQCh. 2 - Prob. R10RQ
Ch. 2 - Why do HTTP, SMTP, and POP3 run on top of TCP...Ch. 2 - Prob. R12RQCh. 2 - Prob. R13RQCh. 2 - Prob. R14RQCh. 2 - Prob. R15RQCh. 2 - Prob. R16RQCh. 2 - Prob. R17RQCh. 2 - From a users perspective, what is the difference...Ch. 2 - Prob. R19RQCh. 2 - Prob. R20RQCh. 2 - Prob. R21RQCh. 2 - Prob. R22RQCh. 2 - Prob. R23RQCh. 2 - Prob. R24RQCh. 2 - Prob. R25RQCh. 2 - In Section 2.7, the UDP server described needed...Ch. 2 - Prob. R27RQCh. 2 - Prob. P1PCh. 2 - Prob. P2PCh. 2 - Prob. P3PCh. 2 - Prob. P4PCh. 2 - Prob. P5PCh. 2 - Prob. P6PCh. 2 - Prob. P7PCh. 2 - Prob. P8PCh. 2 - Prob. P9PCh. 2 - Prob. P10PCh. 2 - Prob. P11PCh. 2 - Prob. P13PCh. 2 - Prob. P14PCh. 2 - Prob. P15PCh. 2 - Prob. P16PCh. 2 - Prob. P17PCh. 2 - Suppose you can access the caches in the local DNS...Ch. 2 - Prob. P21PCh. 2 - Prob. P22PCh. 2 - Prob. P23PCh. 2 - Prob. P25PCh. 2 - Prob. P26PCh. 2 - Prob. P27PCh. 2 - Prob. P28PCh. 2 - Prob. P29PCh. 2 - Prob. P30PCh. 2 - Prob. P31PCh. 2 - Prob. P32P
Knowledge Booster
Similar questions
- Suppose nodes A and B are on the same 10 Mbps broadcast channel, and the propagation delay between the two nodes is 245 bit-times. Suppose A and B send Ethernet frames at the same time. Suppose the transmission time of the entire frame is 295 bit-times. So, the frames collide, and then A and B choose different values of K in the CSMA/CD algorithm. A node chooses the value of K at random from {0,1,2,...2n−1} where n is the number of collisions experienced on the channel – note n is set to 1 in this case). For Ethernet, the actual amount of time a node waits is K*512 bit times (i.e., K times the amount of time needed to send 512 bits into the Ethernet). Suppose A chooses a K value of 0 and B chooses a K value of 1. Assuming no other nodes are active, can the retransmissions from A and B collide? Justify your answer by showing all the intermediate steps of your calculations.arrow_forwardComputer A uses the Go-back-N ARQ protocol to send a 110 Mbytes file to computer B with a window size of 15. Given each frame carries 100K bytes data. How long does it take to send the whole file (the total time taken from A sending the first bit of the file until A receiving the last acknowledgment)? Given that the transmission rate of the link is 500 Mbps and the propagation time between A and B is 15ms. Assume no data or control frame is lost or damaged and ignore the overhead due to header and trailer.arrow_forwardMCQ 1.Suppose 4 packets are received in a burst at a token bucket shaper, which has 1 token in the bucket at the time of arrival (t=0). Tokens are refilled at the rate of 1 token per 5 time units, with the first of the (new) tokens arriving at time t=2. Assume that the shaping buffer is very large. At what times are the packets eventually transmitted? Choose the most appropriate response. The choices list the scheduling times of the packets in order (packet 1, packet 2, packet 3, packet 4). A:2, 7, 12, 17 B:5, 10, 15, 20 C:0, 2, 7, 12 D: 0, 5, 10, 15arrow_forward
- 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.arrow_forwardConsider 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…arrow_forwardDownload delays for 100 objects (HTTP 1.1 with local web 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. There is also a local web cache, as shown in the figure below, with negligible (zero) propagation delay and object transmission time. The client makes 100 requests one after the other, waiting for a reply before sending the next request. All requests first go to the cache (which also has a 2.0 sec. RTT delay to the server but zero RTT to the client). How much time elapses between the client transmitting the first request, and the receipt of the last requested object, assuming no use of the IF-MODIFIED-SINCE header line anywhere, and assuming that 50% of the objects requested are "hits" (found) in the local cache? Your answer should be among the following list( 702 secs, 552 secs, 352 secs, 350 secs, 150 secs) . Show your…arrow_forward
- 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?arrow_forwardConsider an HTTP server and client as shown in the figure below. Suppose that the RTT delay between the client and server is 13 msecs; the time a server needs to transmit an object into its outgoing link is 1 msecs. Any other HTTP message not containing an object has a negligible (zero) transmission time. Suppose the client again makes 106 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 47% of the objects requested have NOT changed since the client downloaded them (before these 106 downloads are performed). Clients RTT delay: t Transmission delay: ta Intemet APACHE Server How much time elapses (in milliseconds) between the client transmitting the first request, and the completion of the last request?arrow_forwardConsider a network connecting two systems located 4000 kilometers apart. The bandwidth of the network is 500 x Mbps. The propagation speed of the media is 4 × 106 meters per second. It is needed to design a Go-Back-N sliding window protocol for this network. The average packet size is 107 bits. The network is to be used to its full capacity. Assume that processing delays at nodes are negligible. What is the minimum size in bits of the sequence number field?arrow_forward
- Skype is a well‑known VoIP system used not only for peer‑to‑peer conversations but also for audio and video conferencing involving three or more callers. Assume a video conference with a central server on Skype has N callers, and each caller generates a constant data stream at rate r bps. How many bits per second does the call initiator need to send? How many bits does each of other N‑1 callers need to send?arrow_forwardIn the generic SR protocol, the sender transmits a message as soon as it is available (if it is in the window) without waiting for an acknowledgment. Suppose now that we want an SR protocol that sends messages two at a time. That is, the sender will send a pair of messages and will send the next pair of messages only when it knows that both messages in the first pair have been received correctly.Supposethat the channel may lose messages but will not corrupt or reorder messages. i) Outline an error-control protocol for the unidirectional rdt of messages. ii) Give an FSM description of the sender and receiver. iii) Describe the format of the packets sent between sender and receiver and vice versa. iv) If you use any procedure calls other than those in SR protocol (for example, udt_send(), start_timer(), rdt_rcv(), and so on),clearly state their actions. v) Give an example (a timeline trace of sender and receiver) showing how your protocol recovers from a lost packetarrow_forward(a) Suppose a server S and client C are connected over the Internet. The one-way prop- agation delay from S to C is 50 ms. The maximum throughput between S and C is R = 200 Mbps. A browser on client C makes an HTTP request for a webpage on server S. The base HTML file is of size 500 KB and it references five objects, each of size 5 MB. Find the total response time for the client to receive the entire webpage using nonpersistent HTTP with up to two parallel connections. Assume that when two par- allel connections are active, the throughput for each connection is 40% of the maximum throughput R. (b) Suppose an application running on host ece.gmu.edu needs to resolve the domain name cs.vtech.edu. Draw a diagram (with labels) showing the sequence of queries/responses in a recursive DNS query to find the answer in a scenario where all levels of the DNS hierarchy are involved.arrow_forward
arrow_back_ios
SEE MORE QUESTIONS
arrow_forward_ios
Recommended textbooks for you
- Database System ConceptsComputer ScienceISBN:9780078022159Author:Abraham Silberschatz Professor, Henry F. Korth, S. SudarshanPublisher:McGraw-Hill EducationStarting Out with Python (4th Edition)Computer ScienceISBN:9780134444321Author:Tony GaddisPublisher:PEARSONDigital Fundamentals (11th Edition)Computer ScienceISBN:9780132737968Author:Thomas L. FloydPublisher:PEARSON
- C How to Program (8th Edition)Computer ScienceISBN:9780133976892Author:Paul J. Deitel, Harvey DeitelPublisher:PEARSONDatabase Systems: Design, Implementation, & Manag...Computer ScienceISBN:9781337627900Author:Carlos Coronel, Steven MorrisPublisher:Cengage LearningProgrammable Logic ControllersComputer ScienceISBN:9780073373843Author:Frank D. PetruzellaPublisher:McGraw-Hill Education
Database System Concepts
Computer Science
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:McGraw-Hill Education
Starting Out with Python (4th Edition)
Computer Science
ISBN:9780134444321
Author:Tony Gaddis
Publisher:PEARSON
Digital Fundamentals (11th Edition)
Computer Science
ISBN:9780132737968
Author:Thomas L. Floyd
Publisher:PEARSON
C How to Program (8th Edition)
Computer Science
ISBN:9780133976892
Author:Paul J. Deitel, Harvey Deitel
Publisher:PEARSON
Database Systems: Design, Implementation, & Manag...
Computer Science
ISBN:9781337627900
Author:Carlos Coronel, Steven Morris
Publisher:Cengage Learning
Programmable Logic Controllers
Computer Science
ISBN:9780073373843
Author:Frank D. Petruzella
Publisher:McGraw-Hill Education