Initialization: Loop until all nodes in N

Size: px
Start display at page:

Download "Initialization: Loop until all nodes in N"

Transcription

1 Routing Routing lgorithm classification Routing protocol Goal: determine good path (sequence of routers) thru netork from source to dest. Graph abstraction for routing s: graph nodes are routers graph edges are physical links link cost: delay, $ cost, or congestion level good path: F typically means minimum cost path other def s possible Global or decentralized information? Global: all routers have complete topology, link cost info link state s ecentralized: router knos physicallyconnected neighbors, link costs to neighbors iterative process of computation, exchange of info ith neighbors distance vector s Static or dynamic? Static: routes change sloly over time ynamic: routes change more quickly periodic update in response to link cost changes : Netork Layer a-9 : Netork Layer a-0 Link-State Routing lgorithm ijkstra s net topology, link costs knon to all nodes accomplished via link state broadcast all nodes have same info computes least cost paths from one node ( source ) to all other nodes gives routing table for that node iterative: after k iterations, kno least cost path to k dest. s Notation: c(i,j): link cost from node i to j. cost infinite if not direct neighbors (v): current value of cost of path from source to dest. V p(v): predecessor node along path from source to v, that is next v N: set of nodes hose least cost path definitively knon : Netork Layer a- ijsktra s lgorithm Initialization: N = {} for all nodes v if v adjacent to then (v) = c(,v) ; p(v) = else (v) = Loop 9 find not in N such that () is a minimum 0 add to N update (v) for all v adjacent to and not in N: If ( (v) > () + c(,v) ) { (v) = () + c(,v)) p(v) = } /* ne cost to v is either old cost to v or knon shortest path cost to plus cost from to v */ until all nodes in N : Netork Layer a-

2 Step 0 ijkstra s : example start N F (),p(),,, (),p(),,,, (),p(), F (),p(), (F),p(F),,, : Netork Layer a- ijsktra s lgorithm Revisited Initialization: N = {} for all nodes v if v adjacent to then (v) = c(,v) ; n(v) = v else (v) = Loop 9 find not in N such that () is a minimum 0 add to N update (v) for all v adjacent to and not in N: If ( (v) > () + c(,v) ) { (v) = () + c(,v)) n(v) = n() } /* ne cost to v is either old cost to v or knon shortest path cost to plus cost from to v */ until all nodes in N : Netork Layer a- ijkstra s, discussion istance Vector Routing lgorithm lgorithm complexity: n nodes Naïve: each iteration: need to check all nodes,, not in N n*(n+)/ comparisons: O(n**) more efficient implementations possible: O(nlogn) (hat data structure?) : Netork Layer a- iterative: continues until no nodes exchange info. self-terminating: no signal to stop asynchronous: nodes need not exchange info/iterate in lock step! distributed: each node communicates only ith directly-attached neighbors istance Table data structure each node has its on ro for each possible column for each directlyattached neighbor to node example: in node, for dest. via neighbor : (,) = = distance from to, via as next hop c(,) + min { (,)} : Netork Layer a-

3 istance Table: example istance table gives routing table (,) (,) (,) = c(,) + min { (,)} = + = = c(,) + min { (,)} = + = loop! = c(,) + min { (,)} = + = () cost to via 9 () cost to via 9 istance table Outgoing link to use, cost,,,, Routing table : Netork Layer a- : Netork Layer a- istance Vector Routing: overvie istance Vector lgorithm: Iterative, asynchronous: each local iteration caused by: local link cost change message from neighbor: its least cost path change from neighbor istributed: each node notifies neighbors only hen its least cost path to any changes neighbors then notify their neighbors if necessary ach node: ait for (change in local link cost or msg from neighbor) recompute distance table if least cost path to any dest has changed, notify neighbors : Netork Layer a-9 t all nodes, : Initialization: for all adjacent nodes v: (*,v) = /* the * operator means "for all ros" */ (v,v) = c(,v) for all s, y send min (y,) to each neighbor /* over all 's neighbors */ : Netork Layer a-0

4 istance Vector lgorithm (cont.): loop 9 ait (until I see a link cost change to neighbor V 0 or until I receive update from neighbor V) if (c(,v) changes by d) /* change cost to all dest's via neighbor v by d */ /* note: d could be positive or negative */ for all s y: (y,v) = (y,v) + d else if (update received from V rt ) /* shortest path from V to some has changed */ 9 /* V has sent a ne value for its min V(,) */ 0 /* call this received ne value is "neval" */ for the single y: (,V) = c(,v) + neval if e have a ne min (,)for any send ne value of min (,) to all neighbors forever : Netork Layer a- istance Vector lgorithm: example : Netork Layer a- istance Vector lgorithm: example istance Vector: link cost changes (,) = c(,) + min { (,)} = + = (,) = c(,) + min { (,)} = + = Link cost changes: node detects local link cost change updates distance table (line ) if cost change in least cost path, notify neighbors (lines,) good nes travels fast 0 terminates : Netork Layer a- : Netork Layer a-

5 istance Vector: link cost changes istance Vector: poisoned reverse Link cost changes: good nes travels fast bad nes travels slo - count to problem! 0 0 If routes through to get to : tells its ( s) distance to is infinite (so on t route to via ) ill this completely solve count to problem? 0 0 continues on! terminates : Netork Layer a- : Netork Layer a- omparison of LS and V s Message complexity LS: ith n nodes, links, O(n) msgs sent each V: exchange beteen neighbors only convergence time varies Speed of onvergence LS: O(n**) requires O(n) msgs may have oscillations V: convergence time varies may be routing loops count-to- problem Robustness: hat happens if router malfunctions? LS: node can advertise incorrect link cost each node computes only its on table V: V node can advertise incorrect path cost each node s table used by others error propagate thru netork : Netork Layer a-

