On approximating multifractal traffic burstiness with Markov modulated Poisson processes

We investigate the approximating capability of Markov modulated Poisson processes (MMPP) for modeling multifractal Internet traffic. The choice of MMPP is motivated by its ability to capture the variability and correlation in moderate time scales while being analytically tractable. Important statistics of traffic burstiness are described and a customized moment-based fitting procedure of MMPP to traffic traces is presented. Our methodology of doing this is to examine whether the MMPP can be used to predict the performance of a queue to which MMPP sample paths and measured traffic traces are fed for comparison respectively, in addition to the goodness-of-fit test of MMPP. Numerical results and simulations show that the fitted MMPP can approximate multifractal traffic quite well, i.e. accurately predict the queueing performance.

Packet Queueing Delay in Resilient Packet Ring Network Nodes

The packet queueing delay is one of the most important performance measures of a data net-work and is also a significant factor to be considered in the scheduling buffer design for a network node. This paper presents a traffic queueing model for resilient packet ring (RPR) networks and a method for quantitatively analyzing queueing delays in RPR nodes. The method was used to calculate the average queueing delays of different priority traffic for different transit queue modes. The simulations show that, in the transmit direction, lower priority traffic is delayed more than higher priority traffic, and that Class-A traffic is delayed more in a single-queue ring than in a dual-queue ring. In the transit direction, the secondary tran-sit buffer in the dual-queue ring contributes more to the traffic delay than the primary transit buffer in the sin-gle-queue ring, which in turn causes more delay than the primary transit buffer in the dual-queue ring.

A case study on multi-lane roundabouts under congestion:Comparing software capacity and delay estimates with field data

Existing studies on modern roundabouts performance are mostly based on data fron： singe lane roundabouts that are not heavily congested. For planners and designers interested in building multilane roundabouts for intersections with potential growth i~ future traffic, there has been a lack of existing studies with field data that provide reference values in terms of capacity and delay measurements. With the intent of providing such reference values, a case study was conducted by using the East DowlinC Road Roundabouts in Anchorage, Alaska, which are currently operating with extensive queues during the evening peak hours. This research used multiple video camcorders t（ capture vehicle turning movements at the roundabouts as well as the progressior~ of vehicle queues at the roundabout entrance approaches. With these video records, the number of vehicles in the queues can be accurately counted in any single minute during the peak hours. This study shows that unbalanced entrance flow patterns （i.e., ~ne entrance has significant higher flow than others） can intensify the queue and delay fo., the overall roundabouts. Then various software packages including RODEL, SIDRA and VISSIM were used to estimate several performance measurements, such as capacity. queue length, and delay, compared with the collected field data. With the comparison, it is found that all the three software packages overestimate multi-lane roundabout ca pacity before calibration. With default parameters, SIDRA and VISSIM tend to underes timate delays and queue lengths for the multi-lane roundabouts under congestion, while RODEL results in higher delay and queue length estimations at most of the entrance approaches.

State of the art and computational aspects of time-dependent waiting models for non-signalised intersections

Time-dependent models are of great importance in highway engineering as they are appropriate for evaluating waiting times and queue lengths at intersections,which are integral parts of various activities in planning,verification and decision support for infrastructure.After reviewing the literature of the main time-dependent models based on the coordinate transformation method and a discussion about some computational issues in time-evolution profiles for non-signalised intersections,the paper identifies the requirements these models have to satisfy in order to be used as"basic"cases for analysing complex evolutionary situations.Three"basic"cases are presented with their timedependent equations for vehicle waiting times and vehicle number;they have been completed and dimensionally homogenised in this paper.As they are recursive,these formulas can be applied for sequential intervals in the time domain in both vehicles and passenger car units.The closed-form expressions for state variables show to be mutually equivalent in comparison with discrete event simulation models and imbedded Markov chain results.For all the three models the paper presents a common deterministic simplification for average waiting time,with good approximation results in the tested cases.The proposed time-dependent formulas will contribute to a better adherence to the real phenomena,compared to the extremely simplified and unrealistic methods suggested by the international manuals for level of service assessment.The proposed formulas will be useful for current applications and possible future development in order to meet the emerging needs of road and transport engineering.