This paper deals with a Markovian queueing system having a multi-task service counters and finite queue in front of each counter. The total service of a customer is completed in three stages provided by two servers at three counters. The first server (S1) can serve the counter I and III alternatively, whereas second server (S2) provides the service at counter II. The server (S1) g ives the prio...

We seek to approximate the mean sojourn time in the processor sharing M/G/1 queue with inaccurate job size information. Suppose we are given the arrival rate λ and random service time Ŝ = SX where X ∼ LN(0, σ) represents the inaccuracy. Denote the mean sojourn time in an M/G/1 queue with processor sharing with service time Ŝ by E(T̂) and with service time S by E(T). Finally, E(T̂) denotes the mea...

We derive the waiting time in a queueing scheme, which an arriving job can be denied service with probability relative to queue size. Such scheme is generalization of tail-drop queue, when buffer (waiting room) full, and found computer networking, call centers other everyday life applications systems. To make model very general, we use arrival process enables shaping arbitrary interarrival dist...

Energy Packet Network (EPN) consists of a queueing network formed by N blocks, where each them is one data queue, that handles the workload, and energy packets energy. We study an EPN model start transfer. In this model, are sent to queue same block. An packet routes workload next block if not empty, it lost otherwise. assume queues have finite buffer size arrives system when full, jump-over bl...

Consider a tandem queue consisting of two single server queues in series with a Poisson arrival process at the rst queue and arbitrarily distributed service times which for any customer are identical in both queues For this tandem queue we relate the tail behavior of the sojourn time distribution and the workload distribution at the second queue to that of the residual service time distribution...

We consider a general QBD process as defining a FIFO queue and obtain the stationary distribution of the sojourn time of a customer in that queue as a matrix exponential distribution, which is identical to a phase-type distribution under a certain condition. Since QBD processes include many queueing models where the arrival and service process are dependent, these results form a substantial gen...

We consider an M/GI/1/N queue with vacation time and exhaustive service discipline, the same queue as in Lee 9]. Focusing only on the service completion epochs (as oposed to both service completion epochs and vacation completion epochs by Lee), we present a simple analysis for the queue length distribution at an arbitrary time as well as for the waiting time distribution.

in this study, sio2 nanoparticles were successfully synthesized via sol-gel precipitation method and the effects of different parameters such as temperature, ethanol, ammonia and tetraethylorthosilicate (teos) contents based on water were investigated in a systematic way applying taguchi experimental design method. it was found that, among all the investigated parameters, ethanol as a co-solven...

The emergence of low latency, high throughput routers means that network locality issues no longer dominate the performance of parallel algorithms. One of the key performance issues is now the even distribution of work across the machine, as the problem size and number of processors increase. This paper describes the implementation of a highly scalable shared queue, supporting the concurrent in...

This paper investigate a queueing model where in customers arrive in batches according to compound Poisson process with rate λ and are served one by one in FIFO basis. All incoming customers demand the first ’essential’ service wherein only some of them demand the second ’optional’ service. The service times of both essential and optional services follow arbitrary(general)distribution with diff...