EBK COMPUTER NETWORKING
7th Edition
ISBN: 8220102955479
Author: Ross
Publisher: PEARSON
expand_more
expand_more
format_list_bulleted
Expert Solution & Answer
Chapter 9, Problem R8RQ
Explanation of Solution
Given:
Arrival rate of the bit =2 Mbps
Bits that are received = 8000000 bits
Value of 2 Mbps will be:
To Find the Initial Buffering delay:
The formula to determine the initial buffer delay is given below:
Expert Solution & Answer
Want to see the full answer?
Check out a sample textbook solution
Students have asked these similar questions
(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.
We compress the video with the pattern GoP (16 : 3) by using MPEG coding. Assume that the average compression ratios of frame I, frame P, and frame B are 1:5, 1:20, and 1:60, respectively. We put the compressed frames in 512 B packets and send them. The header size of each packet is 5% of the size of packet. Each packet contains information on one frame and its header, Each frame can be sent in multiple packets. Picture resolution is 196 × 144 for a video at 32 fps.
(a)What is the compression ratio in this pattern?
(b)What is the order of coding and transmitting frames in this pattern?
(c)If frame 6 is lost while transmission, which frames will be faulty?
(d)If frame 5 is lost while transmission, which frames will be faulty?
(e)If frame 17 is lost while transmission, which frames will be faulty?
(f)Find the size of uncompressed image frame?
(g)In how many packets can an I-frame be transmitted on average?
(h)In how many packets can an I-frame be transmitted on average?
(i)In how many…
Given a M/M/1 queue, which has packets arriving at a rate 2 packets/sec, an output link
rate R bps, and an average packet size of 1500 bytes, write down:
the expression for T, the average delay for a packet (i.e., from arrival till
completing transmission at the output).
b. the expression for the output utilization
c. the expression for average number of packets in the queue
d. the expression for average number of packets in the output NIC
Chapter 9 Solutions
EBK COMPUTER NETWORKING
Ch. 9 - Prob. R1RQCh. 9 - Prob. R2RQCh. 9 - Prob. R3RQCh. 9 - Prob. R4RQCh. 9 - Prob. R5RQCh. 9 - Prob. R6RQCh. 9 - Prob. R7RQCh. 9 - Prob. R8RQCh. 9 - Prob. R9RQCh. 9 - Prob. R10RQ
Ch. 9 - Prob. R11RQCh. 9 - Prob. R12RQCh. 9 - Prob. R13RQCh. 9 - Prob. P1PCh. 9 - Prob. P2PCh. 9 - Prob. P3PCh. 9 - Prob. P4PCh. 9 - Prob. P5PCh. 9 - Prob. P6PCh. 9 - Prob. P7PCh. 9 - Prob. P8PCh. 9 - Prob. P9PCh. 9 - Prob. P10PCh. 9 - Prob. P11PCh. 9 - Prob. P12PCh. 9 - Prob. P13PCh. 9 - Prob. P14PCh. 9 - Prob. P15PCh. 9 - Prob. P16PCh. 9 - Prob. P17PCh. 9 - Prob. P18PCh. 9 - Prob. P19PCh. 9 - Prob. P20PCh. 9 - Prob. P21PCh. 9 - Prob. P22P
Knowledge Booster
Similar questions
- 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_forwardConsider 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 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_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 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 answerarrow_forwardWhen HTTP streaming is being used, are the TCP receive buffer and the application buffer on the client both the same thing? If they are unable to speak with one another, it is unclear how they will behave toward one another.arrow_forward
- Given 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_forwardIn a network, at physical layer, the sender sends the data in continuous binary stream towards receiver, the receiver get confused about how many bits to combine in order to make the frame because the frames are not of fixed size. What you will suggest to make it work properly, suggest a solution that works on any given string. Elaborate your answer with the help of example.arrow_forwardConsider a network with a ring topology, link bandwidths of 100 Mbps, and propagation speed 2 × 108 m/s. What would the circumference of the loop be to exactly contain one 1500-byte packet, assuming nodes do not introduce delay? What would the circumference be if there was a node every 100 m, and each node introduced 10 bits of delay?arrow_forward
- Consider delivering voice through a direct connection network from Host A to Host B. (for example, Internet phone). Host A dynamically transforms analogue speech to a digital 64Kbps bit stream. The bits are subsequently organised into 128-byte packets by Host A. Between Host A and Host B, there is a single connection with a capacity of 10Mbps and a propagation latency of 50 msec. When Host A collects a packet, it immediately delivers it to Host B. When Host B gets a complete packet, it transforms its bits to an analogue signal. How long does it take for a bit to be produced (from the original analogue signal at Host A) and decoded (as a component of the analogue signal at Host B)? Disregard the time required for decoding.arrow_forwardPlease answer all partsarrow_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
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