1 / 79

Switching and Routing Technique

Switching and Routing Technique. W.lilakiatsakun. 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

rosalyn-espinoza
Download Presentation

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. 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

  3. Review Routing Fundamental • VLSM • Static & Dynamic Routing • Routing algorithm concept • RIP V1 /V2

  4. 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

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

  6. 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

  7. 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

  8. VLSM - example

  9. Calculating VLSM

  10. 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

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

  12. Waste of space (2/2)

  13. Sub-subnet(1/2)

  14. Sub-subnet(2/2)

  15. Calculating VLSM (1/6)

  16. Calculating VLSM (2/6)

  17. Calculating VLSM (3/6)

  18. Calculating VLSM (4/6)

  19. Calculating VLSM (5/6)

  20. Calculating VLSM (6/6)

  21. Problem 1- 192.168.10.0/24

  22. 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

  23. Route summarization (1/3)

  24. Route summarization (2/3)

  25. Route summarization (3/3)

  26. 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

  27. Static Routing • 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. • 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.

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

  29. Static route - configuration

  30. 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:

  31. 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.

  32. Default route (3/4)

  33. Default route (4/4)

  34. Routing Protocol • A routing protocol is the communication used between routers. • A routing protocol allows routers to share information about networks and their proximity to each other. Routers use this information to build and maintain routing tables. • Examples of routing protocols are as follows: • Routing Information Protocol (RIP) • Interior Gateway Routing Protocol (IGRP) • Enhanced Interior Gateway Routing Protocol (EIGRP) • Open Shortest Path First (OSPF)

  35. Routed Protocol • A routed protocol is used to direct user traffic. • A routed protocol provides enough information in its network layer address to allow a packet to be forwarded from one host to another based on the addressing scheme. • Examples of routed protocols are as follows: • Internet Protocol (IP) • Internetwork Packet Exchange (IPX)

  36. Routing and Routed Protocol

  37. Autonomous System • An AS is a collection of networks under a common administration that share a common routing strategy. • To the outside world, an AS is viewed as a single entity. • The AS may be run by one or more operators while it presents a consistent view of routing to the external world. • The American Registry of Internet Numbers (ARIN), a service provider, or an administrator assigns a 16-bit identification number to each AS. • EIGRP /OSPF /BGP  require unique AS number

  38. AS (Autonomous System)

  39. Dynamic Routing (1/2) • The goal of a routing protocol is to build and maintain a routing table. • This table contains the learned networks and associated ports for those networks. • Routers use routing protocols to manage information received from other routers and its interfaces, as well as manually configured routes. • The routing protocol learns all available routes, places the best routes into the routing table, and removes routes when they are no longer valid. • The router uses the information in the routing table to forward routed protocol packets.

  40. Dynamic Routing (2/2) • When all routers in an internetwork operate with the same knowledge, the internetwork is said to have converged. • Fast convergence is desirable because it reduces the period of time in which routers would continue to make incorrect routing decisions

  41. Routing Protocol

  42. 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.

  43. 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.

  44. Distance Vector Operation (1/2)

  45. 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

  46. Distance Vector Network Discovery

  47. Routing Metric Component

  48. Link State Protocol • The link-state algorithm is also known as Dijkstra's algorithm or as the shortest path first (SPF) algorithm. • The link-state routing algorithm maintains a complex database of topology information • It also maintain full knowledge of distant routers and how they interconnect

  49. Link State Concept

  50. Link State Concept • Link-state advertisement (LSA) - a small packet of routing information that is sent between routers • Topological database - a collection of information gathered from LSAs • SPF algorithm - a calculation performed on the database that results in the SPF tree • Routing table - a list of the known paths and interfaces

More Related