Shivkumar KalyanaramanRensselaer Q1-1 Internet Protocols: Quiz 1 q This quiz consists of true/false questions for 25 pts and two quantitative problems.

Slides:



Advertisements
Similar presentations
Discussion Monday ( ). ver length 32 bits data (variable length, typically a TCP or UDP segment) 16-bit identifier header checksum time to live.
Advertisements

IPv4 - The Internet Protocol Version 4
Network Layer – IPv4 Dr. Sanjay P. Ahuja, Ph.D.
Umut Girit  One of the core members of the Internet Protocol Suite, the set of network protocols used for the Internet. With UDP, computer.
4: Network Layer4a-1 IP Addressing: introduction r IP address: 32-bit identifier for host, router interface r interface: connection between host, router.
Transport Layer – TCP (Part1) Dr. Sanjay P. Ahuja, Ph.D. Fidelity National Financial Distinguished Professor of CIS School of Computing, UNF.
Shivkumar Kalyanaraman Rensselaer Polytechnic Institute 5-1 Internet Protocol (IP): Packet Format, Fragmentation, Options Shivkumar Kalyanaraman Rensselaer.
Network Layer Packet Forwarding IS250 Spring 2010
IP Suite© Dr. Ayman Abdel-Hamid, CS4254 Spring CS4254 Computer Network Architecture and Programming Dr. Ayman A. Abdel-Hamid Computer Science Department.
The Network Layer Chapter 5. The IP Protocol The IPv4 (Internet Protocol) header.
Chapter 5 The Network Layer.
Shivkumar Kalyanaraman Rensselaer Polytechnic Institute 1 ECSE-6961:Internet Protocols Quiz 1: Solutions Time: 60 min (strictly enforced) Points: 50 YOUR.
11- IP Network Layer4-1. Network Layer4-2 The Internet Network layer forwarding table Host, router network layer functions: Routing protocols path selection.
Shivkumar Kalyanaraman Rensselaer Polytechnic Institute 1 ECSE-6961:Internet Protocols Quiz 1 Time: 60 min (strictly enforced) Points: 50 YOUR NAME: Be.
Shivkumar KalyanaramanRensselaer Q1-1 ECSE-6600: Internet Protocols Quiz 1 Time: 60 min (strictly enforced) Points: 50 YOUR NAME: Be brief, but DO NOT.
1 Internet Networking Spring 2005 Tutorial 2 IP Checksum, Fragmentation.
Internet Networking Spring 2003
CSCI 4550/8556 Computer Networks Comer, Chapter 20: IP Datagrams and Datagram Forwarding.
Shivkumar Kalyanaraman Rensselaer Polytechnic Institute 1 Informal Quiz 1 True or False? T F  The structure of MAC addresses facilitates scalability.
1 Internet Networking Spring 2002 Tutorial 2 IP Checksum, Fragmentation.
Network Layer4-1 Network layer r transport segment from sending to receiving host r on sending side encapsulates segments into datagrams r on rcving side,
Shivkumar Kalyanaraman Rensselaer Polytechnic Institute 1 ECSE-6600: Internet Protocols Quiz 1 SOLUTIONS Time: 60 min (strictly enforced) Points: 50 YOUR.
Network Layer4-1 Network layer r transport segment from sending to receiving host r on sending side encapsulates segments into datagrams r on rcving side,
Shivkumar Kalyanaraman Rensselaer Polytechnic Institute 1 Informal Quiz 2 True or False? T F  The IP checksum protects the entire IP datagram 
IP-UDP-RTP Computer Networking (In Chap 3, 4, 7) 건국대학교 인터넷미디어공학부 임 창 훈.
Gursharan Singh Tatla Transport Layer 16-May
© Janice Regan, CMPT 128, CMPT 371 Data Communications and Networking Network Layer ICMP and fragmentation.
The Network Layer. Network Projects Must utilize sockets programming –Client and Server –Any platform Please submit one page proposal Can work individually.
Review: –What is AS? –What is the routing algorithm in BGP? –How does it work? –Where is “policy” reflected in BGP (policy based routing)? –Give examples.
TCOM 509 – Internet Protocols (TCP/IP) Lecture 03_a
The Saigon CTT Semester 1 CHAPTER 10 Le Chi Trung.
TCP : Transmission Control Protocol Computer Network System Sirak Kaewjamnong.
CCNA 1 v3.0 Module 11 TCP/IP Transport and Application Layers.
Dr. John P. Abraham Professor UTPA
1 Network Layer Lecture 15 Imran Ahmed University of Management & Technology.
Layer 3: Internet Protocol.  Content IP Address within the IP Header. IP Address Classes. Subnetting and Creating a Subnet. Network Layer and Path Determination.
Networks and Protocols CE Week 7b. Routing an Overview.
Network Layer4-1 The Internet Network layer forwarding table Host, router network layer functions: Routing protocols path selection RIP, OSPF, BGP IP protocol.
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”
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.
Network Layer by peterl. forwarding table routing protocols path selection RIP, OSPF, BGP IP protocol addressing conventions datagram format packet handling.
Shivkumar KalyanaramanRensselaer Q3-1 Internet Protocols: Quiz 3 q This quiz consists of true/false questions for 20 pts and three short answers problems.
Internet Protocol Version 4 VersionHeader Length Type of Service Total Length IdentificationFragment Offset Time to LiveProtocolHeader Checksum Source.
1 Figure 3-5: IP Packet Total Length (16 bits) Identification (16 bits) Header Checksum (16 bits) Time to Live (8 bits) Flags Protocol (8 bits) 1=ICMP,
Chapter 4 Network Layer Computer Networking: A Top Down Approach 6 th edition Jim Kurose, Keith Ross Addison-Wesley March 2012 A note on the use of these.
The Internet Network layer
Data Communications and Computer Networks Chapter 4 CS 3830 Lecture 19 Omar Meqdadi Department of Computer Science and Software Engineering University.
1 IP Checksum Calculation At the sender r Set the value of the checksum field to 0. r Divide the header into 16-bit words m Add all segments using one’s.
1 Kyung Hee University Chapter 11 User Datagram Protocol.
IP Fragmentation. Network layer transport segment from sending to receiving host on sending side encapsulates segments into datagrams on rcving side,
IP Internet Protocol. IP TCP UDP ICMPIGMP ARP PPP Ethernet.
Packet Switch Network Server client IP Ether IPTCPData.
Introduction to Networks
Chapter 11 User Datagram Protocol
Chapter 4: Network Layer
IP - The Internet Protocol
Internet Networking Spring 2002
IP - The Internet Protocol
Internet Control Message Protocol (ICMP)
CS 457 – Lecture 10 Internetworking and IP
IP - The Internet Protocol
Checksum Calculations
Internet Control Message Protocol (ICMP)
Dr. John P. Abraham Professor UTPA
Internetworking Outline Best Effort Service Model
Dr. John P. Abraham Professor UTRGV, EDINBURG, TX
Dr. John P. Abraham Professor UTPA
IP - The Internet Protocol
Introduction to Networks
IP - The Internet Protocol
Presentation transcript:

Shivkumar KalyanaramanRensselaer Q1-1 Internet Protocols: Quiz 1 q This quiz consists of true/false questions for 25 pts and two quantitative problems for 25 pts. q In the True/False questions, the following grading policy will be used: q Correct answer: +1 pt q Wrong answer: -1 pt (negative grading is used) q Blank/Unattempted: 0 pts q There will be no negative grading for the quantitative problems. Partial credit may be awarded where appropriate. q Open book policy q Time: 45 min. Strictly enforced. q This is the first quiz out of three quizzes. Best two out of three will be considered for final grades. Each of the two quizzes chosen will be weighted equally.

Shivkumar KalyanaramanRensselaer Q1-2 True or False? (25 points) Note: Correct Ans = +1; Wrong Answer = -1; Did not attempt = 0 T F  Layering is desired because it is the most efficient way of designing and implementing network protocols  If a router looks at the TCP or UDP port numbers to base any of its decisions, it is a violation of layering.   A multihomed host must be configured as a router to allow communication between the networks on the two interfaces   The sockets API models the network as an I/O device with the open-read- write-close paradigm, the difference being that a socket need not be “bound” to an address upon creation.  Typically, ISPs assign IP addresses dynamically to its dial-up clients  As a packet passes from one end to another, it will change some of its address fields depending upon the network it traverses  Ethernet and IP perform a limited protocol-based demultiplexing, whereas TCP/UDP ports allow more flexible port-based demultiplexing

Shivkumar KalyanaramanRensselaer Q1-3 T F  A telnet server demultiplexes incoming TCP segments based upon its local IP address and port number.  A collision domain marks the boundaries of an Ethernet LAN   The 48-bit LAN address has internal structure, but it is considered a “flat” address since the entire address is required at every stage to forward the packet   The key difference between Ethernet and is that the latter has a length field, which means that the former cannot support variable length packets.  Typical IP overhead is 20 bytes while Ethernet overhead is 14 bytes  The Initial Seq Number (ISN) is periodically incremented to avoid confusion from packets belonging to previous incarnations  SLIP and PPP both support dynamic IP address assignment  When a header checksum error is detected, IP quietly drops the packet and reports the error to the source  Fragments are created at 8-octet boundaries

Shivkumar KalyanaramanRensselaer Q1-4 True or False? T F  A result of the “end-to-end” principle was that complex control functions were pushed to the edge while the forwarding path was kept as simple as possible.  Subnetting allows more levels of hierarchy in the addressing structure.   The IP addresses and belong to the same subnet   Subnetting transforms classful addressing into classless addressing  The reason IP addressing is hierarchical is because the router can look at a portion of the address to decide where to forward it.  Though the IP max length is octets, a destination need not accept a datagram larger than 576 bytes  If a UDP checksum value is zero, it means that the sender did not compute a checksum  On an Ethernet, the MSS is1500 bytes  The 2MSL wait allows TCP servers to be brought down and brought up immediately

