• Title/Summary/Keyword: Mean Sojourn Time

Search Result 18, Processing Time 0.018 seconds

CONCAVITY OF THE CONDITIONAL MEAN SOJOURN TIME IN THE PROCESSOR-SHARING QUEUE WITH BATCH ARRIVALS

  • Kim, Jeong-Sim
    • Bulletin of the Korean Mathematical Society
    • /
    • v.47 no.6
    • /
    • pp.1251-1258
    • /
    • 2010
  • For an M/G/1 processor-sharing queue with batch arrivals, Avrachenkov et al. [1] conjectured that the conditional mean sojourn time is concave. However, Kim and Kim [5] showed that this conjecture is not true in general. In this paper, we show that this conjecture is true if the service times have a hyperexponential distribution.

THE SOJOURN TIME AND RELATED CHARACTERISTICS OF THE AGE-DEPENDENT BRANCHING PROCESS

  • Kumar, B.-Krishba;Vijayakumar, A.
    • Journal of applied mathematics & informatics
    • /
    • v.14 no.1_2
    • /
    • pp.157-172
    • /
    • 2004
  • An age-dependent branching process where disasters occur as a renewal process leading to annihilation or survival of all the cells, is considered. For such a process, the total mean sojourn time of all the cells in the system is analysed using the regeneration point technique. The mean number of cells which die in time t and its asymptotic behaviour are discussed. When the disasters arrival as a Poisson process and the lifetime of the cells follows exponential distribution, elegant inter- relationships are found among the means of (i) the total number of cells which die in time t (ii) the total sojourn time of all cells in the system upto time t and (iii) the number of living cells at time t. Some of the existing results are deduced as special cases for related processes.

Performance Analysis of a Discrete-Time Two-Phase Queueing System

  • Kim, Tae-Sung;Chang, Seok-Ho;Chae, Kyung-Chul
    • ETRI Journal
    • /
    • v.25 no.4
    • /
    • pp.238-246
    • /
    • 2003
  • This paper introduces the modeling and analysis of a discrete-time, two-phase queueing system for both exhaustive batch service and gated batch service. Packets arrive at the system according to a Bernoulli process and receive batch service in the first phase and individual services in the second phase. We derive the probability generating function (PGF) of the system size and show that it is decomposed into two PGFs, one of which is the PGF of the system size in the standard discrete-time Geo/G/1 queue without vacations. We also present the PGF of the sojourn time. Based on these PGFs, we present useful performance measures, such as the mean number of packets in the system and the mean sojourn time of a packet.

  • PDF

Sojourn Times in a Multiclass Priority Queue with Random Feedback

  • Hong, Sung-Jo;Hirayama, Tetsuji
    • Management Science and Financial Engineering
    • /
    • v.2 no.1
    • /
    • pp.123-145
    • /
    • 1996
  • We consider a priority-based multiclass queue with probabilistic feed-back. There are J service stations. Each customer belongs to one of the several priority classes, and the customers of each class arrive at each station in a Poisson process. A single server serves queued customers on a priority basis with a nonpreemptive scheduling discipline. The customers who complete their services feed back to the system instantaneously and join one of the queues of the stations or depart from the system according to a given probability. In this paper, we propose a new method to simplify the analysis of these queueing systems. By the analysis of busy periods and regenerative processes, we clarify the underlying system structure, and systematically obtain the mean for the sojourn time, i.e., the time from the arrival to the departure from the system, of a customer at every station. The mean for the number of customers queued in each station at an arbitrary time is also obtained simultaneously.

  • PDF

Queue Lengths and Sojourn Time Analysis of Discrete-time BMAP/G/1 Queue under the Workload Control (일량제어정책을 갖는 이산시간 BMAP/G/1 대기행렬의 고객수와 체재시간 분석)

  • Se Won Lee
    • Journal of Korea Society of Industrial Information Systems
    • /
    • v.29 no.1
    • /
    • pp.63-76
    • /
    • 2024
  • In this study, we analyzed queue length and sojourn time of discrete-time BMAP/G/1 queues under the workload control. Group customers (packets) with correlations arrive at the system following a discrete-time Markovian arrival process. The server starts busy period when the total service time of the arrived customers exceeds a predetermined workload threshold D and serves customers until the system is empty. From the analysis of workload and waiting time, distributions of queue length at the departure epoch and arbitrary time epoch and system sojourn time are derived. We also derived the mean value as a performance measure. Through numerical examples, we confirmed that we can obtain results represented by complex forms of equations, and we verified the validity of the theoretical values by comparing them with simulation results. From the results, we can obtain key performance measures of complex systems that operate similarly in various industrial fields and to analyze various optimization problems.

