This thesis consists of five scientific articles oriented towards capacity. Managing capacity constraints with associated delays is a big issue at new design as well as at trimming existing traffic facilities. In larger Swedish cities these challenges have become more and more important as a result of growing traffic demand due to rapid population increase.Models for estimating capacity and delay are available, but not many are calibrated for Swedish conditions due to the high effort required. This thesis documents development and calibration of new models for motorway links, entry and exit lanes and weaving areas and an developed space-time model with the ability to calculate queue length, delay, etc.The first article is focused on identifying weaknesses in the former Swedish capacity method for motorways, and development of new models overcoming these shortcomings. The development includes new models for jam density at queue, capacity in weaving areas and fundamental flow-density relationships for 15 different highway types for inclusion in the new Swedish capacity manual.The second article describes the development of a Swedish motorway space-time model to estimate travel times and queues in oversaturated conditions based on the American FREEVAL model in Highway Capacity Manual 2010 (HCM 2010). Calibration and validation of the model has been performed with data from the Motorway Control System (MCS) in Stockholm. A good correspondence was obtained for most cases, but further calibration and validation efforts are required for entry and exit lanes.The third article describes further development of the intersection model in the Swedish microscopic model “Rural Traffic Simulator (RuTSim). This is a continuation of the work documented in the author’s licentiate thesis published in 2002. The development focused on simulation of intersections using a new concept on lane use not included in the old RuTSim model. The model describes Swedish rural intersections with flared approaches providing a non-discreet lane use due to vehicle types in queue. New data for calibration and validation data was also generated. The validation results showed good correspondence between simulated and empirical delay results. The new intersection model is now implemented in RuTSim, providing new tools for estimation of capacity, delay and queue length already included in Swedish guidelines and capacity manuals/software (Capcal).The fourth article describes the development of a new capacity model for roadwork zones. Focus is on the resulting capacity of one lane due to several reduction factors. These factors include impacts of closed road shoulders, reduction of number of lanes, diversion of traffic to the opposite carriageway, commuting traffic, length of work zone, lane width and type of road work. The first two correction factors were successfully validated in a full-scale test on the E6 motorway in Gothenburg.The fifth article describes development and implementation of a new harmonization algorithm for MCS systems on motorways designed to increase bottleneck capacity and throughput. Two different models were developed, one of which was implemented in the existing MCS system on E4 Södertäljevägen south of Stockholm. Full-scale trials were carried out with a model based on trigger levels in terms of flow. The second model based on the difference in the variance of speed during two following time periods was tested offline also with very good results. / <p>QC 20160429</p>

Active Queue Management (AQM) schemes are used for ensuring the Quality of Service (QoS) in telecommunication networks. However, they are sensitive to parameter settings and have weaknesses in detecting and controlling congestion under dynamically changing network situations. Another drawback for the AQM algorithms is that they have been applied only on the Markovian models which are considered as Short Range Dependent (SRD) traffic models. However, traffic measurements from communication networks have shown that network traffic can exhibit self-similar as well as Long Range Dependent (LRD) properties. Therefore, it is important to design new algorithms not only to control congestion but also to have the ability to predict the onset of congestion within a network. An aim of this research is to devise some new congestion control methods for communication networks that make use of various traffic characteristics, such as LRD, which has not previously been employed in congestion control methods currently used in the Internet. A queueing model with a number of ON/OFF sources has been used and this incorporates a novel congestion prediction algorithm for AQM. The simulation results have shown that applying the algorithm can provide better performance than an equivalent system without the prediction. Modifying the algorithm by the inclusion of a sliding window mechanism has been shown to further improve the performance in terms of controlling the total number of packets within the system and improving the throughput. Also considered is the important problem of maintaining QoS constraints, such as mean delay, which is crucially important in providing satisfactory transmission of real-time services over multi-service networks like the Internet and which were not originally designed for this purpose. An algorithm has been developed to provide a control strategy that operates on a buffer which incorporates a moveable threshold. The algorithm has been developed to control the mean delay by dynamically adjusting the threshold, which, in turn, controls the effective arrival rate by randomly dropping packets. This work has been carried out using a mixture of computer simulation and analytical modelling. The performance of the new methods that have.

Mémoire numérisé par la Division de la gestion de documents et des archives de l'Université de Montréal.

