An M/G/1 Queueing System with Delay Server Vacations

ＡｎＭ／Ｇ／１ＱｕｅｕｅｉｎｇＳｙｓｔｅｍｗｉｔｈＤｅｌａｙＳｅｒｖｅｒＶａｃａｔｉｏｎｓ⒇ＴＡＮＧＹｉｎｇｈｕｉＴＡＮＧＸｉａｏｗｏ（ＤｅｐａｒｔｍｅｎｔｏｆＡｐｐｌｉｅｄＭａｔｈ．,Ｍａｎａｇｅｍｅｎｔｃｏｌｅｇｅ,Ｕｎｉｖｅｒ．ｏｆＥｌｅｃｔｒ...     

Analysis of G-Queue with Pseudo-Fault and Multiple Working Vacations

This paper presents a new model of discrete time Geo/Geo/1 repairable queueing system with pseudo-fault, negative customers and multiple working vacations. The authors assume that system service may be interrupted by breakdown or pseudo-fault, this system may become disabled only when it is in a regular busy period, and negative customers adopt two types of typical killing strategies. In this paper, the authors know that the evolution of the system can be described by a two-dimensional Markov chain, and the two-dimensional Markov chain satisfies the condition of quasi birth and death chains. Based on the method of matrix-geometric solution, the authors obtain distributions for the stationary queue length in RCH and RCE strategy, respectively. Moreover, the reliability of the system is analyzed and the number of customers and waiting time of a customer in the system in steady state are obtained. The authors analyze the impact of two killing strategies on the system comparatively.This paper studies the individually and socially optimal behaviors of positive customers, and presents a pricing policy for positive customers, therefore, the authors obtain the socially optimal arrival rate.Various numerical results are provided to show the change of performance measures.     

限制式非对称多令牌环形系统的排队分析与平均等待时间

本文提出了一种分析非对称限制式多令牌环形网络性能的方法，建立了排队模型，找到了平均等待时延的关系式，从而对ＬＡＮ对ＦＤＤＩ实现了数学解析。     

The Structure of Departure Process and Optimal Control Strategy N~* for Geo/G/1 Discrete-Time Queue with Multiple Server Vacations and Min(N,V)-Policy

This paper considers the departure process and the optimal control strategy for a discretetime Geo/G/1 queueing model in which the system operates under the control of multiple server vacations and Min(N, V)-policy. Using the law of total probability decomposition, the renewal theory and the probability generating function technique, the transient and the steady-state probabilities that the server is busy at any epoch n~+ are derived. The authors also obtain the explicit expression of the probability generating function for the expected number of departures occurring in the time interval (0~+, n~+] from any initial state. Meanwhile, the relationship among departure process, server's state process and service renewal process in server busy period is found, which shows the special structure of departure process. Especially, some corresponding results of departure process for special discrete-time queues are directly gained by our results. Furthermore, the approximate expansion for calculating the expected number of departures is presented. In addition, some other important performance measures,including the expected length of server busy period, server's actual vacation period and busy cycle period etc., are analyzed. Finally, some numerical results are provided to determine the optimum value N*for minimizing the system cost under a given cost structure.     

M/G/1排队系统的性能灵敏度估计与仿真

对具有一般分布的排队系统-M／G／l排队系统给出了一种通过其嵌入Markov链来计算系统势能及性能导数的仿真算法。由于该算法基于分析系统的一条单一样本轨道，故可直接用于系统的控制与优化。最后提供一个数值例子来表明该算法的应用。     

ANALYSIS AND COMPUTATIONAL ALGORITHM FOR QUEUES WITH STATE-DEPENDENT VACATIONS I： G/M（n）/1/K

In this paper we study a queueing system with state-dependent services and state-dependent vacations, or simply G/M（n）/1/K. Since the service rate is state-dependent, this system includes G/M/c and G/M/c/K queues with various types of station vacations as special cases. We provide a recursive algorithm using the supplementary variable technique to numerically compute the stationary queue length distribution of the system. The only input requirement is the Laplace-Stieltjes transform of the interarrival distribution as well as the state-dependent service rate and state-dependent vacation rate. In a subsequent companion paper, we study its dual system M（n）/G/1/K queue with statedependent vacations.     

