1. Routing and Forwarding Simulation on Paper

2. We will simulate: Managing routing tables using two different protocols: – DV - Distance vector routing (like RIP)‏ – LS - Link State routing (like OSPF)‏ Hop by hop forwarding “Ping” - Echo request, echo reply, TTL expiry

3. Divide into groups Class is divided into 5 groups: AB, CDE, FGH, IJK, LMN Please do not work alone; the entire group should work together Each group represents a “router” Diagrams show the links between “routers” – Each group gets a different diagram, knows only what's on their diagram – Routing protocols should eventually learn about things that were not on the diagrams

4. Each group represents a “router” Your brains act as the software and CPU Large pieces of paper represent routing tables or forwarding tables Small pieces of paper represent messages sent or received

5. Thick lines on diagrams represent links You have a diagram showing network links from your “router” to some other “routers” in the room You do not (yet) know anything that's not on the diagram You can send or receive messages over your direct links. If you want to send a message to a non- neighbour, it will need hop-by-hop forwarding

6. Step by step instructions – Central Clocking All groups should work at the same pace, otherwise it gets too confusing Instructors will tell you what to do, step by step Please do not skip ahead Real routing protocols do not use central clocking. Instead, each router operates at its own pace with its own timers.

7. Reminder: Routing and forwarding Forwarding table lists destinations and corresponding next-hop – Where does forwarding table come from? Messages have source address, destination address, and a message body If destination is yourself, read message and respond If not addressed to you, decrement TTL and pass message on to next hop Discard message if destination is unknown

8. Distance Vector Routing Simulation RIP is a distance vector protocol. This exercise is a much simplified version. “Distance vector” protocols exchange lists (“vectors”) containing information about the distance to each destination.

9. Distance Vector Routing Simulation - Initialisation Instructors pass out information about topology. Each group knows about their direct neighbours, but not distant destinations. Protocol will “learn” how to get to distant destinations.

10. DV Simulation – Examine your topology You have a diagram showing yourself and links to your neighbours You do not yet know anything else OP MN (Self)‏ QR

11. DV Simulation - Create a distance vector routing table Create a distance vector table showing routes to all destinations that you know about. Table will contain three columns: – Destination – Next hop (yourself, or a direct neighbour, never anything else)‏ – Cost (0 for yourself, 1 for your direct neighbours, more for distant destinations)‏ Table will contain one row for each destination you know about.

12. Distance Vector (DV) routing table as known by Time: DestinationNext HopTotal Cost OP 09:15 OP(self)0 MNMN1 QRQR1 Fill in the first version of your DV routing table Use a large sheet of paper for the routing table Cost 1 to get to a direct neighbour. Destination = your neighbour. Next hop = the same neighbour. Put your actual neighbour names instead of “MN” and “QR”. Cost 0 to get to yourself. Put your name instead of “OP”. Time Your name here

13. DV Simulation – Prepare to send copies to neighbours Make copies of your distance vector table – but leave out the next hop. Just include the destination and cost You need one copy for each neighbour Make copies now, but do not send them to neighbours yet

14. Message From to Type: DV routing update Time: DestinationTotal Cost Prepare updates to send to your neighbours OP MN 09:16 OP0 MN1 QR1 Use small pieces of paper for messages. Prepare one message for each neighbour. Copy the “Destination” and “Total Cost” columns from your DV routing table. Do not copy the “Next Hop” column. Make one copy for each neighbour. All copies are identical except for the neighbour's name here. Time Your name here

15. DV Simulation – Exchange DV routing updates with neighbours Wait for instructors to tell you to go. Take the update messages you made, and give them to each of your neighbours Expect to receive a copy of an update message from each of your neighbours

16. Message From to Type: DV routing update Time: DestinationTotal Cost Examine the messages from your neighbours MN OP 09:16 MN0 OP1 ST1 This part of the message tells you which destinations are known by whoever sent the message. The “Total Cost” column is the cost for your neighbour to get to the specified destination. The cost for you to get there will be different. You should have received one message for each neighbour (and sent one to each). Your name should appear here, because the message was sent to you Who sent this to you? It should be from one of your direct neighbours.