Routing. 9: Intro to Routing Algorithms. Routing. Roadmap. Routing Algorithm classification: Static or Dynamic?

Routing. 9: Intro to Routing Algorithms. Routing. Roadmap. Routing Algorithm classification: Static or Dynamic? Routing 9: Intro to Routing lgorithms Last Modified: // :: PM : Netork Layer a- IP Routing each router is supposed to send each IP datagram one step closer to its Ho do they do that? Static Routing Hierarchical

More information

Network service model. Network service model. Network Layer (part 1) Virtual circuits. By the end of this lecture, you should be able to.

Network service model. Network service model. Network Layer (part 1) Virtual circuits. By the end of this lecture, you should be able to. Netork Layer (part ) y the end of this lecture, you should be able to. xplain the operation of distance vector routing algorithm xplain shortest path routing algorithm escribe the major points of RIP and

More information

EE 122: Intra-domain routing

EE 122: Intra-domain routing EE : Intra-domain routing Ion Stoica September 0, 00 (* this presentation is based on the on-line slides of J. Kurose & K. Rose) Internet Routing Internet organized as a two level hierarchy First level

More information

Announcement. Project 2 extended to 2/20 midnight Project 3 available this weekend Homework 3 available today, will put it online

Announcement. Project 2 extended to 2/20 midnight Project 3 available this weekend Homework 3 available today, will put it online Announcement Project 2 extended to 2/20 midnight Project 3 available this weekend Homework 3 available today, will put it online Outline Introduction and Network Service Models Routing Principles Link

More information

Chapter 4: Network Layer

Chapter 4: Network Layer Chapter 4: Network Layer Chapter goals: understand principles behind layer services: routing (path selection) dealing with scale how a router works advanced topics: IPv6, mobility instantiation and implementation

More information

What is Routing? EE 122: Shortest Path Routing. Example. Internet Routing. Ion Stoica TAs: Junda Liu, DK Moon, David Zats

What is Routing? EE 122: Shortest Path Routing. Example. Internet Routing. Ion Stoica TAs: Junda Liu, DK Moon, David Zats What is Routing? Routing implements the core function of a network: : Shortest Path Routing Ion Stoica Ts: Junda Liu, K Moon, avid Zats http://inst.eecs.berkeley.edu/~ee/fa9 (Materials with thanks to Vern

More information

Chapter 4: Network Layer

Chapter 4: Network Layer hapter 4: Network Layer hapter goals: understand principles behind layer services: routing (path selection) dealing with scale how a router works advanced topics: IPv6, multicast instantiation and implementation

More information

Routing Algorithm Classification. A Link-State Routing Algorithm

Routing Algorithm Classification. A Link-State Routing Algorithm Routing Algorithm lassification Global or decentralied information? Global: All routers have complete topolog, link cost info Link state algorithms Decentralied: Router knows phsicallconnected neighbors,

More information

Review: Routing in Packet Networks Shortest Path Algorithms: Dijkstra s & Bellman-Ford. Routing: Issues

Review: Routing in Packet Networks Shortest Path Algorithms: Dijkstra s & Bellman-Ford. Routing: Issues Review: Routing in Packet Networks Shortest Path lgorithms: ijkstra s & ellman-ford Routing: Issues How are routing tables determined? Who determines table entries? What info used in determining table

More information

Chapter 4: Network Layer

Chapter 4: Network Layer Chapter 4: Network Laer 4. Introduction 4. Virtual circuit and datagram networks 4. What s inside a router 4.4 IP: Internet Protocol Datagram format IPv4 addressing ICMP IPv6 4. Routing algorithms Link

More information

CSC 4900 Computer Networks: Routing Algorithms

CSC 4900 Computer Networks: Routing Algorithms CSC 4900 Computer Networks: Routing Algorithms Professor Henry Carter Fall 2017 Last Time Subnets provide granularity for address assignment and ease management. What is 192.168.8.0? 192.168.32.0? 192.168.8.0:

More information

DATA COMMUNICATOIN NETWORKING

DATA COMMUNICATOIN NETWORKING DATA COMMUNICATOIN NETWORKING Instructor: Ouldooz Baghban Karimi Course Book & Slides: Computer Networking, A Top-Down Approach By: Kurose, Ross Introduction Course Overview Basics of Computer Networks

More information

Internet Technology. 08. Routing. Paul Krzyzanowski. Rutgers University. Spring CS Paul Krzyzanowski

Internet Technology. 08. Routing. Paul Krzyzanowski. Rutgers University. Spring CS Paul Krzyzanowski Internet Technolog 08. Routing Paul Kranoski Rutgers Universit Spring 06 March, 06 CS 0-06 Paul Kranoski Routing algorithm goal st hop router = source router last hop router = destination router router

More information

COMP 3331/9331: Computer Networks and Applications

