The Network Layer. Antonio Carzaniga. April 22, Faculty of Informatics University of Lugano Antonio Carzaniga
|
|
|
- Karin Shelton
- 5 years ago
- Views:
Transcription
1 The Network Layer Antonio Carzaniga Faculty of Informatics University of Lugano April 22, 2010
2 Basic network-layer architecture of a datagram network Outline Introduction to forwarding Introduction to routing General architecture of a router Switching fabric and queuing Internet network-layer protocol The Internet protocol (IP) Fragmentation
3 Application Level web browser web server
4 Application Level web browser web server
5 Application Level GET /carzaniga/ HTTP/1.1 Host: web browser web server
6 Application Level web browser web server HTTP/ OK... <html><head>... </head><body>...
7 Application Level GET /carzaniga/anto.png HTTP/1.1 Host: web browser web server
8 Application Level web browser web server HTTP/ OK......
9 Transport Level web browser web server
10 Transport Level web browser web server
11 Transport Level web browser web server
12 Network Layer web browser web server
13 Network Layer web browser web server
14 Network Layer web browser web server
15 Router Antonio Carzaniga
16 Router Fundamental component of the network layer
17 Router Fundamental component of the network layer A node in a graph
18 Router Fundamental component of the network layer A node in a graph A finite set of input/output (physical) connections a.k.a., interfaces or ports Antonio Carzaniga
19 Focus: Datagram Networks Antonio Carzaniga
20 Packet-switched network Focus: Datagram Networks
21 Packet-switched network Focus: Datagram Networks information is transmitted in discrete units called datagrams
22 Packet-switched network Focus: Datagram Networks information is transmitted in discrete units called datagrams Connectionless service
23 Packet-switched network Focus: Datagram Networks information is transmitted in discrete units called datagrams Connectionless service a datagram is a self-contained message treated independently by the network no connection setup/tear-down phase
24 Packet-switched network Focus: Datagram Networks information is transmitted in discrete units called datagrams Connectionless service a datagram is a self-contained message treated independently by the network no connection setup/tear-down phase Best-effort service
25 Packet-switched network Focus: Datagram Networks information is transmitted in discrete units called datagrams Connectionless service a datagram is a self-contained message treated independently by the network no connection setup/tear-down phase Best-effort service delivery guarantee: none
26 Packet-switched network Focus: Datagram Networks information is transmitted in discrete units called datagrams Connectionless service a datagram is a self-contained message treated independently by the network no connection setup/tear-down phase Best-effort service delivery guarantee: none maximum latency guarantee: none
27 Packet-switched network Focus: Datagram Networks information is transmitted in discrete units called datagrams Connectionless service a datagram is a self-contained message treated independently by the network no connection setup/tear-down phase Best-effort service delivery guarantee: none maximum latency guarantee: none bandwidth guarantee: none
28 Packet-switched network Focus: Datagram Networks information is transmitted in discrete units called datagrams Connectionless service a datagram is a self-contained message treated independently by the network no connection setup/tear-down phase Best-effort service delivery guarantee: none maximum latency guarantee: none bandwidth guarantee: none in-order delivery guarantee: none
29 Packet-switched network Focus: Datagram Networks information is transmitted in discrete units called datagrams Connectionless service a datagram is a self-contained message treated independently by the network no connection setup/tear-down phase Best-effort service delivery guarantee: none maximum latency guarantee: none bandwidth guarantee: none in-order delivery guarantee: none congestion indication: none
30 Datagram Network Antonio Carzaniga
31 Datagram Network Antonio Carzaniga
32 Datagram Network Antonio Carzaniga
33 Datagram Network Antonio Carzaniga
34 Datagram Network Antonio Carzaniga
35 Datagram Network Antonio Carzaniga
36 Datagram Network Antonio Carzaniga
37 Datagram Network Potentially multiple paths for the same source/destination
38 Datagram Network Potentially multiple paths for the same source/destination
39 Datagram Network Potentially multiple paths for the same source/destination
40 Datagram Network Potentially multiple paths for the same source/destination
41 Datagram Network Potentially multiple paths for the same source/destination
42 Datagram Network Potentially multiple paths for the same source/destination
43 Datagram Network Potentially multiple paths for the same source/destination
44 Datagram Network Potentially multiple paths for the same source/destination
45 Datagram Network Potentially multiple paths for the same source/destination Potentially asymmetric paths
46 Datagram Network Potentially multiple paths for the same source/destination Potentially asymmetric paths
47 Datagram Network Potentially multiple paths for the same source/destination Potentially asymmetric paths
48 Datagram Network Potentially multiple paths for the same source/destination Potentially asymmetric paths
49 Datagram Network Potentially multiple paths for the same source/destination Potentially asymmetric paths
50 Datagram Network Potentially multiple paths for the same source/destination Potentially asymmetric paths
51 Forwarding Antonio Carzaniga
52 Forwarding c d j A k h i g B e f A sends a datagram to B
53 Forwarding c d j A to: B... k h i g B e f A sends a datagram to B The datagram is forwarded towards B
54 Forwarding A to: B... k c h d i j g B e f A sends a datagram to B The datagram is forwarded towards B
55 Forwarding c to: B... d j A k h i g B e f
56 Forwarding c d j A k h to: B... i g B e f
57 Forwarding c d j A k h 3 2 e to: B i f g B forwarding table dest. output B port
58 Forwarding c d j A k h 3 2 e 1 4 to: B... i f g B forwarding table dest. output B port
59 Forwarding c d j A k h 3 2 e 1 4 i f to: B... g B forwarding table dest. output B port
60 Forwarding c d j A k h 3 2 e 1 4 i f g to: B... B forwarding table dest. output B port
61 Forwarding Input: datagram destination
62 Forwarding Input: datagram destination Output: output port
63 Forwarding Input: datagram destination Output: output port Simple design: forwarding table
64 Forwarding Input: datagram destination Output: output port Simple design: forwarding table Issues
65 Forwarding Input: datagram destination Output: output port Simple design: forwarding table Issues how big is the forwarding table?
66 Forwarding Input: datagram destination Output: output port Simple design: forwarding table Issues how big is the forwarding table? how fast does the router have to forward datagrams?
67 Forwarding Input: datagram destination Output: output port Simple design: forwarding table Issues how big is the forwarding table? how fast does the router have to forward datagrams? how does the router build and maintain the forwarding table?
68 Routing Antonio Carzaniga
69 Routing A B k c d e f g h i j Antonio Carzaniga
70 Routing A B k c d e f g h i j router k A 2 B Antonio Carzaniga
71 Router Functions Antonio Carzaniga
72 Router Functions communications with neighbors: routing protocol routing routing table
73 Router Functions communications with neighbors: routing protocol routing routing table forwarding table
74 Router Functions communications with neighbors: routing protocol routing routing table forwarding table input packets from input ports forwarding output packets to output ports
75 Anatomy of a Router Antonio Carzaniga
76 Anatomy of a Router routing processor input port input port... input port switch fabric output port output port... output port
77 Anatomy of a Router routing processor input port input port... input port switch fabric output port output port... output port data link processing lookup forwarding queuing
78 Anatomy of a Router routing processor input port input port... input port switch fabric output port output port... output port
79 Anatomy of a Router routing processor input port input port... input port switch fabric output port output port... output port queuing data link processing
80 Queuing Where does queuing occur?
81 Queuing Where does queuing occur? Input ports queuing may occur here if the switching fabric is slower than the aggregate speed of all the input lines. I.e., T S < nt in
82 Queuing Where does queuing occur? Input ports queuing may occur here if the switching fabric is slower than the aggregate speed of all the input lines. I.e., T S < nt in Output ports queuing may occur here because of the limited throughput of the output link. I.e., T out < min(t S, nt in )
83 What happens when packets queue up in a router? Queuing
84 What happens when packets queue up in a router? Scheduling: deciding which packets to process Queuing
85 What happens when packets queue up in a router? Scheduling: deciding which packets to process first-come-first-served Queuing
86 What happens when packets queue up in a router? Scheduling: deciding which packets to process first-come-first-served Queuing weighted fair queuing: the router tries to be balance traffic evenly among the different end-to-end connections. Essential to implement quality-of-service guarantees
87 What happens when packets queue up in a router? Scheduling: deciding which packets to process first-come-first-served Queuing weighted fair queuing: the router tries to be balance traffic evenly among the different end-to-end connections. Essential to implement quality-of-service guarantees Deciding when to drop packets, and which packets to drop
88 What happens when packets queue up in a router? Scheduling: deciding which packets to process first-come-first-served Queuing weighted fair queuing: the router tries to be balance traffic evenly among the different end-to-end connections. Essential to implement quality-of-service guarantees Deciding when to drop packets, and which packets to drop drop tail: drop arriving packets when queues are full
89 What happens when packets queue up in a router? Scheduling: deciding which packets to process first-come-first-served Queuing weighted fair queuing: the router tries to be balance traffic evenly among the different end-to-end connections. Essential to implement quality-of-service guarantees Deciding when to drop packets, and which packets to drop drop tail: drop arriving packets when queues are full active queue management: a set of policies and algorithms to decide when and how to drop or mark packets in the attempt to prevent congestion
90 Internet Network Layer Antonio Carzaniga
91 Internet Network Layer Routing: defining paths and compiling forwarding tables
92 Internet Network Layer Routing: defining paths and compiling forwarding tables RIP OSPF BGP
93 Internet Network Layer Routing: defining paths and compiling forwarding tables RIP OSPF BGP IP
94 Internet Network Layer Routing: defining paths and compiling forwarding tables RIP OSPF BGP IP addressing datagram format fragmentation and packet handling
95 Internet Network Layer Routing: defining paths and compiling forwarding tables RIP OSPF BGP IP addressing datagram format fragmentation and packet handling ICMP
96 Internet Network Layer Routing: defining paths and compiling forwarding tables RIP OSPF BGP IP addressing datagram format fragmentation and packet handling ICMP error reporting signaling
97 IPv4 Datagram Format 0 31
98 IPv4 Datagram Format 0 31 vers.
99 IPv4 Datagram Format 0 31 vers. hlen
100 IPv4 Datagram Format 0 31 vers. hlen type of service
101 IPv4 Datagram Format 0 31 vers. hlen type of service datagram length
102 IPv4 Datagram Format 0 31 vers. hlen type of service datagram length identifier flags fragmentation offset
103 IPv4 Datagram Format 0 31 vers. hlen type of service datagram length identifier flags fragmentation offset time-to-live
104 IPv4 Datagram Format 0 31 vers. hlen type of service datagram length identifier flags fragmentation offset time-to-live protocol
105 IPv4 Datagram Format 0 31 vers. hlen type of service datagram length identifier flags fragmentation offset time-to-live protocol header checksum
106 IPv4 Datagram Format 0 31 vers. hlen type of service datagram length identifier flags fragmentation offset time-to-live protocol header checksum source address destination address
107 IPv4 Datagram Format 0 31 vers. hlen type of service datagram length identifier flags fragmentation offset time-to-live protocol header checksum source address destination address options (if any)
108 IPv4 Datagram Format 0 31 vers. hlen type of service datagram length identifier flags fragmentation offset time-to-live protocol header checksum source address destination address options (if any) data
109 Fragmentation Antonio Carzaniga
110 Fragmentation routing processor input port input port... input port switch fabric output port output port... output port
111 Fragmentation routing processor input port input port... input port switch fabric output port output port... output port
112 Fragmentation routing processor input port input port... input port switch fabric output port output port... output port
113 Fragmentation routing processor input port input port... input port switch fabric output port output port... output port
114 Fragmentation MTU= 1500b size=1000b input port input port... input port routing processor switch fabric output port output port... output port
115 Fragmentation routing processor MTU= 1500b size=1000b input port input port... input port switch fabric output port output port... output port MTU= 512b
116 Fragmentation routing processor MTU= 1500b size=1000b input port input port... input port switch fabric output port output port... output port MTU= 512b How does the router handle cases where the size of an input datagram exceeds the maximum transmission unit (MTU) of the output link?
117 Fragmentation routing processor MTU= 1500b size=1000b input port input port... input port switch fabric output port output port... output port MTU= 512b How does the router handle cases where the size of an input datagram exceeds the maximum transmission unit (MTU) of the output link? The datagram is fragmented
118 Fragmentation header input datagram
119 Fragmentation MTU header input datagram
120 Fragmentation MTU header header + header input datagram fragment 1 fragment 2
121 Fragmentation MTU header header + header input datagram fragment 1 fragment 2 The destination reassembles fragmented datagrams
122 Fragmentation MTU header header + header input datagram fragment 1 fragment 2 The destination reassembles fragmented datagrams not intermediate routers this is mainly to push complexity out of the network Antonio Carzaniga
123 Fragmentation MTU header header + header input datagram fragment 1 fragment 2 The destination reassembles fragmented datagrams not intermediate routers this is mainly to push complexity out of the network a datagram may have to be fragmented further along the path Antonio Carzaniga
124 Fragmentation MTU header header + header input datagram fragment 1 fragment 2 The destination reassembles fragmented datagrams not intermediate routers this is mainly to push complexity out of the network a datagram may have to be fragmented further along the path The fragmentation scheme must ensure that the destination host can recognize two fragments of the same original datagram can figure out if and when all the fragments have been received Antonio Carzaniga
125 Fragmentation MTU header header + header input datagram fragment 1 fragment 2 The destination reassembles fragmented datagrams not intermediate routers this is mainly to push complexity out of the network a datagram may have to be fragmented further along the path The fragmentation scheme must ensure that the destination host can recognize two fragments of the same original datagram can figure out if and when all the fragments have been received The fragmentation scheme must ensure that the intermediate routers can fragment a datagram to whatever level necessary Antonio Carzaniga
126 Fragmentation Antonio Carzaniga
127 Fragmentation Initial (non-fragmented) datagram format (datasize=1000)
128 Fragmentation Initial (non-fragmented) datagram format (datasize=1000) sender host assigns a 16-bit identifier to the datagram (e.g., 789)
129 Fragmentation Initial (non-fragmented) datagram format (datasize=1000) sender host assigns a 16-bit identifier to the datagram (e.g., 789) the fragment offset is set to 0, indicating that this packet contains data starting at position 0 of the original datagram fragment offset is actually the offset in units of 8 bytes (remember it s only 13 bits... )
130 Fragmentation Initial (non-fragmented) datagram format (datasize=1000) sender host assigns a 16-bit identifier to the datagram (e.g., 789) the fragment offset is set to 0, indicating that this packet contains data starting at position 0 of the original datagram fragment offset is actually the offset in units of 8 bytes (remember it s only 13 bits... ) the more fragments flag is set to 0, indicating that no (more) fragments have been sent
131 Fragmentation Initial (non-fragmented) datagram format (datasize=1000) sender host assigns a 16-bit identifier to the datagram (e.g., 789) the fragment offset is set to 0, indicating that this packet contains data starting at position 0 of the original datagram fragment offset is actually the offset in units of 8 bytes (remember it s only 13 bits... ) the more fragments flag is set to 0, indicating that no (more) fragments have been sent identifier fragment more header total offset fragments length length
132 Fragmentation Antonio Carzaniga
133 Fragmentation Fragmentation to an MTU of 512
134 Fragmentation to an MTU of 512 sender must split the datagram into 3 fragments: Fragmentation
135 Fragmentation to an MTU of 512 sender must split the datagram into 3 fragments: Fragmentation identifier fragment more header total offset fragments length length
136 Fragmentation to an MTU of 512 sender must split the datagram into 3 fragments: Fragmentation identifier fragment more header total offset fragments length length identifier fragment more header total offset fragments length length
137 Fragmentation to an MTU of 512 sender must split the datagram into 3 fragments: Fragmentation identifier fragment more header total offset fragments length length identifier fragment more header total offset fragments length length identifier fragment more header total offset fragments length length
The Network Layer. Antonio Carzaniga. November 24, Faculty of Informatics Università della Svizzera italiana
The Network Layer Antonio Carzaniga Faculty of Informatics Università della Svizzera italiana November 24, 2017 Outline Basic network-layer architecture of a datagram network Introduction to forwarding
Position of IP and other network-layer protocols in TCP/IP protocol suite
Position of IP and other network-layer protocols in TCP/IP protocol suite IPv4 is an unreliable datagram protocol a best-effort delivery service. The term best-effort means that IPv4 packets can be corrupted,
Chapter 4 Network Layer: The Data Plane. Part A. Computer Networking: A Top Down Approach
Chapter 4 Network Layer: The Data Plane Part A All material copyright 996-06 J.F Kurose and K.W. Ross, All Rights Reserved Computer Networking: A Top Down Approach 7 th Edition, Global Edition Jim Kurose,
Chapter 4 Network Layer: The Data Plane
Chapter 4 Network Layer: The Data 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 see
Lecture 8. Network Layer (cont d) Network Layer 1-1
Lecture 8 Network Layer (cont d) Network Layer 1-1 Agenda The Network Layer (cont d) What is inside a router Internet Protocol (IP) IPv4 fragmentation and addressing IP Address Classes and Subnets Network
CSC 4900 Computer Networks: Network Layer
CSC 4900 Computer Networks: Network Layer Professor Henry Carter Fall 2017 Villanova University Department of Computing Sciences Review What is AIMD? When do we use it? What is the steady state profile
CPSC 826 Internetworking. The Network Layer: Routing & Addressing Outline. The Network Layer
1 CPSC 826 Intering The Network Layer: Routing & Addressing Outline The Network Layer Michele Weigle Department of Computer Science Clemson University mweigle@cs.clemson.edu November 10, 2004 Network layer
Lecture 3. The Network Layer (cont d) Network Layer 1-1
Lecture 3 The Network Layer (cont d) Network Layer 1-1 Agenda The Network Layer (cont d) What is inside a router? Internet Protocol (IP) IPv4 fragmentation and addressing IP Address Classes and Subnets
CSE 3214: Computer Network Protocols and Applications Network Layer
CSE 314: Computer Network Protocols and Applications Network Layer Dr. Peter Lian, Professor Department of Computer Science and Engineering York University Email: peterlian@cse.yorku.ca Office: 101C Lassonde
Chapter 4 Network Layer
Chapter 4 Network Layer Computer Networking: A Top Down Approach Featuring the Internet, 3 rd edition. Jim Kurose, Keith Ross Addison-Wesley, July 2004. Network Layer 4-1 Chapter 4: Network Layer Chapter
CS 3516: Computer Networks
Welcome to CS 3516: Computer Networks Prof. Yanhua Li Time: 9:00am 9:50am M, T, R, and F Location: AK 219 Fall 2018 A-term 1 Some slides are originally from the course materials of the textbook Computer
CS 3516: Advanced Computer Networks
Welcome to CS 3516: Advanced Computer Networks Prof. Yanhua Li Time: 9:00am 9:50am M, T, R, and F Location: Fuller 320 Fall 2017 A-term 1 Some slides are originally from the course materials of the textbook
Introduction to Computer Networking
Introduction to Computer Networking Antonio Carzaniga Faculty of Informatics University of Lugano September 17, 2014 Outline General course information Program Preliminary schedule Intro to computer networking:
CMPE 150/L : Introduction to Computer Networks. Chen Qian Computer Engineering UCSC Baskin Engineering Lecture 11
CMPE 150/L : Introduction to Computer Networks Chen Qian Computer Engineering UCSC Baskin Engineering Lecture 11 1 Midterm exam Midterm this Thursday Close book but one-side 8.5"x11" note is allowed (must
CMSC 332 Computer Networks Network Layer
CMSC 332 Computer Networks Network Layer Professor Szajda CMSC 332: Computer Networks Where in the Stack... CMSC 332: Computer Network 2 Where in the Stack... Application CMSC 332: Computer Network 2 Where
IP : Internet Protocol
1/20 IP : Internet Protocol Surasak Sanguanpong nguan@ku.ac.th http://www.cpe.ku.ac.th/~nguan Last updated: July 30, 1999 Agenda 2/20 IP functions IP header format Routing architecture IP layer 3/20 defines
1-1. Switching Networks (Fall 2010) EE 586 Communication and. October 25, Lecture 24
EE 586 Communication and Switching Networks (Fall 2010) Lecture 24 October 25, 2010 1-1 Announcements Midterm 1: Mean = 92.2 Stdev = 8 Still grading your programs (sorry about the delay) Network Layer
Lecture 16: Network Layer Overview, Internet Protocol
Lecture 16: Network Layer Overview, Internet Protocol COMP 332, Spring 2018 Victoria Manfredi Acknowledgements: materials adapted from Computer Networking: A Top Down Approach 7 th edition: 1996-2016,
CSC 401 Data and Computer Communications Networks
CSC 401 Data and Computer Communications Networks Network Layer Overview, Router Design, IP Sec 4.1. 4.2 and 4.3 Prof. Lina Battestilli Fall 2017 Chapter 4: Network Layer, Data Plane chapter goals: understand
Chapter 4. Computer Networking: A Top Down Approach 5 th edition. Jim Kurose, Keith Ross Addison-Wesley, sl April 2009.
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 can add, modify, and delete
Network Layer PREPARED BY AHMED ABDEL-RAOUF
Network Layer PREPARED BY AHMED ABDEL-RAOUF Network layer transport segment from sending to receiving host on sending side encapsulates segments into datagrams on receiving side, delivers segments to transport
Chapter 4: network layer. Network service model. Two key network-layer functions. Network layer. Input port functions. Router architecture overview
Chapter 4: chapter goals: understand principles behind services service models forwarding versus routing how a router works generalized forwarding instantiation, implementation in the Internet 4- Network
Last time. Wireless link-layer. Introduction. Characteristics of wireless links wireless LANs networking. Cellular Internet access
Last time Wireless link-layer Introduction Wireless hosts, base stations, wireless links Characteristics of wireless links Signal strength, interference, multipath propagation Hidden terminal, signal fading
The Network Layer and Routers
The Network Layer and Routers Daniel Zappala CS 460 Computer Networking Brigham Young University 2/18 Network Layer deliver packets from sending host to receiving host must be on every host, router in
Chapter 20 Network Layer: Internet Protocol 20.1
Chapter 20 Network Layer: Internet Protocol 20.1 Copyright The McGraw-Hill Companies, Inc. Permission required for reproduction or display. 20-1 INTERNETWORKING In this section, we discuss internetworking,
Chapter 4: network layer
Chapter 4: network layer chapter goals: understand principles behind network layer services: network layer service models forwarding versus routing how a router works routing (path selection) broadcast,
Computer Networks. Instructor: Niklas Carlsson
Computer Networks Instructor: Niklas Carlsson Email: niklas.carlsson@liu.se Notes derived from Computer Networking: A Top Down Approach, by Jim Kurose and Keith Ross, Addison-Wesley. The slides are adapted
Data Communication & Networks G Session 7 - Main Theme Networks: Part I Circuit Switching, Packet Switching, The Network Layer
Data Communication & Networks G22.2262-001 Session 7 - Main Theme Networks: Part I Circuit Switching, Packet Switching, The Network Layer Dr. Jean-Claude Franchitti New York University Computer Science
Network Layer: outline
Network Layer: outline 1 introduction 2 virtual circuit and datagram networks 3 what s inside a router 4 IP: Internet Protocol datagram format IPv4 addressing ICMP IPv6 5 routing algorithms link state
internet technologies and standards
Institute of Telecommunications Warsaw University of Technology 2017 internet technologies and standards Piotr Gajowniczek Andrzej Bąk Michał Jarociński Network Layer The majority of slides presented in
IP - The Internet Protocol. Based on the slides of Dr. Jorg Liebeherr, University of Virginia
IP - The Internet Protocol Based on the slides of Dr. Jorg Liebeherr, University of Virginia Orientation IP (Internet Protocol) is a Network Layer Protocol. IP: The waist of the hourglass IP is the waist
COMP211 Chapter 4 Network Layer: The Data Plane
COMP211 Chapter 4 Network Layer: The Data Plane All material copyright 1996-2016 J.F Kurose and K.W. Ross, All Rights Reserved Computer Networking: A Top Down Approach 7 th edition Jim Kurose, Keith Ross
Lecture 4 - Network Layer. Transport Layer. Outline. Introduction. Notes. Notes. Notes. Notes. Networks and Security. Jacob Aae Mikkelsen
Lecture 4 - Network Layer Networks and Security Jacob Aae Mikkelsen IMADA September 23, 2013 September 23, 2013 1 / 67 Transport Layer Goals understand principles behind network layer services: network
Key Network-Layer Functions
Network Layer: Routing & Forwarding Instructor: Anirban Mahanti Office: ICT 745 Email: mahanti@cpsc.ucalgary.ca Class Location: ICT 121 Lectures: MWF 12:00 12:50 hours Notes derived from Computer Networking:
Ref: A. Leon Garcia and I. Widjaja, Communication Networks, 2 nd Ed. McGraw Hill, 2006 Latest update of this lecture was on
IP Version 4 (IPv4) Header (Continued) Identification (16 bits): One of the parameters of any network is the maximum transmission unit (MTU) parameter. This parameter specifies the maximum size of the
CSCE 463/612 Networks and Distributed Processing Spring 2018
CSCE 463/612 Networks and Distributed Processing Spring 2018 Network Layer II Dmitri Loguinov Texas A&M University April 3, 2018 Original slides copyright 1996-2004 J.F Kurose and K.W. Ross 1 Chapter 4:
Network Layer: Control/data plane, addressing, routers
Network Layer: Control/data plane, addressing, routers CS 352, Lecture 10 http://www.cs.rutgers.edu/~sn624/352-s19 Srinivas Narayana (heavily adapted from slides by Prof. Badri Nath and the textbook authors)
LS Example 5 3 C 5 A 1 D
Lecture 10 LS Example 5 2 B 3 C 5 1 A 1 D 2 3 1 1 E 2 F G Itrn M B Path C Path D Path E Path F Path G Path 1 {A} 2 A-B 5 A-C 1 A-D Inf. Inf. 1 A-G 2 {A,D} 2 A-B 4 A-D-C 1 A-D 2 A-D-E Inf. 1 A-G 3 {A,D,G}
Router Architecture Overview
Chapter 4: r Introduction (forwarding and routing) r Review of queueing theory r Router design and operation r IP: Internet Protocol m IPv4 (datagram format, addressing, ICMP, NAT) m Ipv6 r Generalized
OSI Network Layer. Network Fundamentals Chapter 5. Version Cisco Systems, Inc. All rights reserved. Cisco Public 1
OSI Network Layer Network Fundamentals Chapter 5 Version 4.0 1 Objectives Identify the role of the Network Layer, as it describes communication from one end device to another end device. Examine the most
TSIN02 - Internetworking
Lecture 2: Internet Protocol Literature: Forouzan: ch (4-6), 7-9 and ch 31 2004 Image Coding Group, Linköpings Universitet Lecture 2: IP Goals: Understand the benefits Understand the architecture IPv4
Chapter 4 Network Layer: The Data Plane
Chapter 4 Network Layer: The Data Plane Chapter 4: outline 4.1 Overview of Network layer data plane control plane 4.2 What s inside a router 4.3 IP: Internet Protocol datagram format fragmentation IPv4
Chapter 4: Network Layer
Chapter 4: Introduction (forwarding and routing) Review of queueing theory Routing algorithms Link state, Distance Vector Router design and operation IP: Internet Protocol IPv4 (datagram format, addressing,
The Internet Protocol (IP)
The Internet Protocol (IP) The Blood of the Internet (C) Herbert Haas 2005/03/11 "Information Superhighway is really an acronym for 'Interactive Network For Organizing, Retrieving, Manipulating, Accessing
Generic Architecture. EECS 122: Introduction to Computer Networks Switch and Router Architectures. Shared Memory (1 st Generation) Today s Lecture
Generic Architecture EECS : Introduction to Computer Networks Switch and Router Architectures Computer Science Division Department of Electrical Engineering and Computer Sciences University of California,
Routing, Routers, Switching Fabrics
Routing, Routers, Switching Fabrics Outline Link state routing Link weights Router Design / Switching Fabrics CS 640 1 Link State Routing Summary One of the oldest algorithm for routing Finds SP by developing
Chapter 5 OSI Network Layer
Chapter 5 OSI Network Layer The protocols of the OSI model Network layer specify addressing and processes that enable Transport layer data to be packaged and transported. The Network layer encapsulation
Topic 4a Router Operation and Scheduling. Ch4: Network Layer: The Data Plane. Computer Networking: A Top Down Approach
Topic 4a Router Operation and Scheduling Ch4: Network Layer: The Data Plane Computer Networking: A Top Down Approach 7 th edition Jim Kurose, Keith Ross Pearson/Addison Wesley April 2016 4-1 Chapter 4:
IPv4. Christian Grothoff.
IPv4 christian@grothoff.org http://grothoff.org/christian/ Sites need to be able to interact in one single, universal space. Tim Berners-Lee 1 The Network Layer Transports datagrams from sending to receiving
CSCI Computer Networks Fall 2016
source: computer-s-webdesign.com CSCI 4760 - Computer Networks Fall 2016 Instructor: Prof. Roberto Perdisci perdisci@cs.uga.edu These slides are adapted from the textbook slides by J.F. Kurose and K.W.
Chapter 4 Network Layer: The Data Plane
Chapter 4 Network Layer: The Data 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 see
IPv4 addressing, NAT. Computer Networking: A Top Down Approach 6 th edition Jim Kurose, Keith Ross Addison-Wesley.
IPv4 addressing, NAT http://xkcd.com/195/ Computer Networking: A Top Down Approach 6 th edition Jim Kurose, Keith Ross Addison-Wesley Some materials copyright 1996-2012 J.F Kurose and K.W. Ross, All Rights
Lecture 3: Packet Forwarding
Lecture 3: Packet Forwarding CSE 222A: Computer Communication Networks Alex C. Snoeren Thanks: Mike Freedman & Amin Vahdat Lecture 3 Overview Paper reviews Packet Forwarding IP Addressing Subnetting/CIDR
EECS 122: Introduction to Computer Networks Switch and Router Architectures. Today s Lecture
EECS : Introduction to Computer Networks Switch and Router Architectures Computer Science Division Department of Electrical Engineering and Computer Sciences University of California, Berkeley Berkeley,
Computer Networks ICS 651. IP Routing RIP OSPF BGP MPLS Internet Control Message Protocol IP Path MTU Discovery
Computer Networks ICS 651 IP Routing RIP OSPF BGP MPLS Internet Control Message Protocol IP Path MTU Discovery Routing Information Protocol DV modified with split horizon and poisoned reverse distance
CC231 Introduction to Networks Dr. Ayman A. Abdel-Hamid. Internet Protocol Suite
CC231 Introduction to Networks Dr. Ayman A. Abdel-Hamid College of Computing and Information Technology Arab bacademy for Science &T Technology and Maritime Transport Internet Protocol Suite IP Suite Dr.
EP2120 Internetworking/Internetteknik IK2218 Internets Protokoll och Principer
EP2120 Internetworking/Internetteknik IK2218 Internets Protokoll och Principer Homework Assignment 1 (Solutions due 20:00, Mon., 10 Sept. 2018) (Review due 20:00, Wed., 12 Sept. 2018) 1. IPv4 Addressing
Prof. Shervin Shirmohammadi SITE, University of Ottawa. Internet Protocol (IP) Lecture 2: Prof. Shervin Shirmohammadi CEG
Lecture 2: Internet Protocol (IP) Prof. Shervin Shirmohammadi SITE, University of Ottawa Prof. Shervin Shirmohammadi CEG 4185 2-1 Network Layer Provides the upper layers with independence from the data
Chapter 4 Network Layer
Chapter 4 Network Layer Reti degli Elaboratori Canale AL Prof.ssa Chiara Petrioli a.a. 2014/2015 We thank for the support material Prof. Kurose-Ross All material copyright 1996-2012 J.F Kurose and K.W.
cs144 Midterm Review Fall 2010
cs144 Midterm Review Fall 2010 Administrivia Lab 3 in flight. Due: Thursday, Oct 28 Midterm is this Thursday, Oct 21 (during class) Remember Grading Policy: - Exam grade = max (final, (final + midterm)/2)
STEVEN R. BAGLEY PACKETS
STEVEN R. BAGLEY PACKETS INTRODUCTION Talked about how data is split into packets Allows it to be multiplexed onto the network with data from other machines But exactly how is it split into packets and
CSE/EE 461 Lecture 13 Connections and Fragmentation. TCP Connection Management
CSE/EE 461 Lecture 13 Connections and Fragmentation Tom Anderson tom@cs.washington.edu Peterson, Chapter 5.2 TCP Connection Management Setup assymetric 3-way handshake Transfer sliding window; data and
Review for Chapter 4 R1,R2,R3,R7,R10,R11,R16,R17,R19,R22,R24, R26,R30 P1,P2,P4,P7,P10,P11,P12,P14,P15,P16,P17,P22,P24,P29,P30
Review for Chapter 4 R1,R2,R3,R7,R10,R11,R16,R17,R19,R22,R24, R26,R30 P1,P2,P4,P7,P10,P11,P12,P14,P15,P16,P17,P22,P24,P29,P30 R1. Let s review some of the terminology used in this textbook. Recall that
TCP /IP Fundamentals Mr. Cantu
TCP /IP Fundamentals Mr. Cantu OSI Model and TCP/IP Model Comparison TCP / IP Protocols (Application Layer) The TCP/IP subprotocols listed in this layer are services that support a number of network functions:
CMPE 80N: Introduction to Networking and the Internet
CMPE 80N: Introduction to Networking and the Internet Katia Obraczka Computer Engineering UCSC Baskin Engineering Lecture 17 CMPE 80N Spring'10 1 Announcements Next class: Presentation of fun projects
Chapter 7 Internet Protocol Version 4 (IPv4) Kyung Hee University
Chapter 7 Internet Protocol Version 4 (IPv4) 1 7.1 Introduction The transmission mechanism used by the TCP/IP Unreliable and connectionless datagram protocol Best-effort delivery service IP packets can
internet technologies and standards
Institute of Telecommunications Warsaw University of Technology 2015 internet technologies and standards Piotr Gajowniczek Andrzej Bąk Michał Jarociński Network Layer The majority of slides presented in
EC441 Fall 2018 Introduction to Computer Networking Chapter4: Network Layer Data Plane
EC441 Fall 2018 Introduction to Computer Networking Chapter4: Network Layer Data Plane This presentation is adapted from slides produced by Jim Kurose and Keith Ross for their book, Computer Networking:
CSE/EE 461 The Network Layer. Application Presentation Session Transport Network Data Link Physical
CSE/EE 461 The Network Layer Application Presentation Session Transport Network Data Link Physical This Lecture Focus: What to do when one wire isn t big enough? Point to point link Broadcast link (Ethernet
Quiz. Segment structure and fields Flow control (rwnd) Timeout interval. Phases transition ssthresh setting Cwnd setting
Quiz v 10/30/2013 (Wednesday), 20 mins v Midterm question (available on website) v TCP basics Segment structure and fields Flow control (rwnd) Timeout interval v TCP Congestion control Phases transition
Chapter 2 - Part 1. The TCP/IP Protocol: The Language of the Internet
Chapter 2 - Part 1 The TCP/IP Protocol: The Language of the Internet Protocols A protocol is a language or set of rules that two or more computers use to communicate 2 Protocol Analogy: Phone Call Parties
COMPUTER NETWORK. Homework #3. Due Date: May 22, 2017 in class
Computer Network Homework#2 COMPUTER NETWORK Homework #3 Due Date: May 22, 2017 in class Question 1 Host A and B are communicating over a TCP connection, and Host B has already received from A all bytes
Ch.7 Internet Protocol: Connectionless Datagram Delivery (IPv4, IPv6)
CSC521 Communication Protocols 網路通訊協定 Ch.7 Internet Protocol: Connectionless Datagram Delivery (IPv4, IPv6) 吳俊興國立高雄大學資訊工程學系 Internetworking With TCP/IP, Vol I: Sixth Edition, Douglas E. Comer Outline 1
EE-311 Data Communication & Networks
National University of Computer & Emerging Sciences, Islamabad, Pakistan Name: Roll No: EE-311 Data Communication & Networks Summer 2007 Final Thursday, 2 nd August 2007 Total Time: 3 Hours Total Marks:
Goal of Today s Lecture. EE 122: Designing IP. The Internet Hourglass. Our Story So Far (Context) Our Story So Far (Context), Con t
Goal of Today s Lecture EE 122: Designing IP Ion Stoica TAs: Junda Liu, DK Moon, David Zats http://inst.eecs.berkeley.edu/~ee122/ (Materials with thanks to Vern Paxson, Jennifer Rexford, and colleagues
Chapter 5 End-to-End Protocols
Chapter 5 End-to-End Protocols Transport layer turns the host-to-host packet delivery service of the underlying network into a process-to-process communication channel Common properties that application
The Network Layer Forwarding Tables and Switching Fabric
The Network Layer Forwarding Tables and Switching Fabric Smith College, CSC 249 February 27, 2018 1 Network Layer Overview q Network layer services v v Desired services and tasks Actual services and tasks
EEC-484/584 Computer Networks
EEC-484/584 Computer Networks Lecture 13 wenbing@ieee.org (Lecture nodes are based on materials supplied by Dr. Louise Moser at UCSB and Prentice-Hall) Outline 2 Review of lecture 12 Routing Congestion
EE 610 Part 2: Encapsulation and network utilities
EE 610 Part 2: Encapsulation and network utilities Objective: After this experiment, the students should be able to: i. Understand the format of standard frames and packet headers. Overview: The Open Systems
The Internet. The Internet is an interconnected collection of netw orks.
The Internet The Internet is an interconnected collection of netw orks. Internetw orking-1 Internetworking! Communications Network: A facility that provides a data transfer service among stations attached
CS610 Computer Network Final Term Papers Solved MCQs with reference by Virtualians Social Network
CS610 Computer Network Final Term Papers Solved MCQs with reference by Virtualians Social Network Question No: 1( M a r k s: 1 ) A ---------- Relies on the hardware manufacturer to assign a unique physical
Lecture 2 Communication services The Trasport Layer. Antonio Cianfrani DIET Department Networking Group netlab.uniroma1.it
Lecture 2 Communication services The Trasport Layer Antonio Cianfrani DIET Department Networking Group netlab.uniroma1.it The structure edge: applications and hosts core: routers of s access s, media:
CS 458 Internet Engineering Spring First Exam
CS 458 Internet Engineering Spring 2005 First Exam Instructions (read carefully): There are 6 problems for a total of 60 points. This is a closed book and closed notes in-class exam. If any problem is
Computer Networking Course Introduction
Computer Networking Course Introduction Antonio Carzaniga Faculty of Informatics Università della Svizzera italiana September 20, 2017 Outline General course information Program Preliminary schedule Intro
Course 6. Internetworking Routing 1/33
Course 6 Internetworking Routing 1/33 Routing The main function of the network layer is routing packets from the source machine to the destination machine. Along the way, at least one intermediate node
interface Question 1. a) Applications nslookup/dig Web Application DNS SMTP HTTP layer SIP Transport layer OSPF ICMP IP Network layer
TDTS06 Computer networks, August 23, 2008 Sketched answers to the written examination, provided by Juha Takkinen, IDA, juhta@ida.liu.se. ( Sketched means that you, in addition to the below answers, need
TSIN02 - Internetworking
Lecture 4: Transport Layer Literature: Forouzan: ch 11-12 2004 Image Coding Group, Linköpings Universitet Lecture 4: Outline Transport layer responsibilities UDP TCP 2 Transport layer in OSI model Figure
Lecture 9: Internetworking
Lecture 9: Internetworking CSE 123: Computer Networks Alex C. Snoeren HW 2 due WEDNESDAY So what does IP do? Addressing Fragmentation E.g. FDDI s maximum packet is 4500 bytes while Ethernet is 1500 bytes,
b. Suppose the two packets are to be forwarded to two different output ports. Is it
Problem-1:[15] Suppose two packets arrive to two different input ports of a router at exactly the same time. Also suppose there are no other packets anywhere in the router. a. Suppose the two packets are
COMPUTER NETWORK. Homework #3. Due Date: May 22, 2017 in class
Computer Network Homework#3 COMPUTER NETWORK Homework #3 Due Date: May 22, 2017 in class Question 1 Host A and B are communicating over a TCP connection, and Host B has already received from A all bytes
Network Layer: Router Architecture, IP Addressing
Network Layer: Router Architecture, IP Addressing UG3 Computer Communications & Networks (COMN) Mahesh Marina mahesh@ed.ac.uk Slides thanks to Myungjin Lee and copyright of Kurose and Ross Router Architecture
Chapter 4 Network Layer: The Data Plane
Chapter 4 Network Layer: The Data 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 see
Outline. Routing. Introduction to Wide Area Routing. Classification of Routing Algorithms. Introduction. Broadcasting and Multicasting
Outline Routing Fundamentals of Computer Networks Guevara Noubir Introduction Broadcasting and Multicasting Shortest Path Unicast Routing Link Weights and Stability F2003, CSG150 Fundamentals of Computer
CS 455 Internet Architecture, Page 3 ffl By 1985, the ARPANET was heavily used and congested; the National Science Foundation (NSF) initiated the NSFN
CS 455 Internet Architecture, Page 1 Network Layer, Part 3 Internet Architecture These slides are created by Dr. Yih Huang of George Mason University. Students registered in Dr. Huang's courses at GMU
CS 455: INTRODUCTION TO DISTRIBUTED SYSTEMS [NETWORKING] Frequently asked questions from the previous class surveys
![CS 455: INTRODUCTION TO DISTRIBUTED SYSTEMS [NETWORKING] Frequently asked questions from the previous class surveys](/thumbs/95/126288389.jpg "CS 455: INTRODUCTION TO DISTRIBUTED SYSTEMS [NETWORKING] Frequently asked questions from the previous class surveys")
CS 455: INTRODUCTION TO DISTRIBUTED SYSTEMS [NETWORKING] The Receiver's Buffer Small it may be But throttle the mightiest sender It can Not just the how much But also the when Or if at all Shrideep Pallickara
Inter-networking. Problem. 3&4-Internetworking.key - September 20, LAN s are great but. We want to connect them together. ...
1 Inter-networking COS 460 & 540 2 Problem 3 LAN s are great but We want to connect them together...across the world Inter-networking 4 Internet Protocol (IP) Routing The Internet Multicast* Multi-protocol
CS 356: Computer Network Architectures. Lecture 10: IP Fragmentation, ARP, and ICMP. Xiaowei Yang
CS 356: Computer Network Architectures Lecture 10: IP Fragmentation, ARP, and ICMP Xiaowei Yang xwy@cs.duke.edu Overview Homework 2-dimension parity IP fragmentation ARP ICMP Fragmentation and Reassembly
Internet Protocol. Outline Introduction to Internet Protocol Header and address formats ICMP Tools CS 640 1
Internet Protocol Outline Introduction to Internet Protocol Header and address formats ICMP Tools CS 640 1 Internet Protocol Runs on all hosts in the Internet and enables packets to be routed between systems
II. Principles of Computer Communications Network and Transport Layer
II. Principles of Computer Communications Network and Transport Layer A. Internet Protocol (IP) IPv4 Header An IP datagram consists of a header part and a text part. The header has a 20-byte fixed part
Lecture 17 Overview. Last Lecture. Wide Area Networking (2) This Lecture. Internet Protocol (1) Source: chapters 2.2, 2.3,18.4, 19.1, 9.
Lecture 17 Overview Last Lecture Wide Area Networking (2) This Lecture Internet Protocol (1) Source: chapters 2.2, 2.3,18.4, 19.1, 9.2 Next Lecture Internet Protocol (2) Source: chapters 19.1, 19.2, 22,1