Designing IP Addressing and Selecting Routing Protocols Part 2 — Transcript
Full transcript
- 0:04reviewing enterprise
- 0:06routing protocols
- 0:10this segment describes considerations
- 0:12for selecting the most appropriate
- 0:14network routing protocol
- 0:16so first routing protocol features are
- 0:19discussed
- 0:20followed by a description of various
- 0:22routing protocols appropriate for the
- 0:24enterprise use
- 0:26the video discusses why certain
- 0:28protocols are suitable
- 0:30for specific modules in the enterprise
- 0:32architecture
- 0:33it concludes with a description of some
- 0:36advanced
- 0:37routing protocol deployment features
- 0:39including redistribution
- 0:41filtering and summarization
- 0:48routing protocol features so you've got
- 0:50the distance vector
- 0:52versus the link state okay so there are
- 0:56many ways to characterize
- 0:57routing protocols including static
- 1:01versus dynamic routing
- 1:03interior versus exterior routing
- 1:05protocols
- 1:06you've got distance vector versus link
- 1:09state
- 1:10versus hybrid protocols okay
- 1:13so you also have routing protocol
- 1:15metrics
- 1:17routing protocol convergence flat versus
- 1:20hierarchical routing protocols
- 1:23so basically on this slide
- 1:26we will be talking about distance vector
- 1:28and link state
- 1:29comparison okay so there are protocols
- 1:33that are classified to be distance
- 1:34vector
- 1:35which includes and eigrp
- 1:40okay so this our distance vector
- 1:43eigrp is considered to be the hybrid
- 1:45protocol
- 1:47okay now link state
- 1:50such as ospf and isis these are types of
- 1:54the link state routing protocols okay
- 1:57now distance vector protocol
- 2:00characteristics
- 2:02well slow convergence easy
- 2:05implementation and maintenance
- 2:07and limited scalability
- 2:10okay whereas for the link state protocol
- 2:14it is fast convergence good scalability
- 2:19less routing traffic overhead and more
- 2:22knowledge
- 2:22needed for implementation maintenance
- 2:25again several protocols are running
- 2:28under distance vector which includes
- 2:30rip and eigrp and for the link state
- 2:34well a popular ospf is being considered
- 2:40now let's focus on the distance vector
- 2:42protocol
- 2:44in distance vector protocol routing
- 2:46decisions
- 2:47are made on a half by hub basis
- 2:51okay each router relies on its neighbor
- 2:54routers
- 2:55to make the correct routing decision so
- 2:58the router passes
- 3:00only the results of this decision
- 3:03which is its routing table to its
- 3:05neighbors
- 3:07distance vector protocols are typically
- 3:09slower to converge
- 3:10and do not scale well however they are
- 3:13easy to implement and maintain
- 3:16so again examples of distance of vector
- 3:18protocols includes
- 3:20rip okay both rip version one and
- 3:22represent two
- 3:24and the enhanced interior gateway
- 3:26routing protocol or the eigrp now for
- 3:32link state protocol
- 3:34each router floods information about
- 3:37itself
- 3:38its link states either to all other
- 3:41routers
- 3:42in the network okay or
- 3:45to part of the network we call it area
- 3:49now each router makes its routing
- 3:53decision based on all the received
- 3:57information
- 3:58and using the short test path first or
- 4:01spf algorithm
- 4:02also known as the dextras algo which
- 4:05calculates the shortest path
- 4:07to any destination the link state
- 4:10protocols are fast to converge
- 4:13have less routing traffic overhead and
- 4:16scale well
- 4:18however because of their complexity
- 4:21the link state protocols are more
- 4:23difficult to implement and maintain
- 4:26the ip-link state protocols are ospf
- 4:29and the integrated isis
- 4:32so the third type of protocol that i
- 4:34have mentioned earlier
- 4:36is what you call hybrid interior gateway
- 4:38protocol
- 4:39which is the cisco's eigrp
- 4:42now i have mentioned earlier that this
- 4:44is part of the distance
- 4:46vector okay now it is an advanced
- 4:49distance vector
- 4:50making it a hybrid okay so eigrp has
- 4:54characteristics of both
- 4:56distance vector and link state protocols
- 4:59it combines distance vector behavior
- 5:02with some link state characteristics and
- 5:05some proprietary features
- 5:08so eigrp routing protocols are running
- 5:11only on cisco devices
- 5:13so if you are using non-cisco devices so
- 5:16it is recommended to use
- 5:18ospf so eigrp
- 5:21is a fast converging and scalable
- 5:23routing protocol
- 5:28now let's look at the interior versus
- 5:30exterior
- 5:32routing protocols so interior
- 5:36okay or igps routing inside the
- 5:39autonomous system
- 5:41again autonomous system pertains to a
- 5:43network
- 5:44being maintained by a single
- 5:47administrator so fast convergence and
- 5:50easy configuration
- 5:52low administrator influence on routing
- 5:55decisions
- 5:56now for exterior gateway protocols or
- 5:59egps
- 6:00routing between autonomous systems slow
- 6:03convergence
- 6:04and more complex configuration and high
- 6:07administrator influence
- 6:08on routing decisions so if you want to
- 6:11learn more about
- 6:12interior and exterior routing product
- 6:14also go ahead and check the
- 6:16supplementary videos
- 6:20okay now where do we apply interior and
- 6:23exterior
- 6:24routing protocols so as what i've
- 6:26mentioned earlier
- 6:27okay interior or igps
- 6:31are the routing protocols implemented
- 6:34within the autonomous system
- 6:36so if this is an enterprise a within
- 6:38this network
- 6:40we are using interior gateway protocol
- 6:42example
- 6:43eigrp okay assuming that this is
- 6:47autonomous system two if you have
- 6:50autonomous system three again these are
- 6:52or this is maintained by a different
- 6:56single administrator and within this
- 6:58network
- 6:59autonomous system three we are running
- 7:02igp specifically ospf
- 7:06now on ispc or
- 7:09as1 okay so within the system
- 7:13they are using igp isis
- 7:17but connecting this different autonomous
- 7:20systems
- 7:21that is where we use the exterior
- 7:24gateway routing protocol or egp
- 7:26like the border gateway protocol or bgb
- 7:32okay so interior versus exterior routing
- 7:36protocols so
- 7:36flat routing protocols propagate all
- 7:39routing information
- 7:40throughout the network so this
- 7:44are to be classful routing protocols
- 7:47okay so these are the old routing
- 7:50protocols which
- 7:51follows the subnet mask
- 7:54okay this is not appropriate for large
- 7:57networks
- 7:58so example of routing protocols which
- 8:01are class full and flat
- 8:02are rip version one okay the old
- 8:05igrp which now we are using eigrp
- 8:10and rip version 2 which is classless
- 8:14okay now for hierarchical routing
- 8:18protocols
- 8:18divide large networks into smaller areas
- 8:22or subnets so these are said to be
- 8:24classless routing protocols
- 8:26and usually we are using eigrp
- 8:30okay again eigrp is a proprietary
- 8:33protocol from cisco
- 8:34if you are using non-cisco devices so
- 8:37better use ospf
- 8:39okay or isis okay
- 8:42so also for the hierarchical routing
- 8:44protocols
- 8:46so limited drought propagation between
- 8:48areas
- 8:51all right so flat versus hierarchical
- 8:55routing protocols so again we mentioned
- 8:59about
- 8:59flat routing protocol earlier so flat
- 9:02routing protocols have no means of
- 9:03limiting route propagation
- 9:05in major network that's within class a
- 9:09class b or c network environment
- 9:12these protocols are typically classful
- 9:15distance
- 9:15vector protocol so the key point
- 9:18flat routing protocols propagate all
- 9:21routing information
- 9:23throughout the network whereas
- 9:24hierarchical
- 9:26routing protocols divide large networks
- 9:29into smaller areas okay
- 9:32so two examples of flat routing
- 9:35protocols are
- 9:36again reversion 1 and rip version 2.
- 9:40take note however that rip version 2
- 9:43is already a classless protocol
- 9:46now this figure here illustrates a flat
- 9:49network
- 9:50and hierarchical network
- 9:53now for the hierarchical routing
- 9:54protocols to solve the problems
- 9:57associated with flat
- 9:58routing protocols additional features
- 10:01are implemented in hierarchical routing
- 10:03protocols to support
- 10:04large networks for example some support
- 10:08an area based design so hierarchical
- 10:12routing protocols are typically classed
- 10:14as
- 10:14link state protocols so classless
- 10:18means that routing updates include
- 10:20subnet masks
- 10:21in their routing updates therefore the
- 10:24routing protocol supports
- 10:26vlsm or the variable length subnet mask
- 10:32routing protocol convergence
- 10:36so different routing protocols need
- 10:38different amounts
- 10:39of time to converge in a given network
- 10:43so although the convergence depends on
- 10:45networks
- 10:46topology and structure pure distance of
- 10:49vector protocols are slower to converge
- 10:53than link state protocols the use of
- 10:56periodic updates
- 10:58and the hold down mechanism are the main
- 11:01reasons
- 11:03for slow convergence as a result
- 11:06the fast converging protocols should be
- 11:09used
- 11:10when the network's convergence time is
- 11:13crucial
- 11:18now as shown here in the figure
- 11:20different routing protocols
- 11:22need different amounts of time to
- 11:23converge in a given network
- 11:26so link state protocols usually converge
- 11:29much
- 11:30more quickly because they instantly
- 11:32propagate
- 11:33routing updates okay so whenever the
- 11:37change
- 11:37occurs in a link state okay that's ospf
- 11:41a link state update is flooded
- 11:44throughout the network or within the
- 11:45entire network
- 11:47so there is no need to wait for the
- 11:49whole down timer to expire
- 11:52or for the next periodic update as with
- 11:54distance
- 11:55vector protocols
- 12:00now let's talk about this hybrid eigrp
- 12:04or the enhanced interior gateway routing
- 12:06protocol from cisco
- 12:08so eigrp is a special case because
- 12:12it incorporates the distance vector
- 12:14principle of metric propagation
- 12:16it means it sends only the best routes
- 12:19to the neighbors
- 12:21however it does not have periodic
- 12:24updates
- 12:25nor does it implement the principle of
- 12:28hold downs
- 12:29so the most distinct feature of eigrp is
- 12:33that
- 12:34it stores all feasible backup routes in
- 12:37its topology
- 12:38table so when a backup route exists
- 12:41for a lost destination the switch
- 12:45over to the best backup route
- 12:49is almost immediate and involves
- 12:52no action from other routers therefore
- 12:56very fast convergence can be achieved
- 12:59with proper
- 13:00eigrp deployment okay
- 13:05eigrp characteristics so as i mentioned
- 13:08earlier
- 13:09eigrp is proprietary okay it's a cisco
- 13:12proprietary protocol for routing ipb4
- 13:16eigrp can also be configured for routing
- 13:19ipv6 okay internetwork packet exchange
- 13:23ipx and apple talk traffic
- 13:27now eigrp is an enhanced version
- 13:30of the old igrp which is pure
- 13:34distance vector protocol so eigrp
- 13:37however
- 13:38is a hybrid routing protocol
- 13:41it is a distance vector protocol with
- 13:44additional link state
- 13:46protocol features so eigrp features
- 13:49includes the following
- 13:51so it uses a triggered updates
- 13:54eigrp take note has no periodic updates
- 13:58uses a topology table to keep all routes
- 14:02received from its neighbors not only the
- 14:05best routes
- 14:07establishes adjacencies with neighboring
- 14:09routers using the hello protocols
- 14:12just like in ospf okay uses multicast
- 14:16rather than broadcast for communication
- 14:19it supports also vlsm
- 14:22supports manual route summarization
- 14:25eigrp summarizes on major network
- 14:28boundaries by default
- 14:30okay but this features can be turned off
- 14:34and summarization can be configured at
- 14:36any point in the network
- 14:39so it can be used to create
- 14:41hierarchically structured
- 14:42large networks and supports
- 14:45an equal load balancing
- 14:49okay so eigrp
- 14:52uses the diffusing update algorithm
- 14:56to determine the best path ospf uses
- 14:59dixtras algorithm
- 15:04now let's talk about the open shortest
- 15:06path
- 15:07first routing protocol or the ospf
- 15:10ospf is a standardized protocol
- 15:13for routing ipb4 okay so
- 15:16it was developed uh in the year 1988
- 15:21by the ng uh internet engineering task
- 15:23force right
- 15:24etf to replace rip in larger
- 15:28more diverse media networks
- 15:31okay so in 1998 minor changes
- 15:35in ospf version 2 addressed some of the
- 15:38ospf version 1's problem while
- 15:40maintaining backward
- 15:42compatibility so ospf
- 15:45was developed for use in large scalable
- 15:48networks
- 15:49in which rips inherent limitations
- 15:52failed to satisfy requirements
- 15:55so ospf is a superior to reap
- 15:59in all aspects including the following
- 16:02okay so you've got it converges
- 16:05much faster it supports
- 16:08vlsm manual summarization and
- 16:11hierarchical structures
- 16:13it has improved metric calculation
- 16:16for best path okay and it does not have
- 16:21a half count limitations on rip version
- 16:24one
- 16:25and two so at its inception
- 16:28ospf support or supported the largest
- 16:34networks
- 16:36ospf hierarchical design so although
- 16:39ospf
- 16:40was developed for large networks each
- 16:43implementation requires
- 16:45proper design and planning this is
- 16:47especially important for networks
- 16:49with 50 or more routers
- 16:52okay so the concept of multiple separate
- 16:55areas inside one domain or aes
- 16:57was implemented in ospf to reduce the
- 17:00amount of routing traffic
- 17:02and make networks more scalable
- 17:05so in ospf there must always be
- 17:09one backbone area which is
- 17:12area 0 to which all
- 17:15other non-backbone areas must be
- 17:18directly connected
- 17:19so you've got area one here area two
- 17:22this
- 17:23non-backbone area should be directly
- 17:25connected
- 17:26to area zero or backbone via
- 17:30the area border router or abr
- 17:34okay now a router is a member of an ospf
- 17:38area when at least one of each
- 17:40interfaces
- 17:42operates in that area so router that
- 17:45resides
- 17:46on boundaries between the backbone and
- 17:49the non-backbone area are called
- 17:51area border routers or abrs and have at
- 17:54least
- 17:55one of each interface connected to each
- 17:58area
- 17:59so the boundary between the areas is
- 18:02within the abr itself
- 18:04so if external routes are propagated
- 18:07into ospf aes
- 18:10the router does redistributes
- 18:13the routes and it is called autonomous
- 18:15system border routers or asbrs
- 18:18okay so careful design
- 18:21and correct mapping of areas to the
- 18:24network topology are important because
- 18:26manual summarization of routes can only
- 18:29be performed
- 18:30on abrs or asbrs
- 18:34again when you say asbrs these are
- 18:37routers
- 18:38connected to non-ospf networks example
- 18:42the isps
- 18:44so traffic sent from one non-backbone
- 18:48area to another always crosses the
- 18:50backbone
- 18:51for example the area one 1
- 18:55abr must forward traffic from area 1
- 18:59distant for area 2 into the backbone
- 19:04the area 2 abr receives the traffic from
- 19:07the backbone
- 19:08and forwards it to the appropriate
- 19:10destination
- 19:11inside area 2.
- 19:16ospf characteristics ospf
- 19:20is a link state protocol that has the
- 19:22following characteristics for deployment
- 19:25in the enterprise networks so first fast
- 19:28convergence
- 19:30okay so ospf achieves fast convergence
- 19:34times
- 19:34using triggered link state updates that
- 19:37include
- 19:38one or more link state advertisements or
- 19:40lsas
- 19:42so lsas describe the state of the link
- 19:45on specific routers and are propagated
- 19:49and changed within an area so therefore
- 19:53all routers in the same area have
- 19:56identical
- 19:57topology tables each router has a
- 20:00complete
- 20:01view of all the links and devices in the
- 20:04area
- 20:05so depending on their type lsas are
- 20:08usually
- 20:08changed by abrs when they cross
- 20:12into another area
- 20:15so the next one is it's a very good
- 20:18scalability okay ospf
- 20:22multiple area structure provides good
- 20:25scalability however
- 20:27ospf's strict area implementation rules
- 20:31require proper design to support
- 20:34other scalability features such as
- 20:36manual summarization
- 20:38okay on abrs and asbr's
- 20:42stop areas totally stubby areas
- 20:45and not so stubby areas or nssa
- 20:48okay next is reduced bandwidth
- 20:52usage along with the area structure
- 20:56the use of triggered not periodic
- 20:59okay so we're talking about the
- 21:00triggered updates and
- 21:02manual summarization reduces the
- 21:05bandwidth used
- 21:06by ospf by limiting the volume of link
- 21:09state
- 21:10propagation okay
- 21:13and the last one would be of course the
- 21:15vlsm support
- 21:17so because ospf is a classless routing
- 21:19protocol it supports
- 21:20vlsm to achieve better use of ip address
- 21:23space
- 21:26so to know more about ospf you can go
- 21:28ahead and check the
- 21:30supplementary video okay so that
- 21:32discusses
- 21:34the details about this routing protocol
- 21:38next would be the isis
- 21:42so isis was developed by digital
- 21:45equipment corporation or dec
- 21:47as a dynamic link state routing protocol
- 21:49for the open systems interconnection
- 21:52osi protocol suite okay
- 21:55so the osi suite uses connectionless
- 21:58network systems or service
- 22:00so we call it clns to provide
- 22:03connectionless delivery of data
- 22:05and the actual layer 3 protocol is
- 22:07connectionless network protocol or clnp
- 22:11now clnp is the osi suite solution
- 22:14for connection less delivery of data
- 22:17similar to ip and tcp ip suite
- 22:20so isis uses clns address
- 22:24to identify the routers and build the
- 22:27link state databases or lsdb
- 22:33next would be the border gateway
- 22:34protocol this is an example of egp
- 22:38okay so bgp is an egp that is primarily
- 22:42used to interconnect autonomous systems
- 22:45bgp is a successor to egp
- 22:49the exterior gateway protocol okay so
- 22:52note
- 22:52the dual use of egp acronym here
- 22:55okay so because egp is obsolete
- 23:00bgp is currently the only egp in use
- 23:04all right so the key point here for bgp
- 23:06is that
- 23:07the main goal of bgp is to provide an
- 23:11inter-domain routing system
- 23:13that guarantees a loop free exchange of
- 23:16routing information
- 23:18between autonomous systems so bgp
- 23:21routers exchange information about path
- 23:24to destination networks
- 23:28bgp network implementation so in this
- 23:32figure here
- 23:33okay bgp is used to interconnect
- 23:37multiple autonomous systems because of
- 23:40the multiple connection between
- 23:41autonomous systems
- 23:43and the need for path manipulation
- 23:46the use of static routing is excluded
- 23:51so aes 65000 is multi-homed
- 23:55to three isps okay as65500
- 24:01okay as65000
- 24:05and as64500
- 24:12internal bgp so when bgp is running
- 24:15between routers
- 24:16within 1as it is called internal
- 24:20bgp or ibgp ibgp
- 24:23is run within an aes to exchange bgp
- 24:27information
- 24:28so that all internal bgp speakers have
- 24:31the same bgp routing information
- 24:33about outside autonomous systems and so
- 24:37that information can be passed to other
- 24:40autonomous systems
- 24:42as long as they can reach each other
- 24:45routers that run
- 24:46ibgp do not have to be directly
- 24:48connected to each other
- 24:51static routes or routes learned from an
- 24:54igp
- 24:54running within the aes provides rich
- 24:57ability
- 24:59when bgp runs between routers in
- 25:01different autonomous systems
- 25:03it is called external bgp or ebgp
- 25:08routers that run ebgp are usually
- 25:11connected directly to each other
- 25:17recommend that enterprise routing
- 25:19protocol comparison
- 25:21okay so basically this would yield to
- 25:25two of the most popular
- 25:28interior gateway routing protocol eig rp
- 25:32and ospf
- 25:34so they are both fast convergence
- 25:38they are very good uh scalability okay
- 25:43this two both uses vlsm
- 25:47okay multiple network layer protocol
- 25:50support
- 25:51well eigrp yes okay ospf
- 25:55no mix vendor devices
- 26:00pro spf yes you can use
- 26:03ospf routing protocol on
- 26:06any brand of routers
- 26:09unlike eigrp which is supported only on
- 26:12cisco
- 26:12equipments this is proprietary here
- 26:18now to summarize reviewing the
- 26:20enterprise routing protocols
- 26:23so protocols with hierarchical and link
- 26:25state attributes supports the fastest
- 26:27network convergence
- 26:29eigrp and ospf are the recommended igps
- 26:33for the enterprise
- 26:34eigrp is a cisco proprietary for routing
- 26:37ipv4
- 26:38ipv6 ipx and apple talk traffic
- 26:42ospf is a standardized protocol for
- 26:45routing ipv4
- 26:47developed to replace rip in a larger
- 26:49scale
- 26:50more diverse media networks it can also
- 26:53support ipv6
- 26:55bgp is a representative
- 26:59egp it is primarily used to interconnect
- 27:03autonomous systems
- 27:04or to connect enterprises to an isp
About this transcript
This page contains the full transcript of Designing IP Addressing and Selecting Routing Protocols Part 2 by Santelmo, generated from the public captions YouTube serves with the video. The transcript has 2,868 words across 612 segments, with the original timestamps preserved so you can click any line to jump to that moment in the embedded player.
What you can do with it
Use the transcript to take notes, quote the speaker, build a study guide, generate a summary with ChatGPT or Claude via the YouTube Summary tool, or export it as a timed subtitle file with YouTube to SRT. You can also re-open it in the transcriber to translate the transcript into 100+ languages.
Free YouTube transcript tool
YouTube2Text is a free YouTube transcript generator — no signup, no daily limit. Paste any YouTube link and get the full transcript instantly, with timestamps, click-to-jump, translation to 100+ languages, AI prompts for ChatGPT, Claude, and Gemini, and exports to TXT, SRT, VTT, or Markdown.