Busy periods in M/M/∞ systems with heterogeneous servers

Authors:
Boris Tsybakov
Affiliations:
QUALCOMM Incorporated, San Diego, USA 92121-1714
Venue:
Queueing Systems: Theory and Applications
Year:
2006

Citing 6
Cited 0

A queueing analysis of hashing with lazy deletion

SIAM Journal on Computing
Linear birth and death models and associated Laguerre and Meixner polynomials

Journal of Approximation Theory
Introduction to queueing theory (2nd ed)

Introduction to queueing theory (2nd ed)
Probability of heavy traffic period in third generation CDMA mobile communication

Mobile Networks and Applications - Special issue on Mobile Multimedia Communications (MOMUC '99)
Busy Periods in a System with Heterogeneous Servers or Channels

Problems of Information Transmission
Theory, Volume 1, Queueing Systems

Theory, Volume 1, Queueing Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

This note gives a solution for the problem of finding theprobability density and probability distribution functions of theN-busy-period length for the M/M/∞ system where theservers are not necessarily the same. A solution in case of thesame servers was done in [3].