Mechanical Engineering > GATE 2017 SET-2 > Queueing Theory
For a single server with Poisson arrival and exponential service time, the arrival rate is 12 per hour. Which one of the following service rates will provide a steady state finite queue length?
A
6 per hour
B
10 per hour
C
12 per hour
D
24 per hour

Explanation

Correct : d

Similar Questions

What is the worst-case time complexity of insertion in an AVL tree?
Question #23 Medium
Which operations on a binary search tree have O(h) complexity?
Question #31 Easy
Compare search complexities of sorted array vs balanced BST.
Question #47 Hard

Related Topics

Data Structures Binary Search Tree Time Complexity Algorithm Analysis Tree Algorithms Computer Science