A Closed Queueing Maintenance Network with Two Repair Centres

In this paper we introduce a model to determine the maintenance float needed to maximize the availability of an operating system with N number of circulating units. An implicit enumeration algorithm is used as a solution technique to the closed queueing maintenance network with two types of repairs: minor and major repairs. It is shown that when there is no differentiation of repair type, this special case is obtained as a by-product of the two-repair-centre model. This paper assumes exponential failure times and exponential repair times with load-independent servers. The approach followed in this paper provides an approximate and simple way to solve the maintenance-float problem of this complex closed-network system.     

Comments on 'A Closed Queueing Maintenance Network with Two Repair Centres': Response

Journal of the Operational Research Society -     

A Large Closed Queueing Network Containing Two Types of Node and Multiple Customer Classes: One Bottleneck Station

Queueing Systems - The paper studies a closed queueing network containing two types of node. The first type (server station) is an infinite server queueing system, and the second type (client...     

Probabilities for Queueing Systems with Embedded Markov Chains

Abstract

Transition probabilities of embedded Markov chain for single-server queues are considered when the distribution of the inter-arrival time or that of the service time is specified. A comprehensive collection of formulas is derived for the transition probabilities, covering some seventeen flexible families. The corresponding estimation procedures are also derived by the method of moments. It is expected that this work could serve as a useful reference for the modeling of queuing systems with embedded Markov chains.     

Analysis of a Queueing Model with Batch Markovian Arrival Process and General Distribution for Group Clearance

In this paper we consider a single server queueing model with under general bulk service rule with infinite upper bound on the batch size which we call group clearance. The arrivals occur according to a batch Markovian point process and the services are generally distributed. The customers arriving after the service initiation cannot enter the ongoing service. The service time is independent on the batch size. First, we employ the classical embedded Markov renewal process approach to study the model. Secondly, under the assumption that the services are of phase type, we study the model as a continuous-time Markov chain whose generator has a very special structure. Using matrix-analytic methods we study the model in steady-state and discuss some special cases of the model as well as representative numerical examples covering a wide range of service time distributions such as constant, uniform, Weibull, and phase type.

     

A Closed Queueing Network Model to Evaluate the Impact of Recovery Operations on the Performance of Database Servers

As database servers proliferate in modern information systems architectures in organizations, the issue of protecting and recovering the databases becomes of utmost importance. By developing an analytical model based on a closed network of queues, this paper analyses how different database recovery mechanisms impact on the normal transaction processing. Such a model enables one to capture intricate effects that are peculiar to complex, tightly coupled, multi-component systems, such as database recovery systems, and can be used to facilitate the design and the tuning of database recovery managers. The proposed model provides important performance measures in terms of average transaction processing time and overall systems throughput. Numerical experiments using actual recovery methods demonstrate the effectiveness of the modelling approach.     

Queueing Models with Multiple Waiting Lines

This paper discusses analytic solution methods for queueing models with multiple waiting lines. The methods are briefly illustrated, using key models like the 2×2 switch, the shortest queue and the cyclic polling system.     

多类顾客多服务台队列网络的高负荷极限定理

多类顾客多服务台队列网络广泛地应用到计算机网络、通讯网络和交通网络 .由于系统的复杂性 ,其数量指标的精确解很难求出 .为了寻求逼近解 ,本文用概率测度弱收敛理论对进行了研究 ,在高负荷的条件下 ,我们获得了网输入过程、闲时过程和负荷过程的极限定理 .     

带有启动的N级串联开排队网络系统模型

主要研究了带有启动策略的多级串联开排队模型,其中采用递推方式给出了马尔科夫过程的转移矩阵,并利用矩阵分析法进行求解,得到了系统的稳态解及忙期长度、逗留时间和其它相关指标.     

An Iterative Algorithm for a Multiple Finite-source Queueing Model with Dynamic Priority Scheduling

A multiple finite source queueing model with a single server and dynamic, non-preemptive priority service discipline is studied in this paper. The times the customers spend at the corresponding sources are exponentially distributed. The service times of the customers can follow exponential, Erlang or hyperexponential probability density function. By using results published earlier and an extension of mean value analysis, an iterative algorithm was developed to obtain approximate values of the mean waiting times in queues for the priority classes. The mean number of waiting customers and the server utilization of each class are obtained using the result of this algorithm and Little's formula. The algorithm is preferable to the earlier method, because it does not increase in complexity as the number of customer classes increases.     

随机需求下的多条竞争供应链的网络均衡模型

针对供应链与供应链竞争问题,研究随机需求下多条竞争供应链网络之间的竞争行为。通过定义产品市场链说明供应链网络之间是如何竞争的,在市场需求是随机且产品的品牌有差异的情况下,利用多项式logit模型以及变分不等式的方法,构建了具有随机需求的多条竞争供应链的网络均衡模型.模型很好的刻画了包含多条供应链,且每条供应链具有多个层次的供应链网络之间的竞争行为,研究表明供应链与供应链的竞争可以看作是由核心企业所决定的供应链网络之间的竞争.最后,通过一个算例说明了模型的合理性和有效性.     

Multi-Server Queueing Systems with Multiple Priority Classes

We present the first near-exact analysis of an M/PH/k queue with m > 2 preemptive-resume priority classes. Our analysis introduces a new technique, which we refer to as Recursive Dimensionality Reduction (RDR). The key idea in RDR is that the m-dimensionally infinite Markov chain, representing the m class state space, is recursively reduced to a 1-dimensionally infinite Markov chain, that is easily and quickly solved. RDR involves no truncation and results in only small inaccuracy when compared with simulation, for a wide range of loads and variability in the job size distribution. Our analytic methods are then used to derive insights on how multi-server systems with prioritization compare with their single server counterparts with respect to response time. Multi-server systems are also compared with single server systems with respect to the effect of different prioritization schemes—“smart” prioritization (giving priority to the smaller jobs) versus “stupid” prioritization (giving priority to the larger jobs). We also study the effect of approximating m class performance by collapsing the m classes into just two classes. Supported by NSF Career Grant CCR-0133077, NSF Theory CCR-0311383, NSF ITR CCR-0313148, and IBM Corporation via Pittsburgh Digital Greenhouse Grant 2003. AMS subject classification: 60K25, 68M20, 90B22, 90B36     

关于马氏环境中马氏链的几点注记

讨论了马氏环境中马氏链与马氏双链间的关系,通过两个例子,纠正了有关文献的一些错误结论。     

带有故障的休假排队模型

研究了一个复合的休假排队模型,工作或休假时服务台都有可能故障,服务台一旦修好可立即进行服务,而且每个忙期结束就开始一次休假,顾客到达服从Poisson过程,到达率依赖于系统状态,修理时间、服务时间和休假长度都服从指数分布.给出了系统状态的平衡方程,利用概率母函数求出队长,并做了数值分析.     

Analysis of a Discrete-Time Queueing System with a Single Server and Heterogeneous Markovian Arrivals

We consider a discrete-time queueing system with a single deterministic server, heterogeneous Markovian arrivals and finite capacity. Most existing techniques model the queueing system using a direct bivariate Markov chain which requires a state space that grows rapidly as the number of customer types increases. In this paper, we define renewal cycles in terms of the input process and model the system occupancy level on each renewal cycle using a one-dimensional Markov chain. We derive the exact joint steady-state probability distribution of both states of input and system occupancy with a considerably reduced state space, which leads to the efficient calculation of overall/individual performance measures such as loss probability and average delay.     

N级串联休假反馈开排队系统模型

主要研究了具有反馈的多级串联休假开排队模型,其中采用递推方式给出了马尔可夫过程的转移矩阵,并利用矩阵分析方法进行求解,得到了该系统的稳态解及其它相关指标.     

Markovian Controllable Queueing Systems with Hysteretic Policies: Busy Period and Waiting Time Analysis

We study Markovian queueing systems in which the service rate varies whenever the queue length changes. More specifically we consider controllable queues operating under the so-called hysteretic policy which provides a rather versatile class of operating rules for increasing and decreasing service rate at the arrival and service completion times. The objective of this paper is to investigate algorithmically the busy period and the waiting time distributions. Our analysis supplements the classical work of Yadin and Naor (1967) who focused on the steady-state probabilities of the system state. AMS 2000 Subject Classification 60K25, 90B22     

Chains and Families of Tightly Closed Ideals

We prove tight closure analogues of results of Watanabe aboutchains and families of integrally closed ideals. 2000 MathematicsSubject Classification 13A35.     

Network congestion control with Markovian multipath routing

In this paper we consider an integrated model for TCP/IP protocols with multipath routing. The model combines a Network Utility Maximization for rate control based on end-to-end queueing delays, with a Markovian Traffic Equilibrium for routing based on total expected delays. We prove the existence of a unique equilibrium state which is characterized as the solution of an unconstrained strictly convex program. A distributed algorithm for solving this optimization problem is proposed, with a brief discussion of how it could be implemented by adapting the current Internet protocols.     

A Study of Multiple Finite-Source Queueing Models

In this paper, the effects of the head-of-the-line priority and the first-come-first-served service disciplines and the variability of the service-time density functions on the mean values of performance measures of multiple finite-source queueing models are studied. In these models, with a single server, the times between the service completion and the next service requirement are exponentially distributed and the service times follow exponential, hypo-exponential or hyper-exponential probability density functions. The effects are compared with the known behaviour of multiple infinite-source queueing models.