Since the field of computer networks has rapidly grown in the last two decades, congestion control of traffic loads within networks has become a high priority. Congestion occurs in network routers when the number of incoming packets exceeds the available network resources, such as buffer space and bandwidth allocation. This may result in a poor network performance with reference to average packet queueing delay, packet loss rate and throughput. To enhance the performance when the network becomes congested, several different active queue management (AQM) methods have been proposed and some of these are discussed in this thesis. Specifically, these AQM methods are surveyed in detail and their strengths and limitations are highlighted. A comparison is conducted between five known AQM methods, Random Early Detection (RED), Gentle Random Early Detection (GRED), Adaptive Random Early Detection (ARED), Dynamic Random Early Drop (DRED) and BLUE, based on several performance measures, including mean queue length, throughput, average queueing delay, overflow packet loss probability, packet dropping probability and the total of overflow loss and dropping probabilities for packets, with the aim of identifying which AQM method gives the most satisfactory results of the performance measures. This thesis presents a new AQM approach based on the RED algorithm that determines and controls the congested router buffers in an early stage. This approach is called Dynamic RED (REDD), which stabilises the average queue length between minimum and maximum threshold positions at a certain level called the target level to prevent building up the queues in the router buffers. A comparison is made between the proposed REDD, RED and ARED approaches regarding the above performance measures. Moreover, three methods based on RED and fuzzy logic are proposed to control the congested router buffers incipiently. These methods are named REDD1, REDD2, and REDD3 and their performances are also compared with RED using the above performance measures to identify which method achieves the most satisfactory results. Furthermore, a set of discrete-time queue analytical models are developed based on the following approaches: RED, GRED, DRED and BLUE, to detect the congestion at router buffers in an early stage. The proposed analytical models use the instantaneous queue length as a congestion measure to capture short term changes in the input and prevent packet loss due to overflow. The proposed analytical models are experimentally compared with their corresponding AQM simulations with reference to the above performance measures to identify which approach gives the most satisfactory results. The simulations for RED, GRED, ARED, DRED, BLUE, REDD, REDD1, REDD2 and REDD3 are run ten times, each time with a change of seed and the results of each run are used to obtain mean values, variance, standard deviation and 95% confidence intervals. The performance measures are calculated based on data collected only after the system has reached a steady state. After extensive experimentation, the results show that the proposed REDD, REDD1, REDD2 and REDD3 algorithms and some of the proposed analytical models such as DRED-Alpha, RED and GRED models offer somewhat better results of mean queue length and average queueing delay than these achieved by RED and its variants when the values of packet arrival probability are greater than the value of packet departure probability, i.e. in a congestion situation. This suggests that when traffic is largely of a non bursty nature, instantaneous queue length might be a better congestion measure to use rather than the average queue length as in the more traditional models.

