ssume that 2 packets arrive simultaneously to a switch at which one other packet is halfway done being transmitted on the outbound link and two other packets are waiting to be transmitted. Each packets is of length N = 1600 bytes and the outbound link has transmission rate R = 1.28 Mbps. Assume that the queuing buffer is big enough to hold at least five packets. What is the average queuing delay for the arriving 2 packets?

ssume that 2 packets arrive simultaneously to a switch at which one other packet is halfway done being transmitted on the outbound link and two other packets are waiting to be transmitted. Each packets is of length N = 1600 bytes and the outbound link has transmission rate R = 1.28 Mbps. Assume that the queuing buffer is big enough to hold at least five packets. What is the average queuing delay for the arriving 2 packets?

Operations Research : Applications and Algorithms

4th Edition

ISBN:9780534380588

Author:Wayne L. Winston

Publisher:Wayne L. Winston

Chapter20: Queuing Theory

Section20.10: Exponential Queues In Series And Open Queuing Networks

Problem 8P

See similar textbooks

Similar questions

a. Suppose N packets arrive simultaneously to a link at which no packets are currently being transmitted or queued. Each packet is of length L and the link has transmission rate R. What is the average queuing delay for the N packets? b. Now suppose that N such packets arrive to the link every LN/R seconds. What is the average queuing delay of a packet?
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
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,200 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?
TCP 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.
TCP 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.
Consider 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?
In a data communication system, several messages that arrive at a node are bundled into a packet before they are transmitted over the network. Assume that the messages arrive at the node according to a Poisson process with rate 30 messages per minute (0.5 per second). Five messages are used to form a packet.What is the mean time until a packet is formed, that is, until five messages arrive at the node?
Consider 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?
Consider two hosts, A and B that are connected by a transmissions link of2.1 Mbps. Assume that packets are of length 2.0 Kb (Kilobits) and the length of the link is 100Km. a. What is the propagation delay from A to B, that is the amount of time from when the first bit of the packet is transmitted at A, until it is received at B? b. What is the transmission time of the packet at A (the time from when the first bit of the packet is sent into the wire and the time at which the last bit is sent into the wire). c. Suppose now that that length of the link is doubled. What is the propagation delay from A to B now and what is the transmission time? d. Now suppose that node C is connected to node B also by a 2 Mbps, 100 Km link. How long does it take from when the first bit is transmitted by A to when the last bit is received at C, assuming B operates in a store-and -forward manner?
Problem 2. Consider a packet of L bits that is sent over a path of Q links (i.e., a source and destination connected by a sequence of (Q-1) routers or switches). Each link transmits at R bps. This packet is the only traffic transmitted by the network (so there are no queuing delays) and the propagation delay and processing delay at routers are negligible. How long does it take to send this packet from source to destination if the network is: a) a packet-switched datagram network b) a circuit-switched network. Assume that bandwidth of R bps on each link is sliced into five individual circuits, so that cach circuit receives (R/5) bandwidth. Also assume that the circuit setup time is t,.. Give an expression for the number of links Q such that the packet delivery from the sender to the receiver will be faster over the packet-switched network, and the expression for the number of links Q such that the circuit-switched network will be faster.
Eight data terminals statistically share the capacity of an outgoing link. Traffic is combined from the eight terminals and then served first-come first served. An (M/M/1) queue with infinite buffer is assumed. Find the expected number of packets in the system and the expected waiting time in the following cases: a) A terminal generates a packet every 10 seconds, the link speed is 1024 bits/sec, and packet length = 512 bits. b) Repeat (a) using finite buffer k=10 and compare your results to the infinite buffer case A;=1/10 =1024 bits/512 bits = 2 8 terminals Out 1=(1/10)*8 = 0.8 1
Consider 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?