COMP 3331/9331: Computer Networks and Applications OMP /9: omputer Networks and pplications Week 9 Network Layer: Routing Reading Guide: hapter 4: Sections 4.5 Network Layer nnouncements v Labs Lab 4 ongestion ontrol Lab 5 Simple Router (start up for ssignment,

More information

Internet Protocol: Routing Algorithms. Srinidhi Varadarajan

Internet Protocol: Routing Algorithms. Srinidhi Varadarajan Internet Protocol: Routing Algorithms Srinidhi Varadarajan Routing Routing protocol Goal: determine good path (sequence of routers) thru network from source to dest. Graph abstraction for routing algorithms:

More information

Network layer. Network Layer 4-1. application transport network data link physical. network data link physical. network data link physical

Network layer. Network Layer 4-1. application transport network data link physical. network data link physical. network data link physical Network layer transport segment from sending to receiving host on sending side encapsulates segments into datagrams on receiving side, delivers segments to transport layer network layer protocols in every

More information

Chapter 4: Network Layer, partb

Chapter 4: Network Layer, partb Chapter 4: Network Layer, partb The slides are adaptations of the slides available by the main textbook authors, Kurose&Ross Network Layer 4-1 Interplay between routing, forwarding routing algorithm local

More information

Network Routing. Packet Routing, Routing Algorithms, Routers, Router Architecture

Network Routing. Packet Routing, Routing Algorithms, Routers, Router Architecture Network Routing Packet Routing, Routing Algorithms, Routers, Router Architecture Routing Routing protocol Goal: determine good path (sequence of routers) thru network from source to dest. Graph abstraction

More information

Shortest Paths Algorithms and the Internet: The Distributed Bellman Ford Lecturer: Prof. Chiara Petrioli

Shortest Paths Algorithms and the Internet: The Distributed Bellman Ford Lecturer: Prof. Chiara Petrioli Shortest Paths Algorithms and the Internet: The Distributed Bellman Ford Lecturer: Prof. Chiara Petrioli Dipartimento di Informatica Rome University La Sapienza G205: Fundamentals of Computer Engineering

More information

CS 43: Computer Networks. 23: Routing Algorithms November 14, 2018

CS 43: Computer Networks. 23: Routing Algorithms November 14, 2018 S 3: omputer Networks 3: Routing lgorithms November, 08 Last class NT: Network ddress Translators: NT is mostly bad, but in some cases, it s a necessary evil. IPv6: Simpler, faster, better Tunneling: IPv6

More information

Chapter 4 Network Layer. Network Layer 4-1

Chapter 4 Network Layer. Network Layer 4-1 Chapter 4 Network Layer Network Layer 4- Chapter 4: Network Layer 4. Introduction 4. Virtual circuit and datagram networks 4. What s inside a router 4.4 IP: Internet Protocol Datagram format IPv4 addressing

More information

Network Layer: Routing Classifications; Shortest Path Routing

Network Layer: Routing Classifications; Shortest Path Routing igitl ommuniction in the Modern World : Routing lssifictions; Shortest Pth Routing s min prolem: To get efficiently from one point to the other in dynmic environment http://.cs.huji.c.il/~com com@cs.huji.c.il

More information

Chapter 4: outline. 4.5 routing algorithms link state distance vector hierarchical routing. 4.6 routing in the Internet RIP OSPF BGP

Chapter 4: outline. 4.5 routing algorithms link state distance vector hierarchical routing. 4.6 routing in the Internet RIP OSPF BGP Chapter 4: outline 4. introduction 4. irtual circuit and datagram networks 4. what s inside a router 4.4 IP: Internet Protocol datagram format IP4 addressing ICMP IP6 4.5 routing algorithms link state

More information

CSC 401 Data and Computer Communications Networks

CSC 401 Data and Computer Communications Networks CSC 40 Data and Computer Communications Networks Network Layer NAT, Routing, Link State, Distance Vector Prof. Lina Battestilli Fall 07 Chapter 4 Outline Network Layer: Data Plane 4. Overview of Network

More information

Chapter 4: Network Layer

Chapter 4: Network Layer Chapter 4: Introdction (forarding and roting) Reie of qeeing theor Roting algorithms Link state, Distance Vector Roter design and operation IP: Internet Protocol IP4 (datagram format, addressing, ICMP,

More information

Interplay between routing, forwarding

Interplay between routing, forwarding Chapter 4: outline 4. introduction 4. virtual circuit and datagram networks 4. what s inside a router 4.4 IP: Internet Protocol datagram format IPv4 addressing ICMP IPv6 4.5 routing algorithms link state

More information

IP Forwarding Computer Networking. Routes from Node A. Graph Model. Lecture 10: Intra-Domain Routing

IP Forwarding Computer Networking. Routes from Node A. Graph Model. Lecture 10: Intra-Domain Routing IP orwarding - omputer Networking Lecture : Intra-omain Routing RIP (Routing Information Protocol) & OSP (Open Shortest Path irst) The Story So ar IP addresses are structure to reflect Internet structure

More information

CSCE 463/612 Networks and Distributed Processing Spring 2018

CSCE 463/612 Networks and Distributed Processing Spring 2018 CSCE 463/612 Networks and Distributed Processing Spring 2018 Network Layer IV Dmitri Loguinov Texas A&M University April 12, 2018 Original slides copyright 1996-2004 J.F Kurose and K.W. Ross 1 Chapter

More information

ECE 158A: Lecture 5. Fall 2015

ECE 158A: Lecture 5. Fall 2015 8: Lecture Fall 0 Routing ()! Location-ased ddressing Recall from Lecture that routers maintain routing tables to forward packets based on their IP addresses To allow scalability, IP addresses are assigned

More information

What s a protocol? CE80N Introduction to Networks & The Internet. Communication Protocol. Protocol Layers. Dr. Chane L. Fullmer UCSC Winter 2002

What s a protocol? CE80N Introduction to Networks & The Internet. Communication Protocol. Protocol Layers. Dr. Chane L. Fullmer UCSC Winter 2002 E80N Introduction to Networks & The Internet Reading hapter 15 IP: Software To reate A Virtual Network Dr. hane L. Fullmer US Winter 2002 January 22 2002 E80N -- Lecture #6 1 January 22 2002 E80N -- Lecture

More information

More on Network Routing and Internet Protocol

More on Network Routing and Internet Protocol omputer Networks //03 More on Network Routing and Internet Protocol Kai Shen Network Routing Link state routing: ijkstra s algorithm efficient approach to calculate least cost routes all routers need complete

More information

COMP/ELEC 429/556 Introduction to Computer Networks

COMP/ELEC 429/556 Introduction to Computer Networks OMP/ELE 49/6 Introduction to omputer Networks Intra-domain routing Some slides used with permissions from Edward W. Knightly, T. S. Eugene Ng, Ion Stoica, Hui Zhang T. S. Eugene Ng eugeneng at cs.rice.edu

More information

Lecture 5 The Network Layer part II. Antonio Cianfrani DIET Department Networking Group netlab.uniroma1.it

Lecture 5 The Network Layer part II. Antonio Cianfrani DIET Department Networking Group netlab.uniroma1.it Lecture 5 The Network Layer part II Antonio Cianfrani DIET Department Networking Group netlab.uniroma1.it IP datagram format IP protocol version number header length (bytes) type of data max number remaining

More information

Announcements. CS 5565 Network Architecture and Protocols. Project 2B. Project 2B. Project 2B: Under the hood. Routing Algorithms

Announcements. CS 5565 Network Architecture and Protocols. Project 2B. Project 2B. Project 2B: Under the hood. Routing Algorithms Announcements CS 6 Network Architecture and Protocols Lecture 8 Godmar Back Project A due Apr 8 (toda) Project B due in parts: Apr 9 and Ma 6 See link to NY Times article on RFC Project B Project B Highlevel

More information

Distance-Vector Routing: Distributed B-F (cont.)

Distance-Vector Routing: Distributed B-F (cont.) istance-vector Routing: istributed - (cont.) xample [ istributed ellman-ord lgorithm ] ssume each node i maintains an entry (R(i,x), L(i,x)), where R(i,x) is the next node along the current shortest path

More information

CS 3516: Advanced Computer Networks

CS 3516: Advanced Computer Networks Welcome to CS 56: Adanced Computer Networks Prof. Yanhua Li Time: 9:00am 9:50am M, T, R, and F Location: Fuller 0 Fall 06 A-term Some slides are originall from the course materials of the tetbook Computer

More information

Network Layer: Routing

Network Layer: Routing Network Laer: Routing Instructor: Anirban Mahanti Office: ICT 74 Email: mahanti@cpsc.ucalgar.ca Class Location: ICT Lectures: MWF :00 :0 hours Notes derived Computer Networking: A Top Down Approach Featuring

More information

Agenda. distance-vector (what you invented last Friday) hierarchical routing routing in the Internet. v DNS assignment Q&A v Routing Algorithms

Agenda. distance-vector (what you invented last Friday) hierarchical routing routing in the Internet. v DNS assignment Q&A v Routing Algorithms Agenda v DNS assignment Q&A v Routing Algorithms distance-vector (what ou invented last Frida) hierarchical routing routing in the Internet Network Laer 4- Chapter 4 Network Laer A note on the use of these

More information

CS 457 Networking and the Internet. What is Routing. Forwarding versus Routing 9/27/16. Fall 2016 Indrajit Ray. A famous quotation from RFC 791

CS 457 Networking and the Internet. What is Routing. Forwarding versus Routing 9/27/16. Fall 2016 Indrajit Ray. A famous quotation from RFC 791 CS 457 Networking and the Internet Fall 2016 Indrajit Ray What is Routing A famous quotation from RFC 791 A name indicates what we seek An address indicates where it is A route indicates how we get there

More information

Lecture 4 The Network Layer. Antonio Cianfrani DIET Department Networking Group netlab.uniroma1.it

Lecture 4 The Network Layer. Antonio Cianfrani DIET Department Networking Group netlab.uniroma1.it Lecture 4 The Network Layer Antonio Cianfrani DIET Department Networking Group netlab.uniroma1.it Network layer functions Transport packet from sending to receiving hosts Network layer protocols in every

More information

Lecture 9. Network Layer (cont d) Network Layer 1-1

Lecture 9. Network Layer (cont d) Network Layer 1-1 Lecture 9 Network Layer (cont d) Network Layer 1-1 Agenda Routing Tables Unicast and Multicast Routing Protocols Routing Algorithms Link State and Distance Vector Routing Information and Open Shortest

More information

Chapter 4 Network Layer

Chapter 4 Network Layer Chapter 4 Network Layer CPSC 335 Data Communication Systems Readings: 4.4.3, 4.4.4, 4.5, 4.5.1 David Nguyen Computer Networking: A Top Down Approach 6 th edition Jim Kurose, Keith Ross Addison-Wesley March

More information

Let s focus on clarifying questions. More Routing. Logic Refresher. Warning. Short Summary of Course. 10 Years from Now.

Let s focus on clarifying questions. More Routing. Logic Refresher. Warning. Short Summary of Course. 10 Years from Now. Let s focus on clarifying questions I love the degree of interaction in this year s class More Routing all Scott Shenker http://inst.eecs.berkeley.edu/~ee/ Materials with thanks to Jennifer Rexford, Ion

More information

Internet rou)ng. V. Arun CS491G: Computer Networking Lab University of MassachuseFs Amherst

Internet rou)ng. V. Arun CS491G: Computer Networking Lab University of MassachuseFs Amherst Internet rou)ng V. Arun CS491G: Computer Networking Lab University of MassachuseFs Amherst Slide material copyright 1996-2013 J.F Kurose and K.W. Ross, All Rights Reserved Graph abstraction 5 graph: G

