This effort seeks to answer the question; can a transferable model be developed from easily obtainable, publicly available land-use, census, roadway, and network data for the use in safety performance functions? 474 stop-controlled minor legs were used as the training data set using ordinary least squares regression. A best-fit model of maximum independent variables, n=12 was chosen using an exhaustive approach using Mallow's Cp to select the model with least bias in the predictors. The results of the analysis revealed that the combination of variables from Washington, Ohio, and North Carolina did not have a strong relationship. The best-fit model incorporated functional class information of the major-leg, minor leg functional class information, longitudinal markings, access to a parking lot, and population density of census tract. Validation of the model demonstrated an average 59 percent error between the model estimated and actual AADT values for validation data set (n=54). Furthermore, separate models for each state revealed a lack of uniformity in the dependent variables, and more variance description of the state specific AADT.

La majorité des grands opérateurs utilise la technologie MPLS pour gérer leur réseau via des protocoles de signalisation et de distributions de labels. Or, ces protocoles sont complexes à déployer, à maintenir et la résolution des pannes est souvent très difficile. L'IETF a initié la standardisation d'une architecture de routage par segments (Segment Routing) s'appuyant sur un plan de contrôle simple, léger, facile à gérer et instanciée sur MPLS ou IPv6. Cette architecture repose sur le concept de routage à la source, dans lequel l'en-tête des paquets transporte les indications du chemin à suivre pour atteindre sa destination. Adapté aux cas d'usages simples et offrant nativement une résistance aux pannes, les cas d'usages plus complexes exigent de résoudre des verrous technologiques pour lesquels nous proposons plusieurs solutions. Dans cette thèse effectuée au sein d'Orange Labs, nous nous sommes intéressés à l'instanciation de l'architecture Segment Routing sur le plan de transfert MPLS et plus particulièrement à l'ingénierie de trafic, notamment avec réservation de ressources. Nous avons proposé des solutions aux problèmes liés à la limitation matérielle des routeurs actuels ne permettant pas l'expression de tous les chemins contraints. Ce travail est divisé en deux parties : (i) la proposition d'algorithmes de calcul et d'encodage de chemins de routage par segment afin de contourner les limitations matérielles. (ii) la définition des exigences architecturales et la construction d'une preuve de concept fonctionnelle. Enfin, cette thèse propose de nouvelles pistes d'études afin de consolider les outils d'ingénierie de trafic pour le routage par segment. / Most major operators use MPLS technology to manage their network via signalling and label distribution protocols. However, these protocols are complex to deploy, maintain and troubleshooting is often very difficult. The IETF has initiated the standardization of a segment routing architecture based on a simple control plane, lightweight, easyto-manage and instantiated on MPLS or IPv6. This architecture is based on the concept of source routing, in which the packet header carries the indications of the path to follow to reach its destination. Suitable for simple use cases and natively resistant to failure, more complex use cases require the resolution of technological issues for which we offer several solutions.In this thesis carried out within Orange Labs, we were interested in the instantiation of the Segment Routing architecture on the MPLS transfer plan and more particularly in traffic engineering, particularly with resource reservation. We have proposed solutions to the problems related to the hardware limitation of current routers that do not allow the expression of all constrained paths. This work is divided into two parts : (i) the proposal of algorithms for computing and encoding segment routing paths in order to bypass hardware limitations. (ii) the definition of architectural requirements and the construction of a functional proof of concept. Finally, this thesis proposes new research issues to consolidate traffic engineering tools for segment routing.

