Chapter 13: WAN Technologies and Routing

1. Chapter 13: WAN Technologies and Routing 1. LAN vs. WAN 2. Packet switch 3. Forming a WAN 4. Addressing in WAN 5. Routing in WAN 6. Modeling WAN using graphs 7. Constructing routing tables 8. Vector distance algorithm 9. Examples of WAN Sections 13.5, 13.13 and 13.16 will not be covered

2. Introduction • LANs can be extended using techniques in previous chapter • Cannot be extended arbitrarily far or to handle arbitrarily many computers • Distance limitations even with extensions • Eg, Ethernet can span a max distance of 2500m • Need other technologies for larger networks

3. Characterizations of networks • Local Area Network (LAN) - single building • Metropolitan Area Network (MAN) - single city • Wide Area network (WAN) - country, continent, planet

4. Differences between LAN and WAN • Satellite bridge can extend LAN across large distances • Still cannot accommodate arbitrarily many computers • scalability: WAN must be scalable to long distances and many computers

5. Packet switches • To span long distances or many computers, network must replace shared medium with packet switches • Each switch moves an entire packet from one connection to another • A small computer with network interfaces, memory and program dedicated to packet switching function

6. Connections to packet switches • Packets switches may connect to computers and to other packet switches • Typically high speed connections to other packets switches, lower speed to computers • exact details depend on the WAN technology & desired speed

7. Packet switches as building blocks • Packet switches can be linked together to form WANs • WANs need not be symmetric or have regular connections • Each switch may connect to one or more other switches and one or more computers

8. Physical addressing in a WAN • Similar to LAN • Data transmitted in packets (equivalent to frames) • Each packet has format with header • Packet header includes destination and source addresses • Many WANs use hierarchical addressing for efficiency • One part of address identifies destination switch • Other part of address identifies port on switch

9. Next-hop forwarding • Packet switch must choose outgoing connection for forwarding • If destination is local computer, packet switch delivers computer port • If destination is attached another switch, this packet switch forwards to next hop through connection to another switch • Choice based on destination address in packet

10. Choosing next hop • Packet switch doesn't keep complete information about all possible destination • Just keeps next hop • So, for each packet, packet switch looks up destination in table and forwards through connection to next hop

11. Source independence • Next hop to destination does not depend on source of packet • Called source independence • Allows fast, efficient routing • Packet switch need not have complete information, just next hop • Reduces total information • all packets follow same path; 1 table required

12. Hierarchical address and routing • Process of forwarding is called routing • Next hop information is kept in routing table • Note that many entries have same next hop • all packets with identical first part of the destination address are forwarded to the same switch

13. Hierarchical address and routing • In particular, all destinations on same switch have same next hop • switch only need to examine first part of hierarchical address when forwarding a packet • Thus, routing table can be collapsed: • computation time reduced • routing table can be shortened

14. WAN architecture and capacity • More computers = more traffic • Can add capacity to WAN by adding more links and packet switches • Packet switches need not have computers attached • Interior switch - no attached computers • Exterior switch - attached computers

15. Routing in a WAN • Both interior and exterior switches: • Forward packets • Need routing tables • Must have: • Universal routing - next hop for each possible destination • Optimal routes - next hop in table must be on shortest path to destination

16. Modeling a WAN • Use a graph: • Nodes model switches • Edges model direct connections between switches • Captures essence of network, ignoring attached computers

17. Route computation with a graph • Can represent routing table with edges: • Graph algorithms can be applied to find routes

18. Redundant routing information • Notice duplication of information in routing table for node 1: • Switch 1 has only one outgoing connection; all traffic must traverse that connection

19. Default routes • Can collapse routing table entries with a default route • If destination does not have an explicit routing table entry, use the default route: • Use of default route is optional; only use when > 1 entries with the same next-hop value (see node 3)

20. Building routing tables • How to enter information into routing tables: • Manual entry - initialization file • Dynamically - through runtime interface • How to compute routing table information: • Static routing - at boot time • Dynamic routing - allow automatic updates by a program • Static is simpler; doesn't accommodate changes to network topology • Dynamic requires additional protocol(s); can work around network failures

