An interpolation approximation for the GI/G/1 queue based on multipoint Padé approximation

The performance evaluation of many complex manufacturing, communication and computer systems has been made possible by modeling them as queueing systems. Many approximations used in queueing theory have been drawn from the behavior of queues in light and heavy traffic conditions. In this paper, we propose a new approximation technique, which combines the light and heavy traffic characteristics. This interpolation approximation is based on the theory of multipoint Padé approximation which is applied at two points: light and heavy traffic. We show how this can be applied for estimating the waiting time moments of the ^GI/G/1 queue. The light traffic derivatives of any order can be evaluated using the MacLaurin series analysis procedure. The heavy traffic limits of the ^GI/G/1 queue are well known in the literature. Our technique generalizes the previously developed interpolation approximations and can be used to approximate any order of the waiting time moments. Through numerical examples, we show that the moments of the steady state waiting time can be estimated with extremely high accuracy under all ranges of traffic intensities using low orders of the approximant. We also present a framework for the development of simple analytical approximation formulas. This revised version was published online in June 2006 with corrections to the Cover Date.     

Light traffic for workload in queues

General exact light traffic limit theorems are given for the distribution of steadystate workloadV, in open queueing networks having as input a general stationary ergodic marked point process {(t _n ,K _n )n0 (where t_n denotes the arrival time and K_n the routing and service times of the nth customer). No independence assumptions of any kind are required of the input. As the light traffic regime, it is only required that the Palm distribution for the exogenous interarrival time converges weakly to infinity (while the service mechanism is not allowed to change much). As is already known in the context of a single-server queue, work is much easier to deal with mathematically in light traffic than is customer delayD, and consequently, our results are far more general than existing results forD. We obtain analogous results for multi-channel and infinite-channel queues. In the context of open queueing networks, we handle both the total workload in the network as well as the workload at isolated nodes.Research supported in part by the Japan Society for the Promotion of Science during the author's fellowship in Tokyo, and by NSF Grant DDM 895 7825.     

半挂货车内轮差问题改善设想

基于降低货车内轮差安全隐患的考虑,根据已有的研究成果对半挂车内轮差问题改善方向提出设想,基于刚体运动学原理提出具体改进方案,导出转弯时半挂车运动轨迹方程,运用Matlab软件从理论上进行了验证。     

固定需求下基于概率型随机平衡的交通网络设计模型及算法

在考虑网络中用户的路径选择行为满足概率型随机平衡的条件下,给出了交通网络设计的双层规划模型,同时设计了基于差分的启发式求解算法．     

交通事故的时空热点分析

针对目前交通事故分析中时空维度分离的不足,以H市2013―2015年的交通事故数据为研究对象,根据自组织神经网络、平行坐标系、时空颜色矩阵和时空网络核密度估计、热点分析法,分别从行政区划以及道路网络上进行交通事故的时空特征分析,从宏观和微观角度揭示交通事故的时空热点区域。结果表明,整体来说,在空间上,H市交通事故热点区域4个街道高于8个镇,呈明显的“两带一中心”分布,即硖许线与101省道形成的带状区域和市政府所在的行政中心区域;时间上,早、晚高峰时段最为严重,夜晚较为轻微,呈明显的区域特征分布,即工业办公区热点出现在早高峰时段,生活住宅区热点出现在晚高峰时段,商业消费区热点出现在夜晚时段。     

Steady state speed distribution analysis for a combined cellular automaton traffic model

Cellular Automaton （CA） based traffic flow models have been extensively studied due to their effectiveness and simplicity in recent years. This paper develops a discrete time Markov chain （DTMC） analytical framework for a Nagel-Schreckenberg and Fukui Ishibashi combined CA model （W^2H traffic flow model） from microscopic point of view to capture the macroscopic steady state speed distributions. The inter-vehicle spacing Maxkov chain and the steady state speed Markov chain are proved to be irreducible and ergodic. The theoretical speed probability distributions depending on the traffic density and stochastic delay probability are in good accordance with numerical simulations. The derived fundamental diagram of the average speed from theoretical speed distributions is equivalent to the results in the previous work.     

一种复杂网络路由策略的普适优化算法

现有的复杂网络路由策略很多,改进算法也不断涌现,但是目前还没有一个统一的标准来衡量算法是否达到网络最佳传输效果.针对这一问题,本文提出一种适用于现有路由策略的普适优化算法.首先通过理论分析指出制约网络传输能力的关键因素是最大介数中心度,因而"最大介数中心度是否已经最低"成为评判路由策略是否最优的标准.在此基础上,采用"惩罚选择法"避开网络中介数中心度值比较大的节点,使网络介数中心度值分布更均匀,均衡网络中各个节点的传输负载.仿真结果显示,该优化算法针对现有路由策略均能降低最大介数中心度值,大幅度提高网络的传输能力.     

考虑公交港湾式停靠的多速混合城市交通流元胞自动机模型研究

在Nagel-Schreckenberg提出的元胞自动机模型基础上,建立了考虑公交车辆和港湾式公交停靠站的多速混合车辆单车道城市交通流元胞自动机模型.通过计算机模拟,给出了随机减速概率、混合车流密度、公交车辆平均停靠时间、公交车辆占有率和港湾式公交车站间距对混合车流速度和流量的影响图.对混合车流的特性进行了分析和讨论. 关键词： 元胞自动机 港湾式公交停靠站 混合交通流模型 计算机模拟     

信号灯和公交车站对T形路口交通流的影响研究

采用非线性映射模型研究T形路口的交通问题,利用点平均流量指标系统地分析了公交车站、信号灯周期、绿信比、车辆左右转弯等因素对路径交通流量的影响.数值模拟结果表明,信号灯和公交车站之间的相互影响容易导致交通流的串现象,不同路径上的流量与信号灯周期、绿信比和公交车站位置之间存在一定的关系. 关键词： 交通流 非线性映射模型 信号控制 串