Maintaining coherence between the independent views of multiple participants at distributed locations is essential in an Embedded Simulation environment. Currently, the Distributed Interactive Simulation (DIS) protocol maintains coherence by broadcasting the entity state streams from each simulation station. In this dissertation, a novel alternative to DIS that replaces the transmitting sources with local sources is developed, validated, and assessed by analytical and experimental means. The proposed Concurrent Model approach reduces the communication burden to transmission of only synchronization and model-update messages. Necessary and sufficient conditions for the correctness of Concurrent Models in a discrete event simulation environment are established by developing Behavioral Congruence ¨B(EL, ER) and Temporal Congruence ¨T(t, ER) functions. They indicate model discrepancies with respect to the simulation time t, and the local and remote entity state streams EL and ER, respectively. Performance benefits were quantified in terms of the bandwidth reduction ratio BR=N/I obtained from the comparison of the OneSAF Testbed Semi-Automated Forces (OTBSAF) simulator under DIS requiring a total of N bits and a testbed modified for the Concurrent Model approach which required I bits. In the experiments conducted, a range of 100 d BR d 294 was obtained representing two orders of magnitude reduction in simulation traffic. Investigation showed that the models rely heavily on the priority data structure of the discrete event simulation and that performance of the overall simulation can be enhanced by an additional 6% by improving the queue management. A low run-time overhead, self-adapting storage policy called the Smart Priority Queue (SPQ) was developed and evaluated within the Concurrent Model. The proposed SPQ policies employ a lowcomplexity linear queue for near head activities and a rapid-indexing variable binwidth calendar queue for distant events. The SPQ configuration is determined by monitoring queue access behavior using cost scoring factors and then applying heuristics to adjust the organization of the underlying data structures. Results indicate that optimizing storage to the spatial distribution of queue access can decrease HOLD operation cost between 25% and 250% over existing algorithms such as calendar queues. Taken together, these techniques provide an entity state generation mechanism capable of overcoming the challenges of Embedded Simulation in harsh mobile communications environments with restricted bandwidth, increased message latency, and extended message drop-outs.

The purpose of this research was to develop an algorithm that could predict ramp meter wait time at metered freeway on-ramps throughout the state of Utah using existing loop detector systems on the ramps. The loop detectors provided data in 60-second increments that include volume, occupancy, and the metering rate. Using these data sources, several ramp meter queue length algorithms were applied; these predicted queue lengths were then converted into wait times by using the metering rate provided by the detector data. A conservation model and several variations of a Kalman filter model generated predicted queue lengths and wait times that were compared to the observed queue lengths. The Vigos model—the model that yielded the best results—provided wait time estimates that were generally within approximately 45 seconds of the observed wait time. This model is simple to implement and can be automated for the Utah Department of Transportation (UDOT) to provide wait time estimates at any metered on-ramp throughout the state.

In this work, a model of computation for shared memory parallelism is presented. To address fundamental constraints of modern memory systems, the presented model constrains how parallelism interacts with memory access patterns and in doing so provides a method for design and analysis of algorithms that estimates reliable execution time based on a few architectural parameters. This model is presented as an alternative to modern thread based models that focus on computational concurrency but rely on reactive hardware policies to hide and amortize memory latency. Since modern processors use reactive mechanisms and heuristics to deduce the data access requirement of computations, the memory access costs of these threaded programs may be difficult to predict reliably. This research presents the Queue Streaming Model (QSM) that aims to address these shortcomings by providing a prescriptive mechanism to achieve latency-amortized and predictable-cost data access. Further, the work presents application of the QSM to algorithms commonly used in a number of applications. These algorithms include structured regular computations represented by merge sort, unstructured irregular computations represented by sparse matrix dense vector multiplication, and dynamic computations represented by MapReduce. The analysis of these algorithms reveal architectural tradeoffs between memory system bottlenecks and algorithm design. The techniques described in this dissertation reveal a general software approach that could be used to construct more general irregular applications, provided they can be transformed into a relational query form. It demonstrates that the QSM can be used to design algorithms that enhance utilization of memory system resources by structuring concurrency and memory accesses such that system bandwidths are balanced and latency is amortized. Finally, the benefit of applying the QSM algorithm to the Euler inviscid flow solver is demonstrated through experiments on the Intel(R) Xeon(R) E5-2680 v2 processor using ten cores. The transformation produced a speed-up of 25% over an optimized OpenMP implementation having identical computational structure.

No description available.

No description available.

No description available.

