NET2-2 Internet Protocol and Routing Network Science Certificate George Mason University
|
|
- Bonnie Stone
- 5 years ago
- Views:
Transcription
1 NEC/NSC-NET2 NET2-2 Internet Protocol and Routing Network Science Certificate 0 George Mason University The author of these slides is Dr. Mark Pullen of George Mason University s NEC program. Students registered in Dr. Pullen s NEC courses at GMU may make a single machine-readable copy and print a single copy of each slide for their own reference, so long as each slide contains the copyright statement, and GMU facilities are not used to produce paper copies. Permission for any other use, either in machine-readable or printed form, must be obtained from the author in writing J. Mark Pullen Seven Layer Model Application Presentation Session Transport Network DLC Physical Peer Connection Application Presentation Session Transport Network DLC Physical J. Mark Pullen 2
2 Seven Layer ISO Reference Model. Physical - communications medium: wire, fiber, radio, etc. 2. Data Link Control - framing, link error & flow control medium access control (MAC) sublayer used for multi-access e.g. Ethernet 3. Network - routing, congestion control internet sublayer - interconnects networks 4. Transport - end-to-end error and flow control 5. Session - connection management 6. Presentation - recoding transmitted form to display form e.g. compression, encryption 7. Application - doing what the user needs e.g J. Mark Pullen 3 Network Layer Switching Host Host J. Mark Pullen 4 2 2
3 Network Service Models Connection Setup Destination Address Packet Sequencing Error and Flow Control Negotiation of Options Connection-oriented Before data flow At connection setup Ordering guaranteed Provided by Network Layer Possible during setup Connectionless Not required With each packet No assurance Provided by Transport Layer Not provided J. Mark Pullen 5 Network Protocol Models Connection Setup Addressing State Routing Node Failure Virtual Circuit Before data flow Network address mapped to VC Required for each VC Selected at Connection Setup Terminates VCs Datagram Not required Source and Destination on each Packet No state storage needed Selected for each Packet Packets in Queues Lost Complexity Within Network Layer Within Transport Layer J. Mark Pullen 6 3 3
4 TCP/IP History U.S. DoD Advanced Research Project Agency (ARPA, sometimes DARPA) created ARPANET starting 968 ARPANET was first wide-area general purpose packet network, served universities and ARPA contractors Original developers BBN, UCLA, SRI. Later USC/ISI, MIT. Standards evolved from Request for Comments (Now RFC) In the early 970 s the concept of internetworking (or internetting) was advanced. The ARPANET became the core of the Internet experiment and TCP/IP was developed as its protocol suite Today the IETF supports dozens of related open protocols that make up the Internet Protocol Suite (IPS) J. Mark Pullen 7 Internetworking of 3 Subnetworks interconnected by intermediate systems to form an internet (note small i ). LAN X.25 STORE- AND- FORWARD NODES Token Ring Network = Internet or Subnet J. Mark Pullen 8 4 4
5 Internetworking 2 of 3 Subnet: Physical network over which systems may communicate directly. Bridge: Datalink layer Relays frames on same subnet Router: Network layer Forwards packets to different subnets Requirements: Network interconnection - PL, DLL, NL Routing and data delivery among networks Services such that network differences are handled J. Mark Pullen 9 Internetworking 3 of 3 Addressing DL address - subnetwork point of attachment (SNPA) Different address (and possibly formats) for different subnet Assume that subnet physical has local (on subnet) significance only. MTU - Maximum transfer unit Maximum transfer unit Network access mechanism Error recovery Routing techniques Connection-oriented (VC) or connectionless (datagram) J. Mark Pullen 0 5 5
6 Internet Protocol IP is a connectionless protocol-each packet is routed independent of all others IP packets are called datagrams IP delivers packets on a best effort basis - no guarantee of delivery IP does not guarantee ordered delivery Created as a protocol to link different networks, IP has has become increasingly popular to run directly on hosts J. Mark Pullen IP Addresses There are four active classes of IP address. All are 32 bits long Class A - 28 nets with 6M hosts each 0nnnnnnn hhhhhhhh hhhhhhhh hhhhhhhh Class B - 6K nets with 64K hosts each 0nnnnnn nnnnnnnn hhhhhhhh hhhhhhhh Class C - 4M nets with 256 hosts each 0nnnnn nnnnnnnn nnnnnnnn hhhhhhhh Class D - Multicast, 256M groups 0gggg gggggggg gggggggg gggggggg Note: here K = 2 0 = 024, M = 2 20 = J. Mark Pullen 2 6 6
7 IP Number Notation Domain Name System cs.gmu.edu = site.gmu.edu = bacon.gmu.edu = cne.gmu.edu = dsigw.gmu.edu = J. Mark Pullen 3 IP HEADER VERS HLEN SERVICE TYPE TOTAL LENGTH IDENTIFICATION FLAGS FRAGMENT OFFSET TIME TO LIVE PROTOCOL HEADER CHEKSUM SOURCE IP ADDRESS DESTINATION IP ADDRESS IP OPTIONS (IF ANY) DATA... PADDING J. Mark Pullen 4 7 7
8 IP Header Information of 4 VERS - protocol version (current = 4) (new = 6) HLEN - header length in 32 - bit words max. header length = 60 bytes SERVICE TYPE - precedence and handling options Telnet - low delay FTP data - high throughput??? - high reliability 3 bits: Precedence field 4 bits: TOS - min delay, max. throughput, max reliability bit : unused J. Mark Pullen 5 IP Header Information 2 of 4 TOTAL LENGTH - packet length in bytes 6 bits - > max = 64,535 bytes Field needed because link layer may add padding IDENTIFICATION, FLAGS, FRAGMENT OFFSET - used in fragmentation, i.e. passing a packet through a net where its length exceeds that net s Maximum Transmission Unit (MTU) TIME TO LIVE (TTL)- max number of routers through which datagram may be forwarded. Set by sender (e.g. 32 or 64) and decremented by each router that processed datagram J. Mark Pullen 6 8 8
9 IP Header Information 3 of 4 PROTOCOL - code for transport protocol HEADER CHEKSUM - error check for header (assuming zeros in this field). - Sender: Divide header into 6 bit pieces and calculate s compliment of sum) - Receiver: s compliment sum over entire header, including checksum. ALL s -> OK. SOURCE IP, DESTINATION IP - addresses of from/to hosts (32 bits each) J. Mark Pullen 7 OPTIONS - Variable length IP Header Information 4 of 4 Security (not used in Internet) Record route: Each router records its IP address in the options data area Timestamp: Each router records the time and possibly its IP addr. Loose source route: List of routers (IP address) that must be visited by datagram in specified order. Other routers may be visited. Strict source route: Similar. Only listed routers may be visited J. Mark Pullen 8 9 9
10 IP Subnet Mechanisms Using IP, devices on a physically contiguous (or bridged) LAN will share the same high-order address bits typically, a class C network address Address Resolution Protocol (ARP) - broadcast to LAN does anybody out there use this IP address? builds table of Ethernet addresses corresponding to IP addresses. Reverse ARP (RARP) - used by diskless client to find its IP address at bootup, designated RARP host replies protocol BOOTP is used Dynamic Host Configuration Protocol (DHCP) allows IP numbers to be assigned from a server when needed rather than statically configured selected devices can still always receive same IP address J. Mark Pullen 9 Address Resolution Protocol (ARP) How to map IP addresses to 48-bit link level addresses? Maintain a local mapping of IP addresses to link level addresses Techniques Encode hosts physical address into the host part of the IP address. Maintain Cache of mappings (the ARP approach) J. Mark Pullen
11 ARP Packet Hardware Type HLEN PLEN Protocol type Operation Source Hardware Address Source Hardware Address Source Protocol Address Source Protocol Address Target Hardware Address Target Hardware Address Target Protocol Address J. Mark Pullen 2 ARP Packet Hardware Type HLEN PLEN Protocol type Operation Source Hardware Address Source Hardware Address Source Protocol Address Source Protocol Address Target Hardware Address Target Hardware Address Target Protocol Address J. Mark Pullen 22
12 IP Control Message Protocol (ICMP) of 4 ICMP passes data among routers: - error statistics - reachability tests ( ping ) - source quench congestion control - routing loops - clock synchronization Part of Internet Layer Used to communicate errors and other conditions not handled by IP or higher layer protocols Carried in IP datagrams with Protocol = 0x0 IP header 20 bytes ICMP message J. Mark Pullen 23 IP Control Message Protocol 2 of 4 ICMP Message Format type code checksum message contents... Types include 0 Echo (ping) reply Query response 3 Destination unreachable Error Codes include: 0 Network unreachable Host unreachable 5 Redirect Error 8 Echo request Query J. Mark Pullen
13 IP Control Message Protocol 3 of 4 Checksum Calculated over entire ICMP message (same algorithm as IP) Message contents Query: Depends on type Error: IP header and first 8 bytes data of diagram that caused ICMP message to be generated. ICMP error message never generated in response to ICMP error message Datagram destined to IP broadcast or IP multicast addr. Fragment other than first Datagram with source address <> single host J. Mark Pullen 25 IP Control Message Protocol 4 of 4 ICMP Redirect used by router to inform datagram source of a better router ES R R2 Allows good routing on subnet with minimal configuration in end systems J. Mark Pullen
14 IP Fragmentation Transparent to higher layers When IP recovers datagram, if MTU for outgoing interface < datagram (data) size, fragment Rough Algorithm: Divide data based on MTU Max size pieces from front Multiples of 8 except last. Copy original IP header to IP header of each frag. If options in original, all copied to first frag, only some copied to other frags. In each frag: If last, set more fragments bit to, else 0. Set fragment offset to position (in 8 byte units) in data area of original datagram. Set total length of frag, datagram. Compute IP checksum (over header) J. Mark Pullen 27 More on IP Fragmentation Fragment may be further fragmented later. If don t fragment bit = and fragmentation required, drop datagram and send ICMP error message. Reassembly Performed at destination Straightforward using fragment offset and more flags J. Mark Pullen
15 Routing and Forwarding What is the difference? Routing is the process of determining what route a packet shall follow requires routers to exchange reachability information using a routing protocol Forwarding is the process of dealing with a newlyarrived packet by sending it to the place indicated by the routing this always amounts to deciding which interface to send it on in IP the routing is captured in a routing table that shows, for every network or group of networks, which interface receives the packet in X.25 the routing is captured in a table that shows, for each incoming VC, which VC and interface to use J. Mark Pullen 29 A Real Routing Table from bacon.gmu.edu Destination Gateway Interface lo le le le le0 default S&T bacon lab LAN DSI J. Mark Pullen
16 IP Routing Some Basics A network may be a LAN or a WAN composed of packet switches Most WANs today are composed of IP routers acting as packet switches Routers exchange pathway information via a routing protocol Router may also have explicit table of next hop addresses and a default route Some routing protocols are: RIP - distributed with Berkeley Unix OSPF - open shortest-path-first BGP/EGP - exterior gateways exchange Internet-level routing J. Mark Pullen 3 Methods for Routing Review Shortest - path: assign each path a length (link state metric); find the shortest path from source to destination. Optimal: collect data globally to optimize, if necessary assign multiple paths to share loads J. Mark Pullen
17 Primitive Routing Techniques Review Source routing - source inserts list of nodes for packet to follow - no change possible, even if path not workable (IP allows this) Variation loose source routing requires packet to go through certain nodes but allows dynamic routing between the designated must visit nodes Static routing - predetermined paths that do not change Flooding - source sends packet to neighbors, they propagate, so on throughout net - simple but inefficient J. Mark Pullen 33 Flooding Every node sends a copy of each received packet on each other link to which it connects Care must be taken to avoid overwhelming the network with excessive retransmission of packets Provides a simple, yet expensive, mechanism to broadcast messages to all nodes Sometimes used to send control or management frames when the network topology is uncertain J. Mark Pullen
18 Internet Routing Protocols The major function is distributing the cost and reachability information. How this is done reflects the philosophy of routing and age of protocol Routing Information Protocol (RIP) distance vector, uses hop count, uses UDP has messages to exchange routing tables comes with Unix slow convergence Open Shortest Path First (OSPF) link state, multiple metrics, uses IP directly type of service routing (uses IP header TOS) load balancing info exchange among gateways J. Mark Pullen 35 RIP Packet Format Command Version Must be zero Family of Net Address of Net Address of Net Distance to Net Family of Net 2 Address of Net 2 Address of Net 2 Distance to Net J. Mark Pullen
19 Border Gateway Protocol (BGP / EGP) Internet gateways exchange Internet routing information among administrative domains gateway advertises that it can reach certain IP networks and its distance to them distance metrics not standardized exterior routing through autonomous systems uses TCP to exchange routing information important to distinguish between: advertising: telling another administrative what nets are reachable through this one routing:setting up the tables to support forwarding J. Mark Pullen 37 Autonomous Systems (AS) An AS is a region of the Internet under the administrative control of a single entity. each AS has a unique 6 bit identifier (ASN) provides for scalability through hierarchical routing allows different routing methods in different domains domains communicate through border routers established by system managers absent prior arrangements, default routes are used among the autonomous systems J. Mark Pullen
20 Routing Algorithms Review A routing algorithm computes the path packets follow to their destination. Static Routing Algorithms Routes determined in advance, off-line Routes distributed to switching nodes at network startup Adaptive Routing Algorithms Routes chosen in real-time based on measurements or estimates of current traffic and topology Routes updated dynamically to adapt to changes in demand and topology Adaptive algorithms can be centralized or distributed J. Mark Pullen 39 Open Shortest-Path First (OSPF) Inter-domain link-state routing Design considerations Needs to be open, non-proprietary. Must support a variety of distance metrics Needs to respond dynamically to changes Should allow TOS routing Should do load balancing Security J. Mark Pullen
21 OSPF and Network Topologies Three kinds of connections and networks Point to point between two routers Multiaccess network with broadcasting. Multiaccess networks without broadcasting Above is achieved by abstracting the collection of routers, networks and links into a directed graph. Vertices are routers or networks Edges are connections J. Mark Pullen 4 OSPF Protocols Hello Protocol Checks that links are operational, and elects designated routers and backups. Hello packets sent every hello interval Run distributed elections Exchange Protocol Used to synchronize routing databases Flooding Protocol Distributes updates. Includes acknowledgment mechanism J. Mark Pullen
22 Shortest Path Routing Requires a metric to measure path length One possible metric is the number of hops along a path; an alternative is the measured or estimated delay along a path Object of shortest path routing is to find a spanning tree whose branches provide the shortest path to a destination A 2 5 B 3 2 C 3 E 5 2 F D J. Mark Pullen 43 Dijkstra s Algorithm DEPTH-FIRST SEARCH Finds the shortest path from a given node to all other nodes by constructing the path in order of increasing path length Initialize: R = {s} and C n = D ns (if unreachable the delay is infinite) Add to R the node with the least-cost path from node s Find h not in R such that C h = min C n Add h to R Update the least-cost paths: C n = min [C n, C h + D hn ] for all n not in R Repeat preceding two steps until R = N Where, N = set of all nodes, s = source node, R = set of nodes incorporated by algorithm, Cn = cost of the least-cost path from node n to node s, and D ij = link cost from node i to node j J. Mark Pullen
23 Dijkstra s Algorithm In Operation Iteration R CB Path CC Path CD Path CE Path CF Path {A} 2 A-B 5 A-C A-D? -? - 2 {A,D} 2 A-B 4 A-D-C 2 A-D-E? - 3 {A,B,D} 4 A-D-C 2 A-D-E? - 4 {A,B,D,E} 3 A-D-E-C 4 A-D-E-F 5 {A,B,C,D,E} 4 A-D-E-F 6 {A,B,C,D,E,F} A 2 5 B 3 2 C 3 E 5 2 F D J. Mark Pullen 45 The Bellman-Ford Algorithm BREADTH-FIRST SEARCH Principle of optimality Principle of optimality: from the current state, the optimal path is optimal independent of steps taken to reach this state Finds the shortest path from a given node to all other nodes by constructing the shortest path under the constraint that such a path includes at most h hops The algorithm iterates over the number of hops, h = 0,, 2,..., until the cost no longer changes Initialize: C n (h) = infinity For each successive h: C n (h+) = min [ C j (h) + D nj ] Where, h is the maximum number of hops on a path, s is the source node, D nj is the link cost from node n to node j, and C n (h) is the least-cost path from node s to node n with at most h hops J. Mark Pullen
24 Bellman-Ford Algorithm In Operation h CB Path CC Path CD Path CE Path CF Path 0? -----? ? ? ? A-B 5 A-C A-D? ? A-B 4 A-D-C A-D 2 A-D-E 0 A-C-F 3 2 A-B 3 A-D-E-C A-D 2 A-D-E 4 A-D-E-F 4 2 A-B 3 A-D-E-C A-D 2 A-D-E 4 A-D-E-F A 2 5 B 3 2 C 3 E 5 2 F D J. Mark Pullen 47 Comparison Of Dijkstra s Algorithm and the Bellman-Ford Algorithm Approach: Dijkstra depth-first, Bellman-Ford depth-first Computation complexity: Dijkstra O(N 2 ) Bellman-Ford O(N 3 ) Dijkstra s Algorithm requires knowledge of all costs and so is suitable for centralized routing calculations For Bellman-Ford Algorithm, each node requires only knowledge of link costs to its neighboring nodes; hence, it is suitable for distributed routing calculations. Both algorithms adapt to slowly changing link costs (e.g., link outages); however, if the link cost is a function of traffic (e.g., delay), which in turn is a function of the routes chosen, then instabilities can occur J. Mark Pullen
25 J. Mark Pullen 49 NET2-2 Homework to or fax to Briefly describe the following characteristics of IP: a. guarantee of packet delivery b. order of packet delivery 2. Briefly describe the following characteristics of IP subnets: a. MTU b. how different subnets are interconnected c. why they need ARP 3. Describe the role of the following in the Internet: a. class B addresses b. class C addresses c. class D addresses d. Domain Name System e. IP packet Time to Live J. Mark Pullen
26 NET2-2 Homework 4. IP exists to pass data among processes on computers. ICMP is more specialized. What is the purpose of ICMP? 5. Briefly describe the following router functions: a. routing b. forwarding 6. Where would you expect to find the following protocols in use? a. RIP b. OSPF c. BGP J. Mark Pullen 5 Homework. 7 a. For the network below, use Dijkstra s algorithm to find the shortest path from node to all other nodes. Show your work in a form similar to the examples in the slides. b. Repeat for the Bellman-Ford algorithm J. Mark Pullen
27 J. Mark Pullen
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
More informationIP - 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
More informationIP Protocols. ALTTC/Oct
IP Protocols Internet or IP technology over the years has emerged as the most prominent data communication technology. TCP/IP protocol has become de-facto data comm standard throughout the world. It can
More informationChapter 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
More informationConcept Questions Demonstrate your knowledge of these concepts by answering the following questions in the space that is provided.
223 Chapter 19 Inter mediate TCP The Transmission Control Protocol/Internet Protocol (TCP/IP) suite of protocols was developed as part of the research that the Defense Advanced Research Projects Agency
More informationOutline. 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
More informationNetwork Layer, Part 1 Internet Architecture. History
Network Layer, Part 1 Internet Architecture These slides are created by Dr. Huang of George Mason University. Students registered in Dr. Huang s courses at GMU can make a single machine readable copy and
More informationThe Interconnection Structure of. The Internet. EECC694 - Shaaban
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
More informationIntroduction to Internetworking
Introduction to Internetworking Introductory terms Communications Network Facility that provides data transfer services An internet Collection of communications networks interconnected by bridges and/or
More informationTopics for This Week
Topics for This Week Routing Protocols in the Internet OSPF, BGP More on IP Fragmentation and Reassembly ICMP Readings Sections 5.6.4-5.6.5 1 Hierarchical Routing aggregate routers into regions, autonomous
More informationIntroduction to routing in the Internet
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
More informationChapter 09 Network Protocols
Chapter 09 Network Protocols Copyright 2011, Dr. Dharma P. Agrawal and Dr. Qing-An Zeng. All rights reserved. 1 Outline Protocol: Set of defined rules to allow communication between entities Open Systems
More informationInternetworking Terms. Internet Structure. Internet Structure. Chapter 15&16 Internetworking. Internetwork Structure & Terms
Chapter 15&16 Internetworking Internetwork Structure & Terms Internetworking Architecture Features Connection/Connectionless Architecture Fragmentation & Reassembly Internet Protocol & Services Addressing
More informationThe 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
More informationIntroduction to routing in the Internet
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
More informationAuxiliary protocols. tasks that IP does not handle: Routing table management (RIP, OSPF, etc.). Congestion and error reporting (ICMP).
Auxiliary protocols IP is helped by a number of protocols that perform specific tasks that IP does not handle: Routing table management (RIP, OSPF, etc.). Congestion and error reporting (ICMP). Multicasting
More informationNetworking interview questions
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
More informationARP, IP. Chong-Kwon Kim. Each station (or network interface) should be uniquely identified Use 6 byte long address
ARP, IP Chong-Kwon Kim Routing Within a LAN MAC Address Each station (or network interface) should be uniquely identified Use 6 byte long address Broadcast & Filter Broadcast medium Signals are transmitted
More informationEEC-684/584 Computer Networks
EEC-684/584 Computer Networks Lecture 14 wenbing@ieee.org (Lecture nodes are based on materials supplied by Dr. Louise Moser at UCSB and Prentice-Hall) Outline 2 Review of last lecture Internetworking
More informationLecture 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
More informationCS 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
More informationData Communication Prof. A. Pal Department of Computer Science & Engineering Indian Institute of Technology, Kharagpur Lecture 34 TCP/ IP I
Data Communication Prof. A. Pal Department of Computer Science & Engineering Indian Institute of Technology, Kharagpur Lecture 34 TCP/ IP I Hello and welcome to today s lecture on TCP/IP. (Refer Slide
More informationVorlesung Kommunikationsnetze
Picture 15 13 Vorlesung Kommunikationsnetze Prof. Dr. H. P. Großmann mit B. Wiegel sowie A. Schmeiser und M. Rabel Sommersemester 2009 Institut für Organisation und Management von Informationssystemen
More informationThe Internetworking Problem. Internetworking. A Translation-based Solution
Cloud Cloud Cloud 1 The Internetworking Problem Internetworking Two nodes communicating across a network of networks How to transport packets through this heterogeneous mass? A B The Internetworking Problem
More informationCompSci 356: Computer Network Architectures. Lecture 8: Spanning Tree Algorithm and Basic Internetworking Ch & 3.2. Xiaowei Yang
CompSci 356: Computer Network Architectures Lecture 8: Spanning Tree Algorithm and Basic Internetworking Ch 3.1.5 & 3.2 Xiaowei Yang xwy@cs.duke.edu Review Past lectures Single link networks Point-to-point,
More informationIP : 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
More informationThe 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
More informationROUTING INTRODUCTION TO IP, IP ROUTING PROTOCOLS AND PROXY ARP
IP ROUTING INTRODUCTION TO IP, IP ROUTING PROTOCOLS AND PROXY ARP Peter R. Egli 1/37 Contents 1. IP Routing 2. Routing Protocols 3. Fragmentation in the IP Layer 4. Proxy ARP 5. Routing and IP forwarding
More informationTCPIP Protocol Suite & Utilities. Revision no.: PPT/2K403/02
TCPIP Protocol Suite & Utilities Revision no.: PPT/2K403/02 Comparing the TCP/IP protocol Suite, the OSI Model, and the DoD Model Comparing the TCP/IP protocol Suite, the OSI Model, and the DoD Model (contd.)
More informationInternetworking. different kinds of network technologies that can be interconnected by routers and other networking devices to create an internetwork
UNIT - II Internetworking An internetwork is a collection of individual networks, connected by intermediate networking devices, that functions as a single large network. different kinds of network technologies
More informationInternetworking Part 2
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
More informationCSE/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
More informationChapter 12 Network Protocols
Chapter 12 Network Protocols 1 Outline Protocol: Set of defined rules to allow communication between entities Open Systems Interconnection (OSI) Transmission Control Protocol/Internetworking Protocol (TCP/IP)
More informationDongsoo S. Kim Electrical and Computer Engineering Indiana U. Purdue U. Indianapolis
Session 8. TCP/IP Dongsoo S. Kim (dskim@iupui.edu) 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
More informationTable of Contents. Cisco TCP/IP
Table of Contents TCP/IP Overview...1 TCP/IP Technology...1 TCP...1 IP...2 Routing in IP Environments...4 Interior Routing Protocols...5 RIP...5 IGRP...6 OSPF...6 Integrated IS IS...6 Exterior Routing
More informationInter-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
More informationLecture 8. Reminder: Homework 3, Programming Project 2 due on Thursday. Questions? Tuesday, September 20 CS 475 Networks - Lecture 8 1
Lecture 8 Reminder: Homework 3, Programming Project 2 due on Thursday. Questions? Tuesday, September 20 CS 475 Networks - Lecture 8 1 Outline Chapter 3 - Internetworking 3.1 Switching and Bridging 3.2
More informationGuide to TCP/IP, Third Edition. Chapter 3: Data Link and Network Layer TCP/IP Protocols
Guide to TCP/IP, Third Edition Chapter 3: Data Link and Network Layer TCP/IP Protocols 1 Objectives Understand the role that data link protocols, such as SLIP and PPP, play for TCP/IP Distinguish among
More informationCPSC 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
More informationEEC-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
More informationAdministrivia CSC458 Lecture 4 Bridging LANs and IP. Last Time. This Time -- Switching (a.k.a. Bridging)
Administrivia CSC458 Lecture 4 Bridging LANs and IP Homework: # 1 due today # 2 out today and due in two weeks Readings: Chapters 3 and 4 Project: # 2 due next week Tutorial today: Joe Lim on project 2
More informationCS475 Networks Lecture 8 Chapter 3 Internetworking. Ethernet or Wi-Fi).
Assignments Reading for Lecture 9: Section 3.3 3.2 Basic Internetworking (IP) Bridges and LAN switches from last section have limited ability CS475 Networks Lecture 8 Chapter 3 Internetworking is a logical
More informationLecture 8. Basic Internetworking (IP) Outline. Basic Internetworking (IP) Basic Internetworking (IP) Service Model
Lecture 8 Basic Internetworking (IP) Reminder: Homework 3, Programming Project 2 due on Tuesday. An example internet is shown at right. Routers or gateways are used to connect different physical networks.
More informationNeed For Protocol Architecture
Chapter 2 CS420/520 Axel Krings Page 1 Need For Protocol Architecture E.g. File transfer Source must activate communications path or inform network of destination Source must check destination is prepared
More informationAgenda L2 versus L3 Switching IP Protocol, IP Addressing IP Forwarding ARP and ICMP IP Routing First Hop Redundancy
Primer IP Technology L2 Ethernet Switching versus L3 routing IP Protocol, IP Addressing, IP Forwarding ARP and ICMP IP Routing, OSPF Basics First Hop Redundancy (HSRP) Agenda L2 versus L3 Switching IP
More informationNeed For Protocol Architecture
Chapter 2 CS420/520 Axel Krings Page 1 Need For Protocol Architecture E.g. File transfer Source must activate communications path or inform network of destination Source must check destination is prepared
More informationLecture 4 The Network Layer. Antonio Cianfrani DIET Department Networking Group netlab.uniroma1.it
Lecture 4 The Network Layer Antonio Cianfrani DIET Department Networking Group netlab.uniroma1.it Network layer functions Transport packet from sending to receiving hosts Network layer protocols in every
More informationTelecommunication Protocols Laboratory Course. Lecture 3
Telecommunication Protocols Laboratory Course Lecture 3 Course map Last time: we discussed protocols of the Medium Access Control (MAC) sub-layer Deal with broadcast channels and their (multi-party) protocols
More informationLecture 12. Introduction to IP Routing. Why introduction? Routing
Lecture. Introduction to IP Routing Why introduction? Routing: very complex issue need in-depth study entire books on routing our scope: give a flavour of basic routing structure and messaging give an
More informationOpen Shortest Path First (OSPF)
CHAPTER 42 Open Shortest Path First (OSPF) Background Open Shortest Path First (OSPF) is a routing protocol developed for Internet Protocol (IP) networks by the interior gateway protocol (IGP) working
More informationLecture 11: Networks & Networking
Lecture 11: Networks & Networking Contents Distributed systems Network types Network standards ISO and TCP/IP network models Internet architecture IP addressing IP datagrams AE4B33OSS Lecture 11 / Page
More informationECE 428 Internet Protocols (Network Layer: Layer 3)
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
More informationET4254 Communications and Networking 1
Topic 9 Internet Protocols Aims:- basic protocol functions internetworking principles connectionless internetworking IP IPv6 IPSec 1 Protocol Functions have a small set of functions that form basis of
More informationSEN366 (SEN374) (Introduction to) Computer Networks
SEN366 (SEN374) (Introduction to) Computer Networks Prof. Dr. Hasan Hüseyin BALIK (12 th Week) The Internet Protocol 12.Outline Principles of Internetworking Internet Protocol Operation Internet Protocol
More informationThe Internet. 9.1 Introduction. The Internet is a global network that supports a variety of interpersonal and interactive multimedia applications.
The Internet 9.1 Introduction The Internet is a global network that supports a variety of interpersonal and interactive multimedia applications. Associated with each access network - ISP network, intranet,
More informationProf. 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
More informationChapter 7 Routing Protocols
Chapter 7 Routing Protocols Nonroutable Protocols In the early days of networking, networks were small collections of computers linked together For the purposes of sharing information and expensive peripherals
More informationComputer 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
More informationICMP, ARP, RARP, IGMP
Internet Layer Lehrstuhl für Informatik 4 Raw division into three tasks: Data transfer over a global network Route decision at the sub-nodes Control of the network or transmission status Routing Protocols
More informationII. 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
More informationETSF05/ETSF10 Internet Protocols Network Layer Protocols
ETSF05/ETSF10 Internet Protocols Network Layer Protocols 2016 Jens Andersson Agenda Internetworking IPv4/IPv6 Framentation/Reassembly ICMPv4/ICMPv6 IPv4 to IPv6 transition VPN/Ipsec NAT (Network Address
More informationTSIN02 - 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
More informationBasic Idea. Routing. Example. Routing by the Network
Basic Idea Routing 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:
More informationRouter 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
More informationICMP (Internet Control Message Protocol)
Today s Lecture ICMP (Internet Control Message Protocol) Internet Protocols CSC / C 573 I. ICMP Overview II. ICMP rror Reporting III. ICMP Query / Response Messages IV. ICMP Message Processing Fall, 2005
More informationRouting by the Network
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:
More informationLecture 5 The Network Layer part II. Antonio Cianfrani DIET Department Networking Group netlab.uniroma1.it
Lecture 5 The Network Layer part II Antonio Cianfrani DIET Department Networking Group netlab.uniroma1.it IP datagram format IP protocol version number header length (bytes) type of data max number remaining
More informationRouting. Advanced Computer Networks: Routing 1
Routing Advanced Computer Networks: Routing 1 Gateway To internet or wide area network Metropolitan Area Network (MAN) s s Organization Servers Backbone R S R R Departmental Server s R S R s S R s s s
More informationChapter 7. Local Area Network Communications Protocols
Chapter 7 Local Area Network Communications Protocols The Network Layer The third layer of the OSI Model is the network layer. The network layer is concerned with providing a means for hosts to communicate
More informationInterconnecting Networks with TCP/IP. 2000, Cisco Systems, Inc. 8-1
Interconnecting Networks with TCP/IP 2000, Cisco Systems, Inc. 8-1 Objectives Upon completion of this chapter you will be able to perform the following tasks: Identify the IP protocol stack, its protocol
More informationWhy dynamic route? (1)
Routing Why dynamic route? (1) Static route is ok only when Network is small There is a single connection point to other network No redundant route 2 Why dynamic route? (2) Dynamic Routing Routers update
More informationOutline. IP Address. IP Address. The Internet Protocol. o Hostname & IP Address. o The Address
Outline IP The Internet Protocol o IP Address IP subnetting CIDR o ARP Protocol o IP Function o Fragmentation o NAT o IPv6 2 IP Address o Hostname & IP Address IP Address o The Address ping www.nu.ac.th
More informationETSF05/ETSF10 Internet Protocols. Routing on the Internet
ETSF05/ETSF10 Internet Protocols Routing on the Internet Circuit switched routing ETSF05/ETSF10 - Internet Protocols 2 Routing in Packet Switching Networks Key design issue for (packet) switched networks
More informationNetwork layer: Overview. Network layer functions IP Routing and forwarding NAT ARP IPv6 Routing
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
More informationRouting, Routing Algorithms & Protocols
Routing, Routing Algorithms & Protocols Computer Networks Lecture 6 http://goo.gl/pze5o8 Circuit-Switched and Packet-Switched WANs 2 Circuit-Switched Networks Older (evolved from telephone networks), a
More informationInternetworking - We are heterogeneity to our network (variable network technologies, bandwidth, MTU, latency, etc. etc.)
Internetworking - We are heterogeneity to our network (variable network technologies, bandwidth, MTU, latency, etc. etc.) Goal is to use this opportunity (and not to find the lowest common denominator
More informationNetworking: Network layer
control Networking: Network layer Comp Sci 3600 Security Outline control 1 2 control 3 4 5 Network layer control Outline control 1 2 control 3 4 5 Network layer purpose: control Role of the network layer
More informationECE 4450:427/527 - Computer Networks Spring 2017
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
More informationNetwork layer: Overview. Network Layer Functions
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
More informationCS610 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
More informationInternetwork Protocols
Internetwork Protocols Background to IP IP, and related protocols Internetworking Terms (1) Communications Network Facility that provides data transfer service An internet Collection of communications
More informationDate: June 4 th a t 1 4:00 1 7:00
Kommunika tionssyste m FK, Examina tion G 5 0 7 Date: June 4 th 0 0 3 a t 4:00 7:00 KTH/IMIT/LCN No help material is allowed. You may answer questions in English or Swedish. Please answer each question
More informationLecture 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
More information(Chapters 2 3 in Huitema) E7310/Internet basics/comnet 1
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
More informationChapter 4: Network Layer
Mecanismes d Echange d Informations 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
More informationICS 351: Networking Protocols
ICS 351: Networking Protocols IP packet forwarding application layer: DNS, HTTP transport layer: TCP and UDP network layer: IP, ICMP, ARP data-link layer: Ethernet, WiFi 1 Networking concepts each protocol
More informationCOMP/ELEC 429/556 Introduction to Computer Networks
COMP/ELEC 429/556 Introduction to Computer Networks Let s Build a Scalable Global Network - IP Some slides used with permissions from Edward W. Knightly, T. S. Eugene Ng, Ion Stoica, Hui Zhang T. S. Eugene
More informationECE4110 Internetwork Programming. Introduction and Overview
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?
More informationInternet Protocols (chapter 18)
Internet Protocols (chapter 18) CSE 3213 Fall 2011 Internetworking Terms 1 TCP/IP Concepts Connectionless Operation Internetworking involves connectionless operation at the level of the Internet Protocol
More informationHY 335 Φροντιστήριο 8 ο
HY 335 Φροντιστήριο 8 ο Χειμερινό Εξάμηνο 2009-2010 Παπακωνσταντίνου Άρτεμις artpap@csd.uoc.gr 4/12/2009 Roadmap IP: The Internet Protocol IPv4 Addressing Datagram Format Transporting a datagram from source
More informationNetwork and Security: Introduction
Network and Security: Introduction Seungwon Shin KAIST Some slides are from Dr. Srinivasan Seshan Some slides are from Dr. Nick Mckeown Network Overview Computer Network Definition A computer network or
More informationICS 451: Today's plan
ICS 451: Today's plan ICMP ping traceroute ARP DHCP summary of IP processing ICMP Internet Control Message Protocol, 2 functions: error reporting (never sent in response to ICMP error packets) network
More informationThe Internet Protocol. IP Addresses Address Resolution Protocol: IP datagram format and forwarding: IP fragmentation and reassembly
The Internet Protocol IP Addresses Address Resolution Protocol: IP datagram format and forwarding: IP fragmentation and reassembly IP Addresses IP Addresses are 32 bit. Written in dotted decimal format:
More informationTelecom Systems Chae Y. Lee. Contents. Overview. Issues. Addressing ARP. Adapting Datagram Size Notes
Internetworking Contents Overview Functions Issues Basic Delivery Unit Addressing Datagram Delivery ARP IPv4 Header Adapting Datagram Size Notes 2 Overview - Example 3 Direct Delivery 4 Indirect Delivery
More informationNetwork Layer. Goals of This Lecture. Internet Reference Model. Outline of the Class
Goals of This Lecture Network Layer Kuang Chiu Huang TCM NCKU Through the lecture and in-class discussion, students are enabled to describe role and functions of the network layer, and compare different
More informationInternet Control Message Protocol (ICMP)
Internet Control Message Protocol (ICMP) 1 Overview The IP (Internet Protocol) relies on several other protocols to perform necessary control and routing functions: Control functions (ICMP) Multicast signaling
More informationcs/ee 143 Communication Networks
cs/ee 143 Communication Networks Chapter 4 Internetworking Text: Walrand & Parekh, 2010 Steven Low CMS, EE, Caltech Warning These notes are not self-contained, probably not understandable, unless you also
More informationDefining Networks with the OSI Model. Module 2
Defining Networks with the OSI Model Module 2 Objectives Skills Concepts Objective Domain Description Objective Domain Number Understanding OSI Basics Defining the Communications Subnetwork Defining the
More informationThe Network Layer. Internet solutions. Nixu Oy PL 21. (Mäkelänkatu 91) Helsinki, Finland. tel fax.
The Network Layer Nixu Oy PL 21 (Mäkelänkatu 91) 00601 Helsinki, Finland tel. +358 9 478 1011 fax. +358 9 478 1030 info@nixu.fi http://www.nixu.fi OVERVIEW The Internet Protocol IP addresses, address resolution
More informationCIS 551 / TCOM 401 Computer and Network Security. Spring 2006 Lecture 16
CIS 551 / TCOM 401 Computer and Network Security Spring 2006 Lecture 16 Announcements Midterm II March 21st (One week from today) In class Same format as last time Will cover all material since Midterm
More information