Shockwave-based queue estimation approach for undersaturated and oversaturated signalized intersections using multi-source detection data

With the progress of information and sensing technologies, estimating vehicular queue length at signalized intersections becomes feasible and has attracted considerable attention. The existing studies provided a solid theoretical foundation for the estimation; however, the studies have some restrictions or limitations more or less. This paper presents a new methodology for estimating vehicular queue length at signalized intersections using multi-source detection data under both undersaturated and oversaturated conditions. The methodology applies the shockwave theory to model queue dynamics. Using data from probe vehicles and point detectors, analytical formulations for calculating the maximum and minimum (residual) queue lengths of each cycle are developed. Ground truth data were collected from numerical experiments conducted at two intersections in Shanghai, China, to verify the proposed methodology. It is found that the methodology has mean absolute percentage errors of 17.09% and 12.28%, respectively, for maximum queue length estimation in two tests, which are reasonably effective. However, the methodology is unsatisfactory in estimating the residual queue length. Other limitations of the proposed models and algorithms are also discussed in the paper.     

路段平均行程时间估计方法

为了有效利用线圈检测数据,精确估计路段平均行程时间,提出了一种路段平均行程时间估计方法。将路段平均行程时间分为平均行驶时间、平均排队时间和平均通过路口时间三部分。考虑线圈埋设的特点,通过估计平均行驶速度得到平均行驶时间。用分段时齐Poisson过程描述车辆驶入路段过程和驶离过程,用Markov排队模型描述车辆排队过程,用生灭过程描述排队车辆数,得到车辆排队模型,计算了路段有、无初始排队的平均排队时间。基于选取与路口相关的饱和流率和平均车长,计算了平均通过路口时间。计算结果表明:平均行程时间估计值与实测值的误差小于12%,说明路段平均行程时间估计方法可行。     

�������ģ���������������ŶӺ�����Ԥ����һ�����о�

简单输入输出模型与冲击波分析是研究交通瓶颈问题的两种常用方法,本文着重分析两者的一致性。在数学推导中考虑到达需求与流出率的变化时,两者对于排队和延误的预测结果是一致的。在不同的交通和边界条件下,两者在拥堵形成至消散的任意时刻所得排队长度,拥堵时间等结果均是一致的。以往认为两种方法不一致的研究忽略了一些与背景交通密切相关的基本因素。实例分析说明正是这些基本因素使得这两种分析方法在不同流量－密度关系下都具有一致性。     

基于 M/G/1模型的停车场出口排队延误

通过对大型停车场高峰时段出口车辆行驶特性的调查研究,选取了车辆排队的出口车头时距以及出口服务时间两个指标。基于两个指标实测特性和 M/G/1排队模型的分析,计算了停车场出口理论平均排队时间。通过实测车辆平均排队时间,对理论模型计算的平均排队时间进行了修正。实例分析表明：排队时间修正模型能够准确地估计排队时间。提出了基于驾驶员容忍度的排队延误分级标准。     

A Dynamic Job Scheduling Algorithm for Parallel System

One of the fundamental problems in parallel and distributed systems is deciding how to allocate jobs to processors. The goals of job scheduling in a parallel environment are to minimize the parallel execution time of a job and try to balance the user‘s desire with the system‘s desire. The users always want their jobs be completed as quickly as possible, while the system wants to service as many jobs as possible. In this paper, a dynamic job-scheduling algorithm was introduced. This algorithm tries to utilize the information of a practical system to allo-cate the jobs more evenly. The communication time between the processor and scheduler is overlapped with the computation time of the processor. So the communication overhead can he little. The principle of scheduling the job is based on the desirability of each processor. The scheduler would not allocate a new job to a processor that is already fully utilized. The execution efficiency of the system will he increased. This algorithm also can he reused in other complex algorithms.     

A PARALLEL SWITCH FABRIC BASED ON CROSSBAR

With the increase of link rate, the arbitrator of centralized switch fabric becomes too complicated to implement. A parallel switch fabric based on crossbar, named as PSFBC （Parallel Switch Fabric Based on Crossbar）, has been proposed in this paper. PSFBC is composed of k switches whose rate is 1/k of link, these switches exchange cells in parallel; this increases the arbitrator＇s period and make it easy to implement. Load is evenly distributed to each switch with FCFS （First Come First Serve） rule, it can keep the order of cells in one stream. A multi-class queue scheduling policy is used in PSFBC to ensure the quality of realtime streams. Experiments show that the load on each switch in PSFBC is well balanced, its average delay of cells is little and its performance is very close to centralized switch; and with the increase of number of parallel switches, the loss of PSFBC＇s performance keeps very small, it becomes easier to implement.     

基于响应时间的时隙需求与仿真分析

响应时间是描述数据链网络实时性以及分析网络能否满足作战要求的重要指标,其大小与分配的时隙数量有关。文章针对随机性消息的特点,运用排队论研究了时分多址数据链网络满足实时性要求的时隙需求,并构建了作战平台消息的产生、排队等候及发送过程的仿真模型。结果表明,理论计算与仿真结果得到的平均响应时间基本吻合,但仿真显示,不同消息的响应时间相差较大,有些消息甚至不能满足作战要求。所以,时隙需求数量必须进行仿真验证并据此进行调整,以获得最佳的分配方案。文章给出的时隙需求分析理论及仿真平台能用于数据链网络设计及仿真验证工作。     

基于流体逼近的路段交通流动态加载研究

路段交通流动态加载是动态交通网络分配模型中的重要组成部分,在路段交通流动态加载中,离散形式或者连续形式的点排队模型被广泛使用.本文在以往研究的基础上,提出基于流体逼近的连续型点排队模型,克服了原有点排队模型中排队负值的情况.通过分析可以发现,原有点排队模型实质上属于具有单一服务台和无限容量的排队模型,基于流体逼近的思想重新定义了原有点排队模型.其中3 个主要部分是流量守恒模型,车辆流出模型和时间相关的服务台模型,这3 个模型全部都是连续的.由于连续点排队对计算需求较高,本文将连续的排队模型离散化,模拟了3 种不同场景下车辆驶出、路段排队情况.本文模型克服了原有点排队中的负排队现象,并且排队过程满足先进先出的原则,模型具有良好的模拟效果.     

快速路出口辅路与地面交叉口协调控制策略研究

快速路出口及辅路通过的流量增大时,易造成出口下游交叉口的拥堵,同时拥堵会向上游蔓延造成快速路出口范围的拥堵。为缓解出口范围的拥堵,提出了一种新的协调控制策略。以辅路衔接路段排队为监测变量,协调计算出口下游交叉口的周期、绿信比和辅路的绿灯时长,并给出了各控制变量小步距连续调整的算法。仿真实验结果表明该协调控制策略是有效的,与固定配时策略相比,出口匝道通过固定流量持续时间至少减少了10%。     

基于弃尾队列的SCTP稳态吞吐量建模与分析

流控制传输协议（SCTP）是一个基于IP网络用于传输信令的新传输协议．由于其具有很多新的特性尤其对多宿的支持,使得其正在成为一种通用传输协议．本文对基于弃尾队列情况下的流控制传输协议的数据传输进行建模,得到一个稳态吞吐量关于丢包率的函数关系,并对结果进行仿真验证和分析．实验结果显示,该模型能够很好的估计流控制传输协议在弃尾引发丢包情况下的稳态吞吐量．