We propose an analytically tractable approach for studying the transient behavior of multi-server queueing systems and feedforward networks with deterministic routing. We model the queueing primitives via polyhedral uncertainty sets inspired by the limit laws of probability. These uncertainty sets are characterized by parameters that control the degree of conservatism of the model. Assuming the...

The existing TCP/AQM model does not consider the impact of unresponsive flows to AQM algorithms, which contributes to about 70%~80% of the Internet flows. It is important to analysze the performance of AQM algorithms taking into account of the unresponsive flows. An extended GI/M/1/N queueing system is established by means of embedding the AQM mechanism into the standard GI/M/1/N queueing syste...

We present a new analytical tool for three queueing systems which have defied exact analysis so far: (i) the classical M/G/k multi-server system, (ii) queueing systems with fluctuating arrival and service rates, and (iii) the M/G/1 round-robin queue. We argue that rather than looking for exact expressions for the mean response time as a function of the job size distribution, a more fruitful app...

Queueing systems with server vacations (server’s performing non-queueing jobs) have been studied extensively since the late 70’s. A considerable number of works in this area were completed in the early 80’s and surveyed by Doshi in 1986. As an extension to the classical queueing system, allowing idle servers to work on non-queueing jobs makes the vacation models more applicable in a variety of ...

Eight synthetic and nine biogenetic surfactants were tested on their toxicity. Because of their possible application as oil dispersants against oil slicks on sea, the test organisms used were marine microorganisms (mixed and pure cultures of bacteria, microalgae, and protozoa). Bacterial growth was hardly effected or stimulated, whilst that of algae and flagellates was reduced. All substances t...

The modern queueing theory is one of the powerful tools for a quantitative and qualitative analysis of communication systems, computer networks, transportation systems, and many other technical systems. The paper is designated to the analysis of queueing systems, arising in the networks theory and communications theory (called open queueing network). The authors of this research in the sphere o...

This paper describes an extension to Layered Queueing Networks (LQN), a form of an extended queueing network used to investigate performance problems, to model passive resources such as counting semaphores and buffers. Layered queueing networks can be constructed directly, or from UML design models which incorporate the MARTE profile, either directly or via the Core Scenario Model. Layered Queu...

We consider a discrete-time infinite-capacity queueing system with a general uncorrelated arrival process, constant-length service times of multiple slots, multiple servers and a first-come-first-served queueing discipline. Under the assumption that the queueing system can reach a steady state, we first establish a relationship between the steady-state probability distributions of the system co...

In conventional coscheduling, or gang scheduling of parallel workloads a round-robin queueing algorithm is adopted and the length of scheduling slots is xed. However, the characteristics of parallel workloads can be quite di erent from sequential workloads. The system may not perform e ectively using the simple round-robin algorithm. In this paper we introduce a new queueing algorithm. Our new ...