More information

Routing Algorithms : Fundamentals of Computer Networks Bill Nace

Routing Algorithms : Fundamentals of Computer Networks Bill Nace Routing Algorithms 4-740: Fundamentals of Computer Networks Bill Nace Material from Computer Networking: A Top Down Approach, 6 th edition. J.F. Kurose and K.W. Ross Recall from Last Time Routing Algorithm

More information

Internet Architecture. Network Layer Overview. Fundamental Network Layer Function. Protocol Layering and Data. Computer Networks 9/23/2009

Internet Architecture. Network Layer Overview. Fundamental Network Layer Function. Protocol Layering and Data. Computer Networks 9/23/2009 omputer Networks 9//9 Network Layer Overview Kai Shen Internet rchitecture ottom-up: : electromagnetic signals on the wire : data transfer between neighboring elements encoding, framing, error correction,

More information

CS 457 Networking and the Internet. Shortest-Path Problem. Dijkstra s Shortest-Path Algorithm 9/29/16. Fall 2016

CS 457 Networking and the Internet. Shortest-Path Problem. Dijkstra s Shortest-Path Algorithm 9/29/16. Fall 2016 9/9/6 S 7 Networking and the Internet Fall 06 Shortest-Path Problem Given: network topology with link costs c(x,y): link cost from node x to node y Infinity if x and y are not direct neighbors ompute:

