Service reliability in a distributed queuing system can be assessed by means of the probability of successfully serving queued tasks in a heterogeneous network of nodes. Moreover, randomness in delays imposed by the communication medium adds to the uncertainties in the shared information among these faulty nodes, which complicates the dynamics of the queuing system. A novel approach based on st...

This paper proposes different queuing scenarios to avoid dropping of handoff and new calls in a cellular phone network, which is essential when the network has certain restrictions on the available frequencies. This limitation degrades the performance of the system and more sites are required to achieve the desired capacity and coverage. However, this leads to a higher percentage of call drops ...

a r t i c l e i n f o During the course of a construction project, there are many situations in which formation of waiting lines or queues is inevitable. The effect of resource delays in queues on the overall project completion time and cost has motivated researchers to employ simulation for analysis of queuing systems in order to identify the best operational strategies to reduce the time wast...

there are some problems with estimating the time required for the manufacturing process of products, especially when there is a variable serving time, like control stage. these problems will cause overestimation of process time. layout constraints, reworking constraints and inflexible product schedule in multi product lines need a precise planning to reduce volume in particular situation of lin...

The analysis of a preemptive priority queuing system with K ( ≥ 2 ) classes of jobs is undertaken. The system consists of a single processor representing a model of discrete dynamic scheduling problems associated with M k / Gk / 1 / ∞ endogenous priority queues. The processor schedules jobs which arrive according to a Markov arrival process. The process of service is arbitrary. With each job ar...

—Nowadays distributed computing approach has become very popular due to several advantages over the centralized computing approach as it also offers high performance computing at a very low cost. Each router implements some queuing mechanism for resources allocation in a best possible optimize manner and governs with packet transmission and buffer mechanism. In this paper, different types of qu...

The object oriented programming approach for priority service systems with orientation is developed. It provide fast evaluation of the characteristics.

As more and more workstations interconnected by fast local area networks become available, the popularity of heterogeneous processing increases. On the other hand, it is not easy to spread tasks on machines diiering in software availability, hardware resources, and work-loads. It is hard to keep track of all tasks and even harder to collect their results. In our contribution we present experien...

................................................................................................................................................... 9 CHAPTER 1: INTRODUCTION .................................................................................................................. 11 1.1 BACKGROUND .............................................................................................