17. DV Simulation – Adjust costs learned from neighbours You know that you can get to neighbour 'N' with a cost of 1. Your neighbour 'N' says “I can get to destination 'D' with a cost of 'x'” Therefore, you should be able to get to destination 'D' via neighbour 'N' for a cost of 'x+1'. So you should add 1 to the cost of everything your neighbours told you

18. Time: DestinationTotal Cost Message From to Type: DV routing update Add 1 to costs learned from neighbours MN OP 09:16 MN0 1 OP1 2 ST1 2 Add 1 to each cost. This effectively converts from “what it costs your neighbour” to “what it costs you, if you route via that neighbour” Make these changes on the small pieces of paper received from your neighbour.

19. DV Simulation - Update table using new information from neighbours You already added 1 to the cost of everything your neighbours told you If there are any destinations that you did not have before, add them to your table – next hop is the neighbour that told you about the new destination If the new cost (to any destination via your neighbour) is lower than the old cost (to the same destination), then update your table to show new cost and new next hop

20. Message From to Type: DV routing update Time: DestinationTotal Cost Find new destinations or better routes MN OP 09:16 This is a new destination. Add it to your DV routing table. Set the “Next Hop” column to the name of the neighbour that told you this new information. Cost is worse than what we knew already. Do nothing. No change. We already had a route to “MN” with cost “1” MN0 1 OP1 2 ST1 2

21. Distance Vector (DV) routing table as known by Time: DestinationNext HopTotal Cost OP 09:15 09:20 OP(self)0 MNMN1 QRQR1 STMN2 Update your DV routing table Update the routing table on a large sheet of paper Add new destination learned from neighbour “MN”. Repeat for other new destinations, possibly learned from other neighbours. Time Old information does not change this time. It might change later.‏

22. DV Simulation - Ping An instructor will fill in an “Echo Request” packet with a source and destination address and TTL of their choice Start at the source address. Ask “I am trying to go to, what is the next hop?” Got to next hop. Decrement TTL. Ask again. Repeat until success or TTL expires If successful, repeat with “Echo Reply”

23. DV Simulation - Repeat Repeat the entire process once or twice more Observe that you learn more information the first few times Eventually, routing should converge, as each group learns routes to all other groups

24. DV Simulation – Count to infinity If time allows, instructors may demonstrate the “count to infinity” problem using verbal messages

25. DV Simulation – Differences from reality Real DV protocols can detect dead peers using timeouts Real DV protocols can delete routes Real DV protocols do not use central clocking Many other differences

26. Link State Routing Simulation OSPF is a link state routing protocol. This exercise is a much simplified version. “Link state” protocols exchange information about the state (up, down, cost) of each link throughout the network.

27. Link State Routing Simulation - Initialisation Forget everything from the previous exercise. Instructors pass out information about topology. Each group knows about their direct neighbours, but not distant destinations. Protocol will “learn” how to get to distant destinations.

28. DV Simulation – Examine your topology You have a diagram showing yourself and links to your neighbours You do not yet know anything else. OP MN (Self)‏ QR

29. DV Simulation – Assign link costs Each link will have a “cost” or “distance” associated with it – A link may have different costs in different directions For each link from you to your neighbours (in the direction going away from you), assign a cost (an integer from 1 to 5)‏ DO NOT assign costs for the opposite direction. Your neighbours will be in charge of that.

30. OP MN (Self)‏ QR Assign link costs – only for one direction 4 1 Update the diagram on a large sheet of paper. Similarly for all links that go from you to any of your directly-connected neighbours. Write small to leave space for many more blocks and arrows to be added later. Cost of sending a packet across the link in the direction of the arrow (away from you, to your neighbour). Choose an integer from 1 to 5.

31. LS Simulation - Create a link state table Create a link state table showing all links that you know about Table will contain: – Link identification (PQ to RS, OP to MN, …)‏ Diagram shows your links – Cost of link – Both directions have a cost, and they might be different. “A to B” is not the same as “B to A”. The link state table, and the diagram with arrows, both represent exactly the same information.

