No description available.

For decades, vehicle time-headway distribution models have been studied by many researchers and traffic engineers. A good time-headway model can be beneficial to traffic studies and management in many aspects; e.g. with a better understanding of road traffic patterns and road user behaviour, the researchers or engineers can give better estimations and predictions under certain road traffic conditions and hence make better decisions on traffic management and control. The models also help us to implement high-quality microscopic traffic simulation studies to seek good solutions to traffic problems with minimal interruption of the real traffic environment and minimum costs. Compared within previously studied models, the mixed (SPM and GQM) mod- els, especially using the gamma or lognormal distributions to describe followers headways, are probably the most recognized ones by researchers in statistical stud- ies of headway data. These mixed models are reported with good fitting results indicated by goodness-of-fit tests, and some of them are better than others in com- putational costs. The gamma-SPM and gamma-GQM models are often reported to have similar fitting qualities, and they often out-perform the lognormal-GQM model in terms of computational costs. A lognormal-SPM model cannot be formed analytically as no explicit Laplace transform is available with the lognormal dis- tribution. The major downsides of using mixed models are the difficulties and more flexibilities in fitting process as they have more parameters than those single models, and this sometimes leads to unsuccessful fitting or unreasonable fitted pa- rameters despite their success in passing GoF tests. Furthermore, it is difficult to know the connections between model parameters and realistic traffic situations or environments, and these parameters have to be estimated using headway samples. Hence, it is almost impossible to explain any traffic phenomena with the param- eters of a model. Moreover, with the gamma distribution as the only common well-known followers headway model, it is hard to justify whether it has described the headway process appropriately. This creates a barrier for better understanding the process of how drivers would follow their preceding vehicles. This study firstly proposes a framework developed using MATLAB, which would help researchers in quick implementations of any headway distributions of interest. This framework uses common methods to manage and prepare headway samples to meet those requirements in data analysis. It also provides common structures and methods on implementing existing or new models, fitting models, testing their performance hence reporting results. This will simplify the development work involved in headway analysis, avoid unnecessary repetitions of work done by others and provide results in formats that are more comparable with those reported by others. Secondly, this study focuses on the implementation of existing mixed models, i.e. the gamma-SPM, gamma-GQM and lognormal-GQM, using the proposed framework. The lognormal-SPM is also tested for the first time, with the recently developed approximation method of Laplace transform available for lognormal distributions. The parameters of these mixed models are specially discussed, as means of restrictions to simplify the fitting process of these models. Three ways of parameter pre-determinations are attempted over gamma-SPM and gamma-GQM models. A couple of response-time (RT) distributions are focused on in the later part of this study. Two RT models, i.e. Ex-Gaussian (EMG) and inverse Gaussian (IVG) are used, for first time, as single models to describe headway data. The fitting performances are greatly comparable to the best known lognormal single model. Further extending this work, these two models are tested as followers headway distributions in both SPM and GQM mixed models. The test results have shown excellent fitting performance. These now bring researchers more alternatives to use mixed models in headway analysis, and this will help to compare the be- haviours of different models when they are used to describe followers headway data. Again, similar parameter restrictions are attempted for these new mixed models, and the results show well-acceptable performance, and also corrections on some unreasonable fittings caused by the over flexibilities using 4- or 5- parameter models.

In this thesis, we address the problem of minimizing the average delay of data pack-ets served by a transmitter on a static, point-to-point link. The transmitter dynamically chooses state-dependent admission and transmission rates, while adhering to average throughput and transmission power constraints. The transmitter is modelled as an infinite buffer Markov queue with adjustable arrival and service rates. Data packets arrive at the system according to a Poisson process with rate, Λ, and are admitted at a rate, λnwith 0≤ λn ≤ Λ, depending on the number, n, of data packets present in the system. The packet size is assumed to be exponentially distributed, and the controller chooses a transmission rate, µn, at most equal to a maximum value, M, depending on the current backlog, n, in the system. The objective is to minimize the average delay of data packets in the system subject to a throughput lower bound constraint, while satisfying an upper bound on the average transmission power. This constrained MDP problem is solved using a Lagrange relaxation approach and analysed for the cases with throughput and power constraints that are achievable with equality by appropri-ate values of the Lagrange multipliers. A procedure is developed, based on explicit formulae, using which optimal admission and service rates as a function of the packet queue length are obtained.

