G number of hops queue length delay log can convert

Info iconThis preview shows page 1. Sign up to view the full content.

View Full Document Right Arrow Icon
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: E D 4 1 1 2 1 B F 13 Distance Vector •  Local rou)ng algorithm •  Each node maintains a set of triples –  <Des&na&on, Cost, NextHop> •  Exchange updates with neighbors –  Periodically (seconds to minutes) –  Whenever table changes (triggered update) •  Each update is a list of pairs –  <Des&na&on, Cost> •  Update local table if receive a “bePer” route –  Smaller cost •  Refresh exis)ng routes, delete if )me out Calcula)ng the best path •  Bellman- Ford equa)on •  Let: –  Da(b) denote the current best distance from a to b –  c(a,b) denote the cost of a link from a to b •  Then Dx(y) = minz(c(x,z) + Dz(y)) •  Rou)ng messages contain D •  D is any addi)ve metric –  e.g, number of hops, queue length, delay –  log...
View Full Document

This note was uploaded on 01/27/2014 for the course COSC 4377 taught by Professor Staff during the Spring '08 term at University of Houston.

Ask a homework question - tutors are online