Title: Increasing the stability and robustness of simulation-based network assignment models for largescale
|
|
- Percival Lewis
- 5 years ago
- Views:
Transcription
1 Title: Increasing the stability and robustness of simulation-based network assignment models for largescale applications Author: Michael Mahut, INRO Consultants Inc. Larger-scale dynamic network models based on traffic flow principles are becoming increasingly popular, from wide-area micro-simulation to sub-regional or even regional dynamic traffic assignment (DTA), which may also be a coupled with an activity-based demand model in an integrated advanced travel demand model framework. Although the specifics of the traffic flow models may vary, from highly detailed lane-level micro-simulation to hydrodynamic or other mesoscopic models, the promise of these approaches lies largely in their ability to provide greater realism over traditional network models for investigating complex, time-dependent mechanisms, such as congestion-based HOT lane tolls, dynamic parking pricing and departure-time choice modeling. A fundamental issue that is commonly encountered, particularly in larger-scale applications, is the response of the network model to a scenario in which the travel demand is not sufficiently commensurate with the network supply (flow capacities). A key feature shared by the types of network models mentioned above is that they strictly respect flow capacities, i.e., of links, turning movements. These models also respect basic properties of traffic flow: traffic congestion is represented as physical queues which spill back upstream against the direction of traffic, and as they do they reduce the capacities of upstream links and turning movements. When this occurs, the reduction in capacity of the upstream elements leads to even more queueing, and thus even more spillback, which results in even more queueing, and so on In this sense, the actual or effective capacities (throughputs) are not exogenously specified capacities, but are in fact a result of the demand itself, or more specifically, the degree to which the demand exceeds the network supply. In cases where the demand and supply are not well matched, these cascading queues can lead to gridlock, and can often result in severe congestion over large swaths of the network. These extremely congested conditions tend to render the model results unusable. The question is not primarily about the realism of the model results, but rather about their emergent properties, which demonstrate highly nonlinear behavior, making the model unstable or even chaotic. This has several negative consequences. First of all, the network assignment may take a very long time to converge, or may never converge at all. Secondly, even if it does, the results may not be reliable: due to the nonlinear behaviour of the model, small changes to model inputs can lead to large changes in model outputs, and thus a model in this state may be overly sensitive to errors in the model inputs. Any effort to remedy this situation must address the basic question of the trade-off between the mathematical properties of a model and its correctness or realism. If the primary objective is the practical usability of the model, the unavoidable conclusion is that as a model becomes sufficiently unstable, the results become unusable, even if the model is based on realistic assumptions. For example, if the network supply is artificially low due to network coding errors, the excessive congestion makes it virtually impossible to identify the critical bottlenecks that initiated the traffic breakdown. If the demand is unrealistically high, such as might be the case in the context of a demand model within
2 which the network assignment runs iteratively as a sub-model, the instability of the network assignment may prevent the demand model from converging. Although matrix adjustment methods can be useful for addressing certain situations where demand exceeds supply, they are not applicable or relevant in all contexts. Due to the inherent trade-off between stability and realism for these types of models, the only way to address the instability is to allow the models to be less realistic somehow in certain situations. However, this must be done in a well structured way that (1) aims to maintain the overall value of the model outputs (maximize the realism that can be achieved), and (2) provides a meaningful quantitative measure of the degree to which the underlying traffic flow properties have been relaxed or stretched in order to generate a more stable solution. This paper proposes such a mechanism, describes the associated measure, and provides numerical results obtained with a detailed traffic simulation model on a relatively large real-world network. Some attempts have been made in the past, and which are in current use today, to address this issue via built-in rules, such as removing vehicles entirely from the simulation or allowing vehicles to change paths simply in order to reduce the congestion building up behind them (in some cases this may result in the vehicle being unable to reach its intended destination). These ad-hoc approaches are unsatisfying because the outputs of the model are no longer based on the entirety of the inputs (the model violates conservation of flow) but also because the rules are arbitrary, are not parameterized, and tend to be model specific rather than based on the underlying theory that is common across all traffic flow models. As the potential applications of simulation-based network models continues to grow, along with the accessibility of the computational power that makes them feasible to use, there is a need to address fundamental methodological issues such as this in a more satisfying way. The approach taken here to address this issue is inspired from a well-known idea in optimization which involves formulating the dual problem of a given problem in which constraints of the original problem are relaxed (the well known gap measure used in network models is in fact the duality gap which is the difference between the primal and dual solutions). The specifics of the approach proposed here are motivated by the question of which constraint(s) in a traffic flow model can be relaxed without losing the overall realism which is essential to the value of the model. The approach taken here is based on several observations about the behaviour of capacity-constrained traffic models (and real traffic, for that matter). First of all, the property of strictly respecting flow capacities is essential as it is key to the realism and value offered by this type of model. Secondly, the nonlinear behaviour of these models and resulting instabilities are tied to the nonlinear growth of queues, which is highly dependent on the degree to which the demand exceeds the capacity at key bottlenecks. Thirdly, the congestion spill-back effect, which reduces upstream throughput and thus drives the nonlinear/cascading queue process, is less pronounced on multi-lane facilities due to the potential for vehicles to overtake one another (e.g. when congestion is mainly restricted to some of the lanes of a roadway but not all).
3 The mitigating effect of overtaking, which can be referred to equivalently as non-link-fifo (first-in-firstout) behaviour, merits a more detailed description. As a queue grows beyond the immediate link upstream of the bottleneck, it will, depending on the specifics of the local network and demand patterns, incur delays on drivers whose paths do not in fact take them through the bottleneck itself. These drivers thus do not influence the demand/capacity ratio of the bottleneck, their presence is unrelated to the initial growth of the queue, but they will be delayed by the queue and contribute to (i.e. accelerate) the rate of growth of the queue. The more of these drivers (vehicles) that are trapped in a queue, the faster it grows and the more it traps (delays) other vehicles, both destined and not destined for the bottleneck in question. The delays incurred by these drivers, which can be thought of as indirect delays with respect to the bottleneck, are essentially what drives the extremely rapid type of area wide queue formation that is characteristic of unstable micro- and meso-scopic network models. The proposed mechanism for restraining queue formation thus focuses on reducing only the indirect delays, and this is done by partially relaxing the link-fifo constraint as it applies to these vehicles. In concrete terms, relaxing FIFO implies that overtaking is permitted in a situation where it is not physically possible to do so. In order to only reduce (rather than eliminate) indirect delays, and more generally to prevent the mechanism from overly impacting the model results, the relaxation mechanism is triggered though an exogenous parameter which defines the amount of delay that can be passed upstream from one vehicle to the next, if the two vehicles are exiting the link by different turning movements. Thus, the mechanism enforces FIFO by turning movement ( turn FIFO ) while relaxing link FIFO. The maximum amount of delay that is allowed to be transferred in this way is referred to as the delay threshold. In more general terms, the delay threshold parameter controls how much overtaking can take place as a function of the amount of delay that is propagating upstream from the vehicle at the stop line. The mechanism was designed to be relatively subtle in order to avoid overly relaxing and thus modifying the results. In particular, in terms of the total amount of indirect delay (vehicle-seconds) in a queue that is reduced as a function of the initial delay propagating back from the stop line, the mechanism can be characterized as sub-linear in general, and linear in the limiting case where all of the propagated delay is indirect delay. For example, considering a queue of 10 vehicles, all of which are leaving the link by the left turn, behind the first vehicle at the stop line, which is leaving by the right turn, and a delay threshold of 1 minute: the total delay in queue is reduced by zero if the first vehicle experiences one minute of delay only (or less), 5% if the delay is 2 minutes, 10% for 3 minutes,..., 45% for 10 minutes, etc, meaning that there is more intervention with increasing delay, but the intervention strictly follows a (sub) linear rule in order to avoid undesirable nonlinear effects. The proposed link FIFO relaxation (LFR) mechanism was implemented in a simulation-based dynamic traffic assignment model which simulates the movement of individual vehicles on discrete lanes of the roadway using vehicle-interaction models such as car-following and gap-acceptance (Dynameq software developed by INRO Consultants). It should be noted that link FIFO is not respected in an absolute way by real traffic, in particular on multi-lane facilities, and this aspect of real traffic can be represented quite realistically using a lane-based traffic model. The LFR mechanism implemented here allows a model of this kind to further decrease link FIFO in heavily congested conditions.
4 A quantitative measure of the impact of the LFR mechanism was implemented and is referred to as the virtual queue. The virtual queue refers to the number of vehicles that have been allowed to execute the overtaking action but have not yet left the link as they are still delayed by preceding vehicles destined for the same exiting turn. The virtual queues were reported for each lane and turning movement of each roadway link. The virtual queue has a useful intuitive interpretation as it is a direct measure of the number of vehicles by which the queue has been shortened, relative to the case where no LFR is permitted. A brief overview of numerical results is provided here focusing on a single test network. The test case is partially hypothetical as it was important to test the method under severe conditions. The test program also investigated the relative changes in stability with different values of the delay threshold, whereas the results reported here will focus only on one test, with a delay threshold of 30 seconds, referred to as LFR-30. The test case was intentionally set up in such a way that the standard model (no LFR) could not generate an acceptably converged solution in a reasonable number of iterations. This situation is easy to create for any model that strictly respects link and turn capacities (and the resulting spill-back effects) by simply increasing the demand by a sufficient amount. A comparison of the relative gaps (per departure time interval) for the first 50 iterations of the two model runs is presented in figure 1. The LFR-30 model, shown the left, was easily able to generate a stable solution within the first 50 iterations, which is a typical number for a scenario with a well balanced demand and supply. In fact, though not shown here, even the LFR-60 model was able to converge reasonably well within 50 iterations. This was found to be a very positive result as it only required a relatively gentle intervention within the normal functioning of the traffic model. Figure 2 shows link flows scaled to bar widths and colored by link speeds, and virtual queues summed over turning movements at each node, scaled to node circle diameter and colored by delay, during the most congested 30-minute period. The LFR-30 model (left side) clearly shows significantly higher traffic volumes than the standard model, which can be seen very clearly along a major artery in the middle of the network heading into the CBD. The virtual queues, even when summed at each node, were not nearly as prevalent as might have been expected. The orange circle that is clearly visible on the left side represents 70 vehicles. In all, during the worst 30 minutes of congestion, there were only 57 nodes in the network with total virtual queues (summed over all turning movements) greater than 10 vehicles. The LFR-60 model had only 27 nodes with total virtual queue over 10 during the same half hour, with a maximum value of 32. In conclusion, the proposed link FIFO relaxation (LFR) method provides a very effective way to address the issue of instability due to severe congestion in simulation-based dynamic assignment models. The idea behind the mechanism is to reduce the nonlinear growth of queues in severely congested conditions, while respecting bottleneck capacities and turn FIFO discipline, by allowing a certain relaxation of link FIFO. In this way, the mechanism reduces indirect delay, which is defined as delay that is propagated upstream between two vehicles which are exiting the current link by different turning movements. The mechanism reduces total indirect delay in a queue in a sub-linear fashion relative to the initial (stop line) delay being propagated. This adaptive property of the mechanism is key to ensuring
5 that the mechanism does not over-react and that in general it has little or no effect in traffic conditions that are only moderately congested. The LFR virtual queue length outputs indicated that the mechanism was able to drastically improve the convergence properties of extremely congested test scenarios with only a modest relaxation of the physical constraints. The LFR mechanism is motivated by the need to trade-off model stability against realism (fidelity) for simulation-based network models that strictly respect flow capacities and traffic flow properties such as congestion spill-back, when the inputs to the model result in unusable results typified by gridlock and non-convergence of the network assignment. For cases where these conditions are due to network coding, the more fluid traffic flows combined with the virtual queue output yield far more usable outputs that provide insight into the underlying demand/supply discrepancies rather than simply trying to mimic the resulting traffic conditions as they might occur in reality. For situations where the modeling context necessarily requires the network model to handle severe congestion, a mechanism of this kind can play a critical role in helping the model achieve convergence, without necessarily being invoked in the converged solution. Examples of this include the early iterations of an assignment run, or when an assignment is nested within a demand model and is expected to provide meaningful O-D impedances in response to non-converged demands that are necessarily unrealistic. FIGURES Figure 1 Relative gaps by departure time interval: LFR-30 (left), Standard model (right)
6 Figure 2 Link flows scaled to bar widths colored by speed, and virtual queue lengths scaled to node diameter and colored by delay: LFR-30 (left), Standard model (right) BIBLIOGRAPHY Dynamic Traffic Assignment, a Primer. Transportation Research Circular E-C153. Transportation Research Board, June, Guidebook on the Utilization of Dynamic Traffic Assignment in Modeling, Traffic Analysis Toolbox vol. 14. Federal Highway Administration, November
Introduction to Dynamic Traffic Assignment
Introduction to Dynamic Traffic Assignment CE 392D January 22, 2018 WHAT IS EQUILIBRIUM? Transportation systems involve interactions among multiple agents. The basic facts are: Although travel choices
More informationENHANCED PARKWAY STUDY: PHASE 3 REFINED MLT INTERSECTION ANALYSIS
ENHANCED PARKWAY STUDY: PHASE 3 REFINED MLT INTERSECTION ANALYSIS Final Report Prepared for Maricopa County Department of Transportation Prepared by TABLE OF CONTENTS Page EXECUTIVE SUMMARY ES-1 STUDY
More informationQUEUEING MODELS FOR UNINTERRUPTED TRAFFIC FLOWS
QUEUEING MODELS FOR UNINTERRUPTED TRAFFIC FLOWS An assignment submitted by Bhaskararao Boddu ( 06212306) Msc(Mathematics) Indian Institute of Technology Guwahati. 1 INTRODUCTION Due to increased ownership
More informationMESO & HYBRID MODELING IN
MESO & HYBRID MODELING IN www.ptvgroup.com JONGSUN WON, P.E. www.ptvgroup.com I Slide 1 SOMETHING NEW WITH PTV NORTH AMERICA Portland, OR Arlington, VA www.ptvgroup.com I Slide 2 MULTIRESOLUTION MODELING
More informationInfluence of Route Choice Behavior on Vulnerability to Cascading Failure in Transportation Networks
Influence of Route Choice Behavior on Vulnerability to Cascading Failure in Transportation Networks 〇 Kashin Sugishita, Yasuo Asakura Ph.D Candidate Department of Civil and Environmental Engineering Tokyo
More informationReinforcement Learning for Adaptive Routing of Autonomous Vehicles in Congested Networks
Reinforcement Learning for Adaptive Routing of Autonomous Vehicles in Congested Networks Jonathan Cox Aeronautics & Astronautics Brandon Jennings Mechanical Engineering Steven Krukowski Aeronautics & Astronautics
More informationDynamic traffic models
Agenda Dynamic traffic models Joakim Ekström Johan Janson Olstam Andreas Tapani Introduction to dynamic traffic modeling 8.15-9.00 Dynamic traffic assignment 9.15-10.00 Link and network dynamics 10.15-11.00
More informationCONTRIBUTION TO THE INVESTIGATION OF STOPPING SIGHT DISTANCE IN THREE-DIMENSIONAL SPACE
National Technical University of Athens School of Civil Engineering Department of Transportation Planning and Engineering Doctoral Dissertation CONTRIBUTION TO THE INVESTIGATION OF STOPPING SIGHT DISTANCE
More informationTruncation Errors. Applied Numerical Methods with MATLAB for Engineers and Scientists, 2nd ed., Steven C. Chapra, McGraw Hill, 2008, Ch. 4.
Chapter 4: Roundoff and Truncation Errors Applied Numerical Methods with MATLAB for Engineers and Scientists, 2nd ed., Steven C. Chapra, McGraw Hill, 2008, Ch. 4. 1 Outline Errors Accuracy and Precision
More informationChapter 15 Introduction to Linear Programming
Chapter 15 Introduction to Linear Programming An Introduction to Optimization Spring, 2015 Wei-Ta Chu 1 Brief History of Linear Programming The goal of linear programming is to determine the values of
More informationReduction of Periodic Broadcast Resource Requirements with Proxy Caching
Reduction of Periodic Broadcast Resource Requirements with Proxy Caching Ewa Kusmierek and David H.C. Du Digital Technology Center and Department of Computer Science and Engineering University of Minnesota
More informationAutomatically Balancing Intersection Volumes in A Highway Network
Automatically Balancing Intersection Volumes in A Highway Network Jin Ren and Aziz Rahman HDR Engineering, Inc. 500 108 th Avenue NE, Suite 1200 Bellevue, WA 98004-5549 Jin.ren@hdrinc.com and 425-468-1548
More informationBUSNet: Model and Usage of Regular Traffic Patterns in Mobile Ad Hoc Networks for Inter-Vehicular Communications
BUSNet: Model and Usage of Regular Traffic Patterns in Mobile Ad Hoc Networks for Inter-Vehicular Communications Kai-Juan Wong, Bu-Sung Lee, Boon-Chong Seet, Genping Liu, Lijuan Zhu School of Computer
More informationDynamic Control and Optimization of Buffer Size for Short Message Transfer in GPRS/UMTS Networks *
Dynamic Control and Optimization of for Short Message Transfer in GPRS/UMTS Networks * Michael M. Markou and Christos G. Panayiotou Dept. of Electrical and Computer Engineering, University of Cyprus Email:
More informationUtility-Based Rate Control in the Internet for Elastic Traffic
272 IEEE TRANSACTIONS ON NETWORKING, VOL. 10, NO. 2, APRIL 2002 Utility-Based Rate Control in the Internet for Elastic Traffic Richard J. La and Venkat Anantharam, Fellow, IEEE Abstract In a communication
More informationDSRC Field Trials Whitepaper
DSRC Field Trials Whitepaper August 19, 2017 www.cohdawireless.com 1 Overview Cohda has performed more than 300 Dedicated Short Range Communications (DSRC) field trials, comparing DSRC radios from multiple
More informationAPPENDIX E TRANSPORTATION
APPENDIX E TRANSPORTATION 2011 PATRON SURVEYS VISSIM MODEL CALIBRATION AND VALIDATION Environmental and Planning Consultants 440 Park Avenue South 7th Floor New York, NY 10016 tel: 212 696-0670 fax:
More informationOptimal Detector Locations for OD Matrix Estimation
Optimal Detector Locations for OD Matrix Estimation Ying Liu 1, Xiaorong Lai, Gang-len Chang 3 Abstract This paper has investigated critical issues associated with Optimal Detector Locations for OD matrix
More informationAdvanced Transportation Optimization Systems (ATOS)
Advanced Transportation Optimization Systems (ATOS) By Andrew Andrusko Undergraduate Student Student in Civil Engineering, Urban & Regional Studies, Social Studies, Geography, Geology Programs Minnesota
More informationChapter 16. Microscopic Traffic Simulation Overview Traffic Simulation Models
Chapter 6 Microscopic Traffic Simulation 6. Overview The complexity of traffic stream behaviour and the difficulties in performing experiments with real world traffic make computer simulation an important
More informationTowards more robust internetworks:
Towards more robust internetworks: an application of graph theory Authors Jamie Greenwood, MSc (Royal Holloway, 2016) Stephen Wolthusen, ISG, Royal Holloway Abstract As networks become increasingly connected
More informationCohda Wireless White Paper DSRC Field Trials
Cohda Wireless White Paper DSRC Field Trials Copyright Cohda Wireless Pty Ltd ABN 84 107 936 309 Cohda Wireless Pty Ltd 82-84 Melbourne Street North Adelaide, SA 5006 Australia P +61 8 8364 4719 F +61
More informationBalancing Transport and Physical Layers in Wireless Ad Hoc Networks: Jointly Optimal Congestion Control and Power Control
Balancing Transport and Physical Layers in Wireless Ad Hoc Networks: Jointly Optimal Congestion Control and Power Control Mung Chiang Electrical Engineering Department, Princeton University NRL/NATO Workshop
More informationMicroscopic Traffic Simulation
Microscopic Traffic Simulation Lecture Notes in Transportation Systems Engineering Prof. Tom V. Mathew Contents Overview 2 Traffic Simulation Models 2 2. Need for simulation.................................
More informationMulticast Transport Protocol Analysis: Self-Similar Sources *
Multicast Transport Protocol Analysis: Self-Similar Sources * Mine Çağlar 1 Öznur Özkasap 2 1 Koç University, Department of Mathematics, Istanbul, Turkey 2 Koç University, Department of Computer Engineering,
More informationModule 1 Lecture Notes 2. Optimization Problem and Model Formulation
Optimization Methods: Introduction and Basic concepts 1 Module 1 Lecture Notes 2 Optimization Problem and Model Formulation Introduction In the previous lecture we studied the evolution of optimization
More informationUnit 2 Packet Switching Networks - II
Unit 2 Packet Switching Networks - II Dijkstra Algorithm: Finding shortest path Algorithm for finding shortest paths N: set of nodes for which shortest path already found Initialization: (Start with source
More informationChapter 1. Introduction
Chapter 1 Introduction In a packet-switched network, packets are buffered when they cannot be processed or transmitted at the rate they arrive. There are three main reasons that a router, with generic
More informationGreed Considered Harmful
Greed Considered Harmful Nonlinear (in)stabilities in network resource allocation Priya Ranjan Indo-US workshop 2009 Outline Background Model & Motivation Main results Fixed delays Single-user, single-link
More informationWorkshop on Traffic Assignment with Equilibrium Methods
Workshop on Traffic Assignment with Equilibrium Methods Presented by: David Boyce and Michael Florian Northwestern University and University of Montreal Sponsored by: Subcommittee on Network Equilibrium
More informationApplication Oriented Networks: An SOA Perspective
Oriented s: An SOA Perspective www.thbs.com Introduction Service Oriented Architecture is the hot topic of discussion in IT circles today. So much so, in fact, that SOA is being seen by many as the future
More information5. DUAL LP, SOLUTION INTERPRETATION, AND POST-OPTIMALITY
5. DUAL LP, SOLUTION INTERPRETATION, AND POST-OPTIMALITY 5.1 DUALITY Associated with every linear programming problem (the primal) is another linear programming problem called its dual. If the primal involves
More informationUnderstanding Internet Speed Test Results
Understanding Internet Speed Test Results Why Do Some Speed Test Results Not Match My Experience? You only have to read the popular press to know that the Internet is a very crowded place to work or play.
More informationFundamentals of Operations Research. Prof. G. Srinivasan. Department of Management Studies. Indian Institute of Technology, Madras. Lecture No.
Fundamentals of Operations Research Prof. G. Srinivasan Department of Management Studies Indian Institute of Technology, Madras Lecture No. # 13 Transportation Problem, Methods for Initial Basic Feasible
More informationPoonam kori et al. / International Journal on Computer Science and Engineering (IJCSE)
An Effect of Route Caching Scheme in DSR for Vehicular Adhoc Networks Poonam kori, Dr. Sanjeev Sharma School Of Information Technology, RGPV BHOPAL, INDIA E-mail: Poonam.kori@gmail.com Abstract - Routing
More informationQUEUEING MODELS FOR UNINTERRUPTED TRAFFIC FLOWS
QUEUEING MODELS FOR UNINTERRUPTED TRAFFIC FLOWS Tom Van Woensel and Nico Vandaele Faculty of Applied Economics UFSIA-RUCA, University of Antwerp E-mail: tom.vanwoensel@ufsia.ac.be E-mail: nico.vandaele@ufsia.ac.be
More informationMotivation. Technical Background
Handling Outliers through Agglomerative Clustering with Full Model Maximum Likelihood Estimation, with Application to Flow Cytometry Mark Gordon, Justin Li, Kevin Matzen, Bryce Wiedenbeck Motivation Clustering
More informationLecture (08, 09) Routing in Switched Networks
Agenda Lecture (08, 09) Routing in Switched Networks Dr. Ahmed ElShafee Routing protocols Fixed Flooding Random Adaptive ARPANET Routing Strategies ١ Dr. Ahmed ElShafee, ACU Fall 2011, Networks I ٢ Dr.
More informationCIE4801 Transportation and spatial modelling Beyond the 4-step model
CIE4801 Transportation and spatial modelling Beyond the 4-step model Erik de Romph, Transport & Planning 31-08-18 Delft University of Technology Challenge the future Multi disciplinary 2 Contents Input
More informationFree-Form Shape Optimization using CAD Models
Free-Form Shape Optimization using CAD Models D. Baumgärtner 1, M. Breitenberger 1, K.-U. Bletzinger 1 1 Lehrstuhl für Statik, Technische Universität München (TUM), Arcisstraße 21, D-80333 München 1 Motivation
More informationThe negative effects of homogeneous traffic on merging sections
The negative effects of homogeneous traffic on merging sections J.A.C.M. Elbers a,1 and E.C. van Berkum a a Centre for Transport Studies University of Twente, Department of Civil Engineering Tel: +31 534893821,
More informationCS 204 Lecture Notes on Elementary Network Analysis
CS 204 Lecture Notes on Elementary Network Analysis Mart Molle Department of Computer Science and Engineering University of California, Riverside CA 92521 mart@cs.ucr.edu October 18, 2006 1 First-Order
More informationHPC Considerations for Scalable Multidiscipline CAE Applications on Conventional Linux Platforms. Author: Correspondence: ABSTRACT:
HPC Considerations for Scalable Multidiscipline CAE Applications on Conventional Linux Platforms Author: Stan Posey Panasas, Inc. Correspondence: Stan Posey Panasas, Inc. Phone +510 608 4383 Email sposey@panasas.com
More informationPART 2. SIGNS Chapter 2L. Changeable Message Signs
PART 2. SIGNS Chapter 2L. Changeable Message Signs TABLE OF CONTENTS Chapter 2L. CHANGEABLE MESSAGE SIGNS Page Section 2L. Description of Changeable Message Signs.................................... 2L-
More informationResearch Collection. Localisation of Acoustic Emission in Reinforced Concrete using Heterogeneous Velocity Models. Conference Paper.
Research Collection Conference Paper Localisation of Acoustic Emission in Reinforced Concrete using Heterogeneous Velocity Models Author(s): Gollob, Stephan; Vogel, Thomas Publication Date: 2014 Permanent
More informationSummary Cache based Co-operative Proxies
Summary Cache based Co-operative Proxies Project No: 1 Group No: 21 Vijay Gabale (07305004) Sagar Bijwe (07305023) 12 th November, 2007 1 Abstract Summary Cache based proxies cooperate behind a bottleneck
More informationMLR Institute of Technology
Course Name : Engineering Optimization Course Code : 56021 Class : III Year Branch : Aeronautical Engineering Year : 2014-15 Course Faculty : Mr Vamsi Krishna Chowduru, Assistant Professor Course Objective
More informationDYNAMIC USER OPTIMAL TRAFFIC ASSIGNMENT WITH RECOURSE
1 DYNAMIC USER OPTIMAL TRAFFIC ASSIGNMENT WITH RECOURSE K.P. WIJAYARATNA a, L.N. LABUTIS b and S.T.WALLER c a, School of Civil and Environmental Engineering, University of New South Wales, Sydney, Australia
More informationANALYSIS OF THE CORRELATION BETWEEN PACKET LOSS AND NETWORK DELAY AND THEIR IMPACT IN THE PERFORMANCE OF SURGICAL TRAINING APPLICATIONS
ANALYSIS OF THE CORRELATION BETWEEN PACKET LOSS AND NETWORK DELAY AND THEIR IMPACT IN THE PERFORMANCE OF SURGICAL TRAINING APPLICATIONS JUAN CARLOS ARAGON SUMMIT STANFORD UNIVERSITY TABLE OF CONTENTS 1.
More informationConnection-Level Scheduling in Wireless Networks Using Only MAC-Layer Information
Connection-Level Scheduling in Wireless Networks Using Only MAC-Layer Information Javad Ghaderi, Tianxiong Ji and R. Srikant Coordinated Science Laboratory and Department of Electrical and Computer Engineering
More informationAXIOMS OF AN IMPERATIVE LANGUAGE PARTIAL CORRECTNESS WEAK AND STRONG CONDITIONS. THE AXIOM FOR nop
AXIOMS OF AN IMPERATIVE LANGUAGE We will use the same language, with the same abstract syntax that we used for operational semantics. However, we will only be concerned with the commands, since the language
More informationOptimal traffic control via smartphone app users
Optimal traffic control via smartphone app users A model for actuator and departure optimisation Daphne van Leeuwen 1, Rob van der Mei 2, Frank Ottenhof 3 1. CWI, Science Park 123, 1098XG Amsterdam, e-mail:
More information4.12 Generalization. In back-propagation learning, as many training examples as possible are typically used.
1 4.12 Generalization In back-propagation learning, as many training examples as possible are typically used. It is hoped that the network so designed generalizes well. A network generalizes well when
More informationDraft Notes 1 : Scaling in Ad hoc Routing Protocols
Draft Notes 1 : Scaling in Ad hoc Routing Protocols Timothy X Brown University of Colorado April 2, 2008 2 Introduction What is the best network wireless network routing protocol? This question is a function
More informationRouting Basics. What is Routing? Routing Components. Path Determination CHAPTER
CHAPTER 5 Routing Basics This chapter introduces the underlying concepts widely used in routing protocols Topics summarized here include routing protocol components and algorithms In addition, the role
More informationCHAPTER 1 INTRODUCTION
1 CHAPTER 1 INTRODUCTION 1.1 Motivation The presence of uncertainties and disturbances has always been a vital issue in the control of dynamic systems. The classical linear controllers, PI and PID controllers
More informationA Capacity Planning Methodology for Distributed E-Commerce Applications
A Capacity Planning Methodology for Distributed E-Commerce Applications I. Introduction Most of today s e-commerce environments are based on distributed, multi-tiered, component-based architectures. The
More informationRanking Clustered Data with Pairwise Comparisons
Ranking Clustered Data with Pairwise Comparisons Alisa Maas ajmaas@cs.wisc.edu 1. INTRODUCTION 1.1 Background Machine learning often relies heavily on being able to rank the relative fitness of instances
More informationVARIATIONS IN CAPACITY AND DELAY ESTIMATES FROM MICROSCOPIC TRAFFIC SIMULATION MODELS
VARIATIONS IN CAPACITY AND DELAY ESTIMATES FROM MICROSCOPIC TRAFFIC SIMULATION MODELS (Transportation Research Record 1802, pp. 23-31, 2002) Zong Z. Tian Associate Transportation Researcher Texas Transportation
More informationPower Estimation of UVA CS754 CMP Architecture
Introduction Power Estimation of UVA CS754 CMP Architecture Mateja Putic mateja@virginia.edu Early power analysis has become an essential part of determining the feasibility of microprocessor design. As
More informationLecture 2 September 3
EE 381V: Large Scale Optimization Fall 2012 Lecture 2 September 3 Lecturer: Caramanis & Sanghavi Scribe: Hongbo Si, Qiaoyang Ye 2.1 Overview of the last Lecture The focus of the last lecture was to give
More informationBasic Concepts And Future Directions Of Road Network Reliability Analysis
Journal of Advanced Transportarion, Vol. 33, No. 2, pp. 12.5-134 Basic Concepts And Future Directions Of Road Network Reliability Analysis Yasunori Iida Background The stability of road networks has become
More informationCross-layer TCP Performance Analysis in IEEE Vehicular Environments
24 Telfor Journal, Vol. 6, No. 1, 214. Cross-layer TCP Performance Analysis in IEEE 82.11 Vehicular Environments Toni Janevski, Senior Member, IEEE, and Ivan Petrov 1 Abstract In this paper we provide
More informationCHAPTER 2 LITERATURE REVIEW
22 CHAPTER 2 LITERATURE REVIEW 2.1 GENERAL The basic transportation problem was originally developed by Hitchcock (1941). Efficient methods of solution are derived from the simplex algorithm and were developed
More informationCohda Wireless White Paper Mobility and Multipath: Challenges for DSRC
Cohda Wireless White Paper Mobility and Multipath: Challenges for DSRC Copyright Cohda Wireless Pty Ltd ABN 84 107 936 309 Cohda Wireless Pty Ltd 82-84 Melbourne Street North Adelaide, SA 5006 Australia
More informationFINAL REPORT THE FLORIDA DEPARTMENT OF TRANSPORTATION SYSTEMS PLANNING OFFICE. on Project. Improvements and Enhancements to LOSPLAN 2007
FINAL REPORT to THE FLORIDA DEPARTMENT OF TRANSPORTATION SYSTEMS PLANNING OFFICE on Project Improvements and Enhancements to LOSPLAN 2007 FDOT Contract BD-545-84, (UF Project 00067828) Part A: Software
More informationFlow-start: Faster and Less Overshoot with Paced Chirping
Flow-start: Faster and Less Overshoot with Paced Chirping Joakim Misund, Simula and Uni Oslo Bob Briscoe, Independent IRTF ICCRG, Jul 2018 The Slow-Start
More informationARE LARGE-SCALE AUTONOMOUS NETWORKS UNMANAGEABLE?
ARE LARGE-SCALE AUTONOMOUS NETWORKS UNMANAGEABLE? Motivation, Approach, and Research Agenda Rolf Stadler and Gunnar Karlsson KTH, Royal Institute of Technology 164 40 Stockholm-Kista, Sweden {stadler,gk}@imit.kth.se
More informationCorrelation based File Prefetching Approach for Hadoop
IEEE 2nd International Conference on Cloud Computing Technology and Science Correlation based File Prefetching Approach for Hadoop Bo Dong 1, Xiao Zhong 2, Qinghua Zheng 1, Lirong Jian 2, Jian Liu 1, Jie
More informationInteractive 3D Visualization Of Optimization For Water Distribution Systems
City University of New York (CUNY) CUNY Academic Works International Conference on Hydroinformatics 8-1-2014 Interactive 3D Visualization Of Optimization For Water Distribution Systems Matthew Barrie Johns
More information3 No-Wait Job Shops with Variable Processing Times
3 No-Wait Job Shops with Variable Processing Times In this chapter we assume that, on top of the classical no-wait job shop setting, we are given a set of processing times for each operation. We may select
More informationNetwork Capacity, Traffic Instability, and Adaptive Driving: Findings from Simulated Network Experiments
Network Capacity, Traffic Instability, and Adaptive Driving: Findings from Simulated Network Experiments Meead Saberi Transportation Center Northwestern University 600 Foster Street Evanston, IL, USA 60208-4055
More informationMore Specific Announcements in BGP. Geoff Huston APNIC
More Specific Announcements in BGP Geoff Huston APNIC What s a more specific? A prefix advertisement that refines a covering advertisement 10.0.0.0/8 10.1.0.0/16 Why advertise a more specific? I: To redirect
More informationKanban Size and its Effect on JIT Production Systems
Kanban Size and its Effect on JIT Production Systems Ing. Olga MAŘÍKOVÁ 1. INTRODUCTION Integrated planning, formation, carrying out and controlling of tangible and with them connected information flows
More informationOn-line End-to-End Congestion Control
On-line End-to-End Congestion Control Naveen Garg IIT Delhi Neal Young UC Riverside the Internet hard to predict dynamic large End-to-end (design principle of Internet) server end user Routers provide
More informationSection Notes 5. Review of Linear Programming. Applied Math / Engineering Sciences 121. Week of October 15, 2017
Section Notes 5 Review of Linear Programming Applied Math / Engineering Sciences 121 Week of October 15, 2017 The following list of topics is an overview of the material that was covered in the lectures
More informationIntroducing MESSIA: A Methodology of Developing Software Architectures Supporting Implementation Independence
Introducing MESSIA: A Methodology of Developing Software Architectures Supporting Implementation Independence Ratko Orlandic Department of Computer Science and Applied Math Illinois Institute of Technology
More informationFluid models for evaluating threshold-based control policies for survivability of a distributed network
Fluid models for evaluating threshold-based control policies for survivability of a distributed network Vineet Aggarwal ICF Consulting 9 Lee Highway, Fairfax, VA Nataraan Gautam Marcus Department of Industrial
More informationUsing OPNET to Enhance Student Learning in a Data Communications
Using OPNET to Enhance Student Learning in a Data Communications Course Michael W Dixon Murdoch University, Perth, Australia m.dixon@murdoch.edu.au Terry W Koziniec Murdoch University, Perth, Australia
More informationINTERNATIONAL TELECOMMUNICATION UNION
INTERNATIONAL TELECOMMUNICATION UNION TELECOMMUNICATION STANDARDIZATION SECTOR STUDY PERIOD 21-24 English only Questions: 12 and 16/12 Geneva, 27-31 January 23 STUDY GROUP 12 DELAYED CONTRIBUTION 98 Source:
More informationArchitecting the High Performance Storage Network
Architecting the High Performance Storage Network Jim Metzler Ashton, Metzler & Associates Table of Contents 1.0 Executive Summary...3 3.0 SAN Architectural Principals...5 4.0 The Current Best Practices
More informationIP Mobility vs. Session Mobility
IP Mobility vs. Session Mobility Securing wireless communication is a formidable task, something that many companies are rapidly learning the hard way. IP level solutions become extremely cumbersome when
More informationSeminar on. A Coarse-Grain Parallel Formulation of Multilevel k-way Graph Partitioning Algorithm
Seminar on A Coarse-Grain Parallel Formulation of Multilevel k-way Graph Partitioning Algorithm Mohammad Iftakher Uddin & Mohammad Mahfuzur Rahman Matrikel Nr: 9003357 Matrikel Nr : 9003358 Masters of
More informationActive Adaptation in QoS Architecture Model
Active Adaptation in QoS Architecture Model Drago agar and Snjeana Rimac -Drlje Faculty of Electrical Engineering University of Osijek Kneza Trpimira 2b, HR-31000 Osijek, CROATIA Abstract - A new complex
More informationReservation Packet Medium Access Control for Wireless Sensor Networks
Reservation Packet Medium Access Control for Wireless Sensor Networks Hengguang Li and Paul D Mitchell Abstract - This paper introduces the Reservation Packet Medium Access Control (RP-MAC) protocol for
More informationEvaluation of OpenROUTE Networks Bandwidth Reservation System and Priority Queueing
Naval Research Laboratory Washington, DC 20375-5320 Evaluation of OpenROUTE Networks Bandwidth Reservation System and Priority Queueing VINCENT D. PARK JOSEPH P. MACKER STEVE J. SOLLON Protocol Engineering
More informationRandom Search Report An objective look at random search performance for 4 problem sets
Random Search Report An objective look at random search performance for 4 problem sets Dudon Wai Georgia Institute of Technology CS 7641: Machine Learning Atlanta, GA dwai3@gatech.edu Abstract: This report
More informationSYSPRO s Fluid Interface Design
SYSPRO s Fluid Interface Design Introduction The world of computer-user interaction has come a long way since the beginning of the Graphical User Interface, but still most application interfaces are not
More informationSurveying Formal and Practical Approaches for Optimal Placement of Replicas on the Web
Surveying Formal and Practical Approaches for Optimal Placement of Replicas on the Web TR020701 April 2002 Erbil Yilmaz Department of Computer Science The Florida State University Tallahassee, FL 32306
More informationPrediction of traffic flow based on the EMD and wavelet neural network Teng Feng 1,a,Xiaohong Wang 1,b,Yunlai He 1,c
2nd International Conference on Electrical, Computer Engineering and Electronics (ICECEE 215) Prediction of traffic flow based on the EMD and wavelet neural network Teng Feng 1,a,Xiaohong Wang 1,b,Yunlai
More informationWhite paper ETERNUS Extreme Cache Performance and Use
White paper ETERNUS Extreme Cache Performance and Use The Extreme Cache feature provides the ETERNUS DX500 S3 and DX600 S3 Storage Arrays with an effective flash based performance accelerator for regions
More informationOptimization of Tapered Cantilever Beam Using Genetic Algorithm: Interfacing MATLAB and ANSYS
Optimization of Tapered Cantilever Beam Using Genetic Algorithm: Interfacing MATLAB and ANSYS K R Indu 1, Airin M G 2 P.G. Student, Department of Civil Engineering, SCMS School of, Kerala, India 1 Assistant
More informationInfiniBand SDR, DDR, and QDR Technology Guide
White Paper InfiniBand SDR, DDR, and QDR Technology Guide The InfiniBand standard supports single, double, and quadruple data rate that enables an InfiniBand link to transmit more data. This paper discusses
More informationLecture 21. Reminders: Homework 6 due today, Programming Project 4 due on Thursday Questions? Current event: BGP router glitch on Nov.
Lecture 21 Reminders: Homework 6 due today, Programming Project 4 due on Thursday Questions? Current event: BGP router glitch on Nov. 7 http://money.cnn.com/2011/11/07/technology/juniper_internet_outage/
More informationDESIGN AND ANALYSIS OF ALGORITHMS. Unit 1 Chapter 4 ITERATIVE ALGORITHM DESIGN ISSUES
DESIGN AND ANALYSIS OF ALGORITHMS Unit 1 Chapter 4 ITERATIVE ALGORITHM DESIGN ISSUES http://milanvachhani.blogspot.in USE OF LOOPS As we break down algorithm into sub-algorithms, sooner or later we shall
More informationNetwork Flow. The network flow problem is as follows:
Network Flow The network flow problem is as follows: Given a connected directed graph G with non-negative integer weights, (where each edge stands for the capacity of that edge), and two distinguished
More informationCHAPTER 4 FREQUENCY STABILIZATION USING FUZZY LOGIC CONTROLLER
60 CHAPTER 4 FREQUENCY STABILIZATION USING FUZZY LOGIC CONTROLLER 4.1 INTRODUCTION Problems in the real world quite often turn out to be complex owing to an element of uncertainty either in the parameters
More informationExploiting the Behavior of Generational Garbage Collector
Exploiting the Behavior of Generational Garbage Collector I. Introduction Zhe Xu, Jia Zhao Garbage collection is a form of automatic memory management. The garbage collector, attempts to reclaim garbage,
More informationSchedule-Driven Coordination for Real-Time Traffic Control
Schedule-Driven Coordination for Real-Time Traffic Control Xiao-Feng Xie, Stephen F. Smith, Gregory J. Barlow The Robotics Institute Carnegie Mellon University International Conference on Automated Planning
More informationAnalytic Performance Models for Bounded Queueing Systems
Analytic Performance Models for Bounded Queueing Systems Praveen Krishnamurthy Roger D. Chamberlain Praveen Krishnamurthy and Roger D. Chamberlain, Analytic Performance Models for Bounded Queueing Systems,
More information