无标度网络上的队列资源重分配策略

在实际的通信系统中,由于物理条件的限制,每个节点都具有有限长度的队列。研究了在有限队列资源的条件下,队列资源对无标度数据流动力学的影响。提出了一种队列资源重分配策略,策略中节点的队列长度与节点的介数成正比。仿真结果表明,在无标度网络中使用最短路径路由的条件下,所提出的重分配策略可以有效地改进网络的容量。同时对有限队列资源条件下的网络容量进行了理论分析。     

队列歌唱应掌握的技巧

队 列歌唱是部队官兵在集合列队以及行进时的一种有组织的演唱形式 ,也是我军的光荣传统之一。在过去战争年代 ,队列歌唱使官兵树立必胜的信念。在和平时期 ,尤其在军事斗争准备期间 ,队列歌唱能激发官兵的练兵热情。总政治部曾在全军政治工作会议上对部队文化工作提出了“四有”的要求 ,这“四有”的第一有就是“队列集会有歌声”。为使队列歌唱组织更加规范 ,并使其充分发挥职能作用 ,在这里谈一谈组织队列歌唱时的技巧问题。选择合适的歌曲(一 )选歌要注意演唱的速度是否合适。要选以队列歌曲为主的歌 ,因为队列歌曲是进行曲体裁的一种 ,…     

军营检查榜

在面向部队的所有指示、通知中,再没有比检查对兵生活的干预来得更为直接、有效的了。这是兵生活零距离的驱动。卫生、内务、军容、队列、训练、战备……检查的循环往复、大同小异,构成了兵生活之激素。表扬在检查中诞生,批评在检查中见面,热血在检查中激荡。检查就是这样形影不离地跟定你兵生活的每一步。     

检查要素分析

在面向部队的所有指示、通知中,再没有比检查对兵生活的干预来得更为直接、有效的了。这是兵生活零距离的驱动。卫生、内务、军容、队列、训练、战备……检查的循环往复、大同小异,构成了兵生活之激素。表扬在检查中诞生,批评在检查中见面,热血在检查中激荡。检查就是这样形影不离地跟定你兵生活的每一步。     

节假日外出检查

在面向部队的所有指示、通知中,再没有比检查对兵生活的干预来得更为直接、有效的了。这是兵生活零距离的驱动。卫生、内务、军容、队列、训练、战备……检查的循环往复、大同小异,构成了兵生活之激素。表扬在检查中诞生,批评在检查中见面,热血在检查中激荡。检查就是这样形影不离地跟定你兵生活的每一步。     

检查,兵生活之激素

在面向部队的所有指示、通知中,再没有比检查对兵生活的干预来得更为直接、有效的了。这是兵生活零距离的驱动。卫生、内务、军容、队列、训练、战备……检查的循环往复、大同小异,构成了兵生活之激素。表扬在检查中诞生,批评在检查中见面,热血在检查中激荡。检查就是这样形影不离地跟定你兵生活的每一步。     

当直民以分毫的精确检测内务……

在面向部队的所有指示、通知中,再没有比检查对兵生活的干预来得更为直接、有效的了。这是兵生活零距离的驱动。卫生、内务、军容、队列、训练、战备……检查的循环往复、大同小异,构成了兵生活之激素。表扬在检查中诞生,批评在检查中见面,热血在检查中激荡。检查就是这样形影不离地跟定你兵生活的每一步。     

比检查更持久的是制度

在面向部队的所有指示、通知中,再没有比检查对兵生活的干预来得更为直接、有效的了。这是兵生活零距离的驱动。卫生、内务、军容、队列、训练、战备……检查的循环往复、大同小异,构成了兵生活之激素。表扬在检查中诞生,批评在检查中见面,热血在检查中激荡。检查就是这样形影不离地跟定你兵生活的每一步。     

亮相“检查兵器”

在面向部队的所有指示、通知中,再没有比检查对兵生活的干预来得更为直接、有效的了。这是兵生活零距离的驱动。卫生、内务、军容、队列、训练、战备……检查的循环往复、大同小异,构成了兵生活之激素。表扬在检查中诞生,批评在检查中见面,热血在检查中激荡。检查就是这样形影不离地跟定你兵生活的每一步。     

一粒米

在面向部队的所有指示、通知中,再没有比检查对兵生活的干预来得更为直接、有效的了。这是兵生活零距离的驱动。卫生、内务、军容、队列、训练、战备……检查的循环往复、大同小异,构成了兵生活之激素。表扬在检查中诞生,批评在检查中见面,热血在检查中激荡。检查就是这样形影不离地跟定你兵生活的每一步。     

基于Stateflow的排队系统仿真方法