Lors d'une communication dans un réseau, les nœuds intermédiaires se contentent en général de retransmettre les paquets de données qu'ils reçoivent. Grâce au codage de réseau (NC), ces nœuds intermédiaires peuvent envoyer des combinaisons linéaires des paquets qu'ils ont reçus. Ceci permet une meilleure exploitation de la capacité du réseau et une plus grande robustesse à l'égard de pertes.Cette thèse s'intéresse à une implantation du NC en lien avec TCP (TCP-NC). Grâce à la redondance introduite par le NC, une partie des pertes liées à des liens sans fils peut être compensée. Elle propose en particulier un mécanisme d'adaptation de la redondance introduite par le codage de réseau. Une première partie de cette thèse est consacrée à l'analyse de la dynamique de TCP-NC avec Random Early Detection (RED) comme mécanisme de gestion des files d'attente en utilisant les outils d'optimisation convexe et issus de l’automatique. Nous caractérisons l'équilibre du réseau et les propriétés de stabilité de TCP-Reno en présence de NC. Dans une seconde partie, cette thèse propose un algorithme d'adaptation de la redondance introduite par NC. Dans TCP-NC avec redondance adaptative (TCP-NCAR), cet ajustement se fait grâce à un schéma de différenciation des pertes, qui estime la répartition des pertes entre erreurs de transmission dues aux liens sans fils et pertes liées à la congestion. Les propriétés d'équilibre et de stabilité de TCP-NCAR/RED sont caractérisées. Les résultats théoriques et de simulation montrent que TCP-NCAR adopte une redondance proche de l'optimum quand les taux de perte de paquets sur les liens sans fils sont petits. En outre, le modèle linéarisé autour de l'équilibre montre que TCP-NCAR augmente la taille de la région de stabilité de TCP-Reno. / Communication networks today share the same fundamental principle of operation: information is delivered to their destination by nodes intermediate in a store-and-forward manner.Network coding (NC) is a technique that allows intermediate nodes to send out packets that are linear combinations of previously received information. The main benefits of NC are the potential throughput improvements and a high degree of robustness, which is translated into loss resilience. These benefits have motivated deployment efforts for practical applications of NC, e.g., incorporating NC into congestion control schemes such as TCP-Reno to get a TCP-NC congestion protocol. In TCP-NC, TCP-Reno throughput is improved by sending a fixed amount of redundant packets, which mask part of the losses due, e.g., to channel transmission errors. In this thesis, we first analyze the dynamics of TCP-NC with random early detection (RED) as active queue management (AQM) using tools from convex optimization and feedback control. We study the network equilibrium point and the stability properties of TCP-Reno when NC is incorporated into the TCP/IP protocol stack. The existence and uniqueness of an equilibrium point is proved, and characterized in terms of average throughput, loss rate, and queue length. Our study also shows that TCP-NC/RED becomes unstable when delay or link capacities increases, but also, when the amount of redundant packets added by NC increases. Using a continuous-time model and neglecting feedback delays, we prove that TCP-NC is globally stable. We provide a sufficient condition for local stability when feedback delays are present. The fairness of TCP-NC with respect to TCP-Reno-like protocols is also studied. Second, we propose an algorithm to dynamically adjust the amount of redundant linear combinations of packets transmitted by NC. In TCP-NC with adaptive redundancy (TCP-NCAR), the redundancy is adjusted using a loss differentiation scheme, which estimates the amount of losses due to channel transmission errors and due to congestion. Simulation results show that TCP-NCAR outperforms TCP-NC in terms of throughput. Finally, we analyze the equilibrium and stability properties of TCP-NCAR/RED. The existence and uniqueness of an equilibrium point is characterized experimentally. The TCP-NCAR/RED dynamics are modeled using a continuous-time model. Theoretical and simulation results show that TCP-NCAR tracks the optimal value for the redundancy for small values of the packet loss rate. Moreover, simulations of the linearized model around equilibrium show that TCP-NCAR increases the size of the TCP-Reno stability region. We show that this is due to the compensator effect of the redundancy adaptation dynamics to TCP-Reno. These characteristics of TCP-NCAR allow the congestion window adaptation mechanism of TCP-Reno to react in a smooth way to channel losses, avoiding some unnecessary rate reductions, and increasing the local stability of TCP-Reno.

[pt] Foi feito um estudo da linha de montagem de viaturas do Parque regional de Manutenção da Primeira Região Militar com o objetivo de propor o uso de uma ferramenta computacional que auxilie no planejamento da produção desta organização militar. Para isso, foi criado um modelo, composto de várias estações de trabalho, dispostas em linha e utilizou-se o software de simulação ARENA. Foram executadas análises de sensibilidades e ajustes no modelo, com o objetivo de ajustá-lo. Com os resultados obtidos, conclui-se que uso desta ferramenta computacional proporciona aos gestores desta OM de manutenção do Exército Brasileiro um melhor planejamento da produção anual e conseqüentemente um retorno mais rápido das viaturas às OM de origem. Foi feito, também, uma breve explanação sobre Logística Militar, Fases da Logística Militar, Níveis de Apoio Logístico, Função Logística Manutenção, Escalões de manutenção, Organização da Logística no EB, Teoria de Filas e Simulação. / [en] It was made a study of the assembly line of vehicles of the Regional Park of Maintenance of the First Military Área (PqRMnt/1) with the objective of proposing the use of a computation tool that aids in the planning of the production of this military organization. For that, a model was created, composed of several work stations (workshops), disposed in line and the software of simulation ARENA was used. Analyses of sensibilities and fittings were executed in the model, with the objective of adjusting him/it. With the obtained results, it was ended that use of this computation tool provides to the managers of this OM of maintenance of the Brazilian Army (EB) a better planning of the annual production and consequently a faster return of the vehicles to origin OM. It was done, also, an abbreviation explanation on Military Logistics, Phases of the Military Logistics, Levels of the Logistic Support, Functions Logistics of the Maintenance, Steps of Maintenance, Organization of the Logistics in EB, Theory of Queues and Simulation.

