'Graph abstraction' presentation slideshows

Chapter 7 Dynamic Routing

Chapter 7 Dynamic Routing. Speaker: H.M. Liang. 5. 3. 5. 2. 2. 1. 3. 1. 2. 1. x. z. w. u. y. v. Graph abstraction. Graph: G = (N,E) N = set of routers = { u, v, w, x, y, z } E = set of links ={ (u,v), (u,x), (v,x), (v,w), (x,w), (x,y), (w,y), (w,z), (y,z) }.

207 views • 14 slides

Chapter 4: Network Layer

217 views • 9 slides