2. Consider a network node represented by an M/M/1 model. (a) Find the probability that the number of packets in the node is less than a given number k, P[K(t) < k]. This is normally used to estimate the threshold time of the network node to reach a certain load. (b) If we require that P[K(t) < 20] = 0.9904, determine the switching service rate if the arrival rate to this node is 300 packets per second.

2. Consider a network node represented by an M/M/1 model. (a) Find the probability that the number of packets in the node is less than a given number k, P[K(t) < k]. This is normally used to estimate the threshold time of the network node to reach a certain load. (b) If we require that P[K(t) < 20] = 0.9904, determine the switching service rate if the arrival rate to this node is 300 packets per second.

Operations Research : Applications and Algorithms

4th Edition

ISBN:9780534380588

Author:Wayne L. Winston

Publisher:Wayne L. Winston

Chapter9: Integer Programming

Section9.6: Solving Combinatorial Optimization Problems By The Branch-and-bound Method

Problem 3P

See similar textbooks

Similar questions

Given a M/M/1 queue, if the average inter-arrival time is Z seconds, the average packet service time is P, find: a. The probability an arriving packet has to wait in the queue b. The variance (o}) of the inter-arrival time The variance (o) of the packet service time d. The average number of packets in the system (i.e., in the queue + in the NIC) c.
Question 16 Packets arrive to a router according to a Poisson process with rate X=6/sec. The router can only process 1 packet at a time and there is a buffer with a capacity of 4 packets. If a packet arrives and finds no space in the buffer, then it will be discarded. The average time taken to process a packet is 0.125 sec (exponentially distributed). What queueing model describes this scenario (M/M/1, M/M/k, M/M/1/k or M/M/k/k)? What is the service rate? What is the system capacity? What is the probability to have an empty system? What is the probability to have a full system? What is the average number of packets in the system? What fraction of packets are lost?
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?
IN PYTHON Given the following six-node wide area network for which the numbers attached to the links are a measure of the “delay” in using that link (e.g., some lines could be more heavily used than others and therefore have a longer wait time), answer the following question. What is the shortest path from node A to node D, where shortest path is defined as the path with the smallest sum of the delays on each individual link? Explain exactly how you went about finding that path.
3. In an M/M/2 communication node, packets arrive according to a Poisson process of rate 18 packets per second. The system has two parallel crossbar switches, and each switch spends an exponentially distributed amount of time with mean 100 ms to process a packet. (a) Find the probability that an arriving packet must wait to be processed. (b) Find the mean number of packets in the system. (c) Find the mean time a packet spends in the system. (d) Find the probability that more than 50 packets are in the system.
Copy from chegg == Report! A communication line capable of transmitting at a rate of 50 Kbits/secwill be used to accommodate 10 sessions each generating Poisson traffic at a rate 150 packets/min.Packet length are exponentially distributed with mean 1000 bits. For each session, find the averagenumber of packets in queue, the average number in the system, and the average delay per packetwhen the line is allocated to the sessions by using: i) 10 equal-capacity time-division multiplexed channels;ii) statistical multiplexing
Computer Networks Problem In the CSMA/CD protocol, the network adapter waits K-512 bit times after a collision, where K is drawn randomly. For K=20, how long does the adapter wait until returning to Step 2 for a 10 Mbps broadcast channel?
Please dont copy your answer from other sourses i.e chegg A communication line capable of transmitting at a rate of 50 Kbits/secwill be used to accommodate 10 sessions each generating Poisson traffic at a rate 150 packets/min.Packet length are exponentially distributed with mean 1000 bits. For each session, find the averagenumber of packets in queue, the average number in the system, and the average delay per packetwhen the line is allocated to the sessions by using: i) 10 equal-capacity time-division multiplexed channels;ii) statistical multiplexing.
12. Consider the network shown below with the current measured delays between two nodes. A B 3 5 8 E F a. List all possible simple paths between C and D; simple paths are those that do not repeat a node (i.e., no loops). b. Which path provides the shortest delay?
A slotted ALOHA system with N nodes. Each node transmits a frame in a slot with probability 0.26. If we want the efficiency of the link to be greater than 0.3, what is the minimum and maximum number of nodes?
Provided graph G=(N,E), in which N denotes the collection of routers and E, the collection of links. Calculate the least costly route from node U to all other nodes using Dijkstra's link-state routing mechanism, and then display the final lowest graph from U?
We observed that (n-1)D is the maximal delay in queuing if the fabric of switching is n times faster than the input line rate. Suppose all packets have the same duration, n packets are sent to n entry ports at the same time, and all n packets are sent to separate exit ports. What is the maximum delay for a memory packet?