26,555 research outputs found
Busy period analysis of the level dependent PH/PH/1/K queue
In this paper, we study the transient behavior of a level dependent single server queuing system with a waiting room of finite size during the busy period. The focus is on the level dependent PH/PH/1/K queue. We derive in closed form the joint transform of the length of the busy period, the number of customers served during the busy period, and the number of losses during the busy period. We differentiate between two types of losses: the overflow losses that are due to a full queue and the losses due to an admission controller. For the M/PH/1/K, M/PH/1/K under a threshold policy, and PH/M/1/K queues, we determine simple expressions for their joint transforms
Comparative Study Of Congestion Control Techniques In High Speed Networks
Congestion in network occurs due to exceed in aggregate demand as compared to
the accessible capacity of the resources. Network congestion will increase as
network speed increases and new effective congestion control methods are
needed, especially to handle bursty traffic of todays very high speed networks.
Since late 90s numerous schemes i.e. [1]...[10] etc. have been proposed. This
paper concentrates on comparative study of the different congestion control
schemes based on some key performance metrics. An effort has been made to judge
the performance of Maximum Entropy (ME) based solution for a steady state
GE/GE/1/N censored queues with partial buffer sharing scheme against these key
performance metrics.Comment: 10 pages IEEE format, International Journal of Computer Science and
Information Security, IJCSIS November 2009, ISSN 1947 5500,
http://sites.google.com/site/ijcsis
- …