• Title, Summary, Keyword: queueing analysis

Search Result 308, Processing Time 0.051 seconds

Worst Average Queueing Delay of Multiple Leaky-Bucket-Regulated Streams and Jumping-Window Regulated Stream

  • Lee, Daniel C.
    • Journal of Communications and Networks
    • /
    • v.6 no.1
    • /
    • pp.78-87
    • /
    • 2004
  • This paper presents deterministic, worst-case analysis of a queueing system whose multiple homogeneous input streams are regulated by the associated leaky buckets and the queueing system that has a single stream regulated by the jumping-window. Queueing delay averaged over all items is used for performance measure, and the worst-case input traffic and the worst-case performance are identified for both queueing systems. For the former queueing system, the analysis explores different phase relations among leaky-bucket token generations. This paper observes how the phase differences among the leaky buckets affect the worst-case queueing performance. Then, this paper relates the worst-case performance of the former queueing system with that of the latter (the single stream case, as in the aggregate streams from many users, whose item arrivals are regulated by one jumping-window). It is shown that the worst-case performance of the latter is identical to that of the former in which all leaky buckets have the same phase and have particular leaky bucket parameters.

Queueing Performance Analysis of CDF-Based Scheduling over Markov Fading Channels

  • Kim, Yoora
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.41 no.10
    • /
    • pp.1240-1243
    • /
    • 2016
  • In this paper, we analyze the queueing performance of cumulative distribution function (CDF)-based opportunistic scheduling over Nakagami-m Markov fading channels. We derive the formula for the average queueing delay and the queue length distribution by constructing a two-dimensional Markov chain. Using our formula, we investigate the queueing performance for various fading parameters.

Proposal of Approximation Analysis Method for GI/G/1 Queueing System

  • Kong, Fangfang;Nakase, Ippei;Arizono, Ikuo;Takemoto, Yasuhiko
    • Industrial Engineering and Management Systems
    • /
    • v.7 no.2
    • /
    • pp.143-149
    • /
    • 2008
  • There have been some approximation analysis methods for a GI/G/1 queueing system. As one of them, an approximation technique for the steady-state probability in the GI/G/1 queueing system based on the iteration numerical calculation has been proposed. As another one, an approximation formula of the average queue length in the GI/G/1 queueing system by using the diffusion approximation or the heuristics extended diffusion approximation has been developed. In this article, an approximation technique in order to analyze the GI/G/1 queueing system is considered and then the formulae of both the steady-state probability and the average queue length in the GI/G/1 queueing system are proposed. Through some numerical examples by the proposed technique, the existing approximation methods, and the Monte Carlo simulation, the effectiveness of the proposed approximation technique is verified.

A RETRIAL QUEUEING MODEL WITH THRESHOLDS AND PHASE TYPE RETRIAL TIMES

  • CHAKRAVARTHY, SRINIVAS R.
    • Journal of applied mathematics & informatics
    • /
    • v.38 no.3_4
    • /
    • pp.351-373
    • /
    • 2020
  • There is an extensive literature on retrial queueing models. While a majority of the literature on retrial queueing models focuses on the retrial times to be exponentially distributed (so as to keep the state space to be of a reasonable size), a few papers deal with nonexponential retrial times but with some additional restrictions such as constant retrial rate, only the customer at the head of the retrial queue will attempt to capture a free server, 2-state phase type distribution, and finite retrial orbit. Generally, the retrial queueing models are analyzed as level-dependent queues and hence one has to use some type of a truncation method in performing the analysis of the model. In this paper we study a retrial queueing model with threshold-type policy for orbiting customers in the context of nonexponential retrial times. Using matrix-analytic methods we analyze the model and compare with the classical retrial queueing model through a few illustrative numerical examples. We also compare numerically our threshold retrial queueing model with a previously published retrial queueing model that uses a truncation method.

An Analysis of a Multilayered Open Queueing Network with Population Constraint and Constraint and Constant Service Times (사용자수 제한을 갖는 개방형 다중계층구조의 대기행렬 네트워크 분석에 관한 연구)

  • Lee, Yeong
    • Journal of the Korean Operations Research and Management Science Society
    • /
    • v.24 no.4
    • /
    • pp.111-122
    • /
    • 1999
  • In this paper, we consider a queueing network model. where the population constraint within each subnetwork is controlled by a semaphore queue. The total number of customers that may be present in the subnetwork can not exceed a given value. Each node has a constant service time and the arrival process to the queueing network is an arbitrary distribution. A major characteristics of this model is that the lower layer flow is halted by the state of higher layer. We present some properties that the inter-change of nodes does not make any difference to customer's waiting time in the queueing network under a certain condition. The queueing network can be transformed into a simplified queueing network. A dramatic simplification of the queueing network is shown. It is interesting to see how the simplification developed for sliding window flow control, can be applied to multi-layered queueing network.

  • PDF