32. Time: Link From-ToLink Cost (LS) Table of Link States as known by Create the first version of your link state table Update the link state table on a large sheet of paper OP 10:15 OP-MN1 OP-QR4 Repeat for all other links from yourself to all your neighbours. Your name here Time Cost of moving a packet over the direct link from you to your neighbour.

33. LS Simulation - Create shortest- path table Create a shortest-path table by analysing the link state table (or by analysing the arrows on the diagram, which represent the same information)‏ For each destination that you know about, figure out the path that has the lowest cost Table has three columns: Destination, path to get from you to the destination, total cost to get there

34. (LS) Shortest-Path Table derived from Link State Table as known by Time: DestinationShortest PathTotal Cost Create the first version of your Shortest-Path table OP 10:16 OP(self)0 MNOP-MN1 QROP-QR4 Update the shortest path table on a large sheet of paper Your name here Time Set of links that have to be traversed to get to the destination. The first link in the path is also the “next hop”. Sum of the costs of using all necessary links (in the correct direction) to get to the destination.

35. LS Simulation – Mark a checkpoint in the Link State table Draw a horizontal line at the end of the link state table Later, you will know that entries above the line are older and entries below the line are newer

36. Time: Link From-ToLink Cost (LS) Table of Link States as known by Update the link state table on a large sheet of paper OP OP-MN1 OP-QR4 Mark a checkpoint in the Link State table 10:15 10:17 Time Draw a line here. New information will later go below the line.

37. LS Simulation – Prepare the first messages to send to neighbours Make copies of your link state table – Since this is the first iteration, make exact copies; don't leave anything out – In the next iteration, you will send only the changes, with the help of the checkpoints You need one copy for each neighbour Make copies now, but do not send them to neighbours yet

38. Message From to Type: LS routing update Time: Link From-ToLink Cost Prepare the first updates to send to neighbours Use small pieces of paper for messages OP MN 10:18 OP-MN1 OP-QR4 Time Your name here Make one copy for each neighbour. All copies are identical except for the neighbour's name here. The first message to each neighbour contains a complete copy of your link state table. Do not leave anything out. Do not accidentally use the shortest path table.

39. LS Simulation – Exchange LS routing updates with neighbours Wait for instructors to tell you to go. Take the update messages you made, and give them to each of your neighbours Expect to receive a copy of an update message from each of your neighbours

40. Message From to Type: LS routing update Time: Link From-ToLink Cost 10:18 MN-OP2 MN-ST1 Examine the messages from your neighbours MN OP Time Who sent this to you? It should be from one of your direct neighbours. Your name should appear here, because the message was sent to you This part of the message tells you about all the links that your neighbour knows. You will merge this information into your own link state table. You should have received one message for each neighbour (and sent one to each).

41. LS Simulation - Update link-state table Merge the link states that your neighbours send you with those you already have Add any new links to your table If the costs for any old links have changed, update the cost in your table A real routing protocol would also have a way of reporting links that go down

42. Time: Link From-ToLink Cost (LS) Table of Link States as known by Update the link state table on a large sheet of paper OP OP-MN1 OP-QR4 MN-OP2 MN-ST1 Merge updates into Link State table 10:15 10:17 10:19 Time Add all the new information just learned from your neighbours. New information goes below the line that you drew earlier. “MN-OP” is not the same as “OP-MN”.

43. LS Simulation - Use link-state table to update diagram Your link-state table tells you about all the links you know about. Different directions are treated like different links. “A to B” is not the same as “B to A”. Your network diagram contains exactly the same information, just in a different format. Update the diagram using the table.

44. OP MN (Self)‏ QR Update diagram from link state table 4 1 Update the diagram on a large sheet of paper 2 ST 1 A new destination that you did not know before. A new link that you did not know before. Note the direction of the arrow. “MN-OP” is not the same as “OP-MN”.

