2010 IEEE International Symposium on Information Theory 2010
DOI: 10.1109/isit.2010.5513303
|View full text |Cite
|
Sign up to set email alerts
|

Network capacity region of multi-queue multi-server queueing system with time varying connectivities

Abstract: Network capacity region of multi-queue multi-server queueing system with random ON-OFF connectivities and stationary arrival processes is derived in this paper. Specifically, the necessary and sufficient conditions for the stability of the system are derived under general arrival processes with finite first and second moments. In the case of stationary arrival processes, these conditions establish the network capacity region of the system. It is also shown that AS/LCQ (Any Server/Longest Connected Queue) polic… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
34
0

Year Published

2011
2011
2016
2016

Publication Types

Select...
4
3

Relationship

1
6

Authors

Journals

citations
Cited by 17 publications
(34 citation statements)
references
References 16 publications
(59 reference statements)
0
34
0
Order By: Relevance
“…This method is used to prove the stability of many policies [7,10,23,24]. This method is used to prove the stability of many policies [7,10,23,24].…”
Section: Lyapynov Drift Analysis Of the Stat Policymentioning
confidence: 99%
“…This method is used to prove the stability of many policies [7,10,23,24]. This method is used to prove the stability of many policies [7,10,23,24].…”
Section: Lyapynov Drift Analysis Of the Stat Policymentioning
confidence: 99%
“…Traffic offloading between carriages can be conceptually reduced to the distributed load balancing problem for multiqueue multi-server system with the time varying service [14]. To simplify, we consider a corresponding discrete time queuing system with finite size queues.…”
Section: Distributed Load Balancing Mechanismmentioning
confidence: 99%
“…Our work resembles those concerned with designing stable schedulers for multi-queue multiservers systems [10]. An example system is IEEE 802.16e [12], where queues and servers correspond to mobile stations and sub-carriers respectively.…”
Section: Related Workmentioning
confidence: 99%
“…This means a scheduler may implement a policy whereby mobile stations are assigned servers/channels according to their queue length and channel condition. Halabian et al [10] proposed and proved the stability of a Any Server/Longest Connected Queue (AS/LCQ) policy. They preferentially assign servers to the most backlogged queue.…”
Section: Related Workmentioning
confidence: 99%