Explicit Formulae for Characteristics of Finite-Capacity M/D/1 Queues

  • Seo, Dong-Won
    • ETRI Journal
    • /
    • v.36 no.4
    • /
    • pp.609-616
    • /
    • 2014
  • Even though many computational methods (recursive formulae) for blocking probabilities in finite-capacity M/D/1 queues have already been produced, these are forms of transforms or are limited to single-node queues. Using a distinctly different approach from the usual queueing theory, this study introduces explicit (transform-free) formulae for a blocking probability, a stationary probability, and mean sojourn time under either production or communication blocking policy. Additionally, the smallest buffer capacity subject to a given blocking probability can be determined numerically from these formulae. With proper selection of the overall offered load ${\rho}$, the approach described herein can be applicable to more general queues from a computational point of view if the explicit expressions of random vector $D_n$ are available.

Mean Sojourn Time of Preclinical Gastric Cancer in Korean Men: A Retrospective Observational Study

  • Bae, Jong-Myon;Shin, Sang Yop;Kim, Eun Hee
    • Journal of Preventive Medicine and Public Health
    • /
    • v.47 no.4
    • /
    • pp.201-205
    • /
    • 2014
  • Objectives: This retrospective cohort study aimed to estimate the mean sojourn time (MST) of preclinical gastric cancer in Korean men. Methods: The subjects consisted of voluntary male screenees aged 40 to 69 years who underwent subsequent screening gastroscopies after testing negative at a baseline screening performed between January 2007 and December 2011. A new case was defined if gastric cancer cells were present in the biopsy specimens obtained from gastroscopy. The follow-up period was calculated as the number of person-years between the date of baseline screening gastroscopy and positive findings at a subsequent screening. The MST was calculated using transition rates of gastric cancer to determine the best screening interval. Results: Of the 171 979 voluntary male screenees, 61 688 (36%) underwent subsequent screening gastroscopies between January 2007 and December 2011. A total of 91 incident cases were found during 19 598 598 person-years of follow-up. The MST of gastric cancer was 2.37 years (95% confidence intervals, 1.92 to 2.96), and those aged 40 to 49 years had a shorter MST than those 50 to 69 years did. Conclusions: These findings support the 2-year interval of screening recommended by the nationwide gastric cancer screening program in Korea. Further studies for the age-specific MST among women are needed.

A Workflow Time Analysis Applying the Queueing Model (대기행렬모형에 의한 워크플로우 시간분석)

  • Park, Jinsoo
    • Journal of the Korea Society for Simulation
    • /
    • v.23 no.3
    • /
    • pp.1-9
    • /
    • 2014
  • Traditional workflow time analyses have been performed treating an activity as an independent M/M/1queueing system. Using the general forms of performance measures in the M/M/1 system, various aspects of analyses can be performed. Especially, on the time analysis of an AND structure in a workflow system, the mean system sojourn time can be formalized by applying the performance measures of M/M/1 system. In the real workflow system, the AND structure cannot be described correctly under the assumption of independent M/M/1 systems. To overcome this limitation, this research makes the assumption that the all activities for a task starts simultaneously. In this situation, the theoretical solution can be derived using the performance measures of the M/G/1 system. In addition, the simulation modeling method will be proposed to analyze the AND structure of a real workflow system. Finally, some numerical results from the theoretical solutions and simulation models will be provided for verification. The main performance measures used in this research are mean queueing time and mean sojourn time.

A Roots Method in GI/PH/1 Queueing Model and Its Application

  • Choi, Kyung Hwan;Yoon, Bong Kyoo
    • Industrial Engineering and Management Systems
    • /
    • v.12 no.3
    • /
    • pp.281-287
    • /
    • 2013
  • In this paper, we introduce a roots method that uses the roots inside the unit circle of the associated characteristics equation to evaluate the steady-state system-length distribution at three epochs (pre-arrival, arbitrary, and post-departure) and sojourn-time distribution in GI/PH/1 queueing model. It is very important for an air base to inspect airplane oil because low-quality oil leads to drop or breakdown of an airplane. Since airplane oil inspection is composed of several inspection steps, it sometimes causes train congestion and delay of inventory replenishments. We analyzed interarrival time and inspection (service) time of oil supply from the actual data which is given from one of the ROKAF's (Republic of Korea Air Force) bases. We found that interarrival time of oil follows a normal distribution with a small deviation, and the service time follows phase-type distribution, which was first introduced by Neuts to deal with the shortfalls of exponential distributions. Finally, we applied the GI/PH/1 queueing model to the oil train congestion problem and analyzed the distributions of the number of customers (oil trains) in the queue and their mean sojourn-time using the roots method suggested by Chaudhry for the model GI/C-MSP/1.

Analysis of Feedback Queues with Priorities

  • Hong, Sung-Jo;Hirayama, Tetsuji
    • Journal of Korean Institute of Industrial Engineers
    • /
    • v.19 no.4
    • /
    • pp.137-146
    • /
    • 1993
  • We consider single server feedback queueing systems with priorities. In the model, there are J stations and job classes. Jobs of class i arrive at station i according to a Poisson process, and have a general service time distribution. We derive the generating functions of the number of jobs at each station just after a busy period and the formula for the mean sojourn time that a specific tagged job spends at station j from its arrival to departure from the system.

  • PDF