21. Dynamic route computation • Network topology may change dynamically • Switches may be added • Connections may fail • Costs for connections may change • Switches must update routing tables based on topology changes

22. Distributed route computation • Pass information about network topology between nodes • Update information periodically • Each node re-computes shortest paths and next hops • Inject changes into routing tables

23. Vector-distance algorithm • Local information is next-hop routing table and distance from each switch • Switches periodically broadcast topology information • Other switches update routing table based on received information

24. Vector-distance algorithm (continued) • In more detail: • Each switch waits for next update message • Iterate through entries in message (a message from another switch N contains the “distances” (costs) to all other switches from N) • If entry has shorter path to destination: • Insert N as next hop to destination • Record distance as • distance from next hop to destination PLUS • distance from this switch to next hop

25. Vector-distance algorithm (continued) • Each switch will: • construct a one-dimensional array (a vector) containing the “distances” (costs) to all other switches. • distribute the vector to its immediate neighbors. • Each switch’s vector initially consists of • a distance of 0 for reachingitself • a distance of 1 for reaching directly connected switches (note: for hop count, the distance to directly connected switches is 1, there are cases where the distance is not 1, eg. 2, 5, 9, etc) • a distance of infinity for reaching other (indirectly connected) switches. • When the algorithm converges, each switch knows for each destination switch • (1) the next switch closer to the destination, and • (2) the associated cost for this path.

26. Vector-distance algorithm: An Example B 1 C E 1 1 1 1 A 1 D F 1 1 G

27. Vector-distance algorithm: An Example • Switch A’s initial routing table Switch B’s initial routing table Destination A B C D E F G Cost 0 1 1  1 1  Next Hop - B C - E F - Destination A B C D E F G Cost 1 0 1     Next Hop A - C - - - -

28. B B B B 1 1 1 1 C C C C E E E E 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 A A A A 1 1 1 1 D D D D F F F F 1 1 1 1 1 1 1 1 G G G G

29. Vector-distance algorithm: An Example • Switch C’s initial routing table Switch D’s initial routing table Destination A B C D E F G Cost 1 1 0 1    Next Hop A B - D - - - Destination A B C D E F G Cost   1 0   1 Next Hop - - C - - - G

30. Vector-distance algorithm: An Example • Switch E’s initial routing table Switch F’s initial routing table Destination A B C D E F G Cost 1    0   Next Hop A - - - - - - Destination A B C D E F G Cost 1     0 1 Next Hop A - - - - - G Exercise: complete the initial routing table for switch G by yourself (note: you need not hand in)

31. B 1 C E 1 1 1 1 A 1 D F 1 1 G Vector-distance algorithm: An Example • Switch A’s routing table after receiving message from switches C & F Destination A B C D E F G Cost 0 1 1 2 1 1 2 Next Hop - B C C E F F

32. Examples of WAN technology • ARPANET • Began in 1960s • Funded by Advanced Research Projects Agency, an organization of the US Defense Department • Incubator for many of current ideas, algorithms and internet technologies • X.25 • Early standard for networking • From ITU, which was originally CCITT • Predates computer connections, used for terminal/timesharing connection

33. Examples of WAN technology • ATM - Asynchronous Transfer Mode • Designed as single technology for voice, video, data, ... • Low jitter (variance in delivery time) and high capacity • Uses fixed size, small cells - 48 bytes data, 5 bytes header • a cell is a fixed sized packet of 53 bytes • Can connect multiple ATM switches into a network • Frame Relay • service for delivering blocks of data • designed for frame relay in bridging LANs segments • Eg, for connection for frame relay between 2 offices in 2 different cities • Typically 56Kbps or 1.5Mbps; can run to 100Mbps • SMDS - Switched Multi-megabit Data Service • faster speed than frame relay • Typically 1.5-100Mbps

34. Summary • WAN can span arbitrary distances and interconnect arbitrarily many computers • Uses packet switches and point-to-point connections • Packets switches use store-and-forward and routing tables to deliver packets to destination • WANs use hierarchical addressing • Graph algorithms can be used to compute routing tables • Many WAN technologies exist