Teletjänstcentraler används idag inom många områden för kundbetjäning av olika slag med målet att ge så bra service som möjligt. Problematiken är då flertalet instanser tillhandahåller samma tjänster men där dem ansvarar för ett eget geografiskt område. Ett ofta förekommande problem som uppstår är att belastningen mellan dessa teletjänstcentraler varierar drastiskt, vissa har allt för mycket att göra medans andra inte har något alls. Det är därför av intresse att analysera en samverkan mellan dessa centraler och granska eventuella förändringar i effektivitet. I dagsläget har 1177 vårdguiden ett system som hanterar samtalsflödet där ett telefonsamtal skickas till närmaste teletjänstcentral, inom samma region. Softronic fick tidigare i uppdrag att analysera och optimera 1177 Vårdguidens teletjänstsystem genom att effektivisera samt höja kvaliteten på samtalshanteringen. Detta genom snabbare svarstid och ökad samtalshantering inom samma region. Softronic har framtagit två modeller, med givande resultat, dock inte helt i linje med målen. Det är detta som ligger till grund för detta examensarbete. Efter en grundläggande analys användes 6 stycken unika modeller varav 3 av dessa utvecklades under examensarbetet. Dessa modeller är utformade enligt flertalet parametrar och tar hänsyn till bl.a. kompetens. Kompetens baseras på var ett samtal besvaras geografiskt samt hur länge samtalet varit placerad i kön. Dessa modeller simulerades med hjälp av ett verktyg som utvecklades för detta ändamål och dessa resultat jämfördes. Resultatet av dessa simuleringar visade att den bästa modellen var då en kombination av samverkan mellan en lokal och nationell kö. / Call centers are used today in many areas of customer service of various kinds with the objective of providing the best service possible. The problem is when multiple instances provide the same services, but where each instance is responsible for its own geographical area. A frequent problem that arises is that the load of these call centers varies drastically, some call centers might have too much to do while others will not have anything to do at all. It is therefore of interest to analyze the interaction between these centers and review any changes in efficiency. The solution of 1177 Vårdguiden system today is that the system handles the call flow in a fashion where a phone call is sent to the nearest call center, in the same region. Softronic had earlier a mission to analyze and optimize the call system of 1177 Vårdguiden by streamline and enhance the quality of call handling in the form of faster response times and calls answered in the same region they were calling from. Softronic has developed two models, with promising results, however not fully in line with the objectives. This is the basis for this thesis. After thorough analysis six unique models were used were 3 of these were developed in the thesis. These models were designed according to several parameters and took into account for example competence, which is based on where a call is answered geographically as well as how long a call is placed in the queue. These models were simulated using a tool developed for this purpose, and these results were compared. The results of these simulations revealed that the best model was with a combination of collaboration between a local and national queue.

Managing traffic during oversaturated conditions is a current challenge for practitioners due to the lack of adequate tools that can handle such situations. Unlike under-saturated conditions, operation of traffic signal systems during congestion requires careful consideration and analysis of the underlying causes of the congestion before developing mitigation strategies. The objectives of this research are to provide a practical guidance for practitioners to identify oversaturated scenarios and to develop a multi-objective methodology for selecting and evaluating mitigation strategy/ or combinations of strategies based on a guiding principles. The research focused on traffic control strategies that can be implemented by traffic signal systems. The research did not considered strategies that deals with demand reduction or seek to influence departure time choice, or route choice. The proposed timing methodology starts by detecting network's critical routes as a necessary step to identify the traffic patterns and potential problematic scenarios. A wide array of control strategies are defined and categorized to address oversaturation problematic scenarios. A timing procedure was then developed using the principles of oversaturation timing in cycle selection, split allocation, offset design, demand overflow, and queue allocation in non-critical links. Three regimes of operation were defined and considered in oversaturation timing: (1) loading, (2) processing, and (3) recovery. The research also provides a closed-form formula for switching control plans during the oversaturation regimes. The selection of optimal control plan is formulated as linear integer programming problem. Microscopic simulation results of two arterial test cases revealed that traffic control strategies developed using the proposed framework led to tangible performance improvements when compared to signal control strategies designed for operations in under-saturated conditions. The generated control plans successfully manage to allocate queues in network links. / Ph. D.

