Open AccessBook
Queueing Systems - Vol. 1: Theory
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
Approximate analysis of open network of GE/GE/m/N queues with transfer blocking
TL;DR: An iterative procedure is used to converge on to the parameters of the GE distributions of the inter-arrival and service time distributions of an open queueing network with inter-Arrival times of external arrivals and service times at each queue having a generalized exponential (GE) distribution.
Journal ArticleDOI
Performance management of multiple access communication networks
TL;DR: The conceptual design presented offers a step forward to bridging the gap between management standards and users' demands for efficient network operations since most standards such as ISO and IEEE address only the architecture, services, and interfaces for network management.
Journal ArticleDOI
Blocking probabilities for multiple class batched Poisson arrivals to a shared resource
TL;DR: A variant of the Erlang blocking model, in which multiple classes of customers arrive as batched Poisson processes, with arbitrary batch size distributions, is investigated and the uniform asymptotic approximations are found to be very accurate, and substantially more so than the approxIMations for the overloaded, critically loaded and underloaded regimes.
Proceedings ArticleDOI
Delay related issues in integrated voice and data transmission: A review and some experimental work
TL;DR: Network delays as they apply to voice transmission, when applied to both voice and data messages, forms a basis for a relatively new and so-called “transparent” approach to network design.
Journal ArticleDOI
Representing workloads in GI/G/1 queues through the preemptive-resume LIFO queue discipline
TL;DR: A detailed sample-average analysis of GI/G/1 queues with the preemptive-resume LIFO (last-in-first-out) queue discipline yields relations that express the resulting averages in terms of basic characteristics within busy cycles, revealing the underlying structural “explanations” for many classical and somewhat mysterious results relating to queue lengths and/or delays.