1 Secondary link importance: Links as rerouting alternatives during road network disruptions Erik Jenelius Centre for Transport Studies / Royal Institute.

Slides:



Advertisements
Similar presentations
Ch. 12 Routing in Switched Networks
Advertisements

Vulnerability of Complex Infrastructure Systems Torbjörn Thedéen Safety Research, KTH.
Ch. 12 Routing in Switched Networks Routing in Packet Switched Networks Routing Algorithm Requirements –Correctness –Simplicity –Robustness--the.
Traffic and routing. Network Queueing Model Packets are buffered in egress queues waiting for serialization on line Link capacity is C bps Average packet.
The traveler costs of unplanned transport network disruptions: An activity-based approach Erik Jenelius Royal Institute of Technology, Sweden Lars-Göran.
1 Developing a Methodology for Road Network Vulnerability Analysis Erik Jenelius Div. of Transport and Location Analysis Dept. of Transport and Economics.
Using Dynamic Traffic Assignment Models to Represent Day-to-day Variability Dirck Van Vliet 20 th International EMME Users’ Conference Montreal October.
The role of volume-delay functions in forecast and evaluation of congestion charging schemes Application to Stockholm Leonid Engelson and Dirk van Amelsfort.
1 Transportation Modeling Approach Direct vs. Sequence Meeghat Habibian Modeling approach.
1 EL736 Communications Networks II: Design and Algorithms Class8: Networks with Shortest-Path Routing Yong Liu 10/31/2007.
Time of day choice models The “weakest link” in our current methods(?) Change the use of network models… Run static assignments for more periods of the.
The impact of network density, travel and location patterns on regional road network vulnerability Erik Jenelius Lars-Göran Mattsson Div. of Transport.
Network Architecture for Joint Failure Recovery and Traffic Engineering Martin Suchara in collaboration with: D. Xu, R. Doverspike, D. Johnson and J. Rexford.
1 A Vehicle Route Management Solution Enabled by Wireless Vehicular Networks Kevin Collins and Gabriel-Miro Muntean IEEE INFOCOM 2008.
Typical supply chain upstream downstream.
Mutually Controlled Routing with Independent ISPs Offense Gary Bramwell Zhaosheng Zhu.
Graphs and Topology Yao Zhao. Background of Graph A graph is a pair G =(V,E) –Undirected graph and directed graph –Weighted graph and unweighted graph.
Capacity Requirements for Network Recovery from Node Failure with Dynamic Path Restoration Gangxiang Shen and Wayne D. Grover TRLabs and University of.
Norman W. Garrick Trip Assignment Trip assignment is the forth step of the FOUR STEP process It is used to determining how much traffic will use each link.
TRIP ASSIGNMENT.
Flying the A-380 The Case for Bigger Aircraft MIT meets Lufthansa 2003.
1 EL736 Communications Networks II: Design and Algorithms Class11: Multi-Hour and Multi-Layer Network Design 12/05/2007.
Network Topologies.
1 Road network vulnerability Important links and areas, exposed users Erik Jenelius Dept. of Transport and Economics Royal Institute of Technology (KTH)
FTA Transport Manager Introduction The Highways Agency and the Strategic Road Network Risks to resilience Ensuring resilience during all types of.
Www3.informatik.uni-wuerzburg.de Institute of Computer Science Department of Distributed Systems Prof. Dr.-Ing. P. Tran-Gia Performance Metrics for Resilient.
1 Slides by Yong Liu 1, Deep Medhi 2, and Michał Pióro 3 1 Polytechnic University, New York, USA 2 University of Missouri-Kansas City, USA 3 Warsaw University.
Network Sensitivity to Hot-Potato Disruptions Renata Teixeira (UC San Diego) with Aman Shaikh (AT&T), Tim Griffin(Intel),
DaVinci: Dynamically Adaptive Virtual Networks for a Customized Internet Jennifer Rexford Princeton University With Jiayue He, Rui Zhang-Shen, Ying Li,
From EMME to DYNAMEQ in the city of MALMÖ. THE COMPANY Founded in early 2011 Currently located in Stockholm, Gothenburg and Malmö Small company (currently.
1 The vulnerability of road networks under area-covering disruptions Erik Jenelius Lars-Göran Mattsson Div. of Transport and Location Analysis Dept. of.
Computers in Urban Planning Computational aids – implementation of mathematical models, statistical analyses Data handling & intelligent maps – GIS (Geographic.
1 Road network vulnerability: Identifying important links and exposed regions Erik Jenelius, Tom Petersen, Lars-Göran Mattsson Department of Transport.
Trafik Stockholm is working on behalf of the Stockholm Region of the Swedish Road Administration and the City of Stockholm Streets and Real Estate Administration.
David B. Roden, Senior Consulting Manager Analysis of Transportation Projects in Northern Virginia TRB Transportation Planning Applications Conference.
TAMs – Total Airport Management Systems
Network Survivability Against Region Failure Signal Processing, Communications and Computing (ICSPCC), 2011 IEEE International Conference on Ran Li, Xiaoliang.
Dynamics of Traffic Flows in Combined Day-to-day and With- in Day Context Chandra Balijepalli ITS, Leeds September 2004.
The McGraw- AS Computing LAN Topologies. The McGraw- Categories of LAN Topology.
TECHNION – Israel Institute of Technology Department of Electrical Engineering The Computer Network Laboratory Crankback Prediction in ATM According to.
Traffic Flow Nora Shora Laura Tatsch. Traffic Flow Exploring dynamic vs. static toll pricing in a traffic network simulation model.
1 Managing Travel For Planned Special Events: The VA Department of Transportation’s Traffic Signal System Approach National Transportation Operations Coalition.
11/02/09 Chapter 7-Project Planning 1 Elements of Project Planning  Divide project into tasks, tasks into subtasks, subtasks into...  Estimate duration.
June 14th, 2006 Henk Taale Regional Traffic Management Method and Tool.
DaVinci: Dynamically Adaptive Virtual Networks for a Customized Internet Jiayue He, Rui Zhang-Shen, Ying Li, Cheng-Yen Lee, Jennifer Rexford, and Mung.
Quality of Service Routing Anunay Tiwari Anirudha Sahoo.
1 Geography and road network vulnerability Erik Jenelius Div. of Transport and Location Analysis Royal Institute of Technology (KTH), Stockholm.
Star Topology Star Networks are one of the most common network topologies. consists of one central switch, hub or computer, which acts as a conduit to.
Congestion Management for China’s Transit Metropolis Cities by Professors P. Jones, D. Turner and B. Heydecker of UCL. January 2015 Workshop Beijing.
1 Importance and Exposure in Road Network Vulnerability Analysis: A Case Study for Northern Sweden Erik Jenelius Transport and Location Analysis Dept.
Algorithms for Resource Allocation in HetNet Jianwei Liu Clemson University.
Florida’s First Eco-Sustainable City. 80,000+ Residential Units 10 million s.f. Non-Residential 20 Schools International Clean Technology Center Multi-Modal.
Safe roads, Reliable journeys, Informed travellers Highways Agency’s Journey Time Reliability Target With Thanks to Paresh Tailor Business Planning & Performance.
1 Slides by Yong Liu 1, Deep Medhi 2, and Michał Pióro 3 1 Polytechnic University, New York, USA 2 University of Missouri-Kansas City, USA 3 Warsaw University.
Managing Congestion and Emissions in Road Networks with Tolls and Rebates Hai Yang Chair Professor Department of Civil and Environmental Engineering The.
Generated Trips and their Implications for Transport Modelling using EMME/2 Marwan AL-Azzawi Senior Transport Planner PDC Consultants, UK Also at Napier.
Travel Demand Forecasting: Traffic Assignment CE331 Transportation Engineering.
Root Cause Localization on Power Networks Zhen Chen, ECEE, Arizona State University Joint work with Kai Zhu and Lei Ying.
Draft-deoliveira-diff-te-preemption-02.txt J. C. de Oliveira, JP Vasseur, L. Chen, C. Scoglio Updates: –Co-author: JP Vasseur –New preemption criterion.
A Maximum Fair Bandwidth Approach for Channel Assignment in Wireless Mesh Networks Bahador Bakhshi and Siavash Khorsandi WCNC 2008.
Introduction In modern age Geographic Information systems (GIS) has emerged as one of the powerful means to efficiently manage and integrate numerous types.
Transportation Planning Asian Institute of Technology
Urban Land-Use Theories
Ad hoc Data Dissemination in Vehicular Networks
Modeling Approach Direct vs. Sequenced
MATS Quantitative Methods Dr Huw Owens
Meshed Multipath Routing: An Efficient Strategy in Wireless Sensor Networks Swades DE Chunming QIAO Hongyi WU EE Dept.
Route Choice Lecture 11 Norman W. Garrick
OOH AUDIENCE GROWTH IN 2018 February 2019.
Replacement of Vehicle Bridge over Spring Creek
Presentation transcript:

1 Secondary link importance: Links as rerouting alternatives during road network disruptions Erik Jenelius Centre for Transport Studies / Royal Institute of Technology (KTH) Stockholm, Sweden

2 Motivation To allocate resources for maintenance, operations and upgrades, it is useful to rank road links according to importance Measures of link importance usually reflect role under normal conditions Link’s role for transport efficiency We are interested in measuring link importance as rerouting alternative to other links during disruptions Link’s role for transport robustness

3 Primary importance: Importance under normal conditions Flow-based primary importance: Number of travellers using the link per unit time (flow centrality) Captures how many rely on the link Delay-based primary importance: Total travel delay caused by disruption of link (typical vulnerability analysis) Also captures availability of alternatives

4 Secondary importance: Importance as rerouting alternative Flow-based secondary importance: Flow rerouted to link k during disruption of other link Captures how many could come to rely on the link Delay-based secondary importance: Additional delay for rerouted flow if link k also would be disrupted Also captures quality of next-best alternatives

5 Three origins/destinations: A, B, C Six links: a, b, c, d, e, f Consider link f An example

6 f is normally used (only) for trips from B to C Normal link flow: f f = f BC Flow-based primary importance: I 1 flow (f) = f f = f BC An example Primary importance

7 Disruption of f: flow reroutes to (d,b) Delay-based primary importance: I 1 delay (f) = ΔT f = f BC ·Δt f BC

8 Still interested in link f Trips from A to B normally use route (a,d) An example Secondary importance

9 Trips from A to B normally use route (a,d) If a is disrupted, f is on alternative route Added flow on f: f a f+ = f a = f AB An example Flow-based secondary importance

10 Secondary importance To find total flow-based secondary importance of f, we summarize over all OD pairs and other links Flow-based secondary importance: I 2 flow (f) = Σ kf w k ·f k f+ Weight w k reflects influence of link k Here: w k proportional to link length

11 Total delay for rerouted traffic: ΔT a f+ = f AB ·Δt a AB An example Delay-based secondary importance

12 An example Delay-based secondary importance Total delay for rerouted traffic: ΔT a f+ = f AB ·Δt a AB If both a, f are disrupted: (c,b,d) is alternative Difference in delay with/without f: ΔT af f+ - ΔT a f+ = f AB ·(Δt af AB - Δt a AB )

13 Secondary importance Again, we summarize over all other links: Delay-based secondary importance: I 2 delay (f) = Σ kf w k ·(ΔT kf f+ - ΔT k f+ )

14 Example cont. No available routes If both d, f disrupted, no routes from A to B or from B to C We calculate delay as time until disruption is lifted (duration τ) Here, total delay is ΔT df f+ = (f AB +f BC )·τ 2 /2

15 Case study Northern Sweden Study area: 18 municipalities 12 h closure duration Travel time minimization Travel demand, travel times from transport modelling system SAMPERS

16 Results Flow-based primary importance Normal link flows show backbone road network

17 Results Delay-based primary importance Link important if flow and/or average user delay is large

18 Results Flow-based secondary importance Links along coastal motorway, around towns important Links being alternatives for long links important

19 Results Delay-based secondary importance Link important if weighted redirected flow and/or average difference in delay with/without link is large

20 Conclusions Identify links important as rerouting alternatives Can also be used under emergency rerouting schemes If single link failure is isolated event: Use flow-based secondary importance If risk for multiple failures: Use delay-based secondary importance Can be extended to more than two simultaneous failures

21 Thank you!