Cette thèse se focalise sur le développement des algorithmes d’ordonnancement sous contrainte (m, k)-firm, ainsi que leurs applications pour la gestion de la qualité de service (QdS) dans les réseaux et systèmes temps réel distribués. L’objectif recherché est la garantie déterministe de la QdS tout en maintenant un fort taux d’utilisation des ressources. Les contributions sont (1) l’établissement d’une condition suffisante d’ordonnançabilité d'un ensemble de tâches sous l’algorithme « distance based priority »; (2) la définition de R-(m, k)-firm, un nouveau modèle qui relâche la contrainte (m, k)-firm et qui permet de modéliser de façon plus juste des exigences du temps réel souple; (3) le développement d’un algorithme efficace de dimensionnement de ressources sous contrainte (m, k)-firm relâchée; (4) la proposition de « Double Leaks Bucket » pour la gestion active de files d'attente permettant de maintenir une QdS en cas de surcharge des réseaux / This work focuses on the scheduling algorithms under (m,k)-firm constraint, as well as the applications for QoS (quality of service) management in the networks and distributed real-time system. The research aim is to achieve the deterministic guarantee of QoS with high resource utilization. The contributions in this thesis include (1) proposing a sufficient condition for determining the schedulability of a real-time task set under Distance Base Priority scheduling algorithm; (2) defining a novel real-time constraint which relaxes the (m,k)-firm constraint and provides a more suitable modelling of soft real-time; (3) developing an effective resource provisioning algorithm under this relaxed (m,k)-firm constraint; (4) proposing an active queue management mechanism, called Double Leaks Bucket, which can guarantee the QoS with dynamic dropping of the packets during the networks overload period

Malgré le développement de biomatériaux de plus en plus nombreux dans le domaine des greffes osseuses et de la préservation alvéolaire, les résultats sont toujours insuffisants pour assurer des reconstructions ad integrum du tissu osseux. Les techniques d’ingénieries osseuses semblent être la piste à privilégier pour améliorer nos techniques chirurgicales. Le silicium poreux est un matériau prometteur pour l’ingénierie tissulaire et notamment pour la régénération osseuse. En effet, son état de surface permet une adhésion cellulaire importante et ses propriétés non toxique et résorbable en fond un matériau porteur de cellules souches intéressant. Les cellules souches de la pulpe dentaire (DPSC) sont des cellules facilement accessibles dans la cavité buccale. Leurs capacités de prolifération et de différenciation associées au silicium poreux semblent être un atout pour les applications thérapeutique pour la régénération osseuse. Des résultats d’études ultérieures in vitro ont montré leur fort intérêt à une application in vivo. Dans ce travail thèse, nous avons tester l’association silicium poreux et cellules souches de la pulpe dentaire, aux même caractéristiques énoncées dans l’étude de référence in vitro, chez l’animal. Pour cela, le matériau a été produit sous forme de particules de manière a être utilisé comme moyen de comblement osseux, associé ou non à des DPSC. Le modèle de queue de rat a été développé et tester pour diminuer le nombre d’animaux nécessaire à l’étude tout en conservant la puissance statistique des résultats. Les études ont montré la possibilité d’utiliser ce modèle pour la régénération de défauts osseux crées chirurgicalement. De plus, il semblerait que ce modèle puisse également être utile pour les études sur l’ostéointégration de système implantables et sur la régénération osseuse autour de ces implants. Le silicium poreux a ensuite été testé dans ces conditions, associé ou non aux DPSC, en comparaison avec un témoin positif et un témoin négatif. Cette association est apparue comme une piste prometteuse pour la régénération osseuse in vivo. / Despite the development of biomaterials in the field of bone grafts and alveolar preservation, the results are no sufficient to made reconstructions ad integrum of bone tissue. Bone engineering techniques seem to be the preferred way to improve our surgical techniques. Porous silicon is a promising material for tissue engineering and especially for bone regeneration. Indeed, its surface allows cell adhesion. And then, it’s a non-toxic and bioresorbable interesting material properties carrying stem cells. Dental pulp stem cells (DPSC) are easily accessible cells in the oral cavity. Their proliferation and differentiation capacities associated with porous silicon appear to be attractive for therapeutic applications in bone regeneration. The results of the in vitro studies have shown the interest for in vivo application. In this thesis, we have tested the combination of porous silicon and dental pulp stem cells in vivo experimentation, using the same characteristics of the in vitro reference study. For this, the material was produced in particle form to be used as bone filling material, associated or not with DPSC. The rat-tail model was developed and tested to reduce the number of animals needed for the study while maintaining the statistical power of the results. Studies have shown the possibility of using this model for bone regeneration defects surgically created. In addition, it seems that this model can also be useful for studies on osseointegration of implantable systems and bone regeneration around these implants. Then, the porous silicon was tested under these conditions, with or without DPSC, in comparison with a positive control and a negative control. This association has emerged as a promising approach for bone regeneration in vivo.

