DOC PREVIEW
Berkeley ELENG 122 - routing

This preview shows page 1-2-3-4 out of 11 pages.

Save
View full document
View full document
Premium Document
Do you want full access? Go Premium and unlock all 11 pages.
Access to all documents
Download any document
Ad free experience
View full document
Premium Document
Do you want full access? Go Premium and unlock all 11 pages.
Access to all documents
Download any document
Ad free experience
View full document
Premium Document
Do you want full access? Go Premium and unlock all 11 pages.
Access to all documents
Download any document
Ad free experience
View full document
Premium Document
Do you want full access? Go Premium and unlock all 11 pages.
Access to all documents
Download any document
Ad free experience
Premium Document
Do you want full access? Go Premium and unlock all 11 pages.
Access to all documents
Download any document
Ad free experience

Unformatted text preview:

RoutingOutlineShortest PathShortest Path - ContinuedShortest Path - continuedDynamic RoutingDynamic Routing - continuedQuality of Service RoutingQuality of Service Routing (cd)Slide 10Slide 11UCBRoutingJean WalrandU.C. Berkeleywww.eecs.berkeley.edu/~wlrUCBOutlineShortest PathObjectiveBellman-FordDijkstraAdaptive RoutingQoS RoutingUCBShortest PathObjective: Find shortest path between two nodes (e.g., S and D) in a graphExample:Note: Myopic shortest path is not optimal!123434341SDUCBShortest Path - Continued“Dynamic Programming” or Bellman-Ford:123434341SD123434341SD7413755 = min{3 + 3, 4 + 1}7 = min{1 + 7, 2 + 5}UCBShortest Path - continuedDijkstra:123434341SD12455687UCBDynamic RoutingBase route on “congestion” Example:0.3ms0.1ms0.1ms0.2ms0.25ms0.4ms0.5msUCBDynamic Routing - continuedDifficulty: Oscillations0.1ms0.8ms0.8ms0.1msUCBQuality of Service RoutingShortest Path: Single Additive “Cost” length(path) = sum of length(link)Shortest length = AShortest length = BabShortest length = min{a + A, b + B}UCBQuality of Service Routing (cd)Maximum Bandwidth bandwidth(path) = minimum of bandwidth(link)Max. bw = AMax. bw = BabMax bw = max{min{a, A}, min{b, B}}UCBQuality 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)UCBQuality 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 dBetter bwADB


View Full Document

Berkeley ELENG 122 - routing

Documents in this Course
Lecture 6

Lecture 6

22 pages

Wireless

Wireless

16 pages

Links

Links

21 pages

Ethernet

Ethernet

10 pages

Links

Links

7 pages

Switches

Switches

30 pages

Multicast

Multicast

36 pages

Switches

Switches

18 pages

Security

Security

16 pages

Switches

Switches

18 pages

Lecture 1

Lecture 1

56 pages

OPNET

OPNET

5 pages

Lecture 4

Lecture 4

16 pages

Ethernet

Ethernet

65 pages

Models

Models

30 pages

TCP

TCP

16 pages

Wireless

Wireless

48 pages

Load more
Download routing
Our administrator received your request to download this document. We will send you the file to your email shortly.
Loading Unlocking...
Login

Join to view routing and access 3M+ class-specific study document.

or
We will never post anything without your permission.
Don't have an account?
Sign Up

Join to view routing 2 2 and access 3M+ class-specific study document.

or

By creating an account you agree to our Privacy Policy and Terms Of Use

Already a member?