Introduction to Networks

Slides:



Advertisements
Similar presentations
Ver 1,12/09/2012Kode :CIJ 340,Jaringan Komputer Lanjut FASILKOM Routing Protocols and Concepts – Chapter 3 Introduction to Dynamic Routing Protocol CCNA.
Advertisements

Chapter 22 Network Layer: Delivery, Forwarding, and Routing.
Introduction to Dynamic Routing Protocols
CISCO NETWORKING ACADEMY Chabot College ELEC Routed and Routing Protocols.
© 2007 Cisco Systems, Inc. All rights reserved.Cisco Public 1 Version 4.0 Introduction to Dynamic Routing Protocol Routing Protocols and Concepts – Chapter.
© 2007 Cisco Systems, Inc. All rights reserved.Cisco Public 1 Version 4.1 Routing Working at a Small-to-Medium Business or ISP – Chapter 6.
Lecture Week 3 Introduction to Dynamic Routing Protocol Routing Protocols and Concepts.
Fundamentals of Networking Discovery 2, Chapter 6 Routing.
Chapter 7: Routing Dynamically
© 2008 Cisco Systems, Inc. All rights reserved.Cisco ConfidentialPresentation_ID 1 Chapter 3: Routing Dynamically Routing Protocols Assist. Prof. Pongpisit.
6: Routing Working at a Small to Medium Business.
Dynamic Routing Protocols  Function(s) of Dynamic Routing Protocols: – Dynamically share information between routers (Discover remote networks). – Automatically.
Routing/Routed Protocols. Remember: A Routed Protocol – defines logical addressing. Most notable example on the test – IP A Routing Protocol – fills the.
Sybex CCENT Chapter 8: IP Routing Instructor & Todd Lammle.
Routing and Routing Protocols Routing Protocols Overview.
© 2007 Cisco Systems, Inc. All rights reserved.Cisco Public ITE PC v4.0 Chapter 1 1 Introduction to Dynamic Routing Protocol Routing Protocols and Concepts.
Introduction to Dynamic Routing Protocol
Review Routing fundamental W.lilakiatsakun. Review Routing Fundamental VLSM VLSM Route Summarization Route Summarization Static & Dynamic Routing Static.
1. 2 Anatomy of an IP Packet IP packets consist of the data from upper layers plus an IP header. The IP header consists of the following:
CCNA 1 Module 10 Routing Fundamentals and Subnets.
Routing Fundamental W.lilakiatsakun. Review Routing Fundamental VLSM Static & Dynamic Routing Routing algorithm concept.
1 Internet Routing. 2 Terminology Forwarding –Refers to datagram transfer –Performed by host or router –Uses routing table Routing –Refers to propagation.
© 2007 Cisco Systems, Inc. All rights reserved.Cisco Public ITE PC v4.0 Chapter 1 1 Routing Protocols and Concepts Introduction to Dynamic Routing Protocol.
Switching and Routing Technique W.lilakiatsakun. Assessment Final 40 % Final 40 % Midterm 30% Midterm 30% LAB + Assignment 30% LAB + Assignment 30%
CCNA 2 Week 6 Routing Protocols. Copyright © 2005 University of Bolton Topics Static Routing Dynamic Routing Routing Protocols Overview.
© 2007 Cisco Systems, Inc. All rights reserved.Cisco Public ITE PC v4.0 Chapter 1 1 Introduction to Dynamic Routing Protocol Routing Protocols and Concepts.
6: Routing Working at a Small to Medium Business.
Routing and Routing Protocols
Routing Networks and Protocols Prepared by: TGK First Prepared on: Last Modified on: Quality checked by: Copyright 2009 Asia Pacific Institute of Information.
1 Version 3.1 Module 6 Routed & Routing Protocols.
1 7-Jan-16 S Ward Abingdon and Witney College Dynamic Routing CCNA Exploration Semester 2 Chapter 3.
© 2007 Cisco Systems, Inc. All rights reserved.Cisco Public 1 Version 4.0 Link-State Routing Protocols Routing Protocols and Concepts – Chapter 10.
© 2007 Cisco Systems, Inc. All rights reserved.Cisco Public 1 Version 4.1 Routing Working at a Small-to-Medium Business or ISP – Chapter 6.
Routing and Routing Protocols CCNA 2 v3 – Module 6.
+ Dynamic Routing Protocols 2 nd semester
Kapitel 19: Routing. Kapitel 21: Routing Protocols
Lec4: Introduction to Dynamic Routing Protocol
Introduction to Dynamic Routing Protocol
Working at a Small-to-Medium Business or ISP – Chapter 6
Computer Networks Routing Algorithms.
Introduction to Dynamic Routing Protocol
Link State Routing protocol
(How the routers’ tables are filled in)
OSPF (Open Shortest Path First)
Prof. Ashraf Abdelaziz Taha
Routing Protocols and Concepts
Routing/Routed Protocols
Link-State Routing Protocols
Dynamic Routing Protocols part2
Dynamic Routing: Dynamic routing is where we use a routing protocol; routing protocols are cool because they take care of our work. Routing protocols will.
Introduction to Networking
Introduction To Networking
Distance-Vector Routing Protocols
IS3120 Network Communications Infrastructure
Introduction to Dynamic Routing Protocol
Chapter 5: Dynamic Routing
Chapter 7: Routing Dynamically
Introduction to Dynamic Routing Protocol
Dynamic Routing Protocols
Link-State Routing Protocols
After 3.2 Revised
Chapter 7: Routing Dynamically
Routing Protocols Charles Warren.
CIT 384: Network Administration
Dynamic Routing Protocols
Link-State Routing Protocols
Working at a Small-to-Medium Business or ISP – Chapter 6
Dynamic Routing: Dynamic routing is where we use a routing protocol; routing protocols are cool because they take care of our work. Routing protocols will.
Distance Vector Routing
Computer Networks Protocols
Presentation transcript:

Introduction to Networks Routing Protocols Comparisons

Routing Scope Routing protocols are the methods through which a router will learn about and share connected routes to map out their networks There are many different routing protocols, each with their own strengths so we need a way to compare the protocols to decide which ones to use The first classification we’ll look at is routing scope A routing scope is how much information is shared and remembered by the routers

IGP vs EGP An IGP is an Internal Gateway Protocol. This is the protocol used inside autonomous systems An autonomous system is a private network connected to the internet. These networks are fairly independent, only sharing a link to the internet Each autonomous system is assigned a unique ASN, autonomous system number, used to identify that system The routing protocol defines how far and what information is shared IGP will share information within the autonomous system about the internal network, but won’t share any information outside of it An EGP is an External Gateway Protocol. This is the protocol used to share information between autonomous systems over the internet Network admins typically deal with IGP, except if they work for exceptionally large networks

Metrics - Hop Count Another way to classify routing protocols is by comparing metrics A metric is a value set to a route between networks that determine which route to take when there are multiple ways to send data The route with the lowest value indicates the best route The first metric a protocol could use is hop count Hop Count simply measures how many routers we would need to pass through to get to our destination through a certain path The path chosen will always be the route that takes us through the fewest routers to get to the network

Metrics - Bandwidth A more advanced metric we could use is bandwidth or latency (delay) This attempts to measure how quickly a message would move through a route Each connection between routers will be given a value based on the rated bandwidth of the connection. The slower the connection, the higher the value With a protocol using this metric data may choose to move through several faster routers than a few slow ones

Metrics - Relative Value Relative value is a modified version of hop count Every router starts at a default value, and the protocol will choose the path with the lowest value If there is no change, then this works exactly like hop count, however a network admin can assign each router a value to customize how likely the router will be used as part of a path These values are often called link values, and can be based on any reasoning a network admin may have

Distance Vector Another property we can use to compare routing protocols is the method used to share routing information The first method is the distance vector method The distance vector method is when routing tables are propagated by routers sharing with their neighbors Each router knows about its directly connected networks. Periodically each router will send its routing table to its neighbors. Any new networks get added to the routing table of the router, so that when the new router sends its routing table it is included When the routing tables of every router know of every sub-net, then we say this network has achieved convergence

Link State Another way to propagate information about routing tables is called the link state method With the link state method, routers only send out the information about the networks that they are directly connected to using a special message called a link state advertisement (LSA) and link state packets (LSP) Once a router takes in this information and updates its routing table, it forwards the information to the next router Once convergence is achieved, routers will only send out LSAs if something with their local network changes This process of sending out advertisements is called flooding because a single message is flooded through the network This method achieves convergence faster and uses less network traffic, but the distance vector method requires less router processing and is simpler

VLSM The final method we have of classifying routing protocols is their support for variable length subnet masks (VLSM) Early routing protocols relied on networks using the default subnet mask, which created problems between confusing subnets Newer protocols send the network ID with a subnet mask to accurately identify the network Almost all protocols used today supports VLSM. These are called classless protocols, whereas the earlier protocols that relied on an address’s class to know its subnet mask were called classful protocols