Queuing models are important tools for studying the performance of complex systems, but despite the substantial queuing theory literature, it is often necessary to use approximations in the case the system is nonmarkovian. Phase type distribution is by now indispensable tool in creation of queuing system models. The purpose of this paper is to suggest a method and software for evaluating queuin...

1 Computer Engineering Department, UET Taxila, Electronic Engineering Department, MAJU Islamabad, Computer Engineering Department, UET Taxila Pakistan [[email protected], [email protected], [email protected]] ABSTRACT: In this paper we proposed user satisfaction architecture for packed-switched services in 3 generation cellular networks for end-to-end Quality of Service (QoS) pro...

Using a queuing approach to describe a shared memory parallel computer system, it can be considered as a parallel computer system with a shared single ready queue. This can depict a single queue parallel server queuing model. Some models that are based on probability density function have been used to model the performance of the queuing system. This paper uses recursive models to evaluate the ...

In this paper, we present the results of a study priority multi-server queuing system with heterogeneous customers arriving according to marked Markovian arrival process (MMAP), phase-type service times (PH), and queue finite capacity. Priority traffic classes differ in PH distributions time probability joining queue, which depends on current length queue. If is full, customer does not enter sy...

Preemption is a possible way to ensure emergency traffic’s priority in wireless network. But a pure preemption policy can be especially harsh to low priority calls. A way to improve this is introducing a queuing mechanism, which means putting preempted calls into a queue so that they can resume when channels become available, as long as they do not give up due to waiting too long in the queue. ...

as priority disciplines, and are categorized according to priority dependence on running time, system state, external factors, or waiting time. A single-server system is assumed for most of the discussion, but a section on multiple-server systems is included at the end of the paper. The summary would seem to be of most value to someone entering queuing theoretic work with a commitment to comput...

In this paper, we analyse two important and relatively complex performance measures, tail probability and switching frequency, for two class queueing system with two different (relative and earliest due date based) dynamic priority schemes across classes. A simulator is build to perform such analysis and various observations are made. Based on computational evidence, it is conjectured that two ...

An analytical framework for the efficient evaluation of the performance of complete sharing (CS) and complete partitioning (CP) resource sharing policies under a newly proposed general channel management strategy for multi-class traffic in Low Earth Orbit-Mobile Satellite Systems (LEO-MSS) is presented. This strategy gives a higher priority to handover calls over new calls by combine the guard ...

One main group of a transportation network is a discrete hub covering problem that seeks to minimize the total transportation cost. This paper presents a multi-product and multi-mode hub covering model, in which the transportation time depends on travelling mode between each pair of hubs. Indeed, the nature of products is considered different and hub capacity constraint is also applied. Due to ...