论述了排队系统与Stateflow相关概念，利用有限状态机理论与面向对象编程思想，提出了建立基于Stateflow排队系统模型的分析步骤，阐述了应用Stateflow对排队系统进行建模与仿真的方法，使用Stateflow对M／M／1／∞／∞／FIFO类型排队系统进行了具体的建模与仿真。仿真结果表明，基于Stateflow的模型与仿真能够有效地描述排队系统的统计特性，并具有可视化、流程化和层次化的特点。     

Approximation for the departure process of a queue in a network

A simple renewal process is identified to approximate the complex departure process of a queue often found in queueing network models. The arrival process to the queue is the superposition or merging of several independent component-renewal processes that are approximations of departure processes from other queues and external arrival processes; there is a single server with exponential service times, and the waiting space is infinite. The departure process of this queue is of interest because it is the arrival process to other queues in the network. The approximation proposed is a hybrid; the mean and variance of the approximating departure intervals is a weighted average of those determined by basic methods in Whitt [41] with the weighting function empirically determined using simulation. Tandem queueing systems with superposition arrival processes and exponential service times are used to evaluate the approximation. The departure process of the first queue in the tandem is approximated by a renewal process, the tandem system is replaced by two independent queues, and the second queue is solved analytically. When compared to simulation estimates, the average absolute error in hybrid approximations of the expected number in the second queue is 6%, a significant improvement over 22–41% in the basic methods.     

The single server queue in discrete time-numerical analysis III

This paper deals with the stationary analysis of the finite, single server queue in discrete time. The following stntionary distributions and other quantities of practical interest are investigated: (1) the joint density of the queue length and the residual service time, (2) the queue length distribution and its mean, (3) the distribution of the residual service time and its mean, (4) the distribution and the expected value of the number of customers lost per unit of time due to saturation of the waiting capacity, (5) the distribution and the mean of the waiting time, (6) the asymptotic distribution of the queue length following departures The latter distribution is particularly noteworthy, in view of the substantial difference which exists, in general, between the distributions of the queue lengths at arbitrary points of time and those immediately following departures.     

State-dependent gap acceptance

This paper considers a traffic problem in which vehicles queue up according to a Poisson process on a single-lane entrance ramp prior to merging into a major stream of vehicular traffic. In order to then prevent the ramp queue from becoming too large, a model is proposed which considers a lowering of the critical gap as the ramp queue size increases. With the critical gap assumed to be a nonincreasing function of the number of vehicles on the ramp at instances that correspond to departure times of lead vehicles from the ramp queue, the resultant model is an M/G/1 queue with state-dependent service times. Some general results are obtained for this model and a specific case discussed in moderate detail.     

A queuing process with bilevel hysteretic service-rate control

The purpose of this paper is to analyze the effect of a particular control doctrine applied to the service mechanism of a queuing process. A bilevel hysteretic control based on queue length control levels is employed in an M/M/1 queuing system. Expressions are obtained for queue length probabilities, the first two factorial moments of queue length and two figures of merit for describing control performance under the assumption of statistical equilibrium. Computational examples illustrate the effects on queuing processes subject to this type of control. Several cost formulae are considered for comparison of costs when the queue control doctrine is varied. Situations in which hysteretic control is useful are discussed.     

随机环境中的M/MY/1排队系统

文献［４］讨论了随机环境中的Ｍ／Ｍ／１排队模型，本文提出和讨论随机环境中的Ｍ／Ｍｙ／１排队模型，在统计平衡条件下给出了队长和等待队长的平稳分布以及平均队长和平均等待队长，得到了等待时间和逗留时间分布以及平均等待时间和平均逗留时间。     

Workload distribution of discrete‐time parallel queues with two servers

We study discrete‐time, parallel queues with two identical servers. Customers arrive randomly at the system and join the queue with the shortest workload that is defined as the total service time required for the server to complete all the customers in the queue. The arrivals are assumed to follow a geometric distribution and the service times are assumed to have a general distribution. It is a no‐jockeying queue. The two‐dimensional state space is truncated into a banded array. The resulting modified queue is studied using the method of probability generating function (pgf) The workload distribution in steady state is obtained in form of pgf. A special case where the service time is a deterministic constant is further investigated. Numerical examples are illustrated. © 2000 John Wiley & Sons, Inc. Naval Research Logistics 47: 440–454, 2000     

一个具有相互独立、不同分布服务时间序列的排队模型

讨论的排队模型 ,放宽了GI/G/1系统中“服务时间独立同分布”的限制 ,只要求各服务时间相互独立 ,因而较GI/G/1排队模型能更合理地拟合实际问题 .在此较宽的条件下 ,利用补充变量的方法 ,求得了该排队系统队长的瞬时分布     

Optimal control for entry of many classes of customers to an M/M/1 queue

A method is developed for determining the optimal policy for entry of customers from many independent classes of Poisson arrivals to a first-come, first-serve (for customers admitted to the queue) single-server queue with exponential service times. The solution technique utilizes a semi-Markov formulation or the decision problem.