2010 IEEE International Conference on Communications 2010
DOI: 10.1109/icc.2010.5502624
|View full text |Cite
|
Sign up to set email alerts
|

Session Delay in File Server Output Buffers with General Session Lengths

Abstract: Abstract-In this paper, we analyze the delay incurred by session-based traffic in the output buffer of a file server.Users can start and end sessions during which they are active and download information from the file server. Per time slot, each active user downloads a random but strictly positive number of information packets. Each session lasts for a random, yet again, strictly positive number of slots.We model the file server output buffer as a discrete-time infinite-capacity queueing system and we present … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2012
2012
2012
2012

Publication Types

Select...
2

Relationship

0
2

Authors

Journals

citations
Cited by 2 publications
(1 citation statement)
references
References 12 publications
0
1
0
Order By: Relevance
“…Arrival models of interest include, amongst others, finite-state-space Markovian arrival models like the discrete batch Markovian arrival model [1] as well as Markovian arrival models with an infinite but structured state-space. Prime examples of the latter class include M/G/∞-input -often referred to as train arrival or session models, see [3,5,13] -as well as autoregressive arrival models [7,8,10]. Most often, performance analysis of queues with finite-state-space Markovian arrivals relies on a computational approach: efficient algorithms are devised to calculate the performance measures of interest [4].…”
Section: Introductionmentioning
confidence: 99%
“…Arrival models of interest include, amongst others, finite-state-space Markovian arrival models like the discrete batch Markovian arrival model [1] as well as Markovian arrival models with an infinite but structured state-space. Prime examples of the latter class include M/G/∞-input -often referred to as train arrival or session models, see [3,5,13] -as well as autoregressive arrival models [7,8,10]. Most often, performance analysis of queues with finite-state-space Markovian arrivals relies on a computational approach: efficient algorithms are devised to calculate the performance measures of interest [4].…”
Section: Introductionmentioning
confidence: 99%