Busy Periods in a System with Heterogeneous Servers or Channels

Authors:
B. S. Tsybakov
Affiliations:
Aff1 Aff2
Venue:
Problems of Information Transmission
Year:
2005

Citing 5
Cited 1

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)
Theory, Volume 1, Queueing Systems

Theory, Volume 1, Queueing Systems

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

Queueing Systems: Theory and Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider a multiple communication channel system having channels with different transmission rates. We give a solution for the problem (of interest for such a system) of finding the probability densities and probability distribution functions of the N-busy period length. A solution in the case of identical channels (servers) was given in [1].