ANALYSIS AND COMPUTATIONAL ALGORITHM FOR QUEUES WITH STATE-DEPENDENT VACATIONS II： M（n）/G/1/K

We study a single-server queueing system with state-dependent arrivals and general service distribution, or simply M（n）/G/1/K, where the server follows an N policy and takes multiple vacations when the system is empty. We provide a recursive algorithm using the supplementary variable technique to numerically compute the stationary queue length distribution of the system. The only input requirements are the Laplace-Stieltjes transforms of the service time distribution and the vacation time distribution, and the state-dependent arrival rate. The computational complexity of the algorithm is O（K^3）.     

An M/M/1 Queueing-Inventory System with Geometric Batch Demands and Lost Sales

This paper studies an M/M/1 queueing-inventory system with batch demands. Customers arrive in the system according to a compound Poisson process, where the size of the batch demands for each arrival is a random variable that follows a geometric distribution. The inventory is replenished according to the standard (s,S) policy. The replenishment time follows an exponential distribution. Two models are considered. In the first model, if the on-hand inventory is less than the size of the batch demands of an arrived customer, the customer takes away all the items in the inventory, and a part of the customer’s batch demands is lost. In the second model, if the on-hand inventory is less than the size of the batch demands of an arrived customer, the customer leaves without taking any item from the inventory, and all of the customer’s batch demands are lost. For these two models, the authors derive the stationary conditions of the system. Then, the authors derive the stationary distributions of the product-form of the joint queue length and the on-hand inventory process. Besides this, the authors obtain some important performance measures and the average cost functions by using these stationary distributions. The results are illustrated by numerical examples.     

Analysis and Simulation for Capacity of Time Division-Synchronous Code Division Multiple Access System

Capacity both in uplink and downlink of TD-SCDMA (time division-synchronous code division multiple access) system is studied in a multi-cell environment. The theoretical expressions of the mean of intercell interference in uplink and the mean of sum of power allocation in downlink are given, by which uplink and downlink capacity is analyzed. Furthermore, we give the simulation models for both uplink and downlink capacity. The results from theoretical analysis and simulation fit very well. In the end, the maximum number of users that TD-SCDMA system can serve for 12. 2k speech service is given.     

具有强占优先权的不耐烦顾客的M/M/m/k排队模型

首先研究只有一类不耐烦顾客的M/M/m排队模型,其中顾客到达服从相互独立的泊松分布,服务时间服从相互独立的指数分布,到达率与服务率随着系统中的顾客数而发生变化。顾客的耐心等待时间(截止到服务开始前)服从指数分布。在此基础上进一步研究两类顾客到达的M/M/m/k排队系统。其中第一类顾客对于第二类顾客有强占优先权,两类顾客的到达率与服务率随着系统中顾客人数而发生变化。采用矩阵分析的方法得到了两类顾客各自的稳态分布,并有相应的性能分析,为系统的优化设计提供了依据。     

重试,反馈M/M/s/k排队的呼叫中心性能分析

由于CTI(计算机电话集成)技术的发展,使呼叫中心得到广泛的应用.与呼叫中心实现技术的发展相比,对呼叫中心管理的研究显得有些滞后,而针对呼叫中心排队模型的研究,更是如此.针对呼叫中心服务系统中的重试和反馈问题,考虑一种带重试和反馈的M/M/s/k排队模型.将等待位置和服务台数推广到有限个.在模型求解过程中,尝试采用矩阵迭代的新方法,使求解过程简单明了.然后,采用逼近的方法给出模型的数值解,并得出反馈对系统的影响随系统负荷的增大而快速增大等结论.     

基于非线性时间价值的多用户出行均衡与系统最优

针对存在异质用户的固定需求交通路网,当用户的时间价值呈离散分布,且出行费用与出行时间表现为非线性函数关系时,分别建立了基于时间和费用两种计量准则下的系统最优和多用户均衡路径选择模型.证明了在非线性时间价值函数条件下,存在非负匿名路段收费方案,使得基于费用计量的多用户均衡解与系统最优解一致,但在时间计量单位下,使得系统最优解与多用户均衡解一致的匿名路段收费方案不存在.     