With the introduction of different forms of adaptive and actuated signal control, there is a need for effective evaluation tools that can capture the intricacies of real-life applications. While the current state-of-the-art analytical procedures provide simple approaches for estimating delay, queue length and stops at signalized intersections, they are limited in scope. Alternatively, several microscopic simulation softwares are currently available for the evaluation of signalized intersections. The objective of this dissertation is fourfold. First, it evaluates the consistency, accuracy, limitations and scope of the alternative analytical models. Second, it evaluates the validity of micro simulation results that evolve as an outcome of the car-following relationships. The validity of these models is demonstrated for idealized hypothetical examples where analytical solutions can be derived. Third, the dissertation expands the scope of current analytical models for the evaluation of oversaturated signalized intersections. Finally, the dissertation demonstrates the implications of using analytical models for the evaluation of real-life network and traffic configurations. This dissertation compared the delay estimates from numerous models for an undersaturated and oversaturated signalized intersection considering uniform and random arrivals in an attempt to systematically evaluate and demonstrate the assumptions and limitations of different delay estimation approaches. Specifically, the dissertation compared a theoretical vertical queuing analysis model, the queue-based models used in the 1994 and 2000 versions of the Highway Capacity Manual, the queue-based model in the 1995 Canadian Capacity Guide for Signalized Intersections, a theoretical horizontal queuing model derived from shock wave analysis, and the delay estimates produced by the INTEGRATION microscopic traffic simulation software. The results of the comparisons for uniform arrivals indicated that all delay models produced identical results under such traffic conditions, except for the estimates produced by the INTEGRATION software, which tended to estimate slightly higher delays than the other approaches. For the random arrivals, the results of the comparisons indicated that the delay estimates obtained by a micro-simulation model like INTEGRATION were consistent with the delay estimates computed by the analytical approaches. In addition, this dissertation compared the number of stops and the maximum extent of queue estimates using analytical procedures and the INTEGRATION simulation model for both undersaturated and oversaturated signalized intersections to assess their consistency and to analyze their applicability. For the number of stops estimates, it is found that there is a general agreement between the INTEGRATION microscopic simulation model and the analytical models for undersaturated signalized intersections. Both uniform and random arrivals demonstrated consistency between the INTEGRATION model and the analytical procedures; however, at a v/c ratio of 1.0 the analytical models underestimate the number of stops. The research developed an upper limit and a proposed model for estimating the number of vehicle stops for oversaturated conditions. It was demonstrated that the current state-of-the-practice analytical models can provide stop estimates that far exceed the upper bound. On the other hand, the INTEGRATION model was found to be consistent with the upper bound and demonstrated that the number of stops converge to 2.3 as the v/c ratio tends to 2.0. For the maximum extent of queue estimates, the estimated maximum extent of queue predicted from horizontal shock wave analysis was higher than the predictions from vertical deterministic queuing analysis. The horizontal shock wave model predicted lower maximum extent of queue than the CCG 1995 model. For oversaturated conditions, the vertical deterministic queuing model underestimated the maximum queue length. It was found that the CCG 1995 predictions were lower than those from the horizontal shock wave model. These differences were attributed to the fact that the CCG 1995 model estimates the remaining residual queue at the end of evaluation time. A consistency was found between the INTEGRATION model and the horizontal shock wave model predictions with respect to the maximum extent of queue for both undersaturated and oversaturated signalized intersections. Finally, the dissertation analyzed the impact of mixed traffic condition on the vehicle delay, person delay, and number of vehicle stops at a signalized intersection. The analysis considered approximating the mixed flow for equivalent homogeneous flows using two potential conversion factors. The first of these conversion factors was based on relative vehicle lengths while the second was based on relative vehicle riderships. The main conclusion of the analysis was that the optimum vehicle equivalency was dependent on the background level of congestion, the transit vehicle demand, and the Measure of Effectiveness (MOE) being considered. Consequently, explicit simulation of mixed flow is required in order to capture the unique vehicle interactions that result from mixed flow. Furthermore, while homogeneous flow approximations might be effective for some demand levels, these approximations are not consistently effective. / Ph. D.

Access to the large web content hosted all over the world by users of the Internet engage many hosts, routers/switches and faster links. They challenge the internet backbone to operate at its capacity to assure e±cient content access. This may result in congestion and raises concerns over various Quality of Service (QoS) issues like high delays, high packet loss and low throughput of the system for various Internet applications. Thus, there is a need to develop effective congestion control mechanisms in order to meet various Quality of Service (QoS) related performance parameters. In this paper, our emphasis is on the Active Queue Management (AQM) mechanisms, particularly Random Early Detection (RED). We propose a threshold based novel analytical model based on standard RED mechanism. Various numerical examples are presented for Internet traffic scenarios containing both the burstiness and correlation properties of the network traffic.