This research is motivated by the recent developments in the Internet Engineering Task Force (IETF) to support seamless integration of moving networks deployed in vehicles to the global Internet. The effort, known as Network Mobility (NEMO), paves the way to support high-speed Internet access in mass transit systems, e.g. trains; buses; ferries; and planes; through the use of on-board mobile routers embedded in the vehicle. One of the critical research challenges of this vision is to achieve high-speed and reliable back-haul connectivity between the mobile router and the rest of the Internet. The problem is particularly challenging due to the fact that a mobile router must rely on wireless links with limited bandwidth and unpredictable quality variations as the vehicle moves around. In this thesis, the multi-homing concept is applied to approach the problem. With multi-homing, mobile router has more than one connection to the Internet. This is achieved by connecting the mobile router to a diverse array of wireless access technologies (e.g., GPRS, CDMA, 802.11, and 802.16) and/or a multiplicity of wireless service providers. While the aggregation helps addressing the bandwidth problem, quality variation problem can be mitigated by employing advanced traffic engineering techniques that dynamically control inbound and outbound traffic over multiple connections. More specifically, the thesis investigates traffic engineering solutions for mobile networks that can effectively address the performance objectives, e.g. maximizing profit for mobile network operator; guaranteeing quality of service for the users; and maintaining fair access to the back-haul bandwidth. Traffic engineering solutions with three different levels of control have been investigated. First, it is shown, using detailed computer simulation of popular applications and networking protocols(e.g., File Transfer Protocol and Transmission Control Protocol), that packet-level traffic engineering which makes decisions of which Internet connection to use for each and every packet, leads to poor system throughput. The main problem with packet-based traffic engineering stems from the fact that in mobile environment where link bandwidths and delay can vary significantly, packets using different connections may experience different delays causing unexpected arrivals at destinations. Second, a maximum utility flow-level traffic engineering has been proposed that aims to maximize a utility function that accounts for bandwidth utilization on the one hand, and fairness on the other. The proposed solution is compared against previously proposed flow-level traffic engineering schemes and shown to have better performance in terms of throughput and fairness. The third traffic engineering proposal addresses the issue of maximizing operator?s profit when different Internet connections have different charging rates, and guaranteeing per user bandwidth through admission control. Finally, a new signaling protocol is designed to allow the mobile router to control its inbound traffic.

This thesis focuses on two important problems related to DDDAS: interest management (data distribution) and prediction models. In order to reduce communication overhead, we propose a new interest management mechanism for mobile peer-to-peer systems. This approach involves dividing the entire space into cells and using an efficient sorting algorithm to sort the regions in each cell. A mobile landmarking scheme is introduced to implement this sort-based scheme in mobile peer-to-peer systems. The design does not require a centralized server, but rather, every peer can become a mobile landmark node to take a server-like role to sort and match the regions. Experimental results show that the scheme has better computational efficiency for both static and dynamic matching. In order to improve communication efficiency, we present a travel time prediction model based on boosting, an important machine learning technique, and combine boosting and neural network models to increase prediction accuracy. We also explore the relationship between the accuracy of travel time prediction and the frequency of traffic data collection with the long term goal of minimizing bandwidth consumption. Several different sets of experiments are used to evaluate the effectiveness of this model. The results show that the boosting neural network model outperforms other predictors.

As transportation policies are changing to encourage alternative modes of transportation to reduce congestion problems and air quality impacts, more planning organizations are considering or implementing activity-based travel demand models to forecast future travel patterns. The proclivity towards operating activity-based models is the capability to model disaggregate travel data to better understand the model results that are generated with respect to the latest transportation policy implementations. This thesis first examines the differences between the two major modeling techniques used in the United States and then describes the assessment tool that was developed to recommend whether a region should convert to the advanced modeling procedures. This tool consists of parameters that were decided upon based on their known linkages to the advantages of activity-based models.

An arterial traffic control system influences the travel time characteristics of a corridor, including the average corridor travel time and the travel time reliability. However, reliability measures have typically been outside of the focus of arterial control system performance evaluation studies. To assess the effectiveness of arterial traffic control performance evaluation studies are normally limited to average measures of travel time, speed, or delay. As an advanced traffic management system, adaptive traffic control has been developed to address real time demand variability. Thus, an evaluation of the adaptive traffic control system based on reliability may be as important as evaluation based on average travel time or delay. In addition, arterial control systems may also affect the performance of side street traffic as well as arterial corridor traffic. The performance of side street traffic is another measure that should be used in the assessment of the effectiveness of any arterial traffic control system. Finally, an arterial's operational performance often changes throughout a day and over the arterial length. Thus, a system-wide measure that reflects the range of observed operations is needed to thoroughly assess the performance. Given these issues the goal of this research is the development of procedures to evaluate adaptive traffic control's effect on arterial characteristics such as travel time distribution, reliability, side street performance, and system-wide performance. The developed procedures were applied to the evaluation of an adaptive traffic control system, SCATS (Sydney Coordinated Adaptive Traffic System) in Cobb County, Georgia that replaced a semi-actuated coordinated control system. After the procedures were applied, it was found that SCATS produced a less extreme shape of travel time distribution, possibly due to the adaptive feature, but that it did not make statistically significant changes in the selected overall analysis measures. Also, it was found that the results of the performance evaluation can vary depending on the measures selected or the study period and location.

