Analysis of shared finite storage in a computer network node environment under general traffic conditions

F Kamoun, L Kleinrock - IEEE Transactions on communications, 1980 - ieeexplore.ieee.org
Nodal storage limitations in a store and forward computer network lead to blocking; this
results in degradation of network performance due to the loss or retransmission of blocked …

Queuing networks with multiple closed chains: theory and computational algorithms

M Reiser, H Kobayashi - IBM journal of Research and …, 1975 - ieeexplore.ieee.org
In this paper a recent result of Baskett, Chandy, Muntz, and Palacios is generalized to the
case in which customer transitions are characterized by more than one closed Markov chain …

Computational algorithms for product form queueing networks

KM Chandy, CH Sauer - Communications of the ACM, 1980 - dl.acm.org
In the last two decades there has been special interest in queueing networks with a product
form solution. These have been widely used as models of computer systems and …

Теория сетей массового обслуживания и ее приложения к анализу информационно-вычислительных систем

ГП Башарин, АЛ Толмачев - Итоги науки и техники. Серия «Теория …, 1983 - mathnet.ru
В настоящем обзоре отражены основные результаты по теории сетей массового
обслуживания и некоторые ее применения для анализа производительности …

An overview of PANACEA, a software package for analyzing Markovian queueing networks

KG Ramakrishnan, D Mitra - The Bell System Technical Journal, 1982 - ieeexplore.ieee.org
PANACEA is a software package that significantly extends the range of Markovian queueing
networks that are computationally tractable. It solves multi-class closed, open, and mixed …

Modeling and measurement techniques in packet communication networks

FA Tobagi, M Gerla, RW Peebles… - Proceedings of the …, 1978 - ieeexplore.ieee.org
Considerable advances in the modeling and measurements of packet-switched networks
have been made since this concept emerged in the late sixties. In this paper, we first review …

Multidimensional residues, generating functions, and their application to queueing networks

A Bertozzi, J McKenna - SIAM review, 1993 - SIAM
This paper has two goals: the first is to introduce applied mathematicians to a new technique
involving several complex variable residue theory. This is a multidimensional extension of a …

Integral representations and asymptotic expansions for closed Markovian queueing networks: normal usage

J McKenna, D Mitra - Bell System Technical Journal, 1982 - Wiley Online Library
In designing a computer system, it is vitally important to be able to predict the performance of
the system. Often, quantities such as throughput, processor utilization, and response time …

A class of closed Markovian queuing networks: integral representations, asymptotic expansions, and generalizations

J McKenna, D Mitra… - Bell System Technical …, 1981 - Wiley Online Library
Closed Markovian networks of queues that have the product form in their stationary
probability distributions are useful in the performance evaluation and design of computer …

Context-aware lattice based filler approach for key word spotting in handwritten documents

AH Toselli, J Puigcerver, E Vidal - 2015 13th International …, 2015 - ieeexplore.ieee.org
The so-called filler or garbage Hidden Markov Models (HMM-Filler) are among the most
widely used models for lexicon-free, query by string key word spotting (KWS) in the fields of …