A New ANN Method of Aggregation and Stability Analtsis for Large－Scale System with Time Delay

ＡＮｅｗＡＮＮＭｅｔｈｏｄｏｆＡｇｇｒｅｇａｔｉｏｎａｎｄＳｔａｂｉｌｉｔｙＡｎａｌｔｓｉｓｆｏｒＬａｒｇｅ－ＳｃａｌｅＳｙｓｔｅｍｗｉｔｈＴｉｍｅＤｅｌａｙ￥ＺＨＡＮＧＪｉａｎ；ＬＩＵＹｏｎｇｑｉｎｇ；ＳＨＥＮＪｉａｎｊｉｎｇ（Ｄｅｐｔ．ｏｆＡｕｔ...     

Stability and Hopf Bifurcation Analysis of an (n + m)-Neuron Double-Ring Neural Network Model with Multiple Time Delays

Journal of Systems Science and Complexity - Up till the present moment, researchers have always featured the single-ring neural network. These investigations, however, disregard the link between...     

Recursive Solution of Queue Length Distribution for Geo/G/1 Queue with Delayed Min(N,D)-Policy

In this paper we consider a discrete-time Geo/G/1 queue with delayed Min(N, D)-policy.Using renewal process theory, total probability decomposition technique and z-transform, we study the transient and equilibrium properties of the queue length from an arbitrary initial state, and obtain both the recursive expressions of the transient state queue length distribution and the steady state queue length distribution at arbitrary time epoch n~+. Furthermore, we derive the important relations between equilibrium queue length distributions at different time epochs n~-, n and n~+. Finally, we give some numerical examples about capacity decision in queueing systems to demonstrate the application of the analytical results reported in this paper.     

具有两个服务阶段的负顾客Mξ/(G1,G2)/1休假排队系统

研究一类批到达排队系统,单服务台提供两个不同阶段的服务,并且考虑空竭服务单重休假和有负顾客到达的情形.正顾客接受第一个阶段服务后立即接受第二个阶段服务,在正顾客接受两个阶段服务的过程中均可能有负顾客到达,负顾客不接受服务,只抵消正在接受服务的正顾客.运用补充变量法列出稳态下系统的状态偏微积分方程组,从而求得了系统主要排队指标及稳态队长的概率母函数的随机分解结果.     

汽车AMT系统的Matlab/Simulink建模与仿真

文中首先建立汽车AMT控制系统的被控对象模型（油门执行器模型、传动系统模型和离合器模型）;其次基于Matlab/Simulink设计系统的控制器模型。系统地建立了汽车AMT控制系统的模型,仿真结果表明所建立的被控对象模型及所设计的控制器的合理性和可行性,从而为产品开发提供了依据。     

The structure of departure process and optimal control strategy <Emphasis Type="Italic">N</Emphasis>* for <Emphasis Type="Italic">Geo/G</Emphasis>/1 discrete-time queue with multiple server vacations and Min(<Emphasis Type="Italic">N,V</Emphasis>)-Policy

This paper considers the departure process and the optimal control strategy for a discretetime Geo/G/1 queueing model in which the system operates under the control of multiple server vacations and Min(N, V)-policy. Using the law of total probability decomposition, the renewal theory and the probability generating function technique, the transient and the steady-state probabilities that the server is busy at any epoch n⁺ are derived. The authors also obtain the explicit expression of the probability generating function for the expected number of departures occurring in the time interval (0⁺, n⁺] from any initial state. Meanwhile, the relationship among departure process, server’s state process and service renewal process in server busy period is found, which shows the special structure of departure process. Especially, some corresponding results of departure process for special discrete-time queues are directly gained by our results. Furthermore, the approximate expansion for calculating the expected number of departures is presented. In addition, some other important performance measures, including the expected length of server busy period, server’s actual vacation period and busy cycle period etc., are analyzed. Finally, some numerical results are provided to determine the optimum value N* for minimizing the system cost under a given cost structure.