More information

CMPE 150/L : Introduction to Computer Networks. Chen Qian Computer Engineering UCSC Baskin Engineering Lecture 14

CMPE 150/L : Introduction to Computer Networks. Chen Qian Computer Engineering UCSC Baskin Engineering Lecture 14 CMPE 150/L : Introduction to Computer Networks Chen Qian Computer Engineering UCSC Baskin Engineering Lecture 14 1 Two notes on routing algorithm Do not believe ou can understand an routing protocol, e.g.,

More information

Chapter 4 Network Layer

Chapter 4 Network Layer Chapter 4 Network Layer A note on the use of these ppt slides: We re making these slides freely available to all (faculty, students, readers). They re in PowerPoint form so you see the animations; and

More information

Chapter 5 Network Layer: The Control Plane

Chapter 5 Network Layer: The Control Plane Chapter 5 Network Layer: The Control Plane A note on the use of these Powerpoint slides: We re making these slides freely available to all (faculty, students, readers). They re in PowerPoint form so you

More information

Graph abstraction: costs. Graph abstraction 10/26/2018. Interplay between routing and forwarding

Graph abstraction: costs. Graph abstraction 10/26/2018. Interplay between routing and forwarding 0/6/08 Interpla between routing and forwarding Routing Algorithms Link State Distance Vector BGP routing routing algorithm local forwarding table header value output link 000 00 0 00 value in arriving

More information

IP Forwarding Computer Networking. Graph Model. Routes from Node A. Lecture 11: Intra-Domain Routing

IP Forwarding Computer Networking. Graph Model. Routes from Node A. Lecture 11: Intra-Domain Routing IP Forwarding 5-44 omputer Networking Lecture : Intra-omain Routing RIP (Routing Information Protocol) & OSPF (Open Shortest Path First) The Story So Far IP addresses are structured to reflect Internet

More information

CS 3516: Advanced Computer Networks

CS 3516: Advanced Computer Networks Welcome to CS 56: Adanced Computer Networks Prof. Yanhua Li Time: 9:00am 9:50am M, T, R, and F Location: Fuller 0 Fall 07 A-term Some slides are originall the course materials of the tetbook Computer Networking:

More information

Chapter IV: Network Layer

Chapter IV: Network Layer Chapter IV: Network Laer UG3 Computer Communications & Networks (COMN) Mungjin Lee mungjin.lee@ed.ac.uk Slides copright of Kurose and Ross IP addresses: how to get one? Q: How does a host get IP address?

More information

WAN Technology and Routing

WAN Technology and Routing PS 60 - Network Programming WN Technology and Routing Michele Weigle epartment of omputer Science lemson University mweigle@cs.clemson.edu March, 00 http://www.cs.clemson.edu/~mweigle/courses/cpsc60 WN

More information

Lecture 4. The Network Layer (cont d)

Lecture 4. The Network Layer (cont d) Lecture 4 The Network Layer (cont d) Agenda Routing Tables Unicast and Multicast Routing Protocols Routing Algorithms Link State and Distance Vector Routing Information and Open Shortest Path First Protocols

More information

CSCE 463/612 Networks and Distributed Processing Spring 2017

CSCE 463/612 Networks and Distributed Processing Spring 2017 CSCE 46/6 Networks and Distributed Processing Spring 07 Network Layer III Dmitri Loguinov Texas A&M University April, 07 Original slides copyright 996-004 J.F Kurose and K.W. Ross Homework #4 Grading Default

More information

Network layer: Overview. Network layer functions Routing IP Forwarding

Network layer: Overview. Network layer functions Routing IP Forwarding Network layer: Overview Network layer functions Routing IP Forwarding Network Layer Functions Transport packet from sending to receiving hosts Network layer protocols in every host, router application

More information

Computer Networking. Rou1ng Algorithms. Rou1ng Algorithms. Interplay between rou1ng, forwarding. routing algorithm

