UCB Routing Jean Walrand U.C. Berkeley www.eecs.berkeley.edu/~wlr.

Slides:



Advertisements
Similar presentations
Is the shape below a function? Explain. Find the domain and range.
Advertisements

1 EP2210 Fairness Lecture material: –Bertsekas, Gallager, Data networks, 6.5 –L. Massoulie, J. Roberts, "Bandwidth sharing: objectives and algorithms,“
DIJKSTRA’s Algorithm. Definition fwd search Find the shortest paths from a given SOURCE node to ALL other nodes, by developing the paths in order of increasing.
CS4550: Computer Networks II network layer basics 3 routing & congestion control.
1 Chapter-2: Routing Algorithms: Shortest Path and Widest Path Deep Medhi and Karthik Ramasamy August © D. Medhi & K.
Design and Analysis of Algorithms Single-source shortest paths, all-pairs shortest paths Haidong Xue Summer 2012, at GSU.
Data and Computer Communications Ninth Edition by William Stallings Chapter 12 – Routing in Switched Data Networks Data and Computer Communications, Ninth.
Management Science 461 Lecture 2b – Shortest Paths September 16, 2008.
1 EL736 Communications Networks II: Design and Algorithms Class8: Networks with Shortest-Path Routing Yong Liu 10/31/2007.
Algebra and algorithms for QoS path computation and hop-by-hop routing in the internet.
Routing Strategies Fixed Routing
1 Routing Lesson 10 NETS2150/2850 School of Information Technologies.
UCB Claude Shannon – In Memoriam Jean Walrand U.C. Berkeley
EE 4272Spring, 2003 Chapter 10 Packet Switching Packet Switching Principles  Switching Techniques  Packet Size  Comparison of Circuit Switching & Packet.
Traffic Engineering Jennifer Rexford Advanced Computer Networks Tuesdays/Thursdays 1:30pm-2:50pm.
ASWP – Ad-hoc Routing with Interference Consideration Zhanfeng Jia, Rajarshi Gupta, Jean Walrand, Pravin Varaiya Department of EECS University of California,
UCB PHYSICAL LAYER Jean Walrand U.C. Berkeley
Routing 1 Outline –What is Routing? –Why Routing? –Routing Algorithms Overview –Global Routing –Detail Routing –Shortest Path Algorithms Goal –Understand.
UCB Error Control in TCP Jean Walrand U.C. Berkeley
UCB Sharing a Channel Jean Walrand U.C. Berkeley
UCB Packet Dynamics Jean Walrand U.C. Berkeley
Communication Networks A Second Course Jean Walrand Department of EECS University of California at Berkeley.
CS541 Advanced Networking 1 Routing and Shortest Path Algorithms Neil Tang 2/18/2009.
UCB Multicasting Jean Walrand EECS. UCB Outline Definitions Broadcast, Multicast, Anycast Examples ARP, ICMP, Group Flooding Routing Multicast Tree of.
UCB Tools for Smart Networks Jean Walrand BITS (Berkeley Information Technology & Systems) U.C. Berkeley
1 Routing Algorithms. 2 Outline zBellaman-Ford Algorithm zDijkstra Algorithm.
UCB Review for M2 Jean Walrand U.C. Berkeley
UCB Communication Networks: Big Picture Jean Walrand U.C. Berkeley
Routing Protocol Pertemuan 21 Matakuliah: H0484/Jaringan Komputer Tahun: 2007.
CMPE 150- Introduction to Computer Networks 1 CMPE 150 Fall 2005 Lecture 21 Introduction to Computer Networks.
UCB TCP Jean Walrand U.C. Berkeley
Interference-aware QoS Routing (IQRouting) for Ad-Hoc Networks Rajarshi Gupta, Zhanfeng Jia, Teresa Tung, and Jean Walrand Dept of EECS, UC Berkeley Globecom.
UCB Network Address Translation Jean Walrand U.C. Berkeley
The Shortest Path Problem
Jennifer Rexford Princeton University MW 11:00am-12:20pm Wide-Area Traffic Management COS 597E: Software Defined Networking.
Math – Getting Information from the Graph of a Function 1.
Distributed Quality-of-Service Routing of Best Constrained Shortest Paths. Abdelhamid MELLOUK, Said HOCEINI, Farid BAGUENINE, Mustapha CHEURFA Computers.
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.
CS223 Advanced Data Structures and Algorithms 1 The Bellman-Ford Shortest Path Algorithm Neil Tang 03/11/2010.
Shortest Path Algorithm This is called “Dijkstra’s Algorithm” …pronounced “Dirk-stra”
1 Pertemuan 20 Teknik Routing Matakuliah: H0174/Jaringan Komputer Tahun: 2006 Versi: 1/0.
Packet-Switching Networks Routing in Packet Networks.
1 Oblivious Routing in Wireless networks Costas Busch Rensselaer Polytechnic Institute Joint work with: Malik Magdon-Ismail and Jing Xi.
William Stallings Data and Computer Communications 7th Edition
Shortest Path Algorithm
2006 QoS Routing and Forwarding Benefits of QoS Routing  Without QoS routing: –must probe path & backtrack; non optimal path, control traffic and processing.
Decision Maths 1 Shortest path algorithm Dijkstra’s Algorithm A V Ali :
Review for E&CE Find the minimal cost spanning tree for the graph below (where Values on edges represent the costs). 3 Ans. 18.
Spanning Trees Dijkstra (Unit 10) SOL: DM.2 Classwork worksheet Homework (day 70) Worksheet Quiz next block.
1 Transport Bandwidth Allocation, Intro to Network Layer 4/3/2012.
Shortest Paths.
Graph Theory and Optimization
Dijkstra’s shortest path Algorithm
Network Layer – Routing 1
Dijkstra’s Algorithm with two levels of buckets
CS223 Advanced Data Structures and Algorithms
Party-by-Night Problem
Shortest Paths.
15.082J & 6.855J & ESD.78J Visualizations
15.082J & 6.855J & ESD.78J Visualizations
Lecture 19-Problem Solving 4 Incremental Method
Dijkstra’s Shortest Path Algorithm Neil Tang 3/2/2010
and 6.855J Dijkstra’s Algorithm
Visualizations Dijkstra’s Algorithm
Lecture 19 Linear Program
Shortest Paths.
Implementation of Dijkstra’s Algorithm
Prim’s algorithm for minimum spanning trees
15.082J & 6.855J & ESD.78J Visualizations
Presentation transcript:

