Graph Model Represent each router as node Direct link between routers represented by edge Symmetric links undirected graph Edge cost cx,y) denotes measure of difficulty of using link delay, s cost, or congestion level Task Determine least cost path from every node to every other node Path cost d(x, y)=sum of link costs 2021/2/8Graph Model  Represent each router as node  Direct link between routers represented by edge  Symmetric links  undirected graph  Edge “cost” c(x,y) denotes measure of difficulty of using link  delay, $ cost, or congestion level  Task  Determine least cost path from every node to every other node  Path cost d(x,y) = sum of link costs 2021/2/8 9