Computer Networking. Rou1ng Algorithms. Rou1ng Algorithms. Interplay between rou1ng, forwarding. routing algorithm Computer Networking Interpla between roung, forwarding routing algorithm local forwarding table header alue output link 000 00 0 00 alue in arriing packet s header 0 Graph abstracon Graph: G = (N,E) u

More information

Routers & Routing : Computer Networking. Binary Search on Ranges. Speeding up Prefix Match - Alternatives

Routers & Routing : Computer Networking. Binary Search on Ranges. Speeding up Prefix Match - Alternatives Routers & Routing -44: omputer Networking High-speed router architecture Intro to routing protocols ssigned reading [McK9] Fast Switched ackplane for a Gigabit Switched Router Know RIP/OSPF L-4 Intra-omain

More information

Third Generation Routers

Third Generation Routers IP orwarding 5-5- omputer Networking 5- Lecture : Routing Peter Steenkiste all www.cs.cmu.edu/~prs/5-- The Story So ar IP addresses are structured to reflect Internet structure IP packet headers carry

More information

COMP 631: NETWORKED & DISTRIBUTED SYSTEMS 9/6/16 COMP 631: NETWORKED & DISTRIBUTED SYSTEMS. Internet Routing. Jasleen Kaur.

COMP 631: NETWORKED & DISTRIBUTED SYSTEMS 9/6/16 COMP 631: NETWORKED & DISTRIBUTED SYSTEMS. Internet Routing. Jasleen Kaur. OMP 3: NETWORKE & ISTRIUTE SSTEMS // OMP 3: NETWORKE & ISTRIUTE SSTEMS Internet Routing Jasleen Kaur Fall 0 Forwarding vs. Routing: Local vs. istributed oth datagram and virtual-circuit based networks

More information

Network Layer: Routing. Routing. Routing protocol. Graph abstraction for routing algorithms: graph nodes are routers graph edges are physical links

Network Layer: Routing. Routing. Routing protocol. Graph abstraction for routing algorithms: graph nodes are routers graph edges are physical links Network Layer: Routing A note on the use of these ppt slides: We re making these slides freely available to all (faculty, students, readers). They re in PowerPoint form so you can add, modify, and delete

More information

CSCD 330 Network Programming Spring 2018

CSCD 330 Network Programming Spring 2018 CSCD 330 Network Programming Spring 018 Lecture 16 Network Layer Routing Protocols Reading: Chapter 4 Some slides provided courtesy of J.F Kurose and K.W. Ross, All Rights Reserved, copyright 017 1 Network

More information

Computer Networks. Wenzhong Li. Nanjing University

Computer Networks. Wenzhong Li. Nanjing University Computer Networks Wenzhong Li Nanjing University 1 Chapter 3. Packet Switching Networks Switching and Forwarding Virtual Circuit and Datagram Networks ATM and Cell Switching X.25 and Frame Relay Routing

More information

CSCD 330 Network Programming Spring 2017

CSCD 330 Network Programming Spring 2017 CSCD 330 Network Programming Spring 017 Lecture 16 Network Layer Routing Protocols Reading: Chapter 4 Some slides provided courtesy of J.F Kurose and K.W. Ross, All Rights Reserved, copyright 1996-007

More information

06/02/ Local & Metropolitan Area Networks. Overview. Routing algorithm ACOE322. Lecture 6 Routing

06/02/ Local & Metropolitan Area Networks. Overview. Routing algorithm ACOE322. Lecture 6 Routing Local & Metropolitan rea Networks OE3 Lecture 6 Routing r. L. hristofi Overview The main function of the network layer is routing packets from the source to the destination machine. The only exception

More information

Computer Networks. Instructor: Niklas Carlsson

Computer Networks. Instructor: Niklas Carlsson Computer Networks Instructor: Niklas Carlsson Email: niklas.carlsson@liu.se Notes derived Computer Networking: A Top Down Approach, b Jim Kurose and Keith Ross, Addison-Wesle. The slides are adapted and

More information

WANs and Long Distance Connectivity. Introduction

WANs and Long Distance Connectivity. Introduction WANs and Long Distance Connectivity Chapters 2-3 Introduction Previous technologies covered "short" distances Can extend over short distances somewhat with bridges, hubs, repeaters, etc. but still limited

More information

Routing Algorithms. Daniel Zappala. CS 460 Computer Networking Brigham Young University

Routing Algorithms. Daniel Zappala. CS 460 Computer Networking Brigham Young University Routing Algorithms Daniel Zappala CS 460 Computer Networking Brigham Young University Routing 2/20 How does the Internet determine which path to use from the source to the destination? Challenges need

More information

Last time. Transitioning to IPv6. Routing. Tunneling. Gateways. Graph abstraction. Link-state routing. Distance-vector routing. Dijkstra's Algorithm

Last time. Transitioning to IPv6. Routing. Tunneling. Gateways. Graph abstraction. Link-state routing. Distance-vector routing. Dijkstra's Algorithm Last time Transitioning to IPv6 Tunneling Gateways Routing Graph abstraction Link-state routing Dijkstra's Algorithm Distance-vector routing Bellman-Ford Equation 10-1 This time Distance vector link cost

More information

CMPE 150/L : Introduction to Computer Networks. Chen Qian Computer Engineering UCSC Baskin Engineering Lecture 13

CMPE 150/L : Introduction to Computer Networks. Chen Qian Computer Engineering UCSC Baskin Engineering Lecture 13 CMPE 50/L : Introduction to Computer Networks Chen Qian Computer Engineering UCSC Baskin Engineering Lecture 3 Lab3 online Due March 4 th. Introduction -2 IP addresses: how to get one? Q: how does network