45. LS Simulation - Use link-state table to make shortest-path table Your link-state table or your network diagram tells you about all the links you know about. Different directions are treated like different links. “A to B” is not the same as “B to A”. There will often be several ways to get to a destination. Choose the path with the lowest total cost. Use the diagram to help you. Make a table showing all destinations, how to get there, total cost.

46. (LS) Shortest-Path Table derived from Link State Table as known by Time: DestinationShortest PathTotal Cost Update your Shortest-Path table OP 10:16 10:20 OP(self)0 MNOP-MN1 QROP-QR4 STOP-MN-ST2 Update the shortest path table on a large sheet of paper Time A new destination that you did not know before. Total cost is cost of “OP-MN” plus cost of “MN-ST” The best way to get to “ST”

47. LS Simulation - Ping An instructor will fill in an “Echo Request” packet with a source and destination address and TTL of their choice Start at the source address. Ask “I am trying to go to, what is the next hop?” Got to next hop. Decrement TTL. Ask again. Repeat until success or TTL expires If successful, repeat with “Echo Reply”

48. LS Simulation - Repeat Whenever anything changes, send a copy of the changes to each neighbour – changes can be new links, changes in cost, or deleted links (link failure or death of peer)‏ – Use the horizontal line “checkpoints” to keep track of old versus new information. – Also update all your tables and diagrams whenever anything changes. Eventually, routing should converge – all groups should have identical link state tables, identical diagrams, but different shortest path tables

49. Real LS protocols send updates almost instantly Real LS protocols can detect dead peers and dead links using timers or direct measurements Many other differences LS Simulation – Differences from reality

50. NOTE TO INSTRUCTORS Instructors know the complete topology. Students all get different diagrams, showing only their own direct neighbours, not showing more distant topology. When printing these notes, remember that everything after this page needs special treatment. – This page, and all the pages of printing instructions, are not printed at all. – From page 1 to just before this page, treat it like a normal presentation. That probably implies printing in 6-up layout, with one copy per student. – Each group of students will need about 10 copies of the DV and LS routing update messages, and 1 or 2 copies of the echo request, echo reply and unreachable message templates. You can make multiple copies of the same page in the presentation and then print 6-up. – Each group of students will need 1 large copy of their own partial topology, and 1 or 2 large copies of the routing tables. – Instructors will need 1 or 2 large copies of the complete topology There is a “paperrtr-format” shell script to help with preparing the document for printing.

51. PRINTING INSTRUCTIONS for the next page This is for the DV exercise. Print full size Print one or two copies per group

52. Distance Vector (DV) routing table as known by Time: DestinationNext HopTotal Cost Instructions: Start with yourself and your neighbours. When you get updates from neighbours, update this table.

53. PRINTING INSTRUCTIONS for the next two pages This is for the LS exercise. Print full size Print one or two copies per group

54. Time: Link From-ToLink Cost (LS) Table of Link States as known by Instructions: 1. Start by filling in costs of all directly-connected links. 2. When you get updates from neighbours, update this table.

55. (LS) Shortest-Path Table derived from Link State Table as known by Time: DestinationShortest PathTotal Cost Instructions: Use your link-state table (or diagram with arrows) to figure out the shortest path to each destination. Update this shortest-path table when something changes.

56. PRINTING INSTRUCTIONS for the next page This is for the DV exercise. Print many small copies. Each group will need about 10 copies. Suggestion: – print 6 copies of the “LS routing update” per physical page – print 8 or 9 copies of that physical page – cut the pages into pieces – now you have 49 or 54 small copies – give about 10 copies to each group. Some groups may get 9 or 11 copies.

57. Message From to Type: DV routing update Time: DestinationTotal Cost Instructions for Sender: 1. Fill in source, destination, time. 2. Copy your DV routing table, but leave out the “Next Hop” column. 3. Send to your neighbour. Instructions for Receiver: 1. Add 1 to all costs. 2. If there are any costs lower than before, update cost and Next Hop in your table. 3. Similarly for any new destinations.

