1 / 22

NextGen Traffic Routing System Presentation at Carnegie Mellon University

Learn about the innovative system that provides optimal routing on roads using dynamic traffic balancing and leverages cutting-edge technologies for faster and efficient navigation. Discover the architecture, real-time data collection, and future directions of the project.

toshag
Download Presentation

NextGen Traffic Routing System Presentation at Carnegie Mellon University

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Team Members Abhinav Mishra Amber Palekar Rahul Iyer Vishakha Gupta

  2. Imagine Cup Presentation Carnegie Mellon University Team O(1)

  3. Agenda • Motivation • Innovation • System Design Overview • Databases • Compute Servers • Web Servers • Traffic model and Data Collection Servers • Maps • Quantitative Measurements • Architectural Highlights • Future Directions • Questions/Comments

  4. Looks Familiar?

  5. Motivation & Aim • Get you to your destination faster • Optimal Routing on Roads using Dynamic Traffic Balancing • Gives you the “best” route to your destination • Optimal Time • Optimal Distance

  6. Innovation • Different from Yahoo Maps, MapQuest, Google Maps • Bidding good bye to static maps • Leveraging cutting edge technologies • Minneapolis has already deployed traffic sensors at intersections • Scalability and Fault-tolerance built into system (and not “patched” onto it)

  7. A Problem Let’s just meet somewhere! I have an idea! Let’s meet at the Subway on 41st. I’m leavin’ for the Starbucks on 42nd, c’ya guys there!

  8. Our Solution Where should we meet? Thai Café on 43rd is your best option Thai Café on 43rd is your best option Where should we meet? Thai Café on 43rd is your best option Where should we meet?

  9. System Design Overview Maps DB Handler Traffic Model

  10. Load Balancing Web Servers Compute Servers Scalability Compute Servers Database* Fault tolerance Compute Servers: designed to be stateless Web Server Database* Architectural Highlights

  11. Original Design targeted at a 1000 intersection map Current system considers all of Allegheny county ~45,000 Intersections & 60,000 Roads Loading the map for all of Allegheny county takes about 6 seconds We update the map every minute Update takes roughly 3 seconds Quantitative measurements

  12. Future Directions • Server-side map generation engine • More elaborate model for simulation of real-life traffic • Enabling SMS results for user queries • Better text prediction algorithms for the mobile GUI • Sturdier database infrastructure • 2 Phase Commit is too slow?

  13. Postmortem • .NET – a boon for software development • Fast, Handy, Bundled with an excellent IDE • ADO.NET: simple to use • Microsoft SQL Server: fast! • ASP.NET: enabled deployment on mobile devices • .NET Remoting: shorter learning curve • Performance counters • Oh how we wish! • that ADO.NET allowed >2 data readers • that we could try this on Windows Server 2003 

  14. Questions

  15. Thank You

  16. User chooses source and destination intersections from drop-down lists & chooses one of the time-optimal or distance-optimal route options User GUI • Remotely invoke route computation algorithm at the compute server • Commercial Value – Advertisement Server

  17. Handy tool for the Cruise Control Administrator Saves configuration time, designed to handle large number of nodes/links Add/Modify/Delete on: Nodes Links System Parameters Uses backend AdminInterface class which talks to the DB handler Administrator Interface

  18. Uses optimized version of Dijkstra’s algorithm with a priority queue implementation to improve scalability. Euclidean distance as a heuristic to converge faster on routes Refreshes the graph Every ‘refreshInterval’ Whenever node and link details change in system Registers itself with the .NET registry to make itself available for remote invocation (uses Singleton) Answers requests from web server, on-demand Fault tolerance – handle lost DB connectivity for a while Load balancing – server-initiated load balancing Compute Servers

  19. The Database Handler provides an interface for clients to access the database The DB Handler acts like a “stub” providing marshalling and un-marshalling Database Daemons act as “middlemen” between the client DB Handlers and the databases Uses TCP connections instead of Atomic Broadcast DB & DB Handler

  20. Traffic model periodically generates load over each link in the map depending on the type of road Downtown roads are “Heavy” at rush hour Small streets aren’t Model sends periodic updates to collection server as a formatted string Multi-threaded server collects data generated by traffic model, parses it & updates the DB New models can be seamlessly plugged in Fault tolerant, replicated servers running Highly Scalable Traffic Model & Collection

  21. Uses Microsoft IIS On request, remotely invokes compute nodes to calculate optimal route Fault tolerant Load balancing Highly available Ad Server runs on Web Server Decides ad to post Web Server

  22. Tiger Maps Street Level Maps Census Information for: Counties Street Names Zipcodes The GrooveNet project Uses Tiger Maps Interprets them as a graph We leverage existing map interpretation code of GrooveNet Populate database with data from GrooveNet Maps

More Related