In our work we use queuing theory both for security (i.e. anonymity) and performance analysis. A well-known anonymity technique, the MIX method, which is the basis of most of today’s deployments, is the object of our investigation. We show shortcomings and problems in the MIX method and suggest possible workarounds. Our investigation reveals the level of security of MIX based systems and their ...

The mathematical model of an two-phases-service M/M/1/N queuing system with the server breakdown and multiple vacations was realized and established in the Graduate Employment Services system. Secondly, equations of steady-state probability were derived by applying the Markov process theory. Then, we obtained matrix form solution of steady-state probability by using blocked matrix method. Final...

Bacon’s Media Directory; Cabell’s Directories; DBLP; Google Scholar; INSPEC; JournalTOCs; MediaFinder; ProQuest Advanced Technologies & Aerospace Journals; ProQuest Computer Science Journals; ProQuest Illustrata: Technology; ProQuest SciTech Journals; ProQuest Technology Journals; SCOPUS; The Standard Periodical Directory; Ulrich’s Periodicals Directory Copyright The International Journal of Fu...

The purpose of this paper is to carry out queuing analysis to examine multi-stage production line performance to facilitate more realistic resource planning. It is one of a few such studies to improve the performance of multiproduct multi-stage production lines. This work aims to help managers in improving the efficiency, effectiveness and selecting the most suitable policy for assembly systems...

BACKGROUND Allocation of scarce resources presents an increasing challenge to hospital administrators and health policy makers. Intensive care units can present bottlenecks within busy hospitals, but their expansion is costly and difficult to gauge. Although mathematical tools have been suggested for determining the proper number of intensive care beds necessary to serve a given demand, the per...

In the context of computer networks, customers represent packets (or frames, and we shall not make the distinction here), and service represents the assignment of packets to communication links. For instance, if a link (server) has a bandwidth of B bps (service rate), then the service time for a packet (customer) assigned to that link will be L/B, where L is the size of the packet in bits (incl...

This paper presents an analytical model of the aircraft departure process at an airport. The modeling procedure includes the estimation of unimpeded taxi-out time distributions, and the development of a queuing model of the departure runway system based on the transient analysis of D(t)/Ek(t)/1 queuing systems. The parameters of the runway service process are estimated using operational data. U...

In our previous work, a highly scalable and faulttolerant network architecture, the Progressive Multi-hop Rotational Clustered (PMRC) structure, is proposed for constructing large-scale wireless sensor networks. Further, the overlapped scheme is proposed to solve the bottleneck problem in PMRC-based sensor networks. As buffer space is often scarce in sensor nodes, in this paper, we focus on stu...

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....

We study a repairable item inventory system under limited repair capacity and nonstationary Poisson demands, motivated by corrective maintenance of military equipment. Our goal is to minimize the cost of both spare and repair resource allocation. We propose an efficient analytical model that combines optimization modeling and queuing theory.