EBK COMPUTER NETWORKING
7th Edition
ISBN: 8220102955479
Author: Ross
Publisher: PEARSON
expand_more
expand_more
format_list_bulleted
Expert Solution & Answer
Chapter 1, Problem P5P
a.
Explanation of Solution
- Cars propagate the tollbooths of length 75 km at a speed of 100km/hr and the tollbooth takes 12 seconds to service each car. There are 10 cars which take 12 × 10 = 120 seconds or 2 minutes to cross a tollbooth.
- At first tollbooth, the propagation delay of the cars is 45 minutes and reaches the second tollbooth after 2 + 45 = 47 minutes.
- The process repeats with second and third tollbooths and also takes 120 seconds or 2 minutes time for service.
Finally, the total propagation delay is calculated using following formula
b.
Explanation of Solution
- Cars propagate the tollbooths of length 75 km at a speed of 100km/hr and the tollbooth takes 12 seconds to service each car. There are 8 cars which take 12 × 8 = 96 seconds to cross a tollbooth.
- At first tollbooth, the propagation delay of the cars is 45 minutes and reaches the second tollbooth after 46 minutes and 36 seconds.
- The process repeats with second and third tollbooths and also takes 96 seconds time for service.
Finally, the total propagation delay is calculated using following formula
Expert Solution & Answer
Want to see the full answer?
Check out a sample textbook solution
Students have asked these similar questions
Give unique answer only. Do not use AI or plagiarized answer.
Assume that there is a shared connection (for example, an Ethernet bus) with a speed of 1 Mbps. How much
time (in microseconds) is required to send a frame with a length of 1000 bits over this link?
Consider a client and a server connected through
one router. Assume the router can start
transmitting an incoming packet after receiving its
first 0.6 Mbits instead of the whole packet.
Suppose that the transmission rate of each link is
6 Mb/s and that the client transmits one packet
with a size of 2 Mbits to the server. Assume the
propagation, processing, and queuing delays are
negligible. Answer the following questions (use up
to 4 significant digits if needed; e.g., yy.xxxx):
What is the end-to-end delay?3D
seconds
What is the end-to-end delay if there are 2 routers
between the client and the server?=
seconds
Chapter 1 Solutions
EBK COMPUTER NETWORKING
Ch. 1 - What is the difference between a host and an end...Ch. 1 - The word protocol is often used to describe...Ch. 1 - Why are standards important for protocols?Ch. 1 - Prob. R4RQCh. 1 - Prob. R5RQCh. 1 - Prob. R6RQCh. 1 - Prob. R7RQCh. 1 - Prob. R8RQCh. 1 - Prob. R9RQCh. 1 - Prob. R10RQ
Ch. 1 - Prob. R11RQCh. 1 - What advantage does a circuit-switched network...Ch. 1 - Prob. R13RQCh. 1 - Prob. R14RQCh. 1 - Prob. R15RQCh. 1 - Prob. R16RQCh. 1 - Prob. R17RQCh. 1 - Prob. R18RQCh. 1 - Suppose Host A wants to send a large file to Host...Ch. 1 - Prob. R20RQCh. 1 - Prob. R21RQCh. 1 - Prob. R22RQCh. 1 - What are the five layers in the Internet protocol...Ch. 1 - Prob. R24RQCh. 1 - Prob. R25RQCh. 1 - Prob. R26RQCh. 1 - Prob. R27RQCh. 1 - Prob. R28RQCh. 1 - Equation 1.1 gives a formula for the end-to-end...Ch. 1 - Prob. P3PCh. 1 - Prob. P4PCh. 1 - Prob. P5PCh. 1 - This elementary problem begins to explore...Ch. 1 - Prob. P7PCh. 1 - Suppose users share a 3 Mbps link. Also suppose...Ch. 1 - Prob. P9PCh. 1 - Prob. P10PCh. 1 - In the above problem, suppose R1 = R2 = R3 = R and...Ch. 1 - Prob. P13PCh. 1 - Consider the queuing delay in a router buffer. Let...Ch. 1 - Prob. P15PCh. 1 - Prob. P16PCh. 1 - Prob. P17PCh. 1 - Prob. P20PCh. 1 - Prob. P21PCh. 1 - Prob. P22PCh. 1 - Prob. P23PCh. 1 - Prob. P24PCh. 1 - Prob. P25PCh. 1 - Prob. P26PCh. 1 - Prob. P27PCh. 1 - Prob. P28PCh. 1 - Prob. P29PCh. 1 - Prob. P30PCh. 1 - Prob. P31PCh. 1 - Prob. P32PCh. 1 - Prob. P33PCh. 1 - Prob. P34P
Knowledge Booster
Similar questions
- show step by steparrow_forwardA signal in a network has a propagation velocity of 1.77x10" m/s and a delay of 4.3 us introduced by each repeater. If the round trip delay for two computers at either end of a link that includes three repeaters is 52.92 us, calculate the length of this link? Express your answer in kilometers.arrow_forwardConsider a router buffer preceding an outbound link. In this problem, you will use Little’s formula, a famous formula from queuing theory. Let N denote the average number of packets in the buffer plus the packet being transmitted. Let a denote the rate of packets arriving at the link. Let d denote the average total delay (i.e., the queuing delay plus the transmission delay) experienced by a packet. Little’s formula is N=a⋅d . Suppose that on average, the buffer contains 10 packets, and the average packet queuing delay is 10 msec. The link’s transmission rate is 100 packets/sec. Using Little’s formula, what is the average packet arrival rate, assuming there is no packet loss?arrow_forward
- Suppose that KJ sends 3596 back-to-back packets, with each packet composed of 14,000 bits, to TA over 5 links (shown below). Suppose that the transmission rate of each link is 70,000 bits/sec (bps). Consider the routers to be store-and-forward routers. In such a scenario, find the endto- end delay of sending all the packets to TA (i.e., the time needed for the last bit of the last packet to arrive at TA since KJ starts transmitting the first bit of the first packet). Note, consider only the transmission delay that occurs in sending packets in your analysis. Show the steps used for derivation in detail. 70,000 bps 70,000 bps 70,000 bps 70,000 bps 70,000 bps KJ Router 1 Router 2 Router 3 Router 4 ТАarrow_forwardLet a denote the rate of packets arriving at a link in packets/sec, and let μ denote the link’s transmission rate in packets/sec. Based on the formula for the total delay (i.e., the queuing delay plus the transmission delay) derived in the previous problem, derive a formula for the total delay in terms of a and μ.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 two hosts S and R connected directly by a link. A link has a transmission speed of 107 bits/sec. It uses data packets of size 400 bytes. Data needed to transmitted is 400 bytes. Length of the link is 600 km and the propagation speed are 3 × 108 meter per second. T is the transmission delay and P is the propagation delay. The propagation delay in millisecond and transmission delay in microsecond respectively arearrow_forwardComputer Sciencearrow_forwardConsider a sender having an infinite number of frames to send, which we index as 0, 1, 2, .... Assume the transmission delay of each frame is 2t, the ACK transmission time is t, the propagation delay is 3t and symmetric on both directions, and the timeout value is T = 8 starting from the end of frame transmission onto the link. The first frame is sent out at time 0. Show Transcribed Text 3 Ĉ E. Explain what will happen if the sequence number space has exactly the same number of sequence numbers as the number of allowed maximum number of outstanding frames, e.g., when N = W = 10, and the sequence numbers available are only 0-9.arrow_forward
- 2. Consider a bus-topology network with five stations. A reservation access method is used. Each station has infinite data to transmit. Each reservation slot has 10 microseconds (note that 1 microsecond = 106 second). For each station, one data transmission sends 1000 bits. The transmission rate over the medium is 10 Mbps. For a station, which is its throughput (in unit "Mbps")?arrow_forwardData Communicationarrow_forwardConsider a datagram network in which a packet travels through two switches S1 and S2 from source to destination. Packet experiences wait at each switch before it is forwarded. Transmission time, propagation time and wait time at each node is 3 ms, 1.5 ms, and 0.25 ms respectively. Find the total delay.arrow_forward
arrow_back_ios
SEE MORE QUESTIONS
arrow_forward_ios
Recommended textbooks for you
Operations Research : Applications and AlgorithmsComputer ScienceISBN:9780534380588Author:Wayne L. WinstonPublisher:Brooks Cole
Systems ArchitectureComputer ScienceISBN:9781305080195Author:Stephen D. BurdPublisher:Cengage Learning
Operations Research : Applications and Algorithms
Computer Science
ISBN:9780534380588
Author:Wayne L. Winston
Publisher:Brooks Cole
Systems Architecture
Computer Science
ISBN:9781305080195
Author:Stephen D. Burd
Publisher:Cengage Learning