Chapter 22 Q and A Victor Norman IS333 Spring 2015.

Slides:



Advertisements
Similar presentations
1 IP Forwarding Relates to Lab 3. Covers the principles of end-to-end datagram delivery in IP networks.
Advertisements

IP Forwarding Relates to Lab 3.
Discussion Monday ( ). ver length 32 bits data (variable length, typically a TCP or UDP segment) 16-bit identifier header checksum time to live.
20.1 Chapter 20 Network Layer: Internet Protocol Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display.
IPv4 - The Internet Protocol Version 4
CECS 474 Computer Network Interoperability Notes for Douglas E. Comer, Computer Networks and Internets (5 th Edition) Tracy Bradley Maples, Ph.D. Computer.
CS335 Networking & Network Administration Tuesday, May 11, 2010.
CSCI 4550/8556 Computer Networks Comer, Chapter 20: IP Datagrams and Datagram Forwarding.
© 2009 Pearson Education Inc., Upper Saddle River, NJ. All rights reserved.1 Computer Networks and Internets, 5e By Douglas E. Comer Lecture PowerPoints.
TCP/IP Protocol Suite 1 Chapter 6 Upon completion you will be able to: Delivery, Forwarding, and Routing of IP Packets Understand the different types of.
CMPE 80N - Introduction to Networks and the Internet 1 CMPE 80N Winter 2004 Lecture 18 Introduction to Networks and the Internet.
IP Address 0 network host 10 network host 110 networkhost 1110 multicast address A B C D class to to
1 IP Forwarding Relates to Lab 3. Covers the principles of end-to-end datagram delivery in IP networks.
IP-UDP-RTP Computer Networking (In Chap 3, 4, 7) 건국대학교 인터넷미디어공학부 임 창 훈.
TCP/IP Protocol Suite 1 Chapter 6 Upon completion you will be able to: Delivery, Forwarding, and Routing of IP Packets Understand the different types of.
IP Routing, Format, Fragmentation Chapters 20-21, 23.
CS 6401 Internet Protocol Outline Introduction to Internet Protocol Header and address formats ICMP Tools.
1 Internet Protocol: Forwarding IP Datagrams Chapter 7.
1 Chapter 6 – Internet Protocol: Connectionless Datagram Delivery 6.3 Internet Architecture and Philosophy Chapters are about this layer NETWORK.
G64INC Introduction to Network Communications Ho Sooi Hock Internet Protocol.
資 管 Lee Lesson 5 IP Packets: Delivery and Routing IP Layer operation.
CMPT 471 Networking II Address Resolution IPv4 ARP RARP 1© Janice Regan, 2012.
7-1 Last time □ Wireless link-layer ♦ Introduction Wireless hosts, base stations, wireless links ♦ Characteristics of wireless links Signal strength, interference,
Delivery, Forwarding, and Routing of IP Packets
Chapter 22 Q and A Victor Norman CS 332 Spring 2014.
Dr. John P. Abraham Professor UTPA
TCP/IP Illustrated Volume I Internet Protocol 백 일 우.
Chapter 81 Internet Protocol (IP) Our greatest glory is not in never failing, but in rising up every time we fail. - Ralph Waldo Emerson.
Internetworking Internet: A network among networks, or a network of networks Allows accommodation of multiple network technologies Universal Service Routers.
Internetworking Internet: A network among networks, or a network of networks Allows accommodation of multiple network technologies Universal Service Routers.
Chapter 20 IP Datagrams and Datagram Forwarding. Connectionless vs Connection-oriented Service TCP/IP’s fundamental delivery service is connectionless.
Communications Services Connection Oriented Service  A connection is established  Data is sent or received over this connection  Connection may be terminated.
CS 4396 Computer Networks Lab
1 Chapter 23 Internetworking Part 3 (Control Messages, Error Handling, ICMP)
Network Layer4-1 Datagram networks r no call setup at network layer r routers: no state about end-to-end connections m no network-level concept of “connection”
1 Kyung Hee University Chapter 8 Internet Protocol (IP)
Internet Protocol: Routing IP Datagrams Chapter 8.
TCP/IP Protocol Suite 1 Chapter 8 Upon completion you will be able to: Internet Protocol Understand the format and fields of a datagram Understand the.
CSC 600 Internetworking with TCP/IP Unit 5: IP, IP Routing, and ICMP (ch. 7, ch. 8, ch. 9, ch. 10) Dr. Cheer-Sun Yang Spring 2001.
1 Internetworking: IP Packet Switching Reading: (except Implementation; pp )
Delivery and Forwarding Chapter 18 COMP 3270 Computer Networks Computing Science Thompson Rivers University.
COMPUTER NETWORKS CS610 Lecture-30 Hammad Khalid Khan.
1 COMP 431 Internet Services & Protocols The IP Internet Protocol Jasleen Kaur April 21, 2016.
Chapter 20 Network Layer: Internet Protocol Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display.
Routing and the IP v4 Address Space BSAD 141 Dave Novak Sources: Network+ Guide to Networks, Dean 2013.
Chapter 22 Q and A Victor Norman IS333 Spring 2016.
IP - The Internet Protocol
Scaling the Network: The Internet Protocol
Chapter 22 Q and A Victor Norman CS332 Fall 2017.
IP Forwarding Covers the principles of end-to-end datagram delivery in IP networks.
IP - The Internet Protocol
CS 428 Computer Networking
IP Forwarding Relates to Lab 3.
IP Forwarding Relates to Lab 3.
IP - The Internet Protocol
Dr. John P. Abraham Professor UTPA
IP Forwarding Relates to Lab 3.
Dr. John P. Abraham Professor UTRGV, EDINBURG, TX
IP Forwarding Relates to Lab 3.
IP - The Internet Protocol
Dr. John P. Abraham Professor UTPA
Net 323 D: Networks Protocols
IP - The Internet Protocol
Scaling the Network: The Internet Protocol
Delivery, Forwarding, and Routing of IP Packets
IP Forwarding Relates to Lab 3.
Networking and Network Protocols (Part2)
IP Forwarding Relates to Lab 3.
ITIS 6167/8167: Network and Information Security
IP - The Internet Protocol
Presentation transcript:

Chapter 22 Q and A Victor Norman IS333 Spring 2015

Quiz Q1: Explain what connectionless delivery means. Q2: Explain how the source IP address in a packet is used during packet forwarding. Q3: Where is the next-hop IP address is found in an IP packet?

Quiz Q4: The “predictive activity” on Monday was… a.Very useful in understanding the reading. b.Somewhat useful in understanding the reading. c.Neither useful nor un-useful. d.Not very useful in understanding the reading. e.Not useful at all in understanding the reading.

IP packet lengths Q: Is there a minimum length for an IP datagram? A: Yes. The minimum length is 20 bytes (20 byte IP header, 0 bytes of data). The maximum length is 65,536 bytes (max value that can be represented in a 16-bit field).

TTL Field Q: What exactly is the TTL field, and is it similar to the reassembly timer? A: The TTL field is the number of times the packet can be forwarded before it should be discarded. Aka the number of “hops” it can traverse. Each router decrements its value. It is unrelated to the reassembly timer.

Finding matches in the forwarding/routing table Q: Can you explain the algorithm in section 22.7 better? A: The equation is (for entry i in the table): if mask[i]& destAddr == dest[i]: forward packet to nexthop[i]. mask[i] & destAddr gives the network portion of the packet’s dest addr – which is what routing is based on. nexthop[i] is the next router (or the ultimate destination) to see the packet to.

Longest Prefix Match Example: suppose you have a router with a LAN on interface eth1: /24. But, you have the CEOs machine, , on interface eth7. Your routing table should look like this: DestMaskGateway/NextHop direct, eth direct, eth7 default0eth2 (rest of network)