UCB Routing Jean Walrand U.C. Berkeley

UCB Outline Shortest Path Objective Bellman-Ford Dijkstra Adaptive Routing QoS Routing

UCB Shortest Path Objective: Find shortest path between two nodes (e.g., S and D) in a graph Example: Note: Myopic shortest path is not optimal! S D

UCB Shortest Path - Continued “Dynamic Programming” or Bellman-Ford: S D S D = min{3 + 3, 4 + 1} 7 = min{1 + 7, 2 + 5}

UCB Shortest Path - continued Dijkstra: S D

UCB Dynamic Routing Base route on “congestion” Example: 0.3ms 0.1ms 0.2ms 0.25ms 0.4ms 0.5ms

UCB Dynamic Routing - continued Difficulty: Oscillations 0.1ms 0.8ms 0.1ms

UCB Quality of Service Routing Shortest Path: Single Additive “Cost” length(path) = sum of length(link) Shortest length = A Shortest length = B a b Shortest length = min{a + A, b + B}

UCB Quality of Service Routing (cd) Maximum Bandwidth bandwidth(path) = minimum of bandwidth(link) Max. bw = A Max. bw = B a b Max bw = max{min{a, A}, min{b, B}}

UCB Quality of Service Routing (cd) Multi-objective: e.g., (delay, bw) (min. d = 3, max. bw = 10) (min. d = 6, max. bw = 15) (min. d = 3, max. bw = 10) or (min. d = 6, max. bw = 15)

UCB Quality of Service Routing (cd) Example (4, 18) (2, 14) (8, 30) (4, 12) (5, 15) (4, 20) (3, 10) (4, 20) (7, 30) D [Min d, Max bw] (d, bw)[12, 20] [7, 10] [8, 10] [11, 20] A [16, 18] B [11, 10] C [10, 10] D [13, 14] Better d Better bw A D BC