CS541 Advanced Networking 1 Routing and Shortest Path Algorithms Neil Tang 2/18/2009.

Slides:



Advertisements
Similar presentations
Bellman-Ford algorithm
Advertisements

CS223 Advanced Data Structures and Algorithms 1 Greedy Algorithms Neil Tang 4/8/2010.
Lecture 2. Recapitulation Algorithm complexity analysis Point to point routing algorithms –Dijkstra –Bellman-Ford Questions?
Management Science 461 Lecture 2b – Shortest Paths September 16, 2008.
MAX FLOW APPLICATIONS CS302, Spring 2013 David Kauchak.
Computability and Complexity 23-1 Computability and Complexity Andrei Bulatov Search and Optimization.
Path Protection in MPLS Networks Ashish Gupta Design and Evaluation of Fault Tolerance Algorithms with Performance Constraints.
PROXY FOR CONNECTIVITY We consider the k shortest edge disjoint paths between a pair of nodes and define a hyperlink, whose ‘connectivity’ is defined as:
Chapter 7 Network Flow Models.
Shortest path algorithm. Introduction 4 The graphs we have seen so far have edges that are unweighted. 4 Many graph situations involve weighted edges.
Shortest Path Algorithm By Weston Vu CS 146. What is Shortest Paths? Shortest Paths is a part of the graph algorithm. It is used to calculate the shortest.
Multicast Routing in ATM Networks with Multiple Classes of QoS Ren-Hung Hwang, Min-Xiou Chen, and Youn-Chen Sun Department of Computer Science & Information.
CS541 Advanced Networking 1 Static Channel Assignment and Routing in Multi-Radio Wireless Mesh Networks Neil Tang 3/9/2009.
CMPE 150- Introduction to Computer Networks 1 CMPE 150 Fall 2005 Lecture 21 Introduction to Computer Networks.
On Channel-Discontinuity-Constraint Routing in Multi-Channel Wireless Infrastructure Networks Abishek Gopalan, Swaminathan Sankararaman 1.
CS541 Advanced Networking 1 A Real-Time Communication Architecture for Wireless Sensor Networks Neil Tang 4/22/2009.
CS541 Advanced Networking 1 Introduction to Optimization Neil Tang 2/23/2009.
The Shortest Path Problem
1 GRAPHS - ADVANCED APPLICATIONS Minimim Spanning Trees Shortest Path Transitive Closure.
Using Dijkstra’s Algorithm to Find a Shortest Path from a to z 1.
Dijkstra’s Algorithm. 2 Shortest-path Suppose we want to find the shortest path from node X to node Y It turns out that, in order to do this, we need.
CS223 Advanced Data Structures and Algorithms 1 The Bellman-Ford Shortest Path Algorithm Neil Tang 03/11/2010.
1 Pertemuan 20 Teknik Routing Matakuliah: H0174/Jaringan Komputer Tahun: 2006 Versi: 1/0.
Which of these can be drawn without taking your pencil off the paper and without going over the same line twice? If we can find a path that goes over all.
EEC-484/584 Computer Networks Lecture 9 Wenbing Zhao (Part of the slides are based on Drs. Kurose & Ross ’ s slides for their Computer.
The Network Layer & Routing
The Influence of Network Topology on the Efficiency of QoS Multicast Heuristic Algorithms Maciej Piechowiak Piotr Zwierzykowski Poznan University of Technology,
InterConnection Network Topologies to Minimize graph diameter: Low Diameter Regular graphs and Physical Wire Length Constrained networks Nilesh Choudhury.
MAX FLOW APPLICATIONS CS302, Spring 2012 David Kauchak.
Most of contents are provided by the website Graph Essentials TJTSD66: Advanced Topics in Social Media.
1 Computer Communication & Networks Lecture 21 Network Layer: Delivery, Forwarding, Routing Waleed.
Complete Graphs A complete graph is one where there is an edge between every two nodes A C B G.
Optical Network Security Daniel Stewart. Preliminary work Dijkstra's Algorithm Dijkstra's algorithm, is a graph search algorithm that solves the single-
Efficient Computing k-Coverage Paths in Multihop Wireless Sensor Networks XuFei Mao, ShaoJie Tang, and Xiang-Yang Li Dept. of Computer Science, Illinois.
Graphs A ‘Graph’ is a diagram that shows how things are connected together. It makes no attempt to draw actual paths or routes and scale is generally inconsequential.
CS223 Advanced Data Structures and Algorithms 1 Maximum Flow Neil Tang 3/30/2010.
Efficient Resource Allocation for Wireless Multicast De-Nian Yang, Member, IEEE Ming-Syan Chen, Fellow, IEEE IEEE Transactions on Mobile Computing, April.
Graphs Definition: a graph is an abstract representation of a set of objects where some pairs of the objects are connected by links. The interconnected.
Lecture 7. Building Forwarding Tables There are several methods Static Method Dynamic Methods Centralized Distributed Distance Vector Link State.
Chapter 14 Section 3 - Slide 1 Copyright © 2009 Pearson Education, Inc. AND.
ROUTING PROTOCOL IN WIRELESS
SHORTEST ROUTE PROBLEM A Networking Model Report for DPA 702 QUANTITATIVE METHODS OF RESEARCH By: ALONA M. SALVA Cebu Technological University.
1 Most important algorithms! Routing Algorithms Properties Shortest Path Routing Flooding Distance Vector Routing Link State routing Hierarchical routing.
Minimum Spanning Trees
Dynamic Programming 1 Neil Tang 4/20/2010
Unweighted Shortest Path Neil Tang 3/11/2010
The Taxi Scheduling Problem
CS223 Advanced Data Structures and Algorithms
Graph Algorithm.
Minimum Spanning Trees
Minimum Spanning Tree Neil Tang 3/25/2010
COMPUTER NETWORKS CS610 Lecture-42 Hammad Khalid Khan.
Dijkstra’s Shortest Path Algorithm Neil Tang 03/25/2008
Shortest Path Algorithms
Shortest path algorithm
Graphs.
Route Inspection Which of these can be drawn without taking your pencil off the paper and without going over the same line twice? If we introduce a vertex.
Minimum Spanning Tree Neil Tang 4/3/2008
Advanced Computer Networks
Pradeep Kyasanur Nitin H. Vaidya Presented by Chen, Chun-cheng
Discrete Mathematics Lecture 13_14: Graph Theory and Tree
Dynamic Programming 1 Neil Tang 4/15/2008
The Bellman-Ford Shortest Path Algorithm Neil Tang 03/27/2008
Network Flow.
Dijkstra’s Shortest Path Algorithm Neil Tang 3/2/2010
Advisor: Yeong-Sung, Lin, Ph.D. Presented by Yu-Ren, Hsieh
Maximum Flow Neil Tang 4/8/2008
Prim’s Minimum Spanning Tree Algorithm Neil Tang 4/1/2008
Network Flow.
Routing Metrics Neil Tang 11/03/2009
Presentation transcript:

CS541 Advanced Networking 1 Routing and Shortest Path Algorithms Neil Tang 2/18/2009

CS541 Advanced Networking 2 Outline  Network Model  Link and Path Costs  Routing Problems  Dijkstra’s Shortest Path Algorithm  Constrained Shortest Path Algorithms

CS541 Advanced Networking 3 Network Model  A network is usually modeled as a graph such that the networking problems, such as routing and scheduling, can be transformed to the corresponding problems in a graph and solved by algorithms in graph theory.  A vertex in the graph represents a router.  In a wired network, there is an edge (A,B) between a pair of vertices A and B if there is a physical link in between.  Disk graph: In a wireless network, there is an edge (A,B) between a pair of vertices A and B if their Euclidean distance is no more than the transmission range of node A.

CS541 Advanced Networking 4 Link and Path Cost  There is usually one or multiple cost parameters associated with each link, which indicate its transmission cost, bandwidth, delay and so on.  Some of parameters are bottleneck parameters (e.g. bandwidth), i.e., the cost of the path in terms of this parameter depends on the minimum link cost along the path.  Some of parameters are additive parameters (e.g. delay), i.e., the cost of the path in terms of this parameter is equal to the summation of the costs of all links along the path.

CS541 Advanced Networking 5 Routing Problems  Basic routing problem: Given a source and a destination, the basic routing problem seeks a source-destination route such that it has the minimum cost among all possible source-destination routes.  QoS routing problem: Given a source and destination along with one or multiple QoS constrains (e.g, bandwidth, delay), a QoS routing problem seeks a source-destination route such that it has the minimum cost among all source-destination routes which can satisfy all QoS constraints.

CS541 Advanced Networking 6 Dijkstra’s Shortest Path Algorithm 10 5       A B C D E Time complexity: |E|+|V|log|V|

CS541 Advanced Networking 7 Typical QoS Routing Problems  Find a minimum cost path subject to a bottleneck (e.g., bandwidth) constraint.  Find a minimum cost path subject to an additive (e.g. delay) constraint. This problem is NP-hard.

CS541 Advanced Networking 8 Constrained Shortest Path Algorithms Find a shortest path subject to a bottleneck (e.g., bandwidth) constraint: ρ= (A,D), Threshold=3 A B C D (2,4)(2,4) (4,4)(4,4) (3,2)(3,2) (3,4)(3,4) (5,2)(5,2)

CS541 Advanced Networking 9 Constrained Shortest Path Algorithms Find a shortest path subject to an additive (e.g., delay) constraint: ρ= (A,D), Threshold=4 A B C D (2,4)(2,4) (4,4)(4,4) (3,2)(3,2) (3,4)(3,4) (5,2)(5,2) A0A0 A1A1 A2A2 A3A3 A4A4 B0B0 B1B1 B2B2 B3B3 B4B4 C0C0 C1C1 C2C2 C3C3 C4C4 D0D0 D1D1 D2D2 D3D3 D4D