This thesis descries the evolution and testing of a fully portable, inductive loop vehicle counter system. As a component of the NFS Embedded Distributed Simulation for Transportation System Management project, the system's cellular modem transmits real-time data to servers at Georgia Institute of Technology. From there, the data can be fed into simulations predicting travel behavior. Researchers revised both the detector circuit, and the temporary, reusable loop pad several times over multiple rounds of field testing. The final tested version of this system demonstrates the efficacy of uncommonly small inductive loops. When paired with a reliable data transmission channel, the system was shown to capture nearly 96% of actual through traffic.

As the modern roundabout continues to grow in popularity within the United States, more states are considering or implementing statewide roundabout programs and policies. To assist states with the implementation of statewide roundabout programs and policies, an analytical review of statewide roundabout programs and policies was conducted through an examination of literature, interviews, and data pertaining to the construction of roundabouts. The roundabout policy type for each state and the District of Columbia was located, and assigned to a roundabout policy type based on the strength of the identified policy type. In addition, a series of per capita analyses of the statewide roundabout policies was performed, as was a qualitative SWOT (Strengths, Weaknesses, Opportunities and Threats) analysis. The results of the analysis show that the strength of a statewide roundabout policy is correlated to the number of roundabouts in a state, and states should consider implementing or strengthening their policies if they seek to expand the use of roundabouts in their jurisdiction. In addition, the perception of roundabouts, both by the general public and internal to the state DOTs, also continues to hinder the further implementation of roundabouts, and education should be utilized to minimize these obstacles. Furthermore, states should utilize identified successful implementation procedures, and should be cognizant of reasons for implementation failure, as they pursue the further use of roundabouts by their agency.

Title from PDF of title page. / Document formatted into pages; contains 62 pages. / Thesis (M.S.E.E.)--University of South Florida, 2003. / Includes bibliographical references. / Text (Electronic thesis) in PDF format. / ABSTRACT: The rapid growth of the Internet, in the last few years, has generated a need to enhance the existing IP networks in the areas of availability, dependability and scalability in order to provide a mission critical networking environment. In contemporary IP networks, data packets are routed as a function of the destination address and a single metric such as hop-count or delay. This approach tends to cause message traffic to converge onto the same link, which significantly increases congestion and leads to unbalanced network resource utilization. One solution to this problem is provided by Traffic Engineering (TE), which uses, bandwidth guaranteed, Explicitly Routed Label Switched Paths (ER-LSPs). Due to the dramatic increase in the backbone speeds, current research focuses more on traffic engineering with LSPs for clear control over the traffic distribution in the network. / ABSTRACT: However, the growing popularity of the Internet is driving the Internet Service Providers to adapt new technologies in order to support multiple classes of applications with different characteristics and performance requirements. Multi-Protocol Label Switching (MPLS), which was proposed by the IETF provides essential facilities for traffic engineering and reliable QoS services for the Internet. MPLS networks provide the required flexibility for operators to manage their traffic with ER-LSPs. Even though conventional routing algorithms support the ER-LSP setup in MPLS networks, they are not efficient in link residual capacity information updates and limit resource utilization, which eventually leads to LSP failures and unbalanced network resource utilization. This thesis proposes a new architecture with a cluster based distributed routing algorithm to setup bandwidth guaranteed ER-LSPs in MPLS backbone networks. / ABSTRACT: The proposed routing algorithm confines the route discovery region in order to reduce the routing overhead and computes all possible routes from ingress node to egress node. Based on LSP requirements and network load conditions, the egress node selects the most suitable path from the available paths in order to setup the LSP. This routing scheme optimizes network resource utilization by evenly distributing traffic throughout the network. The Resource Reservation Protocol (RSVP) works in conjunction with the routing protocol for resource reservation and label distribution along the LSP. / System requirements: World Wide Web browser and PDF reader. / Mode of access: World Wide Web.

No abstract available. / Thesis (M.T.R.P.)-University of Natal, Durban, 1997.