We consider a storage model that can be either interpreted as a certain queueing model with dependence between a service request and the subsequent interarrival time, or as a fluid production/inventory model with a two-state random environment. We establish a direct link between the workload distributions· of the queueing model and the production/inventory model, and we present a detailed analy...

A single server queueing system 'With constant Poisson input is considered and the partiel elimination of the station's idle fraction is envisaged by intermittent close-do'Wn and setup. The rule pertaining to the dismantling and re-establishing of the service staticn-the management doctrine-is based on the instantaneous size of the queue, but these processes are assumed to consume time. Operati...

In this paper, a queueing system is formulated, analyzed and applied for the study of the queueing behavior of a DQDB station. At rst, an appropriate process is deened to capture the station's perception of the state of the distributed global queue (DQDB network) and a queueing model is formulated. In the sequel, a general queueing system is considered; the packet service time requirement is as...

Queueing models with disasters can be used to evaluate the impact of a breakdown or system reset in service facility. In this paper, we consider discrete-time single-server queueing general independent arrivals and times study effect occurrence on behavior. Disasters occur independently from time slot according Bernoulli process result simultaneous removal all customers system. General probabil...

Using deterministic (sample-path) analysis, we generalize and extend fundamental properties of systems with “stationary deterministic flows” as introduced by Gelenbe (1983) and Gelenbe and Finkel (1987). Primarily, we provide conditions for stability and instability for general queueing models, and focus attention on multichannel queueing systems with servers that work at different rates. Stabi...

A model of computer system security operation is developed based on the fork-join queueing network formalism. We introduce a security operation performance measure, and show how it may be used to performance evaluation of actual systems. Key-Words: computer system security, security attack, security vulnerability, performance evaluation, fork-join queueing networks.

This article describes queueing systems and queueing networks which are successfully used for performance analysis of different systems such as computer, communications, transportation networks and manufacturing. It incorporates classical Markovian systems with exponential service times and a Poisson arrival process, and queueing systems with individual service. Oscillating queueing systems and...

This paper presents a new approach to real-time system scheduling. The approach, called real-time queueing theory, includes customer timing requirements into queueing models. With real-time queueing models, one is able to explicitly characterize the dynamic behavior of the customer lead-tame profile process where lead-time = deadline minus current time. In spite of the injinite dimensionality o...

{ This paper evaluates the use of packet scheduling to provide multiple service classes for bursty data traac. In particular, we study the performance of the weighted fair queueing algorithm by simulating various scenarios in a packet cellular wireless network similar to an EDGE system. The results show that, due to the burstiness of data traac, traditional work-conserving packet scheduling alg...

We investigate stability of scheduling policies in queueing systems. To this day no algorithmic characterization exists for checking stability of a given policy in a given queueing system. In this paper we introduce a certain generalized priority policy and prove that the stability of this policy is algorithmically undecidable. We also prove that stability of a homogeneous random walk in d+ is ...