paper provides a nontechnicul introduction to queuing network concepts, a short introduction to results of research into analytical modeling methodology, and u set of simple but typical examples that illustrute the upplication of that methodology to problems of computer perfbrmunce. The objectives of this paper are to introduce concepts of the theory of queuing networks, to describe an APL prog...

priority queues have a great importance in the study of computer communication networks in which different types of traffic require different quality of service standards. the discrete-time non-preemptive priority queuing model with priority jumps is proposed in this paper. on the basis of probability generating functions mean system contents and mean queuing delay characteristics are obtained....

Ribosome queuing is a fundamental phenomenon suggested to be related to topics such as genome evolution, synthetic biology, gene expression regulation, intracellular biophysics, and more. However, this phenomenon hasn't been quantified yet at a genomic level. Nevertheless, methodologies for studying translation (e.g. ribosome footprints) are usually calibrated to capture only single ribosome pr...

-The performance in terms of reliability of multi-server computer networks motivates this paper. The probability limit theorem is derived on the virtual waiting time of job in nodes in a multi-server open queueing network and applied to a reliability model for multi-server computer networks where we relate the time of failure of a multi-server computer network to the system parameters. Key-Word...

ATM traac is complex but only simple statistical models are amenable to mathematical analysis. We discuss a class of queuing models which is wide enough to provide models which can reeect the features of real traac, but which is simple enough to be analytically tractable, and review the bounds on the queue-length distribution that have been obtained. We use them to obtain bounds on QoS paramete...

Recent development of peer-to-peer (P2P) services (e.g. streaming, file sharing, and storage) systems introduces a new type of queue systems not studied before. In these new systems, both job and server arrive and depart randomly. The server dynamics may or may not correlate to the job dynamics. Motivated by these observations, we develop queuing models for P2P service systems and a taxonomy fo...

Multi-class closed queuing networks with synchronization stations find applications in analytical models of assembly systems and production systems operating under pull control policies. These queuing networks are hard to analyze exactly and therefore approximation methods must be used for performance evaluation. In this research we propose a new efficient approach based on parametric decomposi...

In this article, modeling in queuing systems with heavy traffic customer flows is reviewed. Key areas include their limiting distributions, asymptotic behaviors, modeling issues and applications. Heavy traffic flows are features of queuing in modern communications, transportation and computer systems today. Initially, we reviewed the onset of asymptotic modeling for heavy traffic single server ...

A queuing system, is a dynamical system whose state evolves in time by the occurrence of events at possibly irregular time intervals. Placetransitions Petri nets (commonly called Petri nets) are a graphical and mathematical modeling tool applicable to queuing systems in order to represent its states evolution. Timed Petri nets are an extension of Petri nets, where now the timing at which the st...