More information

Flooding. Routing: Outlook. Flooding Algorithms. Spanning Tree. Flooding

Flooding. Routing: Outlook. Flooding Algorithms. Spanning Tree. Flooding Roting: Otlook Flooding Flooding Link-State: complete, global knoledge Distance-Vector: iteratie, distribted calclation Goal: To distribte a packet in the hole netork (i.e. to realie a netork-ide broadcast)

More information

Computer Networking. Intra-Domain Routing. RIP (Routing Information Protocol) & OSPF (Open Shortest Path First)

Computer Networking. Intra-Domain Routing. RIP (Routing Information Protocol) & OSPF (Open Shortest Path First) Computer Networking Intra-Domain Routing RIP (Routing Information Protocol) & OSPF (Open Shortest Path First) IP Forwarding The Story So Far IP addresses are structured to reflect Internet structure IP

More information

Network layer functions

Network layer functions Network layer functions transport packet from sending to receiving hosts network layer protocols in every host, router application transport network data link physical network data link physical network

More information

Missing Pieces of the Puzzle

Missing Pieces of the Puzzle Missing Pieces of the Puzzle EE122 Fall 2011 Scott Shenker http://inst.eecs.berkeley.edu/~ee122/ Materials with thanks to Jennifer Rexford, Ion Stoica, Vern Paxson and other colleagues at Princeton and

More information

Interplay tra routing e forwarding

Interplay tra routing e forwarding Interpla tra routing e forwarding routing algorithm local forwarding table header value output link 000 00 0 00 value in arriving packet s header 0 Network Laer 4- Grafi Grafo: G = (N,E) u v w N = insieme

More information

Routing in Ad-hoc Networks

Routing in Ad-hoc Networks 0/3/ COMP 635: WIRELESS & MOILE COMMUNICTIONS Routing in d-hoc Networks Jasleen Kaur Fall 0 Infrastructure-less Wireless Networks Standard Mobile IP needs an infrastructure Ø Home gent/foreign gent in

More information

CMPE 80N: Introduction to Networking and the Internet. Katia Obraczka Computer Engineering UCSC Baskin Engineering Lecture 20

CMPE 80N: Introduction to Networking and the Internet. Katia Obraczka Computer Engineering UCSC Baskin Engineering Lecture 20 CMPE 80N: Introduction to Networking and the Internet Katia Obraczka Computer Engineering UCSC Baskin Engineering Lecture 0 Announcements Final exam: June 7 th at 4pm. Comprehensive. Photo id required.

More information

Chapter 4: Network Layer: Part II

Chapter 4: Network Layer: Part II 4: Network Laer Chapter 4: Network Laer: Part II (last revision 9/04/05. v3) 4. Introduction 4. Virtual circuit and datagram networks 4.3 What s inside a router 4.4 IP: Internet Protocol Datagram format

More information

ELEC / COMP 177 Fall Some slides from Kurose and Ross, Computer Networking, 5 th Edition

ELEC / COMP 177 Fall Some slides from Kurose and Ross, Computer Networking, 5 th Edition ELEC / COMP 177 Fall 01 Some slides from Kurose and Ross, Computer Networking, 5 th Edition Homework #4 Due Thursday, Nov 1 st Project # Due Tuesday, Nov 6 th Later this semester: Homework #5 Due Thursday,

More information

Announcements. CS 5565 Network Architecture and Protocols. Count-To-Infinity. Poisoned Reverse. Distance Vector: Link Cost Changes.

Announcements. CS 5565 Network Architecture and Protocols. Count-To-Infinity. Poisoned Reverse. Distance Vector: Link Cost Changes. Announcements CS 6 Network Architecture and Protocols Lecture 20 Project 2B Part/ due Wed Apr 27 :9pm Part/2 due Wed Ma :9pm Current reading assignment: Chapter.6.7, Chapter Final Ma 0, 3:2pm, MCB 26 Godmar

More information

Network layer. Two Key Network-Layer Functions. Datagram Forwarding table. IP datagram format. IP Addressing: introduction

Network layer. Two Key Network-Layer Functions. Datagram Forwarding table. IP datagram format. IP Addressing: introduction Netork laer transport segment sending to receiing host on sending side encapslates segments into grams on rcing side, deliers segments to transport laer laer protocols in eer host, roter roter eamines

More information

CSC 8560 Computer Networks: Control Plane

CSC 8560 Computer Networks: Control Plane CSC 8560 Computer Networks: Control Plane Professor Henry Carter Fall 2017 Last Time Subnets provide granularity for address assignment and ease management. What is 192.168.8.0? 192.168.32.0? 192.168.8.0:

More information

Network Layer: Control Plane 5-2

Network Layer: Control Plane 5-2 Network Laer: Control Plane EECS34 8-03-05 4- Chapter 5: network laer control plane chapter goals: understand principles behind network control plane traditional routing algorithms SDN controlllers Internet

More information

5.1 introduction 5.5 The SDN control 5.2 routing protocols plane. Control Message 5.3 intra-as routing in Protocol the Internet

5.1 introduction 5.5 The SDN control 5.2 routing protocols plane. Control Message 5.3 intra-as routing in Protocol the Internet Chapter 5: outline 5.1 introduction 5.5 The SDN control 5.2 routing protocols plane link state 5.6 ICMP: The Internet distance vector Control Message 5.3 intra-as routing in Protocol the Internet t 5.7

More information

Advanced Computer Networks

