A note on the discretization of Little's result

Authors:
Dieter Fiems;Herwig Bruneel
Affiliations:
SMACS Research Group, Vakgroep TELIN (TW07V), Ghent University, Sint-Pietersnieuwstraat 41, B-9000 Gent, Belgium;SMACS Research Group, Vakgroep TELIN (TW07V), Ghent University, Sint-Pietersnieuwstraat 41, B-9000 Gent, Belgium
Venue:
Operations Research Letters
Year:
2002

Citing 2
Cited 14

A review of L=&lgr;W and extensions

Queueing Systems: Theory and Applications
Rate conservation principle for discrete-time queues

Queueing Systems: Theory and Applications

Discrete-time queues with generally distributed service times and renewal-type server interruptions

Performance Evaluation
A queueing system with discrete autoregressive arrivals

Performance Evaluation
Controlling the delay trade-off between packet flows using multiple reserved places

Performance Evaluation
Delay versus energy consumption of the IEEE 802.16e sleep-mode mechanism

IEEE Transactions on Wireless Communications
Performance of a partially shared priority buffer with correlated arrivals

ITC20'07 Proceedings of the 20th international teletraffic conference on Managing traffic performance in converged networks
Time and space priority in a partially shared priority queue

Proceedings of the 5th International Conference on Queueing Theory and Network Applications
The preemptive repeat hybrid server interruption model

ASMTA'10 Proceedings of the 17th international conference on Analytical and stochastic modeling techniques and applications
Analysis of threshold-based batch-service queueing systems with batch arrivals and general service times

Performance Evaluation
Performance analysis of priority queueing systems in discrete time

Network performance engineering
Transform-domain analysis of packet delay in network nodes with QoS-aware scheduling

Network performance engineering
On the variances of system size and sojourn time in a discrete-time dar(1)/d/1 queue

Probability in the Engineering and Informational Sciences
Analysis of a two-class FCFS queueing system with interclass correlation

ASMTA'12 Proceedings of the 19th international conference on Analytical and Stochastic Modeling Techniques and Applications
Analysis of a discrete-time queue with geometrically distributed service capacities

ASMTA'12 Proceedings of the 19th international conference on Analytical and Stochastic Modeling Techniques and Applications
A discrete-time queueing model with a batch server operating under the minimum batch size rule

NEW2AN'07 Proceedings of the 7th international conference on Next Generation Teletraffic and Wired/Wireless Advanced Networking

Quantified Score

Hi-index	0.00

Visualization

Abstract

By considering discrete-time queueing systems as special cases of continuous-time queueing systems, we derive a discrete-time equivalent of Little's result. Our result is general in the sense that no assumptions are made regarding the exact details of arrival and departure processes within a discrete-time unit.