Comparison of Q Routing and Shortest Path Algorithms

Feb 07, 2013

280 likes | 535 Views

overview. Routing AlgorithmsShortest Path Routing AlgorithmQ RoutingDual Reinforcement Q RoutingNSFNETPVMSimulation ResultsConclusions. Routing. Routing is the transmission of data (packets) from a source s to its destination d on the network or internetwork.

Share Presentation

Embed Code

Link

mauritz

Download Presentation

Comparison of Q Routing and Shortest Path Algorithms

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

Shortest Path Algorithms

Shortest Path Algorithms. Andreas Klappenecker [based on slides by Prof. Welch]. s. t. Single Source Shortest Path Problem. Given: a directed or undirected graph G = (V,E), a source node s in V, and a weight function w: E -> R.

664 views • 32 slides

LSRP: Local Stabilization in Shortest Path Routing

LSRP: Local Stabilization in Shortest Path Routing. Anish Arora Hongwei Zhang. Motivations . Local fault containment is important in large-scale systems Stability, availability, and scalability Self-stabilization is desirable in the presence of unanticipated faults

273 views • 25 slides

Shortest-Path Routing Reading: Sections 4.2 and 4.3.4

Shortest-Path Routing Reading: Sections 4.2 and 4.3.4. COS 461: Computer Networks Spring 2006 (MW 1:30-2:50 in Friend 109) Jennifer Rexford Teaching Assistant: Mike Wawrzoniak http://www.cs.princeton.edu/courses/archive/spring06/cos461/. Goals of Today’s Lecture. Path selection

627 views • 35 slides

Shortest Path Algorithms

Shortest Path Algorithms. Aditya Kumar Sehgal Amlan Bhattacharya. Single Source Shortest Path – Dijkstra’s Algorithm. Weighted graph G = ( V , E , w ) Find the shortest paths from a vertex v Î V to all other vertices in V Edge may represent cost, time, etc.

375 views • 10 slides

EE 122 : Shortest Path Routing

EE 122 : Shortest Path Routing. Ion Stoica TAs: Junda Liu, DK Moon, David Zats http://inst.eecs.berkeley.edu/~ee122/fa09 (Materials with thanks to Vern Paxson , Jennifer Rexford, and colleagues at UC Berkeley). What is Routing?. Routing implements the core function of a network:

670 views • 46 slides

Shortest path

Shortest path. Graph with Length. Dijkstra’s Algorithm. Edge with Length. 3. 4. Distance / time / resource ,etc. 4. 10. 3. 2. 2. Pattaya. Finding Shortest Path. BFS can give us the shortest path Just convert the length edge into unit edge. 2. B. D. B. D. 2. A. 2. A. 1. 3.

676 views • 30 slides

Shortest Path Algorithms

Shortest Path Algorithms. By: Nick Bielik Aaron Staranowicz Mike Knadle. Content. Objective Node Expansion A* Uniform Cost Dijkstra’s Bi-directional Dijkstra’s Demo. Objective. Uniform Cost Search (UCS) vs Dijkstra’s A* vs Dijkstra’s vs Bi-directional Dijkstra’s

291 views • 11 slides

Shortest Path

Shortest Path. Graph Theory Basics. Introduction. Weighted Graph – Edges have weights Shortest Path problem is finding a path between two vertices such that the sum of the weights of edges along the path is minimized. 2. B. C. 20. 3. A. 4. 8. E. G. 6. 5. D. 2. F. Variations.

737 views • 13 slides

9.3 Shortest Path Algorithms

9.3 Shortest Path Algorithms. Improvement Use a queue to keep all vertices whose shortest distance to s is known. Initialize d v to  for all vertices, except s Set d s to 0 and enqueue s. While the queue is not empty remove the first vertex in the queue.

454 views • 27 slides

Shortest path

Shortest path. Shortest path with dijkstra algorithm A good written lecture here: http://www.cs.cornell.edu/courses/cs312/2002sp/lectures/lec20/lec20.htm

245 views • 5 slides

Shortest Path Algorithms

Shortest Path Algorithms. Shortest Path Finding. Unweighted Shortest Path All-pairs Shortest-path Single-source Shortest-path Single-source-destination Shortest-path. Single-source Shortest Path. Bellman-Ford algorithm Dijkstra’s algorithm. Dijkstra’s Algorithm. Dijkstra(DG, source)

393 views • 16 slides

Shortest Path Algorithms

Shortest Path Algorithms. We construct a set of edges A satisfying the following invariant: A is a subset of some MST We start with A empty On each iteration, we add a suitable edge to A In the case of Kruskal’s algorithm, candidate edges are considered in order by increasing weight.

418 views • 23 slides

LSRP: Local Stabilization in Shortest Path Routing

LSRP: Local Stabilization in Shortest Path Routing. By Anish Arora Hongwei Zhang Presented By: Ankit Malhotra ankit@virginia.edu. Local Self Stabilization : Need. Network. Local Self Stabilization : Need. Fault. Fault Propagation Wave. Network. Local Self Stabilization : Need.

570 views • 47 slides

LSRP: Local Stabilization in Shortest Path Routing

LSRP: Local Stabilization in Shortest Path Routing. Hongwei Zhang and Anish Arora Presented by Aviv Zohar. On the agenda. A quick overview of routing algorithms The concept of local stabilization Why conventional algorithms fail to stabilize locally Quantifying the perturbation

816 views • 65 slides

Shortest-Path Routing Reading: Sections 4.2 and 4.3.4

Shortest-Path Routing Reading: Sections 4.2 and 4.3.4. COS 461: Computer Networks Spring 2007 (MW 1:30-2:50 in Friend 004) Jennifer Rexford Teaching Assistant: Ioannis Avramopoulos http://www.cs.princeton.edu/courses/archive/spring07/cos461/. Goals of Today’s Lecture. Path selection

463 views • 36 slides

Shortest Path

Shortest Path. HKOI 2006 March 11, 2006. Graph. Graph G = (V, E) Vertex/Node V Number |V| or simply V Degree deg[ v ],in-deg[ v ],out-deg[ v ] Edge E Number |E| or simply E Direction e = ( u , v ) or { u , v } Weight w e , w uv E ≤ V 2 i.e. deg[ v ] ≤ |V|.

549 views • 38 slides

§3 Shortest Path Algorithms

Given a digraph G = ( V, E ), and a cost function c ( e ) for e  E( G ). The length of a path P from source to destination is (also called weighted path length ). 2. v 1. v 2. 2. v 1. v 2. 4. 1. –10. 4. 1. 3. 10. 3. 2. 2. v 3. v 4. v 5. 2. 2.

364 views • 17 slides

Shortest Path

Shortest Path. 4. 4. 1. 2. 4. 7. 7. 3. 2. 3. 2. 5. Dijkstra’s Algorithm finds the shortest path from the start vertex to every other vertex in the network. We will find the shortest path from A to G. B. F. D. A. G. E. C. Dijkstra’s Algorithm.

231 views • 17 slides

Shortest Path Algorithms

251 views • 10 slides

More Related