Advanced Computer Networks istance Vector dvanced omputer Networks Internal routing - distance vector protocols Prof. ndrzej uda duda@imag.fr ontents Principles of internal routing istance vector (ellman-ford) principles case of

More information

Assignments. Computer Networks LECTURE 7 Network Layer: Routing and Addressing. Network Layer Function. Internet Architecture

Assignments. Computer Networks LECTURE 7 Network Layer: Routing and Addressing. Network Layer Function. Internet Architecture ompter Netorks LETURE Netork Laer: Roting and ddressing ssignments Project : Web Pro Serer DUE OT Sandha Darkadas Department of ompter Science Uniersit of Rochester Internet rchitectre Bottom-p: phsical:

More information

Network layer: Overview. Network layer functions Routing IP Forwarding

Network layer: Overview. Network layer functions Routing IP Forwarding Network layer: Overview Network layer functions Routing IP Forwarding 1 Network Layer Functions Transport packet from sending to receiving hosts (processes) Network layer protocols in every host, router

More information

Intra-AS Routing. Computer Networking: A Top Down Approach 6 th edition Jim Kurose, Keith Ross Addison-Wesley.

Intra-AS Routing. Computer Networking: A Top Down Approach 6 th edition Jim Kurose, Keith Ross Addison-Wesley. Intra-AS Routing Computer Networking: A Top Down Approach 6 th edition Jim Kurose, Keith Ross Addison-Wesle http://xkcd.com/85/ Some materials copright 1996-2012 J.F Kurose and K.W. Ross, All Rights Reserved

More information

EC441 Fall 2018 Introduction to Computer Networking Chapter 5: Network Layer Control Plane

EC441 Fall 2018 Introduction to Computer Networking Chapter 5: Network Layer Control Plane EC441 Fall 2018 Introduction to Computer Networking Chapter 5: Network Layer Control Plane This presentation is adapted from slides produced by Jim Kurose and Keith Ross for their book, Computer Networking:

More information

CS118 Discussion Week 7. Taqi

CS118 Discussion Week 7. Taqi CS118 Discussion Week 7 Taqi Outline Hints for project 2 Lecture review: routing About Course Project 2 Please implement byte-stream reliable data transfer Cwnd is in unit of bytes, not packets How to

More information

Chapter 4: outline. 4.5 routing algorithms link state distance vector hierarchical routing. 4.6 routing in the Internet RIP OSPF BGP

Chapter 4: outline. 4.5 routing algorithms link state distance vector hierarchical routing. 4.6 routing in the Internet RIP OSPF BGP Chapter 4: outline 4.1 introduction 4.2 virtual circuit and datagram networks 4.3 what s inside a router 4.4 IP: Internet Protocol datagram format IPv4 addressing ICMP IPv6 4.5 routing algorithms link

More information

Foundations of Telematics

Foundations of Telematics Foundations of Telematics Chapter 4 Network Layer cknowledgement: These slides have been prepared by J.F. Kurose and K.W. Ross with a couple of additions from various sources (see references) Foundations

More information

2/16/2008. Outline Computer Networking Lecture 11 Routing. Sending Link States by Flooding. Link State Protocol Concept

2/16/2008. Outline Computer Networking Lecture 11 Routing. Sending Link States by Flooding. Link State Protocol Concept //8 Outline - omputer Networking Lecture Routing Link tate OP Peter teenkiste epartments of omputer cience and Electrical and omputer Engineering IP Multicast ervice asics - Networking, pring 8 http://www.cs.cmu.edu/~dga/-/8

More information

ÉCOLE POLYTECHNIQUE FÉDÉRALE DE LAUSANNE! 1. Link state flooding topology information finding the shortest paths (Dijkstra)

ÉCOLE POLYTECHNIQUE FÉDÉRALE DE LAUSANNE! 1. Link state flooding topology information finding the shortest paths (Dijkstra) ontents ÉOL POLYTHNIQU ÉÉRL LUSNN! 1. Link state flooding topology information finding the shortest paths (ijkstra)! 2. Hierarchical routing with areas! 3. OSP Link State Routing database modelling neighbor

More information

Routing in a network

Routing in a network Routing in a network Focus is small to medium size networks, not yet the Internet Overview Then Distance vector algorithm (RIP) Link state algorithm (OSPF) Talk about routing more generally E.g., cost

More information

Routing Unicast routing protocols

Routing Unicast routing protocols Routing Unicast routing protocols Jens A Andersson Electrical and Information Technology R1 Choosing an Optimal Path R4 5 R7 5 10 40 R6 6 5 B R2 15 A 20 4 10 10 R8 R3 5 10 R5 1 Router A router is a type

More information

Routing Algorithms. 1 Administrivia. Tom Kelliher, CS 325. Apr. 25, Announcements. Assignment. Read 4.6. From Last Time. IP protocol.

Routing Algorithms. 1 Administrivia. Tom Kelliher, CS 325. Apr. 25, Announcements. Assignment. Read 4.6. From Last Time. IP protocol. Routing Algorithms Tom Kelliher, CS 325 Apr. 25, 2008 1 Administrivia Announcements Assignment Read 4.6. From Last Time IP protocol. Outline 1. Introduction. 2. Link state routing. 3. Distance vector routing.

More information

More Routing. EE122 Fall 2012 Scott Shenker

More Routing. EE122 Fall 2012 Scott Shenker More Routing EE Fall 0 Scott Shenker http://inst.eecs.berkeley.edu/~ee/ Materials with thanks to Jennifer Rexford, Ion Stoica, Vern Paxson and other colleagues at Princeton and UC Berkeley Let s focus

More information