Shivkumar KalyanaramanRensselaer Q1-5 q 1) a) (7 pts) The IP checksum involves 1’s complement arithmetic on 16-bit quantities. Use a similar technique, but on 4-bit quantities to compute the blank checksum field: ____

Shivkumar KalyanaramanRensselaer Q1-6 q 2) a) (13 pts) An IP datagram of length 2000 bytes needs to cross an Ethernet (MTU = 1500B) followed by a WAN (MTU = 576B). How many fragments reach the destination ? What are the values of the Header length, More bit, Offset, and Length fields in each fragment ?

Shivkumar KalyanaramanRensselaer Q1-7 Gimme the Solutions!!!

Shivkumar KalyanaramanRensselaer Q1-8 True or False? (25 points) Note: Correct Ans = +1; Wrong Answer = -1; Did not attempt = 0 T F    Layering is desired because it is the most efficient way of designing and implementing network protocols   If a router looks at the TCP or UDP port numbers to base any of its decisions, it is a violation of layering.    A multihomed host must be configured as a router to allow communication between the networks on the two interfaces    The sockets API models the network as an I/O device with the open-read- write-close paradigm, the difference being that a socket need not be “bound” to an address upon creation.   Typically, ISPs assign IP addresses dynamically to its dial-up clients   As a packet passes from one end to another, it will change some of its address fields depending upon the network it traverses   Ethernet and IP perform a limited protocol-based demultiplexing, whereas TCP/UDP ports allow more flexible port-based demultiplexing

Shivkumar KalyanaramanRensselaer Q1-9 T F    A telnet server demultiplexes incoming TCP segments based upon its local IP address and port number.    A collision domain marks the boundaries of an Ethernet LAN    The 48-bit LAN address has internal structure, but it is considered a “flat” address since the entire address is required at every stage to forward the packet    The key difference between Ethernet and is that the latter has a length field, which means that the former cannot support variable length packets.    Typical IP overhead is 20 bytes while Ethernet overhead is 14 bytes   The Initial Seq Number (ISN) is periodically incremented to avoid confusion from packets belonging to previous incarnations    SLIP and PPP both support dynamic IP address assignment    When a header checksum error is detected, IP quietly drops the packet and reports the error to the source   Fragments are created at 8-octet boundaries

Shivkumar KalyanaramanRensselaer Q1-10 True or False? T F   A result of the “end-to-end” principle was that complex control functions were pushed to the edge while the forwarding path was kept as simple as possible.   Subnetting allows more levels of hierarchy in the addressing structure.    The IP addresses and belong to the same subnet    Subnetting transforms classful addressing into classless addressing   The reason IP addressing is hierarchical is because the router can look at a portion of the address to decide where to forward it.   Though the IP max length is octets, a destination need not accept a datagram larger than 576 bytes   If a UDP checksum value is zero, it means that the sender did not compute a checksum    On an Ethernet, the MSS is 1500 bytes    The 2MSL wait allows TCP servers to be brought down and brought up immediately

Shivkumar KalyanaramanRensselaer Q1-11 q 1) a) (7 pts) The IP checksum involves 1’s complement arithmetic on 16-bit quantities. Use a similar technique, but on 4-bit quantities to compute the blank checksum field: ____ Checksum = 1s complement sum of the 1s complement of 4-bit quantities. 1s complement of 1111, 0000, 1100, 0101, 1000 is 0000, 1111, 0011, 1010, s complement sum: = = (carry) = = = (carry) = 0101 Ans: Checksum = 0101

Shivkumar KalyanaramanRensselaer Q1-12 2) a) (13 pts) An IP datagram of length 2000 bytes needs to cross an Ethernet (MTU = 1500B) followed by a WAN (MTU = 576B). How many fragments reach the destination ? What are the values of the More bit, (fragment) offset, and Length fields in each fragment ? IP Datagram 2000B => payload = 1980B > Enet MTU = 1500B => Max IP payload is nearest multiple of 8 to 1480B (1500B - 20B) = 1480B => 1st fragment: Length = (1480B + 20B) = 1500B; MF set; Fragoff = 0 2nd fragment: Length = (500B + 20B) = 520B; MF not set; Fragoff (13-bit quantity) = 1480 >> 3 = 185 WAN MTU = 576B => 1st fragment needs to be refragmented. Nearest multiple of 8 to (576B - 20B = 556B) is 552B. => Fragment 1a: Length = (552B + 20B) = 572B; MF set; Fragoff = 0 Fragment 1b: Length = (552B + 20B) = 572B; MF set; Fragoff = 69 Fragment 1c: Length = (376B + 20B) = 396B; MF set; Fragoff = 138 Fragment 2 not fragmented further. Ans: Four fragments reach the destination with the fields highlighted above.