1 / 77

Switching and Routing Technique

Switching and Routing Technique. W.lilakiatsakun. Assessment. Final 40 % Midterm 30% LAB + Assignment 30%. Topics. Review routing fundamental Routing Techniques Distance Vector – RIP V1,2 /IGRP /EIGRP Link state Protocol – OSPF ,IS-IS Hierarchical –BGPv4 Review Switching Operation

chico
Télécharger la présentation

Switching and Routing Technique

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Switching and Routing Technique W.lilakiatsakun

  2. Assessment • Final 40 % • Midterm 30% • LAB + Assignment 30%

  3. Topics • Review routing fundamental • Routing Techniques • Distance Vector – RIP V1,2 /IGRP /EIGRP • Link state Protocol – OSPF ,IS-IS • Hierarchical –BGPv4 • Review Switching Operation • Switching Techniques • Spanning Tree Protocol • VLAN and Trunk • Network Design • Case study – campus network design

  4. Review Routing Fundamental • VLSM • Static & Dynamic Routing • Routing algorithm concept

  5. VLSM • Variable Length Subnet Mask • VLSM allows an organization to use more than one subnet mask within the same network address space • VLSM implementation maximizes address efficiency, and is often referred to as subnetting a subnet • Main reason – addressing crisis

  6. Short-term solution of addressing crisis • Subnetting (1985) • VLSM (1987) • Classless interdomain routing (1993) • Private IP • NAT (Network Address Translation) /PAT (Port Address Translation)

  7. Classful routing protocol • RIP V1 (Routing Information Protocol) • IGRP (Interior Gateway Routing Protocol) • Routing table is considered by class of IP address • 192.168.10.X  192.168.10.0 • 172.10.X.X  172.10.0.0 • 10.X.X.X  10.0.0.0

  8. Supporting protocols • OSPF • Integrated IS-IS • EIGRP • RIP V2 • Static Routing • Subnet information will be exchanged as well as routing information • 172.16.10.0 /255.255.255.0 • 10.5.2.0 /255.255.255.0

  9. VLSM - example

  10. Calculating VLSM

  11. 255.255.255.252 - /30 255.255.255.248 - /29 255.255.255.240 - /28 255.255.255.224 - /27 255.255.255.192 - /26 255.255.255.128 - /25 255.255.255.0 - /24 255.255.254.0 - /23 255.255.252.0 - /22 255.255.248.0 - /21 Subnet Mask

  12. Waste of Space (1/2) • All one subnet and all zero subnet can be used to reduce the waste of space

  13. Waste of space (2/2)

  14. Sub-subnet(1/2)

  15. Sub-subnet(2/2)

  16. Calculating VLSM (1/6)

  17. Calculating VLSM (2/6)

  18. Calculating VLSM (3/6)

  19. Calculating VLSM (4/6)

  20. Calculating VLSM (5/6)

  21. Calculating VLSM (6/6)

  22. Problem 1- 192.168.10.0/24

  23. Route Aggregation • The use of classless interdomain routing (CIDR) and VLSM prevents address waste and promotes route aggregation, or summarization • Aka. Route Summarization • Save routing table space

  24. Route summarization (1/3)

  25. Route summarization (2/3)

  26. Route summarization (3/3)

  27. Review Routing fundamental • Routing is the process that a router uses to forward packets toward the destination network. • A router makes decisions based upon the destination IP address of a packet. • To make the correct decisions, routers must learn how to reach remote networks. • When routers use dynamic routing, this information is learned from other routers. • When static routing is used, a network administrator configures information about remote networks manually

  28. Static Routing(1/2) • Since static routes are configured manually, network administrators must add and delete static routes to reflect any network topology changes. • In a large network, the manual maintenance of routing tables could require a lot of administrative time.

  29. Static Routing (2/2) • Static routing is not as scalable as dynamic routing because of the extra administrative requirements. • In large networks, static routes that are intended to accomplish a specific purpose • They are often configured in conjunction with a dynamic routing protocol.

  30. Static route operation • Network administrator configures the route • Router installs the route in the routing table • The static route is used to route packets.

  31. Static route - Topology

  32. Static route – R1 configuration

  33. Static route – R1 configuration

  34. Summary static routes (1/3) • Route Summarization • Multiple static routes can be summarized into a single static route if: • The destination networks can be summarized into a single network address, and • The multiple static routes all use the same exit-interface or next-hop IP address

  35. Summary static routes (2/3) R3(config)#ip route 172.16.0.0 255.255.252.0 serial0/0/1

  36. Summary static routes (3/3)

  37. Default route (1/4) • Default routes are used to route packets with destinations that do not match any of the other routes in the routing table. • Routers are typically configured with a default route for Internet-bound traffic, since it is often impractical and unnecessary to maintain routes to all networks in the Internet. • A default route is actually a special static route that uses this format:

  38. Default route (2/4) • ip route 0.0.0.0 0.0.0.0 [next-hop-address | outgoing interface ] • The 0.0.0.0 mask, when logically ANDed to the destination IP address of the packet to be routed, will always yield the network 0.0.0.0 • If the packet does not match a more specific route in the routing table, it will be routed to the 0.0.0.0 network.

  39. Default route (3/4)

  40. Default route (4/4) Before using default route After using default route

  41. Dynamic Routing Protocol • A routing protocol is a set of processes, algorithms, and messages that are used to exchange routing information and populate the routing table with the routing protocol's choice of best paths. • The purpose of a routing protocol includes: • Discovery of remote networks • Maintaining up-to-date routing information • Choosing the best path to destination networks • Ability to find a new best path if the current path is no longer available

  42. Routing Protocol

  43. Dynamic Routing Protocol Operation • In general, the operations of a dynamic routing protocol can be described as follows: • The router sends and receives routing messages on its interfaces. • The router shares routing messages and routing information with other routers that are using the same routing protocol • Routers exchange routing information to learn about remote networks. • When a router detects a topology change the routing protocol can advertise this change to other routers.

  44. Static Routing VS Dynamic Routing

  45. AS / IGP and EGP • An autonomous system (AS) - otherwise known as a routing domain - is a collection of routers under a common administration. • Interior Gateway Protocols (IGP) are used for intra-autonomous system routing - routing inside an autonomous system. • Exterior Gateway Protocols (EGP) are used for inter-autonomous system routing - routing between autonomous systems.

  46. AS /IGP and EGP

  47. Class of routing protocol • Most routing algorithms can be classified into one of two categories: • Distance vector • Link-state • The distance vector routing approach determines the direction, or vector, and distance to any link in an internetwork. • The link-state approach recreates the exact topology of an entire internetwork.

  48. Distance Vector Routing • The distance vector routing algorithm passes periodic copies of a routing table from router to router. • These regular updates between routers communicate topology changes. • The distance vector routing algorithm is also known as the Bellman-Ford algorithm.

  49. Distance Vector Operation (1/2)

  50. Distance Vector Operation (2/2) • Each router receives a routing table from its directly connected neighbor routers. • Router B receives information from Router A. Router B adds a distance vector number, such as a number of hops. • This number increases the distance vector. • Then Router B passes this new routing table to its other neighbor, Router C. • This same step-by-step process occurs in all directions between neighbor routers

More Related