58. PRINTING INSTRUCTIONS for the next page This is for the LS exercise Print many small copies. Each group will need about 10 copies. Suggestion: – print 6 copies of the “LS routing update” per physical page – print 8 or 9 copies of that physical page – cut the pages into pieces – now you have 49 or 54 small copies – give about 10 copies to each group. Some groups may get 9 or 11 copies.

59. Message From to Type: LS routing update Time: Link From-ToLink Cost Instructions for Sender: 1. Fill in source, destination, time. 2. Copy your LS routing table; do not leave out anything. 3. Send to your neighbour. Instructions for Receiver: 1. If any costs have changed for links that you already knew, update your routing table. 3. Similarly for any new links.

60. PRINTING INSTRUCTIONS for the next two pages This is for both exercises. Print a few small copies of the “echo request” and “echo reply” packets. Do not give the copies to the groups, but keep them all in a central place for use as needed. Suggestion: – print 3 copies of the “echo request” and 3 copies of the “echo reply” on each physical page. – print 3 physical pages, and cut them into pieces to get 9 copies of each packet type.

61. Message From to Type: Echo Request TTL: ______ Request ID: _________ Instructions for Original Sender: 1. Fill in source, destination, TTL, ID. 2. Consult your routing table to choose next hop. 3. Send to next hop. Instructions for Receiver: 1. If message is addressed to you, send back Echo Reply. 2. If message is not addressed to you: Decrement TTL, 3. If TTL is zero, send back Error: TTL Exceeded. 4. Consult your routing table to choose next hop. 5. If destination is unknown, send back Error: Host Unreachable 6. Send message to next hop.

62. Message From to Type: Echo Reply TTL: ______ Original ID: _________ Instructions for Original Sender: 1. Fill in source, destination, TTL, Original ID (copied from request). 2. Consult your routing table to choose next hop. 3. Send to next hop. Instructions for Receiver: 1. If message is addressed to you: You received a reply! Congratulations! 2. If message is not addressed to you: Decrement TTL, 3. If TTL is zero, discard packet. Do not send error message. 4. Consult your routing table to choose next hop. 5. If destination is unknown, discard packet. Do not send error message. 6. Send message to next hop.

63. PRINTING INSTRUCTIONS for the next two pages These messages are unused, unless you have a class that is very fast at completing exercised. If you have a very fast class, you could print a few small copies of the “error” and “generic” messages, similarly to the way “echo request” and “echo reply” messages are handled.

64. Message From to Error Type: TTL: ______ Orig ID : ______Orig Dest : ______ Instructions for Original Sender: 1. Fill in source, destination, TTL, Original ID, Original Destination. 2. Consult your routing table to choose next hop. 3. Send to next hop. Instructions for Receiver: 1. If message is addressed to you: There was an error! Sorry! 2. If message is not addressed to you: Decrement TTL, 3. If TTL is zero, discard packet. Do not send error message. 4. Consult your routing table to choose next hop. 5. If destination is unknown, discard packet. Do not send error message. 6. Send message to next hop.

65. Message From to Type: TTL: ______ Message:

66. PRINTING INSTRUCTIONS for the next page The same diagrams are used for both the DV and the LS exercises. The “full topology” is kept secret from the class, revealed only to instructors You might not need any paper copies of this page; or you might want a few copies for the instructors to use. Print full size (if you print it at all)‏

67. Complete Topology as known to instructors IJK AB CDE FGH LMN

68. PRINTING INSTRUCTIONS for the next five pages The same diagrams are used for both the DV and the LS exercises. Each group gets a different page Print full size Print one to three copies of each page: – If you plan to do only one exercise (either DV or LS, but not both) then only one copy is needed, but you might also want a spare copy. – If you plan to do both exercises, then two copies will be needed, but you might also want a spare copy.

69. Partial Topology as known to group AB AB (Self)‏ CDE FGH LMN

70. Partial Topology as known to group CDE IJK AB CDE (Self)‏ LMN

71. Partial Topology as known to group FGH IJK AB FGH (Self)‏

72. Partial Topology as known to group IJK IJK (Self)‏ CDE FGH

73. Partial Topology as known to group LMN AB CDE LMN (Self)‏