This paper introduces an analytical method for approximating the performance of a two-class priority M/M/1 system. The system is fully non-preemptive. More specifically, the prioritized class-1 jobs are real-time and served with the non-preemptive earliest-deadline-first (EDF) policy, but despite their priority cannot preempt any non real-time class-2 job. The waiting class-2 jobs can only be s...

The reference class problem in probability theory and the multiple inheritances (extensions) problem in non-monotonic logics can be referred to as special cases of con icting beliefs. The current solution accepted in the two domains is the speci city priority principle. By analyzing an example, several factors (ignored by the principle) are found to be relevant to the priority of a reference cl...

In this article we analyze the system occupancy of a discrete time queue of packets, where each packet is either of class-1 or of class-2, with class-1 receiving higher service priority than class-2. Such a queue is naturally formed in many computer and digital communications systems, e.g. multiuser computers, multiprocessing computers, file servers, ATM multiplexers, and ATM switches, when the...

Abstract. This paper discusses five different ways to approximate the loss rate in a fundamental two class priority system, where each class has its own finite capacity buffer, as well as an exact approach. We identify the type of error one can expect by assuming that one, or both buffers are of infinite size. Furthermore, we investigate whether asymptotic based results can achieve the same lev...

An admission control algorithm for a multimedia server is responsible for determining if a new request can be accepted without violating the QoS requirements of the existing requests in the system. Most admission control algorithms treat every request uniformly and hence optimize the system performance by maximizing the number of admitted and served requests. In practice, requests might have di...

BACKGROUND Ki67 labeling index (Ki67 LI), the percentage Ki67 immunoreactive cells, is a measure of tumor proliferation, with important clinical relevance in breast cancer, and it is extremely important to standardize its evaluation. AIM To test the efficacy of computer assisted image analysis (CAIA) applied to completely digitized slides and to assess its feasibility in routine practice and ...

We consider a queue with finite buffer where the buffer size limits the amount of work that can be stored in the queue. The arrival process is a Poisson or a Markov modulated Poisson process. The service times (packet lengths) are iid with a general distribution. Our queue models the systems in the Internet more realistically than the usual M/GI/1/K queue which restricts the number of packets i...

We consider a model of a service system with finite and shared processing capacity and two service classes. Users arrive at the system and select either a high-priority service level where the service requests are processed at a fixed rate, or a low-priority service level where service rate is subject to degradation when the system is congested. A fixed price-per-connection is charged for each ...