chapter_19_routing

chapter_19_routing - 1 ROUTING ON THE INTERNET Feb 14, 2012...

Info iconThis preview shows pages 1–10. Sign up to view the full content.

View Full Document Right Arrow Icon
ROUTING ON THE INTERNET CSE 6590 1 Feb 14, 2012
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Performance Criteria used for selection of route simplest is “minimum hop” can be generalized as “least cost” 2
Background image of page 2
Example Packet Switched Network 3
Background image of page 3

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Autonomous Systems (AS) is a group of routers and networks managed by single organization which exchange information via a common routing protocol form a connected network at least one path between any pair of nodes except in times of failure 4
Background image of page 4
Interior and Exterior Router Protocols interior router protocol (IRP) passes routing information between routers within AS can be tailored to specific applications needs detailed model of network to function may have more than one AS in internet routers need info on networks outside own AS use an exterior router protocol (ERP) for this supports summary information on AS reachability 5
Background image of page 5

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Application of IRP and ERP 6 R1, R5: gateways
Background image of page 6
Interior Routing Approaches Distance vector Bellman-Ford Routing Information Protocol ( RIP) Interior Gateway Routing Protocol (IGRP, Cisco proprietary) Link state OSPF (Open Shortest Path First) OLSR protocol for MANETs 7
Background image of page 7

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Distance Vector Routing each node (router or host) exchange information with neighboring nodes first generation routing algorithm for ARPANET eg. used by Routing Information Protocol (RIP) Bellman-Ford algorihtm requires transmission of lots of info by routers distance vector and estimated path costs changes take long time to propagate 8
Background image of page 8
Link State Routing designed to overcome drawbacks of distance-vector each router determines link cost on each interface
Background image of page 9

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Image of page 10
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 02/14/2012 for the course CSE 6590 taught by Professor Kotakoski during the Winter '12 term at York University.

Page1 / 26

chapter_19_routing - 1 ROUTING ON THE INTERNET Feb 14, 2012...

This preview shows document pages 1 - 10. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online