2000
DOI: 10.1016/s0166-5316(99)00067-x
|View full text |Cite
|
Sign up to set email alerts
|

Waiting time, busy periods and output models of a server analyzed via Wiener–Hopf factorization

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

1
19
0

Year Published

2002
2002
2009
2009

Publication Types

Select...
3
2
1

Relationship

0
6

Authors

Journals

citations
Cited by 25 publications
(20 citation statements)
references
References 32 publications
1
19
0
Order By: Relevance
“…In the literature, only a few papers address the departure process when the arrival process has correlation in time, e.g., [10]. Moreover, for non-Bernoulli and non-Poisson arrivals, it is known that the departure process is correlated with the queue length and arrival process [11], which results in cumbersome expressions [10,12] that prohibit a scalable e2e analysis. Closed-form solutions for the delay of wireless regular line networks with a single source (like Fig.…”
Section: Previous Workmentioning
confidence: 99%
See 2 more Smart Citations
“…In the literature, only a few papers address the departure process when the arrival process has correlation in time, e.g., [10]. Moreover, for non-Bernoulli and non-Poisson arrivals, it is known that the departure process is correlated with the queue length and arrival process [11], which results in cumbersome expressions [10,12] that prohibit a scalable e2e analysis. Closed-form solutions for the delay of wireless regular line networks with a single source (like Fig.…”
Section: Previous Workmentioning
confidence: 99%
“…So, an ALOHA node can also be modeled as GI/Geo/1 although the arrival process characterization is different from TDMA. We use a decomposition approach to analyze the tandem queueing network that decomposes the network into single nodes in isolation [19,20]. The e2e analysis is based on the single node analysis and thus requires not only the node delay performance but also node departure process characterization.…”
Section: Our Contributionsmentioning
confidence: 99%
See 1 more Smart Citation
“…Sengupta [13] provides a matrix-exponential solution to an SMP/PH/1 queue. Haβlinger [5] analyzes a discrete time SMP/G/1 queue using Wiener-Hopf factorization approach. To the best of our knowledge, there are few studies on multiple-server queues with SMP arrival.…”
Section: Introductionmentioning
confidence: 99%
“…We use semi-Markov processes (SMPs) to model data arrival [12] as they are able to represent this correlation. An analysis of such models is possible via matrix-analytical [21] and factorization techniques [6,9,15,22]. The former are considered numerically more stable, whereas the latter are more efficient in terms of computation time and memory requirements.…”
mentioning
confidence: 99%