Abstract
Queuing systems with an infinite variance of service time are considered. The average waiting time in such systems is equal to infinity at a stationary regime. We analyze the efficiency of introducing of absolute priorities with infinite number of priority classes determined by the special axis marking on intervals for possible values of service time. It is stated that queues in systems become normalized, i.e. the average queue length become finite, when using regular marking. Furthermore, request loss probabilities radically decrease when buffer size is finite. More efficient marking – exponential marking – is proposed for practical purposes in networks with fractal traffic. The optimization problems of regular and exponential markings are solved.
Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
