WK 7 routing, Dijkstras and BellFord Algorithm

WK 7 routing, Dijkstras and BellFord Algorithm - Click to...

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

View Full Document Right Arrow Icon

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

View Full DocumentRight Arrow Icon

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

View Full DocumentRight Arrow Icon

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

View Full DocumentRight Arrow Icon

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

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

Unformatted text preview: Click to edit Master subtitle style Communication Networks Kang Xi, 11 Routing Communication Networks Kang Xi, Polytechnic Institute of NYU Packet Forwarding in IP Networks Communication Networks Kang Xi, Polytechnic Institute of NYU 22 47.1 47. 2 47.3 IP 47.1.1.1 D e s t O u t 4 7 .1 1 4 7 .2 2 4 7 .3 3 D e s t O u t 4 7 . 1 1 4 7 . 2 2 4 7 . 3 3 IP 47.1.1. 1 IP 47.1.1. 1 IP 47.1.1. 1 D e s t O u t 4 7 . 1 1 4 7 . 2 2 4 7 . 3 3 Communication Networks Kang Xi, Polytechnic Institute of NYU Communication Networks Kang Xi, Polytechnic Institute of NYU 33 What does Routing DO ? n Given: a network a (source, destination) pair n Find: A path from the source to the destination Sounds simple, what else? Communication Networks Kang Xi, Polytechnic Institute of NYU Communication Networks Kang Xi, Polytechnic Institute of NYU 44 Simple Topology, Simple Routing n Star n Tree n Ring n Why they are simple? S D Communication Networks Kang Xi, Polytechnic Institute of NYU Communication Networks Kang Xi, Polytechnic Institute of NYU 55 Real Topologies n With irregular topologies, routing is not so obvious 7 5 4 6 2 1 3 9 8 10 11 12 13 14 2 1 14 15 13 4 8 10 11 12 19 16 3 5 18 9 17 6 7 NSFNet EON Communication Networks Kang Xi, Polytechnic Institute of NYU Communication Networks Kang Xi, Polytechnic Institute of NYU 66 Basic Idea n Each packet carries the destination label n Each node forwards packets according to their destination addresses n Nodes perform local delivery Know whats next May NOT know the path thereafter n Routing Construct a Forwarding table for each node destination & whats the next hop Communication Networks Kang Xi, Polytechnic Institute...
View Full Document

This note was uploaded on 04/06/2011 for the course EE 5363 taught by Professor Kang during the Spring '09 term at NYU Poly.

Page1 / 25

WK 7 routing, Dijkstras and BellFord Algorithm - Click to...

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

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