1 control Networking: Network layer Comp Sci 3600 Security
2 Outline control 1 2 control 3 4 5
3 Network layer control
4 Outline control 1 2 control 3 4 5
5 Network layer purpose: control Role of the network layer is simple, to move packets from a sending host to a receiving host. Two important network-layer functions can be identified: Forwarding: When a packet arrives at a router s input link, the router must move the packet to the appropriate output link. For example, a packet arriving from Host H1 to R1 must be forwarded to the next router on a path to H2. : The network layer must determine the route or path taken by packets as they flow from a sender to a receiver. The algorithms that calculate these paths are referred to as algorithms. A algorithm would determine, for example, the path along which packets flow from H1 to H2.
6 v4 address control
7 algorithms build forwarding tables control
8 Every router has a forwarding table control A router forwards a packet by examining the value of a field in the arriving packet s header, and then using this header value to index into the router s forwarding table. The value stored in the forwarding table entry for that header indicates the router s outgoing link interface to which that packet is to be forwarded. The algorithm may be centralized (e.g., with an algorithm executing on a central site and downloading information to each of the routers) or decentralized (i.e., with a piece of the distributed algorithm running in each router). In either case, a router receives protocol messages, which are used to configure its forwarding table.
9 Outline control 1 2 control 3 4 5
10 control In a datagram network, each time an end system wants to send a packet, it stamps the packet with the address of the destination end system and then pops the packet into the network.
11 packet control As a packet is transmitted from source to destination, it passes through a series of routers. Each of these routers uses the packet s destination address to forward the packet. Specifically, each router has a forwarding table that maps destination addresses to link interfaces; when a packet arrives at the router, the router uses the packet s destination address to look up the appropriate output link interface in the forwarding table. The router then forwards the packet to that output link interface.
12 tables control Suppose that our router has four links, numbered 0 through 3, and that packets are to be forwarded to the link interfaces as follows:
13 Longest prefix match control When there are multiple matches, the router uses the longest prefix matching rule; that is, it finds the longest matching entry in the table and forwards the packet to the link interface associated with the longest prefix match.
14 Outline control 1 2 control 3 4 5
15 architecture control and management functions collectively referred to as the router control plane, usually implemented in software and execute on the processor (typically a traditional CPU) Forwarding functions collectively referred to as the router forwarding plane
16 Input ports: control Physical layer function of terminating an incoming physical link Link-layer functions needed to interoperate with the link layer at the other side of the incoming link Lookup function is also performed at the input port; this will occur in the rightmost box of the input port. It is here that the forwarding table is consulted to determine the router output port to which an arriving packet will be forwarded via the switching fabric. Control packets (for example, packets carrying protocol information) are forwarded from an input port to the processor. Term port here, referring to the physical input and output router interfaces, is different from the software ports associated with network applications and sockets
17 fabric: control The switching fabric connects the router s input ports to its output ports. This switching fabric is completely contained within the router, a network inside of a network router!
18 ports: control Stores packets received from the switching fabric and transmits these packets on the outgoing link by performing the necessary link-layer and physical-layer functions. When a link is bidirectional (that is, carries traffic in both directions), an output port will typically be paired with the input port for that link
19 processor: control The processor executes the protocols, maintains tables and attached link state information, and computes the forwarding table for the router. It also performs the network management functions
20 Outline control 1 2 control 3 4 5
21 control The lookup performed in the input port is central to the router s operation. It is here that the router uses the forwarding table to look up the output port to which an arriving packet will be forwarded via the switching fabric. The forwarding table is computed and updated by the processor, with a shadow copy typically stored at each input port. Search through the forwarding table looking for the longest prefix match Once a packet s output port has been determined via the lookup, the packet can be sent into the switching fabric.
22 Outline control 1 2 control 3 4 5
23 architecture variation control Which is fastest?
24 Outline control 1 2 control 3 4 5
25 control Takes packets that have been stored in the output port s memory and transmits them over the output link. This includes selecting and de-queueing packets for transmission, and performing the needed link-layer and physical-layer transmission functions.
26 Outline control 1 2 control 3 4 5
27 control As queues grow large, the router s memory can eventually be exhausted and packet loss will occur when no memory is available to store arriving packets.
28 port queuing control
29 Head of line (HOL) blocking in input queuing control
30 Outline control 1 2 control 3 4 5
31 control (more to come) control
32 Outline control 1 2 control 3 4 5
33 Network layer components control
34 Outline control 1 2 control 3 4 5
35 v4 address control
36 v4 header control
37 v4 header control Version number. 4 bits specify the protocol version of the datagram. can determine how to interpret the remainder of the datagram. Different versions of use different data-gram formats. Header length. Because an can contain a variable number of options (which are included in the header), these 4 bits are needed to determine where in the datagram the data actually begins. Most datagrams do not contain options, so the typical datagram has a 20-byte header. Type of service. included in the v4 header to allow different types of datagrams (for example, datagrams particularly requiring low delay, high throughput, or reliability) to be distinguished from each other. For example, it might be useful to distinguish real-time datagrams (such as those used by an telephony application) from non-real-time traffic (for example, FTP).
38 v4 header control length. total length of the datagram (header plus data), measured in bytes. s are rarely larger than 1,500 bytes. Identifier, flags, fragmentation offset. These three fields have to do with so-called fragmentation. Time-to-live. included to ensure that datagrams do not circulate forever (due to, for example, a long-lived loop) Decremented by one each time the datagram is processed by a router. If the TTL field reaches 0, the datagram must be dropped. Protocol. Used only when an datagram reaches its final destination. Value of this field indicates the specific transport-layer protocol to which the data portion of this datagram should be passed. For example, a value of 6 indicates that the data portion is passed to TCP, while a value of 17 indicates that the data is passed to UDP.
39 v4 header control Header checksum. aids a router in detecting bit errors in a received datagram. Source and destination addresses. When a source creates a datagram, it inserts its address into the source address field and inserts the address of the ultimate destination into the destination address field. Often the source host determines the destination address via a DNS lookup. Options. allow an header to be extended. Header options were meant to be used rarely. Data (payload). In most circumstances, the data field of the datagram contains the transport-layer segment to be delivered to the destination. Total of 20 bytes of header (assuming no options). If the datagram carries a TCP segment, then each (nonfragmented) datagram carries a total of 40 bytes of header (20 bytes of header plus 20 bytes of TCP header) along with message.
40 v4 header details control
41 v4 header details control Version The first header field in an packet is the four-bit version field. Header Length (IHL) The Header Length (IHL) field has 4 bits, which is the number of 32-bit words. Since an v4 header may contain a variable number of options, this field specifies the size of the header (this also coincides with the offset to the data). Differentiated Services Code Point (DSCP) Originally defined as the Type of service (ToS) field. An example is Voice over (Vo), which is used for interactive data voice exchange. Explicit Congestion Notification (ECN) This field is defined in RFC 3168 and allows end-to-end notification of network congestion without dropping packets. ECN is an optional feature that is only used when both endpoints support it and are willing to use it. It is only effective when supported by the underlying network.
42 v4 header details control Total Length This 16-bit field defines the entire packet size in bytes, including header and data. The minimum size is 20 bytes (header without data) and the maximum is 65,535 bytes. All hosts are required to be able to reassemble datagrams of size up to 576 bytes, but most modern hosts handle much larger packets. Sometimes links impose further restrictions on the packet size, in which case datagrams must be fragmented. Fragmentation in v4 is handled in either the host or in routers. Identification This field is an identification field and is primarily used for uniquely identifying the group of fragments of a single datagram. Flags A three-bit field follows and is used to control or identify fragments. They are (in order, from most significant to least significant):
43 v4 header details control Fragment Offset The fragment offset field is measured in units of eight-byte blocks. It is 13 bits long and specifies the offset of a particular fragment relative to the beginning of the original unfragmented datagram. Time To Live (TTL) An eight-bit time to live field helps prevent datagrams from persisting (e.g. going in circles) on an internet. It is specified in seconds, but time intervals less than 1 second are rounded up to 1. In practice, the field has become a hop countwhen the datagram arrives at a router, the router decrements the TTL field by one. When the TTL field hits zero, the router discards the packet and typically sends an Time Exceeded message to the sender. The program traceroute uses these Time Exceeded messages to print the routers used by packets to go from the source to the destination. Protocol This field defines the protocol used in the data portion of the datagram.
44 v4 header details control Header Checksum The 16-bit checksum field is used for error-checking of the header. When a packet arrives at a router, the router calculates the checksum of the header and compares it to the checksum field. If the values do not match, the router discards the packet. Errors in the data field must be handled by the encapsulated protocol. Source address This field is the v4 address of the sender of the packet. Note that this address may be changed in transit by a network address translation device. Destination address This field is the v4 address of the receiver of the packet. As with the source address, this may be changed in transit by a network address translation device. Options The options field is not often used. Data The data portion of the packet is not included in the packet checksum. Its contents are interpreted based on the value of the Protocol header field.
45 v4 fragmentation control
46 addresses in routers control The boundary between the host and the physical link is called an interface. The boundary between the router and any one of its links is also called an interface. A router thus has multiple interfaces, one for each of its links. Because every host and router is capable of sending and receiving datagrams, requires each host and router interface to have its own address. Thus, an address is technically associated with an interface, rather than with the host or router containing that interface.
47 v4 address control about 4 billion addresses
48 Interface addresses and subnets control
49 Subnet addressing control
50 Subnet addressing control To determine the subnets, detach each interface from its host or router, creating islands of isolated, with interfaces terminating the end points of the isolated. Each of these isolated is called a subnet.
51 Three routers interconnecting six subnets control
52 Obtaining address blocks control ISP provides addresses from a larger block of addresses that had already been allocated to the ISP. For example, the ISP may itself have been allocated the address block /20. The ISP, in turn, could divide its address block into eight equal-sized contiguous address blocks and give one of these address blocks out to each of up to eight organizations that are supported by this ISP, as shown below. (underlined the subnet part of these addresses for your convenience.)
53 control Dynamic Host Configuration Protocol (DHCP) client-server
54 DHCP process control DHCP discover message, which a client sends within a UDP packet to port 67, broadcast A DHCP server receiving a DHCP discover message responds to the client with a DHCP offer message that is broadcast to all nodes on the subnet, again using the broadcast address of DHCP request. The newly arriving client will choose from among one or more server offers and respond to its selected offer with a DHCP request message, echoing back the configuration parameters. DHCP ACK. The server responds to the DHCP request message with a DHCP ACK message, confirming the requested parameters.
55 DHCP query response control
56 Network address translation (NAT) control NAT router behaves to the outside world as a single device with a single address, matching external ports to internal network /port combinations What are problems with NAT?
57 Outline control 1 2 control 3 4 5
58 Control Message Protocol () control is often considered part of but architecturally it lies just above, as messages are carried inside datagrams. That is, messages are carried as payload, just as TCP or UDP segments are carried as payload. Similarly, when a host receives an datagram with specified as the upper-layer protocol, it demultiplexes the datagram s contents to, just as it would demultiplex a datagram s content to TCP or UDP. The well-known ping program sends an type 8 code 0 message to the specified host. The destination host, seeing the echo request, sends back a type 0 code 0 echo reply. Most TCP/ implementations support the ping server directly in the operating system; that is, the server is not a process Traceroute uses
59 Control Message Protocol () control
60 Outline control 1 2 control 3 4 5
61 v6 address format control
62 v6 header control
63 The most important changes introduced in v6: control Expanded addressing capabilities. v6 increases the size of the address from 32 to 128 bits. This ensures that the world won t run out of addresses. Now, every grain of sand on the planet can be -addressable. In addition to unicast and multicast addresses, v6 has introduced a new type of address, called an address, which allows a datagram to be delivered to any one of a group of hosts. This feature could be used, for example, to send an HTTP GET to the nearest of a number of mirror sites that contain a given document.
64 The most important changes introduced in v6: control A streamlined 40-byte header. A number of v4 fields have been dropped or made optional. The resulting 40-byte fixed-length header allows for faster of the datagram. A new encoding of options allows for more flexible options.
65 The most important changes introduced in v6: control Flow labeling and priority. v6 has an elusive definition of a flow. RFC 1752 and RFC 2460 state that this allows labeling of packets belonging to particular flows for which the sender requests special handling, such as a nondefault quality of service or real-time service. For example, audio and video transmission might likely be treated as a flow. On the other hand, the more traditional applications, such as file transfer and , might not be treated as flows. It is possible that the traffic carried by a high-priority user (for example, someone paying for better service for their traffic) might also be treated as a flow.
66 The following fields are defined in v6: control Version. This 4-bit field identifies the version number. Not surprisingly, v6 carries a value of 6 in this field. Note that putting a 4 in this field does not create a valid. If it did, life would be a lot simpler, see the discussion below regarding the transition from v4 to v6. Traffic class. This 8-bit field is similar in spirit to the TOS field we saw in v4. Flow label. As discussed above, this 20-bit field is used to identify a flow of datagrams. Payload length. This 16-bit value is treated as an unsigned integer giving the number of bytes in the v6 datagram following the fixed-length, 40-byte data- gram header.
67 The following fields are defined in v6: control Next header. This field identifies the protocol to which the contents (data field) of this datagram will be delivered (for example, to TCP or UDP). The field uses the same values as the protocol field in the v4 header. Hop limit. The contents of this field are decremented by one by each router that forwards the datagram. If the hop limit count reaches zero, the datagram is discarded. Source and destination addresses. The various formats of the v6 128-bit address are described in RFC Data. This is the payload portion of the. When the datagram reaches its destination, the payload will be removed from the datagram and passed on to the protocol specified in the next header field.
68 v6 header details control
69 v6 header details control Traffic class. 8-bit field is similar in spirit to the TOS field we saw in v4. Flow label. datagrams. 20-bit field is used to identify a flow of Payload length. This 16-bit value is treated as an unsigned integer giving the number of bytes in the v6 datagram following the fixed-length, 40-byte datagram header. Next header. This field identifies the protocol to which the contents (data field) of this datagram will be delivered (for example, to TCP or UDP). The field uses the same values as the protocol field in the v4 header. Hop limit. The contents of this field are decremented by one by each router that forwards the datagram. If the hop limit count reaches zero, the datagram is discarded.
70 v6 header details control Source and destination addresses. The various formats of the v6 128-bit address are described in RFC Data. This is the payload portion of the. When the datagram reaches its destination, the payload will be removed from the datagram and passed on to the protocol specified in the next header field.
71 Backwards compatibility via dual-stack control
72 Backwards compatibility via tunneling control
73 Outline control 1 2 control 3 4 5
74 control While TLS or SSH secure application layer, end-to-end encrypts the network layer. Cryptographic agreement. two communicating hosts to agree on cryptographic algorithms and keys. Encryption of datagram payloads. When the sending host receives a segment from the transport layer, encrypts the payload. The payload can only be decrypted by in the receiving host. Data integrity. allows the receiving host to verify that the datagram s header fields and encrypted payload were not modified while the datagram was en route from source to destination. Origin authentication. When a host receives an datagram from a trusted source (with a trusted key see), the host is assured that the source address in the datagram is the actual source of the datagram.
75 control When two hosts have an session established between them, all TCP and UDP segments sent between them will be encrypted and authenticated. therefore provides blanket coverage, securing all communication between the two hosts for all network applications.
76 Outline control 1 2 control 3 4 5
77 Abstract graph model of a computer network control Given any two nodes x and y, there are typically many paths between the two nodes, with each path having a cost. One or more of these paths is a least-cost path.
78 Outline control 1 2 control 3 4 5
79 table building algorithm control A global algorithm computes the least-cost path between a source and destination using complete, global knowledge about the network. That is, the algorithm takes the connectivity between all nodes and all link costs as inputs. broadcast to all nodes in the network, and then centrally perform Dijkstra s algorithm to find the shortest path on a graph
80 Least cost path and forwarding table for nodule u control
81 Outline control 1 2 control 3 4 5
82 table building algorithm control In a decentralized algorithm, the calculation of the least-cost path is carried out in an iterative, distributed manner. No node has complete information about the costs of all network links. Instead, each node begins with only the knowledge of the costs of its own directly attached links. Then, through an iterative process of calculation and exchange of information with its neighboring nodes (that is, nodes that are at the other end of links to which it itself is attached), a node gradually calculates the least-cost path to a destination or set of destinations.
83 Distance-vector (DV) algorithm control
84 Outline control 1 2 control 3 4 5
85 control : interconnected autonomous systems (AS)
86 Autonomous systems control Autonomous systems (ASs) consist of a group of router typically under the same administrative control (e.g., operated by the same ISP or belonging to the same company network). s within the same AS all run the same algorithm and have information about each other. The algorithm running within an autonomous system is called an intra-autonomous system protocol. Obtaining reachability information from neighboring ASs and propagating the reachability information to all routers internal to the AS, are handled by the inter-as protocol. Since the inter-as protocol involves communication between two ASs, the two communicating ASs must run the same inter-as protocol. In the all ASs run the same inter-as protocol, called BGP4
87 Outline control 1 2 control 3 4 5
88 Outline control 1 2 control 3 4 5
89 Distributed: Information Protocol (R) control Each router maintains a R table known as a table. A router s table includes both the router s distance vector and the router s forwarding table.
90 Distributed: Information Protocol (R) control
91 Outline control 1 2 control 3 4 5
92 Central: Open Shortest Path First (OSPF) control Used by mega-isps OSPF was conceived as the successor to R and as such has a number of advanced features. At its heart, however, OSPF is a link-state protocol that uses flooding of link-state information and a Dijkstra least-cost path algorithm. With OSPF, a router constructs a complete topological map (that is, a graph) of the entire autonomous system. The router then locally runs Dijkstra s shortest-path algorithm to determine a shortest-path tree to all subnets, with itself as the root node. Individual link costs are configured by the network administrator
93 Outline control 1 2 control 3 4 5
94 Border Gateway Protocol version 4 (BGP4) control
95 BGP provides each A.S. a means to: control 1 Obtain subnet reachability information from neighboring ASs. 2 Propagate the reachability information to all routers internal to the AS. 3 Determine good routes to subnets based on the reachability information and on AS policy. Most importantly, BGP allows each subnet to advertise its existence to the rest of the. A subnet screams I exist and I am here, and BGP makes sure that all the ASs in the know about the subnet and how to get there. If it weren t for BGP, each subnet would be isolated, alone and unknown by the rest of the.
96 Border Gateway Protocol version 4 (BGP4) control BGP session that spans two ASs is called an external BGP (ebgp) session BGP session between routers in the same AS is called an internal BGP (ibgp) session
97 Outline control 1 2 control 3 4 5
98 control In broadcast, the network layer provides a service of delivering a packet sent from a source node to all other nodes in the network; Multicast enables a single source node to send a copy of a packet to a subset of the other network nodes. v6 has introduced a new type of address, called an address, which allows a datagram to be delivered to any one of a group of hosts. This feature could be used, for example, to send an HTTP GET to the nearest of a number of mirror sites that contain a given document
99 Broadcast control When a host sends a datagram with destination address , the message is delivered to all hosts on the same subnet.
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 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:
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
Department of Computer and IT Engineering University of Kurdistan Network Layer By: Dr. Alireza Abdollahpouri What s the Internet: nuts and bolts view PC server wireless laptop cellular handheld millions
Network layer: Overview Network layer functions IP Routing and forwarding NAT ARP IPv6 Routing 1 Network Layer Functions Transport packet from sending to receiving hosts Network layer protocols in every
Chair for Network Architectures and Services Prof. Carle Department for Computer Science TU München Master Course Computer Networks IN2097 Prof. Dr.-Ing. Georg Carle Christian Grothoff, Ph.D. Chair for
The Internet Evolved from the ARPANET (the Advanced Research Projects Agency Network), a project funded by The U.S. Department of Defense (DOD) in 1969. ARPANET's purpose was to provide the U.S. Defense
Network Layer: Internet Protocol Motivation Heterogeneity Scale Intering IP is the glue that connects heterogeneous s giving the illusion of a homogenous one. Salient Features Each host is identified by
ECE 4450:427/527 - Computer Networks Spring 2017 Dr. Nghi Tran Department of Electrical & Computer Engineering Lecture 6.2: IP Dr. Nghi Tran (ECE-University of Akron) ECE 4450:427/527 Computer Networks
Computer Network Architectures and Multimedia Guy Leduc Chapter 2 MPLS networks Chapter based on Section 5.5 of Computer Networking: A Top Down Approach, 6 th edition. Jim Kurose, Keith Ross Addison-Wesley,
Hierarchical Routing Our routing study thus far - idealization all routers identical network flat not true in practice scale: with 200 million destinations: can t store all destinations in routing tables!
Hierarchical Routing Our routing study thus far - idealization all routers identical network flat not true in practice scale: with 200 million destinations: can t store all destinations in routing tables!
CMPE 344 Computer Networks Spring 2012 Internetworking Part 2 Reading: Peterson and Davie, 3.2, 4.1 19/04/2012 1 Aim and Problems Aim: Build networks connecting millions of users around the globe spanning
1 v4 & v6 Header Comparison v6 Ver Time to Live v4 Header IHL Type of Service Identification Protocol Flags Source Address Destination Address Total Length Fragment Offset Header Checksum Ver Traffic Class
RMIT University Data Communication and Net-Centric Computing COSC 1111/2061 Internetworking IPv4, IPv6 Technology Slide 1 Lecture Overview During this lecture, we will understand The principles of Internetworking
CHAPTER 18 INTERNET PROTOCOLS ANSWERS TO QUESTIONS 18.1 (1) The communications network may only accept blocks of data up to a certain size. (2) Error control may be more efficient with a smaller PDU size.
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
ECE 428 Internet Protocols (Network Layer: Layer 3) 1 Done so far MAC protocols (with PHYsical layer) Transport bits from one node to another. Key element: Determine WHEN to transmit DLC protocol (running
Announcements CS 5565 Network Architecture and Protocols Lecture 20 Godmar Back Project 2B due in 2 parts: Apr 29 and May 6 Extra Credit Opportunities: Expand simulator (and your implementation) to introduce
Lecture 2 Outline Addressing on the network layer ICMP IPv6 Addressing on the link layer Virtual circuits TCP/IP protocol suite Good name for our book! User application, e.g., http with Mozilla Communication
IPv6 : Internet Protocol Version 6 History Internet growth was faster than anticipated In early 1990 s, it was realized that we may run out of IPv4 addresses somewhere between 2000 and 2010 Also, experiences
Introduction to routing in the Internet Internet architecture IPv4, ICMP, ARP Addressing, routing principles (Chapters 2 3 in Huitema) Internet-1 Internet Architecture Principles End-to-end principle by
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
Prof. Dr. Hans Peter Großmann mit M. Rabel sowie H. Hutschenreiter und T. Nau Sommersemester 2012 Institut für Organisation und Management von Informationssystemen Lecture Computer Networks Internet Protocol
TCP/IP Protocol Suite Computer Networks Lecture 5 http://goo.gl/pze5o8 TCP/IP Network protocols used in the Internet also used in today's intranets TCP layer 4 protocol Together with UDP IP - layer 3 protocol
Chapter 4 Network Layer Computer Networking A Top-Down Approach These slides are based on the slides made available by Kurose and Ross. All material copyright 1996-2012 J.F Kurose and K.W. Ross, All Rights
IPv4 email@example.com 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
CS 457 Lecture 11 More IP Networking Fall 2011 IP datagram format IP protocol version number header length (bytes) type of data max number remaining hops (decremented at each router) upper layer protocol
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
Last time Network layer Introduction forwarding vs. routing Virtual circuit vs. datagram details connection setup, teardown VC# switching forwarding tables, longest prefix matching IP: the Internet Protocol
CSEP 561 Internetworking David Wetherall firstname.lastname@example.org Internetworking t Focus: Joining multiple, different networks into one larger network Forwarding models Application Heterogeneity Transport
Outline 5-44 Computer Networking Lecture 9 Protocol Traditional addressing CIDR addressing Peter Steenkiste Departments of Computer Science and Electrical and Computer Engineering Forwarding examples 5-44
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
Indian Institute of Technology Kharagpur Internet Routing Protocols Part II Prof. Indranil Sen Gupta Dept. of Computer Science & Engg. I.I.T. Kharagpur, INDIA Lecture 8: Internet routing protocols Part
Design Issues Routing Algorithms Congestion Control Quality of Service Internetworking Network Layer Chapter 5 Network Layer of the Internet Revised: August 2011 and February 2018 The Network Layer Responsible
CSCI 4211 16Spring Final Exam Solution 1. When an IP packet arrives a router, how the router decides what is the next router (output link) this packet to be forwarded to? What are the routing table and
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
Exercise Sheet 4 Exercise 1 (Routers, Layer-3-Switches, Gateways) 1. What is the purpose of Routers in computer networks? (Also explain the difference to Layer-3-Switches.) 2. What is the purpose of Layer-3-Switches
Internet Multicast Routing. group addressing class D IP addresses 1110 Multicast Group ID. link layer multicast 28 bits. two protocol functions group management IGMP route establishment DVMRP, MOSPF, CBT,
UNIT III THE NETWORK LAYER Introduction-Virtual Circuit and Datagram Networks- Inside a Router- The Internet Protocol (IP): Forwarding and Addressing in the Internet-Routing Algorithms Routing in the Internet-Broadcast
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
CSC 401 Data and Computer Communications Networks Link Layer, Switches, VLANS, MPLS, Data Centers Sec 6.4 to 6.7 Prof. Lina Battestilli Fall 2017 Chapter 6 Outline Link layer and LANs: 6.1 introduction,
Outline IPv6: An Introduction Dheeraj Sanghi Department of Computer Science and Engineering Indian Institute of Technology Kanpur email@example.com http://www.cse.iitk.ac.in/users/dheeraj Problems with
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
Network Layer: Data Plane EECS3214 18-02-25 4-1 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
OSI Network Layer Network Fundamentals Chapter 5 Objectives Identify the role of the Network Layer, as it describes communication from one end device to another end device. Examine the most common Network
Network Layer II Still chapter 4 in the textbook C compiler You writing assignment 2 Getting IP addresses ARP is the simplest way, which we will barely discuss (now) It s a mapping between Ethernet MAC
: Computer Networks Lecture 2: Feb 2, 2004 IP (Internet Protocol) A hypothetical service You want a mail delivery service You have two choices: Acme Guaranteed Mail Delivery Service We never fail Rocko
Networking Theory CSCI 201 Principles of Software Development Jeffrey Miller, Ph.D. firstname.lastname@example.org Networking Overview IP Addressing DNS Ports NAT Subnets DHCP Test Yourself Outline USC CSCI 201L
Networking interview questions What is LAN? LAN is a computer network that spans a relatively small area. Most LANs are confined to a single building or group of buildings. However, one LAN can be connected
ELEC / COMP 177 Fall 2011 Some slides from Kurose and Ross, Computer Networking, 5 th Edition Homework #6 - Presentation on security/ privacy Topic selection Due Tuesday, Nov 22 nd Slides Due Monday, Nov
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
Internet 1) Internet basic technology (overview) 2) Mobility aspects 3) Quality of Service (QoS) aspects Relevant information: these slides (overview) course textbook (Part H) www.ietf.org (details) IP
Computer Network Fundamentals Spring 2008 Week 4 Network Layer Andreas Terzis Outline Internet Protocol Service Model Addressing Original addressing scheme Subnetting CIDR Fragmentation ICMP Address Shortage
ECE4110 Internetwork Programming Introduction and Overview 1 EXAMPLE GENERAL NETWORK ALGORITHM Listen to wire Are signals detected Detect a preamble Yes Read Destination Address No data carrying or noise?
NETWORK LAYER DATA PLANE 1 GOALS Understand principles behind network layer services, focusing on the data plane: Network layer service models Forwarding versus routing How a router works Generalized forwarding
Problem-1: 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
Introduction to routing in the Internet Ethernet, switching vs. routing Internet architecture IPv4 Addressing Routing principles Protocols: IPv4, ICMP, ARP (Chapters 2 3 in Huitema) E7310/Internet basics/comnet
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
THE INTERNET PROTOCOL The Internet Protocol Stefan D. Bruda Winter 2018 A (connectionless) network protocol Designed for use in interconnected systems of packet-switched computer communication networks
21 CHAPTER This chapter describes underlying concepts of how routing behaves within the ASA, and the routing protocols that are supported. This chapter includes the following sections: Information About
Session 8. TCP/IP Dongsoo S. Kim (email@example.com) Electrical and Computer Engineering Indiana U. Purdue U. Indianapolis IP Packet 0 4 8 16 19 31 Version IHL Type of Service Total Length Identification
IP Packet Switching CS 375: Computer Networks Dr. Thomas C. Bressoud Goals of Todayʼs Lecture Connectivity Links and nodes Circuit switching Packet switching IP service model Best-effort packet delivery
CSCI-1680 Network Layer: Wrapup Rodrigo Fonseca Based partly on lecture notes by Jennifer Rexford, Rob Sherwood, David Mazières, Phil Levis, John JannoA Administrivia Homework 2 is due tomorrow So we can
EITF25 Internet Techniques and Applications L7: Internet Stefan Höst What is Internet? Internet consists of a number of networks that exchange data according to traffic agreements. All networks in Internet
University of Toronto Faculty of Applied Science and Engineering Final Exam, December 2009 ECE 461: Internetworking Examiner: J. Liebeherr Exam Type: A Calculator: Type 2 There are a total of 10 problems.
Routing in the Internet Daniel Zappala CS 460 Computer Networking Brigham Young University Scaling Routing for the Internet 2/29 scale 200 million destinations - can t store all destinations or all prefixes
Internetworking Lecture 2: Basic routing, ARP, and basic IP Literature: Forouzan, TCP/IP Protocol Suite: Ch 6-8 Basic Routing Delivery, Forwarding, and Routing of IP packets Connection-oriented vs Connectionless
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
Introduction to Computer Networking Guy Leduc Chapter 4 Network Layer: The Data Plane Computer Networking: A Top Down Approach, 7 th edition. Jim Kurose, Keith Ross Addison-Wesley, April 2016. From Computer
Tutorial 9 1 Router Architecture Consider a router with a switch fabric, 2 input ports (A and B) and 2 output ports (C and D). Suppose the switch fabric operates at 1.5 times the line speed. a. If, for
THE INTERNET PROTOCOL a (connectionless) network layer protocol designed for use in interconnected systems of packet-switched computer communication networks (store-and-forward paradigm) provides for transmitting
LARGE SCALE IP ROUTING LECTURE BY SEBASTIAN GRAF MODULE 05 MULTIPROTOCOL LABEL SWITCHING (MPLS) AND LABEL DISTRIBUTION PROTOCOL (LDP) 1 by Xantaro IP Routing In IP networks, each router makes an independent
Routing Basic Idea Routing table at each router/gateway When IP packet comes, destination address checked with routing table to find next hop address Questions: Route by host or by network? Routing table:
Inter-AS routing and BGP Network Layer 4-1 Review: intra-as routing v Also known as interior gateway protocols (IGP) v Most common intra-as routing protocols: RIP: Routing Information Protocol, distance
CSC 4900 Computer Networks: Network Layer Professor Henry Carter Fall 2017 Chapter 4: Network Layer 4. 1 Introduction 4.2 What s inside a router 4.3 IP: Internet Protocol Datagram format 4.4 Generalized