1. CIS 725 Network Layer

2. This layer provides communication between any two nodes Uniform addressing scheme independent of the network technology Network layer Data Link layer

3. Problems to be addressed Routing Congestion control

4. Routing Processing nodes Switches/routers Communication links

5. Datagram routing Each packet is routed independently Unordered Unreliable

6. Virtual Circuit routing Set up a path for each connection All messages are sent over this path Ordered Reliable

7. Routing Table Routing table contains the next hop information At each node i, for each destination j, what is the next hop

8. Bellman-Ford Algorithm Distance table: Routing table Distance Vector Algorithms distance from i to j via k

9. Protocol at node i: On receiving routing table from k update column k of the distance table as follows For each destination j, if k reports its distance to j as d then update D j,k = d + weight(i,k) Routing table

10. Recompute the routing table as follows: For each destination k, update next hop to j, where D j,k = min(D x,k : for all x)

11. Periodically or whenever the routing table changes, send routing table to all neighbors

12. Bellman-Ford Algorithm b c bcdebcde a b ea c d acdeacde abdeabde bcdebcde acdeacde abdeabde 2 2 1 1 2 4 e d c b a 2 4 2 2 1 4 1 2 b 2 c 4 a 2 c 1 d 2 a 4 b 1 e 2

13. Bellman-Ford Algorithm b c bcdebcde a b ea c d acdeacde abdeabde bcdebcde acdeacde abdeabde 2 2 1 1 2 4 e d c b a 2 4 2 2 1 4 1 2 b 2 b 3 a 2 c 1 d 2 b 3 b 1 e 2 3 4 b 4 5 6 3 3 b 3

14. Bellman-Ford Algorithm Distance vector algorithm –Best path criteria Latency Jitter bandwidth

15. Counting to infinity a b c 1 1 100 a a b b 1 3 3 1 aa a 22 c c aa 1 1 bb aa a 44 c c a a b b 1 3 3 101 ab 3 1 bb a a b b 1 5 3 ab 5 1 bb  101

16. a edf b c 11111 5 20 1234 5 destnextdistpath

17. a edf b c 11111 5 1234 5 destnextdistNext to last hop bb1a db3c cb2b fb5e eb4d e d  c  b 

18. Link State Routing Each node maintains the state of every link State of the link may contain several types of information

19. Learning local information Exchange hello packets periodically Measure the cost of adjacent links

20. Distributed link state information Link state packet: * source id * cost of incident edges * sequence numbers

21. Building Link State Packets (a) A subnet. (b) The link state packets for this subnet.

22. Distribution Algorithm Controlled flooding - hop count - sequence numbers - age

23. Receive LSP from nbr j - compare sequence numbers - update topology table - propagate LSP to all nbrs except j

24. Hierarchical Routing Divide area into regions Maintain accurate information about nodes in the same region

25. Hierarchical Routing Hierarchical routing.

26. Source-routing Message contains the entire path Routing table lookup is avoided at each node

27. Broadcasting/Multicasting To send a message to all nodes: - make a separate message to each destination - route each message independently

28. Multi-destination routing Include all destination address in message Each node decides which links to forward so that it reaches all destinations

29. Multicast trees Create a spanning tree Prune the spanning tree: Steiner tree