Suppose users in a network share a 4 Mbps communication link and each user requires 125 kbps when transmitting. However, each user transmits only 20 percent of the time. Suppose there are 30 users and packet switching is employed. Find the probability that at any given, there are 17 or more users transmitting simultaneously.

Suppose users in a network share a 4 Mbps communication link and each user requires 125 kbps when transmitting. However, each user transmits only 20 percent of the time. Suppose there are 30 users and packet switching is employed. Find the probability that at any given, there are 17 or more users transmitting simultaneously.

Operations Research : Applications and Algorithms

4th Edition

ISBN:9780534380588

Author:Wayne L. Winston

Publisher:Wayne L. Winston

Chapter20: Queuing Theory

Section20.4: The M/m/1/gd/∞/∞ Queuing System And The Queuing Formula L = Λw

Problem 7P

See similar textbooks

Similar questions

A router receives packets from a group of users transmitting in a multiple access system by time division (TDMA), in which everyone uses the same frequency and transmit in instants of time many different. Assuming the packets arrive accordingly with the Poisson process at the rate of one packet every 4 ms (milliseconds) and assuming that the instants of Packet transmission time is exponentially distributed with a mean of 3 ms. Given this scenario, calculate:a)The average of packets on the system.(b) The average total system delay. (c) What percentage increase in the arrival rate results in a doubling of the delay average total calculated in part (a)?
A given ad hoc network consists of 100 nodes, and the mobility of the nodes is such that every second, two existing radio connections are broken, while two new radio links are established. Assuming each node is connected to exactly four adjacent nodes, find the total number of communications links in the network.
Assume that an end-to-end communications system is made up of three networks with date rate in Mbps ρ1, ρ2, and ρ3, respectively. Ignoring the other delay components, what is the total end-to-end delay to transmit a packet size of λ?
Pure ALOHA is used in a network with Poisson distributed traffic. The success probability, as defined in this given with P(successful access) = 0.05.a) How large is the normalised channel access rate G, and the normalised success rate S (alsosometimes called throughput)?b) From now, the maximum data rate C is considered with C = 96 kbit/s = 96·103 bit/s. Allpackets that are transmitted have a size of 64 byte and every sender in the network sends3 packets per minute on average. What is the average access rate g1 of a single sender?What is the average access rate g and the normalised access rate G on the channel if there are 50, 500, and 5000 senders connected?c) With the same values of part (b) above, what are the normalised success rates S50, S500, S500in the case of 50, 500, and 5000 senders?
Suppose nodes A, B, C and D are competing for access to a channel using slotted ALOHA. Assume each node has an infinite number of packets to send. Each node attempts to transmit in each slot with probability p = 0.6. The first slot is numbered slot 1, the second slot is numbered slot 2, and so on. a) What is the probability that node A succeeds for the first time in slot 5? b)What is the probability that some node (either A, B, C or D) succeeds in slot 4? c) What is the probability that the first success occurs in slot 3? d) What is the efficiency of this four-node system?
For the experiment, let’s assume that the concrete distance between Canterbury and London is 60miles (or ca. 100km) and our pigeons fly at a speed of 60 miles per hour (or ca. 100km/h). (ii) With current technology and considering the weight a pigeon can carry, we are able to send 2TB of data on a USB stick with a pigeon. On a 4G mobile network, we can likely send about 2MB/s. Which of the two transport media would have the shorter message transmission time for a 2TB message? (We again assume pigeons to be perfectly reliable).Briefly explain your reasoning.
A data channel at 5 Gbps is shared by two users. Assume that each user is transmitting at 2.5Gbps data rate continuously. Each user only transmits only 30% of the time. (a) If circuit switching is used, how many users can be supported? (b) If packet switching is used, would there be queuing delay to accommodate these two users? If a third identical user is added will there be a queuing delay? (c) What is the probability that a user is sending data? (d) Now assume three users under packet switching. Compute the probability that at any given time all three are transmitting at the same time. What is the fraction of time when the queue is growing?
Assume each user has a 500 kilobit per second demand and uses the network only 25% of the time. How many users with a probability of at least 0.9 can we multiplex onto an 8 Mbps connection using packet switching? What benefit does statistical multiplexing provide in this case?
Assume that each user demands 500 kilobits per second and is only active 25% of the time. How many people can we multiplex onto an 8 Mbps connection using packet switching with a probability of at least 0.9? What is the statistical multiplexing advantage in this scenario?
Consider a packet of length L that begins at end system A and travels over three links to a destination end system. These three links are connected by two packet switches. Let d, s , and R denote the length, propagation speed, and the transmission rate of link i, for i=1,2,3 . The packet switch delays each packet by d . Assuming no queuing delays, in terms of d, s , R, , and L, what is the total end-to-end delay for the packet? Suppose now the packet is 1,500 bytes, the propagation speed on all three links is 2.5⋅108m/s the transmission rates of all three links are 2 Mbps, the packet switch processing delay is 3 msec, the length of the first link is 5,000 km, the length of the second link is 4,000 km, and the length of the last link is 1,000 km. For these values, what is the end-to-end delay?
This problem will compare circuit switching and packet switching. Consider a single link with capacity 60 Mbps. Each user is active 20% of the time. When active, each user transmits at 1 Mbps half of the time and at 3 Mbps half of the time. (a) Suppose the network uses circuit switching. How many users can be supported if you want to guarantee that the blocking probability is zero? In parts (b)-(d), suppose the network uses packet switching and that there are 200 users. (b) Suppose that 20 users are simultaneously active. What is the traffic intensity (i.e., load)? (c) Write an expression for the probability that at least 30 users are simultaneously active. (d) If 30 users are simultaneously active, write an expression for the probability that the total instantaneous transmission rate of these 30 users exceeds the link capacity.
Computer Networks Consider a packet of length L that begins at end system A and travels over three links to a destination end system. These three links are connected by two packet switches. Let d, s, and R denotes the length, propagation speed, and the transmission rate of link i, for i=1,2,3 . The packet switch delays each packet by d . Assuming no queuing delays, in terms of d, s , R, (i=1,2,3), and L, what is the total end-to-end delay for the packet? Suppose now the packet is 1,500 bytes, and the propagation speed on all three links are 3125km/sec, 10000 km/sec, and 3333km/sec respectively. The transmission rates of all three links are 2 Mbps, the packet switch processing delay is 3 msec, the length of the first link is 5,000 km, the length of the second link is 4,000 km, and the length of the last link is 1,000 km. For these values, what is the end-to-end delay? In the above problem, suppose R1=R2=R3=R and dproc=0. Further, suppose the packet switch does not store-and-forward…