A Study on an Efficient Size Dry Docks for Warship Maintenance using Queueing Problem (대기문제를 이용한 효율적인 함정정비 건선거 규모 연구)

  • Ok, Kyoung-Chan;Cho, Sung-Jin;Jeon, Jae-Hyo;Yang, Jae-Young;Cho, Youn-Chol
    • Journal of Korean Institute of Industrial Engineers
    • /
    • v.40 no.4
    • /
    • pp.428-434
    • /
    • 2014
  • Dry docks are used to repair warships or Merchant ships based on their life cycles. There are the certain number of dry docks in the ROK Navy, However, the ROK Navy force structure has been changing a lot since the Korean War. The focus of this study is to analyze the queueing problem regarding present dry docks capacities and to forecast the appropriate number of dry docks based on future naval ship structure. The study proposes to obtain an efficient dry dock size using queueing problem and simulation.

Effect of First and Second Order Channel Statistics on Queueing Performance (채널의 1차 2차 통계적 특성이 큐의 성능에 미치는 영향)

  • Kim, Young-Yong
    • Journal of Institute of Control, Robotics and Systems
    • /
    • v.8 no.4
    • /
    • pp.288-291
    • /
    • 2002
  • We characterize multipath fading channel dynamics at the packet level and analyze the corresponding data queueing performance in various environments. We identify the similarity between wire-line queueing analysis and wireless network per-formance analysis. The second order channel statistics, i.e. channel power spectrum, is fecund to play an important role in the modeling of multipath fading channels. However, it is identified that the first order statistics, i.e. channel CDF also has significant impact on queueing performance. We use a special Markov chain, so-called CMPP, throughout this paper.

A Simulation Study on the Variability Function of the Arrival Process in Queueing Networks (시뮬레이션을 이용한 대기행렬 네트워크 도착과정의 변동성함수에 관한 연구)

  • Kim, Sun-Kyo
    • Journal of the Korea Society for Simulation
    • /
    • v.20 no.2
    • /
    • pp.1-10
    • /
    • 2011
  • In queueing network analysis, arrival processes are usually modeled as renewal processes by matching mean and variance. The renewal approximation simplifies the analysis and provides reasonably good estimate for the performance measures of the queueing systems under moderate conditions. However, high variability in arrival process or in service process requires more sophisticated approximation procedures for the variability parameter of departure/arrival processes. In this paper, we propose an heuristic approach to refine Whitt's variability function with the k-interval squared coefficient of variation also known as the index of dispersion for intervals(IDI). Regression analysis is used to establish an empirical relationships between the IDI of arrival process and the IDI of departure process of a queueing system.

Analysis of Unobservable RSS Queueing Systems (관측불가능한 임의순서규칙 대기행렬시스템 분석)

  • Park, Jin-Soo;Kim, Yun-Bae
    • Journal of the Korea Society for Simulation
    • /
    • v.17 no.2
    • /
    • pp.75-82
    • /
    • 2008
  • The times of service commencement and service completion had been used for inferring the queueing systems. However, the service commencement times are difficult to measure because of unobservable nature in queueing systems. In this paper, for inferring queueing systems, the service commencement times are replaced for arrival times which can be easily observed. Determining the service commencement time is very important in our methods. The methods for first come first served(FCFS), last come first served(LCFS) queueing discipline are already developed in our previous work. In this paper, we extend to random selection for service(RSS) queueing discipline. The performance measures we used are mean queueing time and mean service time, the variances of two. The simulation results verify our proposed methods to infer queueing systems under RSS discipline.

  • PDF

Analysis of a Departure Process on the Population Constrained Tandem Queueing Network with Constant Service Times (사용자수 제한과 상수 서비스시간을 갖는 개방형 대기행렬의 출력 프로세스에 관한 연구)

  • Young Rhee
    • Journal of the Korean Operations Research and Management Science Society
    • /
    • v.25 no.1
    • /
    • pp.15-26
    • /
    • 2000
  • We consider an open tandem queueing network with population constraint and constant service times. The total number of customers that may be present in the network can not exceed a given value k. Customers arriving at the queueing network when there are more than k customers are forced to walt in an external queue. The arrival process to the queueing network is assumed to be arbitrary. It is known that the queueing network with population constrant and constant service times can be transformed into a simple network involving only two nodes. In this paper, the departure process from the queueing network is examined using this simple network. An approximation can be calculated with accuracy. Finally, validations against simulation data establish the tightness of these.

  • PDF