1. Networking and internetworking devices

3. Repeater

4. Hub

5. Function of a bridge Regenerate and filter traffic Check destination address Forwards the new copy to the segment to which the address belongs

6. Multiport bridge

7. Connecting LAN segments in two buildings

8. Router

9. Gateway

10. Gateway is a protocol converter IBM Novell

11. Switch

12. Backbone

13. Routing algorithms Calculate the shortest path between two routers –Distance vector routing –Link state routing

14. In distance vector routing, each router periodically shares its knowledge about the entire network with its neighbors Network ID Cost Next Hop (ID of the next router) The cost is base on hop count 1= No hop Routing table 14 1 55 1 + 1 hop 14 2 B 55 2 B 14 1 14 2 B 23 1 55 2 B 78 1 14 1 23 1 55 2 B 78 1 A’s new table

15. Final routing table

16. In link state routing, each router shares its knowledge of its neighborhood with all routers in the internetwork Flooding router sends its info. to all of its neighbors, each neighbor sends the packet to all of its neighbors, and so on. Link state packet (LSP) Advertiser ID Destination network ID Cost Neighbor ID Initialization Each router sends a short greeting packet to its neighbor Prepare an LSP, Floods the network Every router receivers every LSP, Puts the info. Into a Link state database Flooding of A’s LSP

17. Every router has the same Link state database

18. Dijkstra’s Algorithm finds shortest paths from given source node s to all other nodes by developing paths in order of increasing path length algorithm runs in stages. each time adding node with next shortest path algorithm terminates when all nodes processed by algorithm

19. Link state routing table for router A โดยใช้ Dijkstra Algorithm

21. Link state routing table for router A

22. Bellman-Ford Algorithm find shortest paths from given node subject to constraint that paths contain at most one link find the shortest paths with a constraint of paths of at most two links and so on

23. Example of Bellman-Ford Algorithm