This thesis concerns measuring, understanding and modelling Internet traffic. We first study the origins of the statistical properties of Internet traffic, in particular its scaling behaviour, and propose a constructive model of packet traffic with physically motivated parameters. We base our analysis on a large amount of empirical data measured on different networks, and use a so called semi-experimental approach to isolate certain features of traffic we seek to model. These results lead to the choice of a particular Poisson cluster process, known as Bartlett-Lewis point process, for a new packet traffic model. This model has a small number of parameters with simple networking meaning, and is mathematically tractable. It allows us to gain valuable insight on the underlying mechanisms creating the observed statistics. / In practice, Internet traffic measurements are limited by the very large amount of data generated by high bandwidth links. This leads us to also investigate traffic sampling strategies and their respective inversion methods. We argue that the packet sampling mechanism currently implemented in Internet routers is not practical when one wants to infer the statistics of the full traffic from partial measurements. We advocate the use of flow sampling for many purposes. We show that such sampling strategy is much easier to invert and can give reasonable estimates of higher order traffic statistics such as distribution of number of packets per flow and spectral density of the packet arrival process. This inversion technique can also be used to fit the Bartlett-Lewis point process model from sampled traffic. / We complete our understanding of Internet traffic by focusing on the small scale behaviour of packet traffic. To do so, we use data from a fully instrumented Tier-1 router and measure the delays experienced by all the packets crossing it. We present a simple router model capable of simply reproducing the measured packet delays, and propose a scheme to export router performance information based on busy periods statistics. We conclude this thesis by showing how the Bartlett-Lewis point process can model the splitting and merging of packet streams in a router.

Temps Inter-véhiculaire (TIV) est une variable microscopique fondamentale dans la théorie du trafic, et a été étudié depuis le début du développement de cette théorie, vers 1930. La distribution de probabilité du TIV décrit la répartition des arrivées des véhicules en un point donné et reflète dans une certaine mesure le comportement de conduite. Beaucoup d'applications en ingénierie du trafic viennent de la connaissance fine de cette variable. La thèse a pour but d'approfondir cette connaissance en modélisant la distribution du TIV dans différents contextes selon différents points de vue. Tout d'abord, deux méthodes d'échantillonnage, la méthode de groupement et la méthode de raffinement sont considérées. L'application numérique concerne deux bases de données, celle de la route nationale RN118 et celle de l'autoroute A6. Ensuite, trois types de modèles probabilistes sont analysés et classifiés. Une comparaison exhaustive des modèles et des méthodes d'estimation est réalisée ce qui conduit à considérer que le modèle gamma-GQM est supérieur aux autres modèles en matière de performance statistique et en efficacité de calcul. Différentes procédures d'estimation sont testées, celle qui est proposée et retenue favorise la stabilité des paramètres estimés. Six nouveaux modèles de TIV sont proposés, calibrés, analysés. Mis à part deux modèles de performance inférieure aux autres et au modèle gamma-GQM, quatre modèles sont équivalents voire meilleurs que le modèle gamma-GQM. Pour une raison pratique, le modèle Double Gamma est choisi à côté du modèle gamma-GQM, comme modèle de comparaison, dans toute la modélisation des TIV. Le calibrage des modèles et l'analyse des paramètres des modèles sont menés, à partir des données réelles, en considérant trois dimensions d'étude du trafic: les échelles macroscopique, mésoscopique et microscopique. Une quatrième dimension d'étude des TIV est constituée des facteurs exogènes au trafic. La prise en compte de ces facteurs exogènes, à chaque échelle macroscopique entraîne la distinction de deux types de facteur exogène : « empêchant » et « impulsant». Finalement, différentes approches de validation sont testées. L'approche proposée par « enveloppe des distributions » semble prometteuse pour le futur / Time Headway (TH) is a microscopic variable in traffic flow theories that has been studied since the 1930s. Distribution of this fundamental variable describes the arrival pattern of vehicles in traffic flow, so probabilistic modeling is the main approach to study TH and represent driving behaviour. The applications of the variable in traffic engineering are varied; include capacity calculation, microscopic simulation, traffic safety analysis, etc. This dissertation aims at modeling the TH distribution in different contexts. Firstly, the short-time sampling method and long-time sampling method are applied to obtain TH samples from the two data bases (the RN118 national roadway and the A6 motorway). Then, three probabilistic TH model types are analyzed and classified. An exhaustive comparison between the existing models and between the corresponding estimation methods lead to consider that the gamma-GQM is the best TH model in the literature. An estimation process is also proposed in order to obtain good and stable estimated results of the parameters. After that, the TH probabilistic modeling is developed by six new models. Except for the two ones which are worse, the four other models are statistically equivalent and/or better than the gamma-GQM. For practical reason, the Double Gamma model is selected, as a comparison model, with the gamma-GQM to calibrate all TH samples. Three traffic levels are considered: macroscopic, mesoscopic and microscopic. The effects of exogenous factors are also examined. Examining this factor in each macroscopic variable level leads to distinguish two following factor types: impeding factor and propulsive factor. Finally, different approaches for TH validation are tested. The proposed approach of “envelope of distributions” seems to be promising for future applications

