Objectives After completing this chapter you will be able to: Understand how routers operate Describe Distance Vector and Link State Algorithms Describe.

Slides:



Advertisements
Similar presentations
RIP V1 W.lilakiatsakun.
Advertisements

© 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.
CSCE 515: Computer Network Programming Chin-Tser Huang University of South Carolina.
RIP – Routing Information Protocol Syeda Momina Tabish MIT - 7.
CCNA 2 v3.1 Module 6.
Routing Fundamentals and Subnetting
CSCE 515: Computer Network Programming Chin-Tser Huang University of South Carolina.
Extending Networks. Three Levels of Extension Physical Layer –Repeaters Link Layer –Bridges –Switches Network –Routers: “Connecting networks”
1 CCNA 1 v3.1 Module 10 Review. 2 What is the address that is changed when a frame is received at a router interface? MAC address.
ROUTING PROTOCOL IGRP. REVIEW 4 Purpose of Router –determine best path to destination –pass the frames to the destination 4 Protocols –routed - used by.
Institute of Technology Sligo - Dept of Computing Chapter 11 Layer 3 Protocols Paul Flynn.
Lecture Week 3 Introduction to Dynamic Routing Protocol Routing Protocols and Concepts.
Objectives After completing this chapter you will be able to: Describe hierarchical routing in OSPF Describe the 3 protocols in OSPF, the Hello, Exchange.
Each computer and router interface maintains an ARP table for Layer 2 communication The ARP table is only effective for the broadcast domain (or LAN)
S305 – Network Infrastructure Chapter 5 Network and Transport Layers.
Chapter 8 Routing. Introduction Look at: –Routing Basics (8.1) –Address Resolution (8.2) –Routing Protocols (8.3) –Administrative Classification (8.4)
IP (Internet Protocol) –the network level protocol in the Internet. –Philosophy – minimum functionality in IP, smartness at the end system. –What does.
S305 – Network Infrastructure Chapter 5 Network and Transport Layers.
Introduction to Routing and Routing Protocols By Ashar Anwar.
© 2007 Cisco Systems, Inc. All rights reserved.Cisco Public 1 Version 4.0 OSI Network Layer Network Fundamentals – Chapter 5.
CN2668 Routers and Switches Kemtis Kunanuraksapong MSIS with Distinction MCTS, MCDST, MCP, A+
Sybex CCENT Chapter 8: IP Routing Instructor & Todd Lammle.
Routing and Routing Protocols Routing Protocols Overview.
1 Chapter Overview Routing Principles Building Routing Tables.
Dynamic Routing Chapter 9. powered by DJ 1. C HAPTER O BJECTIVES At the end of this Chapter you will be able to:  Explain Dynamic Routing  Identify.
Introduction to Dynamic Routing Protocol
Code : STM#520-1 Samsung Electronics Co., Ltd. OfficeServ7400 Router Operation Distribution EnglishED01.
Review Routing fundamental W.lilakiatsakun. Review Routing Fundamental VLSM VLSM Route Summarization Route Summarization Static & Dynamic Routing Static.
CISCO NETWORKING ACADEMY PROGRAM (CNAP) Routing Fundamentals & Subnets
Copyright 2003 CCNA 1 Chapter 8 Routing Fundamentals and Subnets By Joe Parisien.
Cisco – Chapter 11 Routers All You Ever Wanted To Know But Were Afraid to Ask.
Cisco – S1C10 Routers All You Ever Wanted To Know But Were Afraid to Ask.
1 Chapter Overview Routing Principles Building Routing Tables.
The Saigon CTT Semester 1 CHAPTER 11 Le Chi Trung.
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:
1 Computer Networking Dr. Mohammad Alhihi Communication and Electronic Engineering Department Philadelphia University Faculty of Engineering.
10/13/2015© 2008 Raymond P. Jefferis IIILect 07 1 Internet Protocol.
Interior Gateway Protocol. Introduction An IGP (Interior Gateway Protocol) is a protocol for exchanging routing information between gateways (hosts with.
© Wiley Inc All Rights Reserved. CCNA: Cisco Certified Network Associate Study Guide CHAPTER 5: IP Routing.
TCOM 515 IP Routing. Syllabus Objectives IP header IP addresses, classes and subnetting Routing tables Routing decisions Directly connected routes Static.
S305 – Network Infrastructure Chapter 5 Network and Transport Layers.
1 Network Layer Lecture 13 Imran Ahmed University of Management & Technology.
© 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.
1 © 2003, Cisco Systems, Inc. All rights reserved. CCNA 3 v3.0 Module 2 Single-Area OSPF.
Sem1 - Module 10 Routing Fundamentals and Subnets Review.
SW REVERSE JEOPARDY Chapter 1 CCNA2 SW Start-up Routing table Routing table Router parts Router parts Choosing a path Choosing a path Addressing Pot.
Network Layer4-1 Datagram networks r no call setup at network layer r routers: no state about end-to-end connections m no network-level concept of “connection”
7400 Samsung Confidential & Proprietary Information Copyright 2006, All Rights Reserved. -0/35- OfficeServ 7x00 Enterprise IP Solutions Quick Install Guide.
© 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.
Networking and internetworking devices. Repeater.
ICS 156: Networking Lab Magda El Zarki Professor, ICS UC, Irvine.
Routing Fundamentals and Subnets Introduction to IT and Communications Technology CE
Routing protocols. Static Routing Routes to destinations are set up manually Route may be up or down but static routes will remain in the routing tables.
Stainov - DataComMET CS TC5353 THE NETWORK LAYER 5.2 ROUTING ALGORITHMS - adaptive Distance Vector Routing (Bellman-Ford, Ford-Fulkenson). It was used.
1 © 2003, Cisco Systems, Inc. All rights reserved. CCNA 3 v3.0 Module 3 EIGRP.
Routing protocols. 1.Introduction A routing protocol is the communication used between routers. A routing protocol allows routers to share information.
Routing and Routing Protocols PJC CCNA Semester 2 Ver. 3.0 by William Kelly.
Routing Algorithms and IP Addressing Routing Algorithms must be ▪ Correctness ▪ Simplicity ▪ Robustness ▪ Stability ▪ Fairness ▪ Optimality.
Routing Protocols Brandon Wagner.
Sem1 - Module 10 Routing Fundamentals and Subnets
Objectives After completing this chapter you will be able to: Describe the Routing Information Protocol (RIP version 1 and RIP version 2) Describe Routing.
1 Chapter 14-16a Internet Routing Review. Chapter 14-16: Internet Routing Review 2 Introduction Motivation: Router performance is critical to overall.
Static Routing Technique. What is Routing   the act of moving information across an internetwork from a source to a destination   Bridge   the mid-1980s.
S305 – Network Infrastructure Chapter 5 Network and Transport Layers.
Prof. Alfred J Bird, Ph.D., NBCT Office – Science 3rd floor – S Office Hours – Monday and Thursday.
© 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.
Prof. Alfred J Bird, Ph.D., NBCT Office – McCormick 3rd floor 607 Office Hours – Monday 3:00 to 4:00 and.
Chapter 5 Network and Transport Layers
CHAPTER 10.
Presentation transcript:

Objectives After completing this chapter you will be able to: Understand how routers operate Describe Distance Vector and Link State Algorithms Describe hierarchies in IP routing Outline the advantages and disadvantages of routing

Path Taken by an IP Packet in an Internetwork A B C Destination Host (Protocol Address) Router 1 (Physical address) Destination Host (Protocol Address) Router 2 (Physical address) Destination Host (Protocol Address) Destination Host (Physical address)

IP Version 4 Message Header Source Address Version Type of Service Total LengthIHL IdentificationFragment Offset ProtocolTime to LiveHeader Checksum Destination address Padding Options (variable) IP header is normally 20 bytes long Flags DATA (variable)

Default Gateway IP Address Subnet Mask Default Gateway IP Address Subnet Mask Default Gateway IP Address Subnet Mask Default Gateway

Proxy ARP IP Address Subnet Mask Default Gateway IP Address Subnet Mask Default Gateway IP Address Subnet Mask Default Gateway

Routing Tables

Routing Algorithms Distance Vector Algorithms - calculate the best path to each destination separately, usually trying to find a path that minimises a simple metric, such as the number of hop counts to the destination. Example is Routing Information Protocol (RIP). Link State Algorithms - Instead of advertising a list of distances to each known destination, a router running link-state algorithm advertises the states of its local network links. Example is Open Shortest Path First (OSPF).

Commonly used Metrics in IP Routing Path Length / Hop Count Reliability Delay Bandwidth Load Communications Cost

Distance Vector Algorithm A B DE C

IP Routing Protocol Hierarchies Area 1 Router 4 Router 1 Router 5 H2 Router 8 Router 7 Router 11 Router 13 H1 Area 2 Area 3 Router 12 Area 0 (Backbone) Router 2 Router 3 Router 6 Router 9 Router 10

Neighbour Acquisition, Neighbour Reachability and Network Reachability Neighbour Acquisition Neighbour Reachability Network Reachability Acquisition Request / Hello Acquisition Reply / Hello Hello Polling List

Advantages of Routers Flexible - can differentiate between paths using metrics. Can load share over redundant paths. Network Devices understand routers - they understand congestion messages. Easier to administer and control because each segment has a different address. Provide a protective firewall.

Disadvantages of Routers Because routers are protocol-dependent devices, they require software for each protocol that they run. Routers make movement of network devices between network segments more difficult. Some low level protocols, for example, DEC LAT and NetBIOS cannot be routed because they do not contain a network layer address.