Interplay tra routing e forwarding
|
|
- Phyllis Howard
- 6 years ago
- Views:
Transcription
1 Interpla tra routing e forwarding routing algorithm local forwarding table header value output link value in arriving packet s header 0 Network Laer 4-
2 Grafi Grafo: G = (N,E) u v w N = insieme di routers = { u, v, w,,, } E = insieme di links ={ (u,v), (u,), (v,), (v,w), (,w), (,), (w,), (w,), (,) } Nota: astraione utile anche in altri contesti Esempio: PP, dove N e l insieme di peers e E le connessioni TCP Network Laer 4-
3 Costi u v w c(, ) = costo del link ( - e.g., c(w,) = cost could alwas be, or inversel related to bandwid or inversel related to congestion Costo del cammino (,,,, p ) = c(, ) + c(, ) + + c( p-, p ) Question: qual e il cammino di costo minimo tra u and? Routing algorithm: algorithm that finds least-co Network Laer 4-
4 Classificaione dei Routing Algorithm Global or decentralied information? Global: all routers have complete topolog, link cost info link state algorithms Decentralied: router knows phsicall-connected neighbors, link costs to neighbors iterative process of computation, echange of info with neighbors distance vector algorithms Network Laer 4-4
5 A Link-State Routing Algorithm Dijkstra s algorithm net topolog, link costs known to all nodes accomplished via link state broadcast all nodes have same info computes least cost paths one node ( source ) to all other nodes gives forwarding table for that node iterative: after k iterations, know least cost path to k dest. s Notation: c(,): link cost node to ; = if not direct neighbors D(v): current value of cost of path source to dest. v p(v): predecessor node along path source to v N': set of nodes whose least cost path definitivel known Network Laer 4-
6 Dijsktra s Algorithm Initialiation: N' = {u} for all nodes v 4 if v adjacent to u then D(v) = c(u,v) 6 else D(v) = 7 8 Loop 9 find w not in N' such that D(w) is a minimum 0 add w to N' update D(v) for all v adjacent to w and not in N' : D(v) = min( D(v), D(w) + c(w,v) ) /* new cost to v is either old cost to v or known 4 shortest path cost to w plus cost w to v */ until all nodes in N' Network Laer 4-6
7 Network Laer 4-7 Dijkstra s algorithm: eample Step 0 4 N' u u u uv uvw uvw D(v),p(v),u,u,u D(w),p(w),u 4,,, D(),p(),u D(),p(), D(),p() 4, 4, 4, u w v
8 Dijkstra s algorithm: eample () Resulting shortest-path tree u: u v w Resulting forwarding table in u: destination link v w (u,v) (u,) (u,) (u,) (u,) Network Laer 4-8
9 Vettori Distana Bellman-Ford Equation Definiamo d () := cost of least-cost path to Allora d () = min {c(,v) + d v () } v dove min e' su tutti i vicini v of Network Laer 4-9
10 Bellman-Ford eample u v w E' chiaro che d v () =, d () =, d w () = L'equaione B-F dice: d u () = min {c(u,v) + d v (), c(u,) + d (),c(u,w) + d w ()} = min { +, +, + } = 4 Il nodo che ottiene il minimo e' il prossimo hop nella tabella di inoltro Network Laer 4-0
11 Vettori Distane D () = estimate of least cost to Distance vector: D = [D (): є N ] Node knows cost to each neighbor v: c(,v) Node maintains D = [D (): є N ] Node also maintains its neighbors distance vectors For each neighbor v, maintains D v = [D v (): є N ] Network Laer 4-
12 Distance vector algorithm (4) Basic idea: Each node periodicall sends its own distance vector estimate to neighbors When a node receives new DV estimate neighbor, it updates its own DV using B-F equation: D () min v {c(,v) + D v ()} for each node N Under minor, natural conditions, the estimate D () converge to the actual least cost d () Network Laer 4-
13 Distance Vector Algorithm () Iterative, asnchronous: each local iteration caused b: local link cost change DV update message neighbor Distributed: each node notifies neighbors onl when its DV changes neighbors then notif their neighbors if necessar Each node: wait for (change in local link cost of msg neighbor) recompute estimates if DV to an dest has changed, notif neighbors Network Laer 4-
14 D () = min{c(,) + D (), c(,) + D ()} = min{+0, 7+} = node table cost to cost to 0 7 node table cost to 0 node table cost to cost to cost to D ()= min{c(,)+ D (), c(,) + D ()} = min{+,7+0} = cost to cost to cost to time 7 Network Laer 4-4
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 informationInterplay 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 informationNetwork 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 informationComputer 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 informationRouting 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 informationCS 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 informationCS 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 informationChapter 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 informationChapter 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 informationComputer 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 informationGraph 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 informationNetwork 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 informationDATA 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 informationChapter 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 informationInitial motivation: 32-bit address space soon to be completely allocated. Additional motivation:
IPv6 Initial motivation: 3-bit address space soon to be completel allocated. Additional motivation: Header format helps speed processing/forwarding Header changes to facilitate QoS (service classes) Reduction
More informationCMPE 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 informationChapter 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 informationCSC 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 informationInternet 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 informationAgenda. 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 informationELEC / 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 informationNetwork 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 informationCSC 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 informationChapter 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 information11/13/2017 Network Layer (SSL) Network-layer functions. Recall the two network-layer functions:
Chapter 5: outline 5. introduction 5.2 routing protocols link state distance vector 5.3 intra-as routing in the Internet 5.4 inter-as routing: BGP 5.5 The SDN control 5.6 ICMP: The Internet Control Message
More informationAnnouncements. 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 informationRedes de Computadores. Shortest Paths in Networks
Redes de Computadores Shortest Paths in Networks Manuel P. Ricardo Faculdade de Engenharia da Universidade do Porto » What is a graph?» What is a spanning tree?» What is a shortest path tree?» How are
More informationChapter 5: Network Layer Control Plane. understand principles behind network control plane : traditional routing algorithms
Introduction to Computer Networking Gu Leduc Chapter 5 Network Laer: The Control Plane Computer Networking: A Top Down Approach, 7 th edition. Jim Kurose, Keith Ross Addison-Wesle, April 06. From Computer
More informationChapter 4 Network Layer
Chapter 4 Network Laer A note on the use of these ppt slides: The notes used in this course are substantiall based on powerpoint slides developed and coprighted b J.F. Kurose and K.W. Ross, 1996-2007 Computer
More informationChapter 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 informationNetwork 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 informationChapter 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 informationCMPE 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 informationCSCD 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 informationProtocoles et Interconnexions
Protocoles et Interconneions Course Overview and Introduction Dario Vieira Department of Computer Science EFREI Routing Protocol BGP TCP Computer Networking Preliminaries Transport Laer Network Laer Introduction
More informationCSCD 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 informationCMPE 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 informationIntra-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 informationCSCE 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 informationAnnouncement. 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 informationCS 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 informationChapter 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 informationRouting 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 informationInternet 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 informationChapter 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 informationRouting 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 informationChapter 4: Network Layer. Chapter 4 Network Layer. Chapter 4: Network Layer. Network Layer. Chapter goals:
Chapter 4 Network Laer A note on the use of these ppt slides: The notes used in this course are substantiall based on powerpoint slides developed and coprighted b J.F. Kurose and K.W. Ross, 996-7 Computer
More informationLecture 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 informationDynamic Routing. The Protocols
Dynamic Routing The Protocols Desirable Characteristics of Dynamic Routing Automatically detect and adapt to topology changes Provide optimal routing Scalability Robustness Simplicity Rapid convergence
More informationChapter 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 informationInitialization: Loop until all nodes in N
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
More informationCSC 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 informationCOMP/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 informationInternet 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 information4.5.2 The Distance-Vector (DV) Routing Algorithm
4.5 ROUTING ALGORITHMS 371 highl congested (for eample, high-dela) links. Another solution is to ensure that not all routers run the LS algorithm at the same time. This seems a more reasonable solution,
More informationEE 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 informationCS 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 informationLecture 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 informationEC441 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 information5.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 informationComputer Networking: A Top Down Approach 6 th edition Jim Kurose, Keith Ross Addison-Wesley
Intra- AS Rou-ng h0p://kcd.com/85/ Computer Networking: A Top Down Approach 6 th edition Jim Kurose, Keith Ross Addison-Wesle Some materials copright 1996-2012 J.F Kurose and K.W. Ross, All Rights Reserved
More informationCourse on Computer Communication and Networks. Lecture 7 Network Layer, Chapter 4 (6/e) - Part B (7/e Ch5)
Course on Computer Communication and Networks Lecture 7 Network Layer, Chapter 4 (6/e) - Part B (7/e Ch5) EDA344/DIT 420, CTH/GU Based on the book Computer Networking: A Top Down Approach, Jim Kurose,
More informationNetwork 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 informationNetwork layer functions. Chapter 4 Network Layer. Network layer functions. Network layer functions
Network layer functions Chapter 4 Network Layer transport packet from sending to receiving hosts layer entity in every host, router functions: path determination: route taken by packets from source to
More informationCS 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 informationTelecomunicazioni. Docente: Andrea Baiocchi. DIET - Stanza 107, 1 piano palazzina P. Piga Via Eudossiana 18
University of Roma La Sapiena Telecomunicaioni Docente: Andrea Baiocchi DIET - Stana 07, piano palaina P. Piga Via Eudossiana 8 E-mail: andrea.baiocchi@uniroma.it Corso di Laurea in Ingegneria Gestionale
More informationLecture 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 informationChapter 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 informationChapter 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 informationComputer 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 informationLecture 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 informationChapter 4: Network Layer. Chapter 4 Network Layer. Chapter 4: Network Layer. Network layer
Chapter 4 Network Laer A note on the use of these ppt slides: We re making these slides freel available to all (facult, students, readers). The re in PowerPoint form so ou can add, modif, and delete slides
More informationNetwork 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 informationNetwork 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 informationSummary Chapter 4. Smith College, CSC 249 March 2, q IP Addressing. q DHCP dynamic addressing
Smith College, CSC 49 March, 08 Summary Chapter 4 q IP Addressing Network prefixes and Subnets IP datagram format q DHCP dynamic addressing Obtain: own IP address Subnet mask, DNS serer & first-hop router
More informationNetwork Layer. CMPS 4750/6750: Computer Networks
Network Layer CMPS 4750/6750: Computer Networks 1 Outline Overview of network layer Forwarding (data plane) Routing (control plane) The Internet Protocol (IP) Routing in the Internet: OSPF, BGP 2 Network
More informationCSc 450/550 Computer Networks Internet Routing
CSc 450/550 Computer Networks Internet Routing Jianping Pan Summer 2007 7/12/07 CSc 450/550 1 Review Internet Protocol (IP) IP header addressing class-based, classless, hierarchical, NAT routing algorithms
More informationAssignments. 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 informationLink-State Routing OSPF
CE Computer Networks Link-State Routing OSPF Behnam Momeni Computer Engineering Department Sharif University of Technology Acknowledgments: Lecture slides are from Computer networks course thought by Jennifer
More informationLink State Rou.ng Reading: Sec.ons 4.2 and 4.3.4
Link State Rou.ng Reading: Sec.ons. and.. COS 6: Computer Networks Spring 0 Mike Freedman hep://www.cs.princeton.edu/courses/archive/spring/cos6/ Inside a router Goals of Today s Lecture Control plane:
More informationModule 3 Network Layer CS755! 3-1!
Module 3 Network Layer CS755 3-1 Please note: Most of these slides come from this book. Note their copyright notice below A note on the use of these ppt slides: We re making these slides freely available
More informationΔίκτυα Υπολογιστών ΙΙ. Κώστας Μαγκούτης Επίκουρος Καθηγητής Τμήμα Μηχανικών Η/Υ και Πληροφορικής Πανεπιστήμιο Ιωαννίνων
Δίκτυα Υπολογιστών ΙΙ Κώστας Μαγκούτης Επίκουρος Καθηγητής Τμήμα Μηχανικών Η/Υ και Πληροφορικής Πανεπιστήμιο Ιωαννίνων Course information introductory course in computer networking course materials: text:
More informationChapter 4: Network Layer. Chapter 4 Network Layer. Chapter 4: Network Layer. Key Network-Layer Functions. Network layer.
Chapter 4 Network Laer note on the use of these ppt slides: We re making these slides freel available to all (facult, students, readers). The re in PowerPoint form so ou can add, modif, and delete slides
More informationData Communications & Networks. Session 7 Main Theme Networks: Part II Circuit Switching, Packet Switching, The Network Layer
Data Communications & Networks Session 7 Main Theme Networks: Part II Circuit Switching, Packet Switching, The Network Layer Dr. Jean-Claude Franchitti New York University Computer Science Department Courant
More informationCOM-208: Computer Networks - Homework 6
COM-208: Computer Networks - Homework 6. (P22) Suppose you are interested in detecting the number of hosts behind a NAT. You observe that the IP layer stamps an identification number sequentially on each
More informationRouting Algorithms. CS158a Chris Pollett Apr 4, 2007.
Routing Algorithms CS158a Chris Pollett Apr 4, 2007. Outline Routing Algorithms Adaptive/non-adaptive algorithms The Optimality Principle Shortest Path Routing Flooding Distance Vector Routing Routing
More informationRouting 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 informationChapter 4: Network Layer. Chapter 4 Network Layer. Chapter 4: Network Layer. Network layer. Two Key Network-Layer Functions
当前无法显示此图像 Chapter 4: Network Laer Chapter 4 Network Laer Chapter goals: understand principles behind laer services: laer service models forwarding versus routing how a works routing (path selection) dealing
More informationInternet 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 informationChapter 4: Network Layer. Chapter 4 Network Layer. Chapter 4: Network Layer. Network layer. Two Key Network-Layer Functions
Chapter 4 Network Laer note on the use of these ppt slides: We re making these slides freel available to all (facult, students, readers). The re in PowerPoint form so ou can add, modif, and delete slides
More informationLast 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 information4.5 Routing Algorithms
4.5 ROUTING ALGORITHMS 363 to hosts enjo the securit services provided b IPsec. On the sending side, the transport laer passes a segment to IPsec. IPsec then encrpts the segment, appends additional securit
More informationChapter 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 informationCSCE 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 informationChapter 4: Network Layer. Chapter 4 Network Layer. Chapter 4: Network Layer. Network layer. Chapter goals:
Chapter 4 Network Layer Computer Networking: A Top Down Approach Featuring the, 3 rd edition. Jim Kurose, Keith Ross Addison-Wesley, July 004. Chapter 4: Network Layer Chapter goals: understand principles
More informationWhat 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 informationRouting Protocols. The routers in an internet are responsible for receiving and. forwarding IP datagrams through the interconnected set of
Routing Protocols MITA DUTTA The routers in an internet are responsible for receiving and forwarding IP datagrams through the interconnected set of sub-networks from source to destination. Routing protocols
More informationDepartment of Computer Science Southern Illinois University Carbondale
Department of Computer Science Southern Illinois University Carbondale CS441 Mobile & Wireless Computing Overview of Computer Networking Network Layer of TCP/IP Model Data and Computer Communications 7
More informationCommunication Networks
Communication Networks Routing and Traffic Management Manuel P. Ricardo Faculdade de Engenharia da Universidade do Porto Routing Graph Directed and Undirected Tree Trees T = (V,E)» graph with no cycles»
More informationReview: 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