Telematics Chapter 6: Network Layer - Freie Universität Berlin

Routing Algorithms: Graph abstraction
● Abstraction of a computer network as a graph
● 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) }
u
2
1
Univ.-Prof. Dr.-Ing. Jochen H. Schiller ▪ cst.mi.fu-berlin.de ▪ Telematics ▪ Chapter 6: Network Layer
5
v
2
x
3
3
1
w
y
5
1 2
z
6.131