带启动-关闭期的多重休假M/G/1排队

研究多重休假带启动一关闭期的M／G／1排队。给出稳态队长和等待时间分布的母函数及其随机分解结果，并给出附加队长和附加延迟时间的PH的封闭性，推导出忙期、全假期和在线期母函数和均值。     

爱尔朗排队系统的瞬态分析

对于一般分布的排队系统的瞬态解是一个相当复杂的问题，本文利用把福克－普朗克方程降阶去奇异性，转人继有外力作用的状态方程，利用Ｒｕｎｇｅ－Ｋｕｔｔａ法，求得系统的瞬态及稳态解，并给出不同参数时的曲线族。     

QUEUEING NETWORKS WITH INSTANTANEOUS SEQUENTIAL TRANSITIONS

1 IntroductionQueueing networks have been one of the most importallt techniques in the modeling andanalysis of computer, communication, transportation, and Iogistics systems. The first queueingnetwork model was introduced by J..k,..[i'2], in which Jackson considers a network with Nnodes, and transitions of the typex -- x -- ej ek5 i,k = 0,1,'',N, (1)where x = (x1, x2)'' 5 XN) denotes the number of customers at the N nodes, ej is the unitvector with a 1 at the j-th position and 0 elsewh…     

带负顾客和不耐烦顾客的离散时间Geo/G/1重试排队

考虑了一个带负顾客和不耐烦顾客且重试时间为一般分布的离散时间Geo/G/1重试排队系统. 负顾客带走一个正在服务的顾客, 而对重试组中的顾客无影响.正顾客到达系统若遇服务器忙则可能进入重试组也可能离开系统.通过对此排队系统的嵌入马氏链进行分析, 得到了重试组队长和系统队长的概率母函数. 进而得到了一系列重要的排队指标. 此外, 还推导出了系统的稳态存在条件. 以及对无负顾客和不耐烦顾客时的特例进行了分析. 最后通过几个具体的数值实例演示了一些参数对系统关键性能指标的影响.     

基于边际效应全局最优的队列控制方法

为了解决网络节点在进行数据传输过程中的冲突拥塞,针对队列控制方法存在的问题,提出了一种基于经济学中边际效应全局最优的队列管理机制.在这种机制中会兼顾数据流之间的公平性和优先级,在二者中寻找到最佳的平衡点.通过在合理的范围内设定不同业务用户的满意度和结点提供的带宽之间存在边际效应,平衡公平性和优先级之间的矛盾,达到使全局满意度最高的带宽分配方案.实验结果表明,提出的分配带宽的方案能使全局满意度达到最大值.     

基于双优先级队列的异构分布式控制系统容错调度算法

在对分布式控制系统进行分析的基础上,给出了任务模型和处理器模型.为了调度多种实时性的任务,提出了双优先级队列调度算法,用于调度每个处理器上的任务.该算法设置2个优先级队列,其中高优先级队列用于调度实时任务,低优先级队列用于调度非实时任务,高优先级队列中的任务可抢占低优先级队列中的任务.在此基础上,采用版本复制技术使系统具有容错能力,并分析了任务的容错可调度条件.基于此,采用首次适应的启发式任务分配策略,将任务分配到各个处理器上,在确保任务容错可调度的条件下使处理器负载均衡.仿真结果表明所提出的算法是有效的.     

目标有优先权的模糊多目标规划的一种解法

本文讨论了目标具有不同优先权的模糊多目标规划问题的一种近似解法．每个目 标的优先权用正实数表示，将目标的优先权和隶属函数合成新的隶属函数。再用模糊 最大策略方法求满足每一个目标的新隶属函数和约束的隶属函数的最大λ值，即把解 有不同优先权的模糊多目标规划问题化为解普通线性规划问题． 文中从理论上证明了算法的正确性．并给出误差估计公式．通过 一个例题的计算说明该算法是合理的，误差估计公式是正确的。     

Optimal control of an M/G/1 retrial queue with vacations

In this note, we consider an M/G/1 retrial queue with server vacations, when retrial times, service times and vacation times are arbitrary distributed. The distribution of the number of customers in the system in stationary regime is obtained in terms of generating function. Next, we give heavy traffic approximation of such distribution. We show that the system size can be decomposed into two random variables, one of which corresponds to the system size of the ordinary M/G/1 FIFO queue without vacation. Such a stochastic decomposition property is useful for the computation of performance measures of interest. Finally, we solve simple problems of optimal control of vacation and retrial policies.     

On the single server retrial queue with priority subscribers and server breakdowns

The author concerned the reliability evaluation as well as queueing analysis of M1, M2/G1, G2/1 retrial queues with two different types of primary customers arriving according to independent Poisson flows. In the case of blocking, the first type of customers can be queued whereas the second type of customers must leave the service area but return after some random period of time to try their luck again. The author assumes that the server is unreliable and it has a service-type dependent, exponentially distributed life time as well as a service-type dependent, generally distributed repair time. The necessary and sufficient condition for the system to be stable is investigated. Using a supplementary variable method, the author obtains a steady-state solution for queueing measures, and the transient as well as the steady-state solutions for reliability measures of interest.