EBK COMPUTER NETWORKING
7th Edition
ISBN: 8220102955479
Author: Ross
Publisher: PEARSON
expand_more
expand_more
format_list_bulleted
Question
Chapter 2, Problem P22P
Program Plan Intro
Given Information:
For distributing a file,
F= 15 Gbits = 15 * 1024 Mbits
The upload rate of server (us = 30 Mbps)
Download rate (di) = 2 Mbps
The formula for calculating the minimum distribution time for client-server distribution is:
The formula for calculating the minimum distribution time for P2P distribution is:
Expert Solution & Answer
Want to see the full answer?
Check out a sample textbook solution
Students have asked these similar questions
1.
Consider that two hosts A and B are connected via a direct link with
transmission rate of 30 Mbps. Host A wants to send a file of 1 MB to Host B. The distance
between Host A and Host B is 100 Km and the propagation speed over the link is 2*10
m/s. The processing delay at Host A is 20 us.
A
В
a.
What is the propagation delay over the link from Host A to Host B?
b.
What is the transmission delay if the file is sent as one large packet?
с.
What is the total time needed for the file to arrive to Host B?
Consider a local network with a 1 Gbps access link to the Internet. Hosts on this network are
accessing resources with an average size of 2 MB from a distant server at an average rate of 50
requests per second.
a.
What is the link utilization of the access link to the internet?
b.
Suppose these requests were to go through a caching proxy server. What would the
link utilization to the internet be if half of all requests were served from the cache of the proxy
server?
с.
resources never being needed for example.) Would this still provide any advantages to the end
user? Would there be any disadvantages to the end user?
Suppose the proxy server could not serve any content from cache (due to the same
Calculate the total time required to transfer a 1.5-MB file in the following cases, assuming an RTT of 80 ms, a packet size of 1 KBdata, and an initial 2 RTT handshake before data is sent:
The link allows infinitely fast transmit, but limits bandwidth such that only 20 packets can be sent per RTT.
The bandwidth is infinite, but during the first RTT we can send one packet, during the second RTT we can send two packets, during the third we can send four, etc.
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
- Consider two nodes (A, B) sharing the same broadcast channel of speed R =10Mbps. The propagation delay between the two nodes is 1ms. Consider a node C in the middle between both nodes. If A starts at time t=0 its transmission of a packet to node C, at what time can node B start transmitting its packet to a node D in the network in order for the two packets not to collide? Assume both nodes have each a packet of length L = 1000Bytes. О а. 1.3ms O b. 1ms О с. 0.5ms d. 1.8msarrow_forwardConsider distributing a file of F = 20 Gbits to N = 100 peers. The server has an upload rate of us = 40Mbps, and each peer has a download rate of di = 5 Mbps and an upload rate of ui = 500 Kbps. i) Estimate the distribution time in a client-server architecture. ii) Estimate the distribution time in a peer-to-peer architecture.arrow_forwardCopy 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 multiplexingarrow_forward
- A file of size 20 KiloBytes is transmitted to a destination over a 10 Megabit/s network link (1 Mega = 10^6, 1 Kilo = 10^3, 1 byte = 8 bits). The propagation delay to the destination is 40 milliseconds (1 milli = 10^−3). Assume the queueing delay encountered by packets of the file is negligible. What is the total delay (in milliseconds) for the file to get to its destination?arrow_forwardConsider the following illustration of a proxy server, Client Client Client Transmission rate R Proxy Cache Server Transmission rate: R₂ Internet Web Server Assume that HTTP messages containing objects are 1 KB and that HTTP messages not containing objects can be ignored as they do not produce a significant delay. Also, assume the transmission rate of the proxy server, Rp = 20 Mb/s, and the transmission rate of the webserver is Rs = 24 Mb/s. If clients transmit on average 1100 HTTP requests per second and the proxy server has a cache hit rate of 30%, what is the traffic intensity at the link connecting the proxy server to the Internet? (provide your answer to 2 significant figures)arrow_forwardSuppose two hosts, A and B, are separated by 10,000 kilometers and are connected by a direct link of R = 1 Mbps. Suppose the propagation speed over the link is 2.5 × 108 meters/sec. a. What is the propagation delay dprop in seconds? b. Consider sending a file of 400,000 bits from Host A to Host B. Suppose the file is sent continuously as one large message. What is the maximum number of bits that will be in the link at any given time? c. Suppose we downgrade our link to a capacity of R = 500 kbps. Let x denote the size of a digital photo (selfie) being sent over the link. Every minute, the user on host A takes a selfie and sends it to host B. What is the minimum value of x for the link to be continuously transmitting? Express your answer in Megabitsarrow_forward
- Suppose that R = 1 Gbps and Rc is 300 Mbps and Rs is 200 Mbps. Assuming that the servers are sending at their maximum rate possible, enter the link utilization of the shared link, whose rate is R, below. Enter your answer as a decimal, of the form 1.00 (if the utilization is 1, or 0.xx if the utilization is less than 1, rounded to the closest xx).arrow_forwardLet host A sends a file a size of 2200 byte to host B through routers R1, R2, R3, R4 and R5 respectively. Each packet contains 110 bytes of header information along with the user data. Assume that the bandwidth of each link is 106 B/s. File is split into 20 equal parts, and these packets are transmitted from A to B. Consider only transmission time and ignore processing, queuing and propagation delays also no error in transmission. What is the time taken by host A to send the complete file to host B?arrow_forwardAssume a client is connected to the server and has already received an HTML webpage. It reads the webpage, and it now needs to get 3 new files, File A is 5 MB file B is 1 MB and file C is 1 KB. The client requests the files in the order A B C. The link has an RTT (round trip time) of 0.5 seconds and a bandwidth of 8 Mb/s(Megabits per second) (or 1 Megabyte per second). The client can reuse the open connection if the protocol allows it to. For all parts of this problem ignore header sizes, and start the timer when the client sends How long does it take to get file C under HTTP 0? How long does it take to get file C under HTTP 1 (assume the browser does not support pipeling)? How long does it take to get file C under HTTP 2 assuming a frame size of 1 KB and no server push? What event would make HTTP 3 faster than HTTP 2 for this use case (ignore TLS)?arrow_forward
- Suppose Host A wants to send a large file to Host B. The path from Host A to Host B has three links, of rates R1=500 kbps, R2=2 Mbps, and R3=1 Mbps a. Assuming no other traffic in the network, what is the throughput for the file transfer? b. Suppose the file is 4 million bytes. Dividing the file size by the throughput, roughly how long will it take to transfer the file to Host B? c. Repeat (a) and (b), but now with R reduced to 100 kbps.arrow_forwardConsider a client connecting to a web server via a router as shown in Fig.Q2. Client A sends a request to the server to retrieve a 7.5 Mbytes file. Given that the segment size is 50 Kbytes, the round trip time (RTT) between the server and client is 10 ms, the initial slow-start threshold is 16 and the client's buffer always has a storage space of 1 Mbytes. Assume that TCP Reno is used, there is no loss during transmission and the headers of protocols are ignored. 400 Mbps 200 Mbps 400 Mbps Link a Link b Link c Client Web Server Fig.Q2 (a) Describe how the value of sending window changes as a function of time (in units of RTT) during the whole connection time. 2.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
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 Education
Starting Out with Python (4th Edition)Computer ScienceISBN:9780134444321Author:Tony GaddisPublisher:PEARSON
Digital Fundamentals (11th Edition)Computer ScienceISBN:9780132737968Author:Thomas L. FloydPublisher:PEARSON
C How to Program (8th Edition)Computer ScienceISBN:9780133976892Author:Paul J. Deitel, Harvey DeitelPublisher:PEARSON
Database Systems: Design, Implementation, & Manag...Computer ScienceISBN:9781337627900Author:Carlos Coronel, Steven MorrisPublisher:Cengage Learning
Programmable 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