"The Internet has assumed the role of the underlying communication network for applications such as file transfer, electronic mail, Web browsing and multimedia streaming. Multimedia streaming, in particular, is growing with the growth in power and connectivity of today's computers. These Internet applications have a variety of network service requirements and traffic characteristics, which presents new challenges to the single best-effort service of today's Internet. TCP, the de facto Internet transport protocol, has been successful in satisfying the needs of traditional Internet applications, but fails to satisfy the increasingly popular delay sensitive multimedia applications. Streaming applications often use UDP without a proper congestion avoidance mechanisms, threatening the well-being of the Internet. This dissertation presents an IP router traffic management mechanism, referred to as Crimson, that can be seamlessly deployed in the current Internet to protect well-behaving traffic from misbehaving traffic and support Quality of Service (QoS) requirements of delay sensitive multimedia applications as well as traditional Internet applications. In addition, as a means to enhance Internet support for multimedia streaming, this dissertation report presents design and evaluation of a TCP-Friendly and streaming-friendly transport protocol called the Multimedia Transport Protocol (MTP). Through a simulation study this report shows the Crimson network efficiently handles network congestion and minimizes queuing delay while providing affordable fairness protection from misbehaving flows over a wide range of traffic conditions. In addition, our results show that MTP offers streaming performance comparable to that provided by UDP, while doing so under a TCP-Friendly rate."

Les marches aléatoires en milieux aléatoires constituent un modèle permettant de décrire des phénomènes de diffusion en milieux inhomogènes, possédant des propriétés de régularité à grande échelle. La thèse comportent 6 chapitres. Les trois premiers sont introductifs : le chapitre 1 est une courte introduction générale, le chapitre 2 donne une présentation des modèles considérés par la suite et le chapitre 3 un bref aperçu des résultats obtenus. Les preuves sont renvoyées aux chapitres 4, 5 et 6. Le contenu du chapitre 4 porte sur les théorèmes limites pour une marche aléatoire avec biais sur un arbre de Galton-Watson avec des feuilles dans un régime transient sous-balistique. Le chapitre 5 porte sur le comportement de la vitesse d'une marche aléatoire avec biais sur un amas de percolation quand le paramètre de percolation se rapproche de 1. Un développement asymptotique de la vitesse en fonction du paramètre de percolation est obtenu. On en déduit que la vitesse est croissante en $p=1$. Finalement le chapitre 6 porte sur des estimées de déviations modérées pour une marche aléatoire en milieu aléatoire unidimensionnel. / Random walks in random environments is a suitable model to describe diffusions in inhomogeneous media that have regularity properties on a macroscopic scale. The three first chapters are introductive : chapter 1 is a short general introduction, chapter 2 presents the models considered afterwards and chapter 3 is a brief overview of the results obtained. The proofs are postponed to the chapters4, 5 and 6.The content of chapter 4sheds light on limit theorems for a biased random walk on a Galton-Watson tree with leaves in the transient and sub-ballistic regime. Next, chapter 5 deals with the behaviour of the speed of a biased random walk on a percolation cluster as the percolation parameter goes to 1. An expansion of the speed in function of the percolation parameter is obtained. It can be deduced from this that the speed is increasing in $p=1$. Finally, chapter 6 tackles the problem of moderate deviations for random walks in random environments in dimension $1$.