14 - Routing Algorithms and Protocols

14 - Routing Algorithms and Protocols - Last Lecture:...

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

View Full Document Right Arrow Icon
Last Lecture: Network Layer 1. Design goals and issues Debate around service model/design principle question 2. Packet Forwarding Shortest-Path Algorithms Routing Protocols 3. Addressing, Fragmentation and reassembly 4. Internet Routing Protocols and Inter-networking 5. Router design 6. Congestion Control, Quality of Service 7. More on the Internet’s Network Layer SUNY at Buffalo; CSE 489/589 – Modern Networking Concepts; Fall 2010; Instructor: Hung Q. Ngo 1
Background image of page 1

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

View Full DocumentRight Arrow Icon
This Lecture: Network Layer 1. Design goals and issues Debate around service model/design principle question 2. Routing and Forwarding o Packet Forwarding o Shortest-Path Algorithms o Routing Protocols 3. Addressing, Fragmentation and reassembly 4. Internet Routing Protocols and Inter-networking 5. Router design 6. Congestion Control, Quality of Service 7. More on the Internet’s Network Layer SUNY at Buffalo; CSE 489/589 – Modern Networking Concepts; Fall 2010; Instructor: Hung Q. Ngo 2
Background image of page 2
SUNY at Buffalo; CSE 489/589 – Modern Networking Concepts; Fall 2010; Instructor: Hung Q. Ngo 3 Routing and Forwarding Let’s consider connection-oriented and connectionless services first More on QoS and congestion control issues later Three main problems (on a packet switched net.) Forwarding : how routers forward a packet Routing : routers “learn” network topology (more later) Addressing : identify hosts and routers (more later)
Background image of page 3

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

View Full DocumentRight Arrow Icon
Routing and Forwarding SUNY at Buffalo; CSE 489/589 – Modern Networking Concepts; Fall 2010; Instructor: Hung Q. Ngo 4 1 2 3 0111 value in arriving packet’s header routing algorithm local forwarding table header value output link 0100 0101 0111 1001 3 2 2 1 Routing algorithm determines values in the forwarding tables
Background image of page 4
1. Packet Forwarding a) Virtual Circuit (connection-oriented) Connection routed through network to set up state Packets forwarded using connection state b) Datagram (connectionless) Routers keep next hop for destination Packets carry destination address c) Source routing : Packet contains entire path to destination Could done on either virtual circuit or datagram networks SUNY at Buffalo; CSE 489/589 – Modern Networking Concepts; Fall 2010; Instructor: Hung Q. Ngo 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
SUNY at Buffalo; CSE 489/589 – Modern Networking Concepts; Fall 2010; Instructor: Hung Q. Ngo 6 a) Virtual Circuits Call setup before data can flow Call teardown after data flow Each packet carries VC ID ( not destination host ID) Every router on source-destination path maintains “state” for each passing connection Link, router resources (bandwidth, buffers) may be allocated to VC Get a circuit-like performance “Source-to-dest path behaves much like telephone circuit” Performance-wise Network actions along source-to-dest path
Background image of page 6
SUNY at Buffalo; CSE 489/589 – Modern Networking Concepts; Fall 2010; Instructor: Hung Q. Ngo 7 Virtual Circuits: Signaling Protocols
Background image of page 7

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

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

Page1 / 43

14 - Routing Algorithms and Protocols - Last Lecture:...

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