2007
DOI: 10.1007/s10626-007-0021-4
|View full text |Cite
|
Sign up to set email alerts
|

Stability of Parallel Queueing Systems with Coupled Service Rates

Abstract: This paper considers a parallel system of queues fed by independent arrival streams, where the service rate of each queue depends on the number of customers in all of the queues. Necessary and sufficient conditions for the stability of the system are derived, based on stochastic monotonicity and marginal drift properties of multiclass birth and death processes. These conditions yield a sharp characterization of stability for systems where the service rate of each queue is decreasing in the number of customers … Show more

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
80
0

Year Published

2008
2008
2023
2023

Publication Types

Select...
4
3
1

Relationship

0
8

Authors

Journals

citations
Cited by 74 publications
(82 citation statements)
references
References 25 publications
0
80
0
Order By: Relevance
“…These probabilities are unknown in general, and so is the stability region. The results of [26] have been recently generalized to more general systems of interacting queues [8]. The only previous explicit stability condition for arbitrary N is given in [2]; unfortunately, to obtain this condition, the author has to assume that the arrival processes of the different users are correlated, which is unrealistic in practice.…”
Section: B Related Workmentioning
confidence: 99%
“…These probabilities are unknown in general, and so is the stability region. The results of [26] have been recently generalized to more general systems of interacting queues [8]. The only previous explicit stability condition for arbitrary N is given in [2]; unfortunately, to obtain this condition, the author has to assume that the arrival processes of the different users are correlated, which is unrealistic in practice.…”
Section: B Related Workmentioning
confidence: 99%
“…These papers study the stability of networks where the rate region reduces to a single point depending on the set of classes with active flows. Some other papers aim at providing exact stability conditions: in [9], [20], [29], a recursive (with respect to the number of flow classes) stability condition is given for a particular class of networks, including those studied in [3], [25]. Unfortunately, this kind of recursive formula often proves difficult to exploit: the stability condition of networks with classes of flows depends on that of the network with classes and also on more detailed characterizations such as the probability that a given class has no active flows.…”
Section: B Related Workmentioning
confidence: 99%
“…We consider the same function defined in (9), but given the assumption on , the sign of cannot be guaranteed. We write as defined in (11) and (12) (6), the trajectory of also converges as .…”
Section: B Proof Of Theoremmentioning
confidence: 99%
“…The model discussed in this chapter however does not fall under the set of allocation functions, as the overall capacity of the network is not constant due to interference. For a network of parallel servers with coupled service rates, necessary and sufficient conditions for stability are derived in [BJL08]. Stability and performance of networks where the service rate depends on the network state is also analyzed in [VLK01], where transmissions over links with a fixed capacity are considered.…”
Section: Literature and Contributionmentioning
confidence: 99%
“…Our work is related to [BJL08] where parallel systems with coupled service rates are studied (a special case of our model in which there is no forwarding) in which the service rate is a function of the number of packets in the other queue.…”
Section: Introductionmentioning
confidence: 99%