Typical MTU sizes Q: How big are MTUs, normally? A: From a Microsloth website: NetworkMTU (bytes) 16 Mbps Token Ring Mbps Token Ring4464 FDDI4352 Ethernet1500 IEEE 802.3/ PPPoE (WAN Miniport)1480 X.25576

Fragmentation Algorithm Q: How does a host/router fragment packets? A: It puts the most data it can in each fragment, leaving the rest for the last fragment (even if it is only 1 byte).

Reassembly Timer Q: What is the typical duration of a reassembly timer? A: On Ubuntu, it is 30 seconds. On Windows, it is 60 seconds. Q: What is it? A: It is how long a host holds packet fragments before giving up on receiving them all.

Reassembly Handling Q: What happens if a packet cannot be reassembled in time? Does the sender/receiver receive a notification? A: No. There are no notifications because IP delivery is best-effort.

Old Slides

Connectionless? Q: Could you explain what connectionless service is more clearly? Every host must 'connect' to a network somehow. Is the term 'connectionless' therefore not a bit of a misnomer? A: Connectionless means that no end-to-end setup or tear-down of the connection is done – i.e., it is not a “circuit”. Packets are just sent and forwarded hop-by-hop to the destination.

Forwarding/routing? Q: Is the forwarding table the same as the routing table? A: Yes. Same thing. Q: How is each hop determined by the destination IP? A: Each router looks at the packet’s dest IP address and consults its routing table to figure out where to send the packet next.

IP datagram vs Hardware frame Q: What is the difference between an IP datagram and a hardware frame? Is it just that one uses as IP address and one uses a MAC address? A: Both are “PDUs” – protocol data units. IP calls its stuff a “datagram”. The datagram is sent down to layer 2 to be encapsulated in a layer 2 “frame” to be sent over the local network.

Best-effort Delivery Q: In the Best-Effort Delivery, what does it mean that “IP is designed to run over any type of network”? And, how is IP “best-effort”? A: It means that IP was designed to operate over networks that provide few guarantees. It does not require absolutely perfect, fast, robust layer 2 hardware/protocols. It just requires that the lower layer do its best to deliver the frames correctly. And, it will do the same.

TTL field Q: Can you explain the TTL field? A: Each packet’s TTL (time-to-live) field is initialized to 64 (recommended). Each time a router forwards a packet, it decrements the TTL value. If the TTL reaches 0, the packet is dropped (and an ICMP packet may be sent to original sender).

TTL reason Q: What is the role of the TTL field? A: To prevent packets from looping forever if there is a “routing loop” – forwarding tables on neighboring routers (mistakenly) send the packet back and forth to each other forever.

&-ing process Q: Could you go over a few examples of the &- ing process used in forwarding tables? A: Sure… let’s look at section 22.6 and 22.7.

Forwarding Q: Do forwarding algorithms (for Internet forwarding tables) ever change, or do they simply get longer? A: Forwarding tables do change size, theoretically. On hosts and most routers they probably don’t change very often, if ever. They are based on the IP addresses assigned to interfaces, and a default route, which usually comes via DHCP or a routing protocol (which we haven’t talked about).

Host-specific routes Q: How is host-specific routing different from “normal” routing (how does it make it more efficient)? A: The forwarding algorithm is not different. A host-specific route is chosen because it has the longest prefix (/32). (Just like the default route is chosen only if nothing else matches, because it has the shortest prefix (/0).)

Why LPM? Q: Why does forwarding software choose to forward entries with the longest prefixes (and therefore more specific), first? A: It makes sense. If you had to forward a package to somewhere in South Grand Rapids, and you were told you had two choices – send it to Grand Rapids, or South Grand Rapids, you’d choose the more specific one.

Implications of lost packets Q: What does an internet users actually experience when datagrams are lost? Is it errors, slow internet, or something else? A: Depends on the application. If the application does not care about lost datagrams, then maybe nothing out of the ordinary is experienced. If the application requires all data be there, then you’ll get slower response times from the network, etc. This is determined by the Layer 4 protocol in use.