scispace - formally typeset
Open AccessBook

Queueing Systems - Vol. 1: Theory

Leonard Kleinrock
Reads0
Chats0
About: 
The article was published on 2013-01-01 and is currently open access. It has received 540 citations till now. The article focuses on the topics: Layered queueing network & Bulk queue.

read more

Citations
More filters
Proceedings ArticleDOI

An approach to characterizing response time based on queue-length probabilities in queueing systems

Kin K. Leung
TL;DR: A technique is proposed for characterizing the response (or waiting) times in terms of probability distribution function or percentiles, given the set of queue-length probabilities, which makes use of the Laguerre functions to approximate the distribution functions.
Proceedings ArticleDOI

Teletraffic/transmission performance of multi-hop networks using hybrid-store-and-forward

Gerardo Castanon, +2 more
TL;DR: A hybrid semi-transparent store-and-forward node architecture performs well, in terms of throughput, propagation delay and BER, and suggests that the proposed hybrid scheme may have good potential for future multimedia networks.
Posted Content

SEH: Size Estimate Hedging for Single-Server Queues

Maryam Akbari-Moghaddam, +1 more
- 30 Dec 2020 - 
TL;DR: In this paper, a simple heuristic, size estimate hedging (SEH), is proposed for scheduling a single-server system when exact information about the jobs' processing times is not available.
Journal ArticleDOI

Computing steady-state queueing-time distributions of single-server queues: GI X / M /1

Mohan L. Chaudhry, +2 more
TL;DR: This paper presents a computationally efficient method to find the steady-state distributions of actual queueing times of the first customer, as well as of a randomly selected customer, of an arrival group for the queueing systemGIX/M/1, and hence theQueueing-time distribution of a customer for the systemGI/EX/1.
Journal ArticleDOI

Sojourn time in a queue with clustered periodic arrivals

Dai Inoue, +1 more
- 01 Jun 2003 - 
TL;DR: The overall mean waiting time in the queue with clustered periodic arrivals is compared with those in the corresponding queues with dispersed periodic arrivals and periodic batch arrivals, and the eciency of dispersing cells is quantitatively shown by simple formulas.