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
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
Consider 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.
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
- Consider 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 = 25 Mb/s, and the transmission rate of the webserver is Rs = 14 Mb/s. If clients transmit on average 1500 HTTP requests per second and the proxy server has a cache hit rate of 70%, what is the traffic intensity at the link connecting the proxy server to the Internet? (provide your answer to 2 significant figures)arrow_forwardGiven a single link of length 800 Km and transmission speed of 49 Mbps between a client and a web server. Assume the client web browser sends a small Http request (packet) of 40 bytes to the web server at the other end. Data travels through the links at the speed of (2 x 108 meters/sec) and Queuing delay = processing delay =0. The propagation delay in microseconds is The transmission delay in microseconds of the packet of size 40 bytes is Calculate the Round-trip time (RTT) in microseconds if a upon receiving the packet the web server sends a response packet with the same size.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_forward
- Assume 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_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_forwardSuppose host A is sending a large file to host B over a TCP connection. The two end hosts are 10 msec apart (20 msec RTT) connected by a 1 Gbps link. Assume that they are using a packet size of 1000 bytes to transmit the file. For simplicity, ignore ack packets. At least how big would the window size (in packets) have to be for the channel utilization to be greater than 80%?arrow_forward
- Make sure to answer all parts correctly. Attached is image of the questionarrow_forwardIn a network, two systems are connected and the distance between the system is 5000 km. The propagation speed of the medium is 2 x 107 m/s. The bandwidth of the network is 500 MBps. If the average packet size is 108 bits and the network is used to its full capacity. The minimum size of the sequence number field is n bits. The processing delay at nodes is 0 ms. What is the value of n in case of Go-Back-N sliding window protocol?arrow_forwardConsider the scenario below where 4 TCP senders are connected to 4 receivers. The servers transmit to the receiving hosts at the fastest rate possible (i.e., at the rate at which the bottleneck link between a server and its destination is operating at 100% utilization, and is fairly shared among the connections passing through that link). R =1 Gbps and Rc is 300 Mbps and Rs is 400 Mbps. And that all four senders have data to send, What is the minimum value of Re that will ensure that the connections to Host-1 and Host-2 are not bottlenecked at links with capacity Rc or Re?arrow_forward
- Computer networking subject rcs817arrow_forwardTo ensure the quality of service, especially for multiple applications, regulating the rate at which packets are sent to the network is an important strategy. The leaky bucket is just one of such mechanisms. A flow of packets is said to conform to the leaky bucket specification (r, b), where r is the average rate and b is the burst rate, if the number of packets arriving at the leaky bucket is less than r*t + b in every time interval of t. What is the implication of that? What will happen if the number of packets arriving at the leaky bucket is equal to or greater than r*t + b?arrow_forwardCalculate the total time required to transfer a 1000-KB file in the following cases, assuming an RTT of 50 ms, a packet size of 1 KBdata, and an initial 2 RTT handshake before data is sent: The bandwidth is 1.5 Mbps, and data packets can be sent continuously. The bandwidth is 1.5 Mbps, but after we finish sending eachdata packet we must wait one RTT before sending the next.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