
Chapter 4 Network Layer computer networking A note on the use of these ppt slides: 黄容 Computer Networking: (including this one)and slide content to suit your needs.They obviously A Top Down Approach represent a lot of work on our part.In retum for use,we only ask the following: Featuring the Internet f you use these slides (e.g.,in a class)in substantially unaltered form, 3rd edition. that you mention their source (after all,we'd like people to use our book!) If you post any slides in substantially unaltered form on a ww site,that Jim Kurose,Keith Ross you note that they are adapted from(or perhaps identical to)our slides,and Addison-Wesley,July note our copyright of this material. 2004. Thanks and enjoy!JFK/KWR All material copyright 1996-2004 J.F Kurose and K.W.Ross,All Rights Reserved Network Layer 4-1
Network Layer 4-1 Chapter 4 Network Layer Computer Networking: A Top Down Approach Featuring the Internet, 3rd edition. Jim Kurose, Keith Ross Addison-Wesley, July 2004. 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 slides (including this one) and slide content to suit your needs. They obviously represent a lot of work on our part. In return for use, we only ask the following: ❑ If you use these slides (e.g., in a class) in substantially unaltered form, that you mention their source (after all, we’d like people to use our book!) ❑ If you post any slides in substantially unaltered form on a www site, that you note that they are adapted from (or perhaps identical to) our slides, and note our copyright of this material. Thanks and enjoy! JFK/KWR All material copyright 1996-2004 J.F Kurose and K.W. Ross, All Rights Reserved

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

Chapter 4:Network Layer 4.1 Introduction 4.5 Routing algorithms 4.2 Virtual circuit and o Link state datagram networks o Distance Vector 4.3 What's inside a o Hierarchical routing router 4.6 Routing in the 4.4 IP:Internet Internet Protocol o RIP o OSPF o Datagram format o IPv4 addressing BGP ICMP 口4.7 Broadcast and o IPv6 multicast routing Network Layer 4-3
Network Layer 4-3 Chapter 4: Network Layer 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 state Distance Vector Hierarchical routing 4.6 Routing in the Internet RIP OSPF BGP 4.7 Broadcast and multicast routing

Network layer transport segment from sending to receiving host ▣on sending side encapsulates segments into datagrams data link ▣on receiving side physica delivers segments to transport layer network layer protocols in every host,router Router examines header hysical fields in all IP datagrams passing through it Network Layer 4-4
Network Layer 4-4 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 host, router Router examines header fields in all IP datagrams passing through it network data link physical network data link physical network data link physical network data link physical network data link physical network data link physical network data link physical network data link physical application transport network data link physical application transport network data link physical

Key Network-Layer Functions ▣forwarding:move analogy: packets from router's input to appropriate □routing:process of router output planning trip from source to destination Orouting:determine route taken by forwarding:process packets from source of getting through to destination single interchange o Routing algorithms Network Layer 4-5
Network Layer 4-5 Key Network-Layer Functions forwarding: move packets from router’s input to appropriate router output routing: determine route taken by packets from source to destination Routing algorithms analogy: routing: process of planning trip from source to destination forwarding: process of getting through single interchange

Interplay between routing and forwarding routing algorithm local forwarding table header value output link 01003 0101 2 01112 10011 value in arriving packet's header 0111 Network Layer 4-6
Network Layer 4-6 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 Interplay between routing and forwarding

Connection setup 3rd important function in some network architectures: ATM,frame relay,X.25 Before datagrams flow,two hosts and intervening routers establish virtual connection o Routers get involved Network and transport layer connection service: o Network:between two hosts o Transport:between two processes Network Layer 4-7
Network Layer 4-7 Connection setup 3rd important function in some network architectures: ATM, frame relay, X.25 Before datagrams flow, two hosts and intervening routers establish virtual connection Routers get involved Network and transport layer connection service: Network: between two hosts Transport: between two processes

Network service model Q:What service model for "channel"transporting datagrams from sender to receiver? Example services for Example services for a individual datagrams: flow of datagrams: ▣guaranteed delivery 口In-order datagram ▣Guaranteed delivery delivery with less than 40 msec Guaranteed minimum delay bandwidth to flow ▣Restrictions on changes in inter- packet spacing Network Layer 4-8
Network Layer 4-8 Network service model Q: What service model for “channel” transporting datagrams from sender to receiver? Example services for individual datagrams: guaranteed delivery Guaranteed delivery with less than 40 msec delay Example services for a flow of datagrams: In-order datagram delivery Guaranteed minimum bandwidth to flow Restrictions on changes in interpacket spacing

Network layer service models: Network Service Guarantees Congestion Architecture Model Bandwidth Loss Order Timing feedback Internet best effort none no no no no (inferred via loss) ATM CBR constant yes yes yes no (constant)rate congestion ATM VBR guaranteed yes yes yes no (variable)rate congestion ATM ABR guaranteed no yes no yes (available)minimum ATM UBR none no yes no no (unspecific) Network Layer 4-9
Network Layer 4-9 Network layer service models: Network Architecture Internet ATM ATM ATM ATM Service Model best effort CBR (constant) VBR (variable) ABR (available) UBR (unspecific) Bandwidth none constant rate guaranteed rate guaranteed minimum none Loss no yes yes no no Order no yes yes yes yes Timing no yes yes no no Congestion feedback no (inferred via loss) no congestion no congestion yes no Guarantees ?

Chapter 4:Network Layer ▣4.1 Introduction 4.5 Routing algorithms 4.2 Virtual circuit and o Link state datagram networks o Distance Vector 4.3 What's inside a o Hierarchical routing router 4.6 Routing in the 4.4 IP:Internet Internet Protocol RIP o Datagram format o OSPF o IPv4 addressing o BGP o ICMP 4.7 Broadcast and IPv6 multicast routing Network Layer 4-10
Network Layer 4-10 Chapter 4: Network Layer 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 state Distance Vector Hierarchical routing 4.6 Routing in the Internet RIP OSPF BGP 4.7 Broadcast and multicast routing