EBK COMPUTER NETWORKING
7th Edition
ISBN: 8220102955479
Author: Ross
Publisher: PEARSON
expand_more
expand_more
format_list_bulleted
Textbook Question
Chapter 1, Problem P11P
In the above problem, suppose R1 = R2 = R3 = R and dproc = 0. Further suppose the packet switch does not store-and-forward packets but instead immediately transmits each bit it receives before waiting for the entire packet to arrive. What is the end-to-end delay?
Expert Solution & Answer
Learn your wayIncludes step-by-step video
schedule06:23
Students have asked these similar questions
Consider the Go-Back-N (GBN) and Selective Repeat (SR) protocols with a sender window size of 4 and a sequence number range of 1024. For each of these protocols, describe what happens for the following cases:a) The first packet in the sender window size is lost before reaching the destination.b) All transmitted packets reached the destination except the third one.c) Only the first and last packets in the sender window size reached the destination.d) Only the ACKs of the first and last packets, in the sender window size, reached the destination.
Consider 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.
A packet switch receives a packet and determines the outbound link to which the packet should be forwarded. When the packet arrives, one other packet is halfway done being transmitted on this outbound link and four other packets are waiting to be transmitted. Packets are transmitted in order of arrival. Suppose all packets are 1,500 bytes and the link rate is 2 Mbps. What is the queuing delay for the packet? More generally, what is the queuing delay when all packets have length L, the transmission rate is R, x bits of the currently-being-transmitted packet have been transmitted, and n packets are already in the queue?
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
Additional Engineering Textbook Solutions
Find more solutions based on key concepts
The smallest unsigned integer that can be represented in a 16-hit memory location is 02.
Prelude to Programming
Suppose the class SportsCar is a derived class of a class Automobile, and suppose also that the class Automobil...
Java: An Introduction to Problem Solving and Programming (7th Edition)
Use Mohrs circle to determine the normal stress and shear stress acting on the inclined plane AB.
Statics and Mechanics of Materials (5th Edition)
Repeat Exercise 1 for a credit card account instead of a credit card. An account represents the charges and pay...
Java: An Introduction to Problem Solving and Programming (8th Edition)
The moment at supports A and B and the bending moment diagram for the beam.
Structural Analysis (10th Edition)
Write a program to print the value of EOF.
C Programming Language
Knowledge Booster
Similar questions
- 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 NICarrow_forwardto achieve the lowest latency a message is split into 24 packets. every packet has 15 bytes of header. there are 11 hops between the source and the destination. Assume all devices are store-and-forward and it takes 1 ns to transmit 1 byte of data. what is the size of the message?arrow_forwardConsider the Go-Back-N (GBN) and Selective Repeat (SR) protocols with a sender window size of 4 and a sequence number range of 1024. For each of these protocols, describe what happens for the following cases: The first packet in the sender window size is lost before reaching the destination. All transmitted packets reached the destination except the third one. Only the first and last packets in the sender window size reached the destination. Only the ACKs of the first and last packets, in the sender window size, reached the destination.arrow_forward
- Consider sending real-time data from Host A to Host B over a packet-switched network. Host A takes an 8-bit measurement every millisecond, and Host A collects these into 64-byte packets. There is one link between Hosts A and B; its transmission rate is 5 Mbps, its propagation delay is 2 × 108 meters/sec, and its length is 3 km. As soon as Host A gathers a packet, it sends the packet to Host B. How much time elapses from the time that Host A begins to take the first measurement in a packet until the entire packet reaches Host B?arrow_forwardSuppose that Bob sends N back-to-back packets (numbered 1 to N) to Alice over two links (shown below) with the link between Bob's computer and the router having a transmission rate of R bits/sec (bps), and the link between the router and Alice's computer having a transmission rate of 2R bps. Bob Alice R bps 2R bps Router Find a formula, in terms of N, L and R, that characterizes the end-to-end delay of sending the N packets to Alice (i.e., the time needed for the last bit of the Nth packet to arrive at Alice since Bob starts transmitting the first bit of the first packet). Consider only the transmission delay that occurs in sending packets in your analysis. Show your work in detail. Also, using your formula, N = 800 packets, L find the end-to-end delay when 400 bits, and R = 100 bps.arrow_forwardConsider the Go-Back-N (GBN) and Selective Repeat (SR) protocols with a sender window size of 4 and a sequence number range of 1024. For each of these protocols, describe what happens if only the ACKs of the first and last packets, in the sender window size, reached the destination.arrow_forward
- Draw a space-time diagram similar to Figure 3.22 of textbook for the following problem: Sender is sending 10 packets to receiver. Stop after 7 packets are accepted by receiver. Protocol Used: Go-Back-N Sliding Window size = 6 Timeout interval =1RTT Assume transmission time of a packet = 1/4 RTT Assume Packet 1 is lost, then ACK 2 is lost, and then ACK 6 is lost Note: The sender starts a timer when base = nextseqnum, i.e. at beginning of your example. Then when an ACK is received, if base is not nextseqnum, the timer is started.arrow_forwardFor the sake of this example, let us assume that a packet is being sent from its origin to an address at the other end of the network through a fixed path. The following are other reasons for lateness: How long do the majority of total delays last, and what proportion of total delays are time-dependent?arrow_forwardA link has a transmission speed of 1010 bits/sec. It uses data packets of size 2000 bytes each. The efficiency of the stop-and-wait protocol in this setup is exactly 30%. Determine the value of the one-way propagation delay in milliseconds. Assume that the acknowledgement has negligibletransmission delay, and its propagation delay is the same as the data propagation delay. Consider the same transmission speed and packet size for Go back-N protocol with window size 8 and find the channel utilization.arrow_forward
- A sender with window size (W=3) is connected to a selective repeat receiver by a link with bandwidth =106 bytes/second and propagation delay of 0.25 msec. The receiver sends Positive ACK for correctly received packets. For each packet sent, the sender sets a timer with time out value of 5 msec. On receiving an ack for a packet, the timer for that packet is cancelled. If the timer expires, that packet is retransmitted immediately. Assume that the sender sends packets 1, 2, and 3 (at t=0, packet size =1000 Bytes) and packet 2 is lost. NO other packet is lost. Under this scheme , at what time in msec would all the packets been received at the receiver.arrow_forwardTCP congestion control example. Consider the figure below, where a TCP sender sends 8 TCP segments at t = 1, 2, 3, 4, 5, 6, 7, 8. Suppose the initial value of the sequence number is 0 and every segment sent to the receiver each contains 100 bytes. The delay between the sender and receiver is 5 time units, and so the first segment arrives at the receiver at t = 6. The ACKs sent by the receiver at t = 6, 7, 8, 10, 11, 12 are shown. The TCP segments (if any) sent by the sender at t = 11, 13, 15, 16, 17, 18 are not shown. The segment sent at t=4 is lost, as is the ACK segment sent at t=7. TCP sender t=1 T t=2 t=3 t=4+ t=5- t=6+ t=11 t=12 t=13 t=14 t=15 t=16 t=17 t=18 I data segment data segment data segment data segment data segment data segment data segment data segment ACK ACK ACK ACK ACK ACK Ty A A V V htt TCP receiver t=6 t=7 t=8 t=9 t=10 t=11 t=12 t=13 What does the sender do at t=17? You can assume for this question that no timeouts have occurred.arrow_forwardTCP congestion control example. Consider the figure below, where a TCP sender sends 8 TCP segments at t = 1, 2, 3, 4, 5, 6, 7, 8. Suppose the initial value of the sequence number is 0 and every segment sent to the receiver each contains 100 bytes. The delay between the sender and receiver is 5 time units, and so the first segment arrives at the receiver at t = 6. The ACKS sent by the receiver at t = 6, 7, 8, 10, 11, 12 are shown. The TCP segments (if any) sent by the sender att = 11, 13, 15, 16, 17, 18 are not shown. The segment sent at t=4 is lost, as is the ACK segment sent at t=7. t=1 T data segment t=2+ data segment data segment-- t=3 TCP sender TCP receiver t=4+ t=5+ data segment - data segment t=6+ t36 data segment t=7 data segment t=8 data segment t=9 ACK + t=10 k -- ACK t=11 t=11 t=12 t=12 t=13 t=13 t=14 ACK -ACK ACK t=15 t=16 t=17 ACK t=18 What does the sender do at t=17? You can assume for this question that no timeouts have occurred.arrow_forward
arrow_back_ios
SEE MORE QUESTIONS
arrow_forward_ios
Recommended textbooks for you
- Principles of Information Security (MindTap Cours...Computer ScienceISBN:9781337102063Author:Michael E. Whitman, Herbert J. MattordPublisher:Cengage LearningOperations Research : Applications and AlgorithmsComputer ScienceISBN:9780534380588Author:Wayne L. WinstonPublisher:Brooks ColeSystems ArchitectureComputer ScienceISBN:9781305080195Author:Stephen D. BurdPublisher:Cengage Learning
Principles of Information Security (MindTap Cours...
Computer Science
ISBN:9781337102063
Author:Michael E. Whitman, Herbert J. Mattord
Publisher: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