No description available.

Scheduling policies adopted for statistical multiplexing should provide delay differentiation between different traffic classes, where each class represents an aggregate traffic of individual applications having same target-queueing-delay requirements. We propose scheduling to optimally balance weighted mean instanteneous queue lengths and later weighted mean cumulative queue lengths as an approach to delay differentiation, where the class weights are set inversely proportional to the respective products of target delays and packet arrival rates. In particular, we assume a discrete-time, two-class, single-server queueing model with unit service time per packet and provide mathematical frame-work throughout our work. For iid Bernoulli packet arrivals, using a step-wise cost-dominance analytical approach using instantaneous queue lengths alone, for a class of one-stage cost functions not necessarily convex, we find the structure of the total-cost optimal policies for a part of the state space. We then consider two particular one-stage cost functions for finding two scheduling policies that are total-cost optimal for the whole state-space. The policy for the absolute weighted difference cost function minimizes the stationary mean, and the policy for the weighted sum-of-square cost function minimizes the stationary second-order moment, of the absolute value of the weighted difference of queue lengths. For the case of weighted sum-of-square cost function, the ‘iid Bernoulli arrivals’ assumption can be relaxed to either ‘iid arrivals with general batch sizes’ or to ‘Markovian zero-one arrivals’ for all of the state space, but for the linear switching curve. We then show that the average cost, starting from any initial state, exists, and is finite for every stationary work-conserving policy for our choices of the one-stage cost-function. This is shown for arbitrary number of class queues and for any i.i.d. batch arrival processes with finite appropriate moments. We then use cumulative queue lengths information in the one-step cost function of the optimization formulation and obtain an optimal myopic policy with 3 stages to go for iid arrivals with general batch sizes. We show analytically that this policy achieves the given target delay ratio in the long run under finite buffer assumption, given that feasibility conditions are satisfied. We take recourse to numerical value iteration to show the existence of average-cost for this policy. Simulations with varied class-weights for Bernoulli arrivals and batch arrivals with Poisson batch sizes show that this policy achieves mean queueing delays closer to the respective target delays than the policy obtained earlier. We also note that the coefficients of variation of the queueing delays of both the classes using cumulative queue lengths are of the same order as those using instantaneous queue lengths. Moreover, the short-term behaviour of the optimal myopic policy using cumulative queue lengths is superior to the existing standard policy reported by Coffman and Mitrani by a factor in the range of 3 to 8. Though our policy performs marginally poorer compared to the value-iterated, sampled, and then stationarily employed policy, the later lacks any closed-form structure. We then modify the definition of the third state variable and look to directly balance weighted mean delays. We come up with another optimal myopic policy with 3 stages to go, following which the error in the ratio of mean delays decreases as the window-size, as opposed to the policy mentioned in the last paragraph, wherein the error decreases as the square-root of the window-size. We perform numerical value-iteration to show the existence of average-cost and study the performance by simulation. Performance of our policy is comparable with the value-iterated, sampled, and then stationarily employed policy, reported by Mallesh. We have then studied general inter-arrival time processes and obtained the optimal myopic policy for the Pareto inter-arrival process, in particular. We have supported with simulation that our policy fares similarly to the PAD policy, reported by Dovrolis et. al., which is primarily heuristic in nature. We then model the possible packet errors in the multiplexed channel by either a Bernoulli process, or a Markov modulated Bernoulli process with two possible channel states. We also consider two possible round-trip-time values for control information, namely zero and one-slot. The policies that are next-stage optimal (for zero round-trip-time), and two-stage optimal (for one-slot round-trip-time) are obtained. Simulations with varied class-weights for Bernoulli arrivals and batch arrivals with Poisson batch sizes show that these policies indeed achieve mean queueing delays very close to the respective target delays. We also obtain the structure for optimal policies with N = 2 + ⌈rtt⌉ stages-to-go for generic values of rtt, and which need not be multiple of time-slots.