Important note! Please start with problems 1-4; because your grade is F if you do not reach at least 15 (fifteen) points out of 20 for problems 1-4!
|
|
- Geraldine Parks
- 6 years ago
- Views:
Transcription
1 Examination DD2392 Protocols and Principles of the Internet EP2120 Internetworking Date: 10 March 2009 at 8:00 13:00 a) No help material is allowed - You are not allowed to use dictionaries, books, or calculators! b) You may answer questions in English or in Swedish. c) Please answer each question on a separate page. d) Please write concise answers! e) Put a mark in the table on the cover page for each question you have addressed. f) The grading of the exam will be completed no later than 1 April g) After grading, the exams will be available for inspection at STEX (Q-building). h) Deadline for written complaints is 30 April 2009 i) Course responsible DD2392 is Olof Hagsand, phone j) Course responsible EP2120 is György Dán, phone Important note! Please start with problems 1-4; because your grade is F if you do not reach at least 15 (fifteen) points out of 20 for problems 1-4!
2 Part one (Problems 1-4) 1. IP addressing and IP header (5p) a) You want to install a wireless router at home. The router obtains the public IP address on its wired interface from your ISP (towards the Internet), and can be configured to use private IP addresses from the block /23 on its wireless interface. You plan to use at most 15 computers simultaneously at home, and would like to use the smallest possible subnet on the wireless interface. What is the longest possible netmask for the subnet? (1p) You will need 18 addresses (15 for hosts, 1 net, 1 broadcast, 1 router), so you will need a /27 network. The netmask is b) Give the network address of your subnet in CIDR notation! Propose an IP address for the wireless interface of the wireless router! (1p) The network address is /27. The router could use c) What is the directed broadcast address of the subnet? (1p) d) Why is there a limitation on the maximum size of the IPv4 options? What is the maximum size of the IPv4 options? Name one IPv4 option that is affected by the size limitation (affected in the sense that its usefulness is limited because of size limitation). (1p) Because the header length field is 4 bits long, has granularity 4 bytes. The max size of the header is 60 bytes, out of which 20 bytes is the base header. Examples: strict source route, loose source route, timestamp, record route. e) What is the maximum size of an IPv6 datagram? Why? (1p) With the jumbo payload extension header it is 2^ Delivery and address resolution (5p) a) When is direct delivery used to deliver a datagram in an IP network? (1p) If the destination host is on the same link as the host that tries to send the datagram. b) Which protocol is used to perform address resolution in IPv6? (1p) ICMPv6 neighbour solicitation and advertisement. Consider the following IPv4 network consisting of 2 bridges and 1 router. Hosts H 1 to H 6 have one interface each. B 1 and B 2 are learning bridges. R 1 is a router with an appropriate routing table. All ARP caches and the bridges learning tables are empty. Assume that ARP snooping is used. H 1 B 1 H 2 H 3 H 4 R 1 H 5 B 2 H 6
3 c) Add the necessary physical (MAC) and logical (IP) addresses, and identify the subnets! Use small letters to denote the MAC addresses and capital letters to denote the IP addresses (e.g., a-a). (1p) The bridges do not need an IP address or a MAC address. The router has addresses g-g,h- H,i-I,j-J starting from the interface to H3 clockwise. d) A process on Host H 5 sends 100 bytes via UDP to a process on host H 6. Show the contents of the learning tables and the ARP caches after the packet has been delivered. Assume that the process on Host H 5 knows the IP address of Host H 6. (1p) H5: f-f H6: e-e R1: e-e B2: e:west, f: East e) A process on Host H 6 sends 100 bytes via UDP to a process on host H 1. Assume that the process on Host H 6 knows the IP address of Host H 1. Show the new contents of the ARP caches and the learning tables. (1p) R1: f-f H6: j-j B2:j-North B1:h-South, a-west R1: a-a H1: h-h H2: h-h 3. IP forwarding (5p) a) Which fields of the IPv4 base header have to be updated by a router upon forwarding a datagram (assume that fragmentation is not needed)? (1p) The TTL field and the header checksum. A router has the IPv4 forwarding table shown below. Determine the next-hop address and the outgoing interface for the packets arriving to the router with destination addresses as given in points (b)-(e). Destination Next hop Flags Interface /24 - U m /16 - U m /18 - U m / UG m / UG m / UG m / UG m / UG m1 b) (1p) on m1 (default route) c) (1p) on m0 d) (1p) on m1 (default route) e) (1p) on m2 (direct delivery)
4 4. TCP (5p) a) Describe the purpose of TCP congestion control. (1p) The purpose of TCP congestion control is to avoid overloading the network and to ensure fair usage of the network resources. b) Describe how the congestion avoidance phase of TCP congestion control works. (1p) Congestion avoidance starts when CWND surpasses SSTRESH. It consists of additive increase and multiplicative decrease. If there are no losses, the congestion window CWND is increased by 1MSS every time data worth a full congestion window is transmitted. (i.e., approx every RTT time). If a loss event is detected (Retransmission timeout), then the SSTRESH is set to half of the current congestion window CWND and congestion control enters the slow start phase, i.e., congestion window CWND=1 MSS. c) Describe how the retransmission timeout (RTO) is calculated in TCP (describe both the case without losses and with losses). (2p) RTO=sRTT+4RTTdev. The smoothed RTT (srtt) estimate is calculated based on the measured RTT values according to an exponentially weighted moving average. Similarly, the deviation of the RTT (RTTdev) is measured and updated using an exponentially weighted moving average. If a loss is detected (timeout), the RTO is doubled. The srtt is not updated when the acknowledgement received concerns a retransmitted segment (Karn s algorithm.) d) You would like to use TCP to transmit data over a transmission link of 1Mbps capacity. The end-to-end one way delay is 100ms. What is the minimum size of the receiver window that TCP should use if the link should be fully utilized? How can the receiver window be as big as needed? (1p) The bandwidth delay product of the link is bps*0.2s = /8bytes = 25000B. This is less than 65535, so there is no need for window scaling. Part two (Problems 5-12) 5. UDP and fragmentation (5p) a) What are the two major differences between how fragmentation is implemented in IPv4 and in IPv6? (hint: where is fragmentation done and where is the necessary information transmitted) (1p) In IPv6 fragmentation can only be done in the end hosts (not in the routers). In IPv6 the fragmentation related information is carried in an extension header (not in the base header). An application wants to transmit 2940 bytes of data via UDP from host A to host B. The UDP header is 8 bytes long. The path consists of two networks: the MTU of the first network is 1500 bytes, and the MTU of the second network is 1400 bytes. b) The network layer protocol is IPv4, and there are no IP options used. How many IP fragments arrive at host B? Give the segment sizes, the fragmentation offset and the more fragments (MF) bit of all fragments. (3p) Total amount of data to be sent is =2948 bytes. The host sends two segments: 1, 1480, 1, 0 2, 1468, 0, 1480 The router has to fragment both fragments 1, 1376, 1, 0 2, 104, 1, , 1376, 1, 1480
5 4, 92, 0, 2856 c) The last fragment of the datagram is lost on the first link. How many bytes will be delivered to the receiving application and how much time after the reception of the penultimate fragment? (1p) The datagram will be discarded after the fragmentation reassembly timeout expires at the receiving host. No data will be delivered to the receiving application. 6. Application layer (5p) a) What does network byte order mean? Why is there a need for it? (1p) Network byte order is the standard byte order used in the TCP/IP protocol stack. It is the Big endian order. There is a need for a standard such that network applications can exchange multi-byte words (they should know how to interpret the numbers.) b) Name two ways in which Multipurpose Internet Mail Exchange (MIME) extends SMTP. (1p) Textual message bodies in other character sets, multi-part message bodies, header information in other character sets, non-textual message bodies. c) What are the two major advantages (new features) of HTTP 1.1 compared to HTTP 1.0? (1p) Persistent connections and compression. d) What is the Session Initiation Protocol (SIP)? How does it relate to H.323? Name one SIP protocol message. (1p) SIP is a signalling protocol originally developed for real-time communications for session management. It provides more or less the same functionality as H.323. Example: INVITE e) What is delay jitter? How does the Real-time Transport Protocol (RTP) help to combat delay jitter? (1p) Delay jitter is the variation of the one way transmission delay between two hosts. RTP includes a timestamp. Using this time stamp the receiver can know when to play back the data contained in the individual packets from the playout buffer. 7. DNS 1 (5p) Answer the following questions about DNS (Domain Name System). Please be concise. a) What is a stub resolver? A client library making recursive lookups to a resolving nameserver b) What is a resolving nameserver? A nameserver that performs recursive lookups on behalf of clients. It caches results that can re-used by other client lookups. c) What is an authoritative ( advertizing ) nameserver? A nameserver that is authoritative for a zone and answers on iterative requests from resolving nameservers. c) What is a master nameserver? An authoritative nameserver containing the original zone data, eg in the form of a zone file. Changes to the zone file is loaded into the master nameserver. Also called primary nameserver. d) What is a slave nameserver? A slave nameserver (secondary) is also authoritative for a zone but gets the zone data from a master nameserver. e) What is full zone transfer and how does it work? Full zone transfer is when the complete zone information is transferred from a master nameserver to a slave nameserver. The slave periodically queries the master and when the
6 serial numbers do not match (if the master has a higher serial number), the master sends the complete zone file via TCP to the slave (AXFR). f) How does incremental zone transfer work. How does it differ from full zone transfer? Instead of sending all zone data, the master only sends increments between the two versions. For this to work, the master must keep track of zone file differences, so when the slave asks to be updated from a specific serial number, the master only sends differences from that previous number to the most updated. This is called IXFR and is also made with TCP. g) How does DNS notify work? When a change has been made in the master zone file, the master notifies all slaves of the change. The slaves can then proceed with IXFR or AXFR. h) What is the full domain name (FQDN) of the IPv4 address as it could appear in a PTR record? inet.arpa i) What is the full domain name (FQDN) of the IPv6 address 2001:6b0:1::246? b ip6.arpa 8. DNS II (5p) Cache effectiveness is an important and fundamental part of the DNS design. Answer the following questions: a) Assume that you have a large site with many resolving nameservers but a very limited bandwidth link to the rest of the Internet which you want to use as little as possible. How can you design DNS at this site in order to increase caching? (2p) A common way to better use caching on a site is to use one single nameserver as a forwarder. All other resolving nameservers on a site forward their external (queries that they are not authoritative for) to the forwarder instead of quering the root nameservers (or other cached external nameservers). The forwarder itself make external iterative queries starting with the root nameservers. With this arrangement, the forwarder builds up a common cache for all resolving nameservers of the site. Note that this question is about resolving nameservers, there is no mentioning of zones and authoritative nameservers. Answers about master and slave nameservers or settings of TTL are not relevant. b) DNS caches can be exploited by attackers using DNS cache poisoning. What is DNS cache poisoning? Explain its effects for an end-user, how it can be detected, and avoided? (1.5p) DNS cache poisoning is made by inserting false DNS result records in a caching (resolving) name-server's cache. Specifically, it is common with a fake NS record mapping redirecting queries to a nameserver under the control of an attacker. A user then makes accesses to what seems to be a real web-page (for example) but are in reality made to a fake sites where false information can be planted. Without end-to-end security (such as TSL or SSH) it is difficult to detect false DNS mappings, since it is difficult to know which IP addresses are actually correct. One could query other nameeservers or make recursive queries, but this is difficult in practice. DNSSEC is a systematic way to avoid cache poisoning. d) Describe one method an attacker may use to perform DNS cache poisoning. (1.5p) (1) An attacker tries to inject false replies to queries made by a resolving name-server A towards an advertising nameserver B. The attacker must spoof a message which A accepts as correct before the correct reply is received from B. To do this, the attacker must know (or guess) the source port of A, the transaction id and the destination address B. Additionally, the attacker can also slow down the reply by (eg) attacking B and thus get more time to fake a reply. Another way is to lure a client to make an access to a rogue nameserver who in its response
7 will append glue records for a well-known NS mapping to a rogue address. Other clients using the same resolving nameserver A will be directed to the rogue address when quering for addresses of the well-known domain. 9. Routing I (5p) Please answer the following question in a concise way. e) What is asymmetric routing? Traffic between two end-points takes different paths in different directions. To-traffic takes a different path than the return traffic. f) What is equal-cost multi-path? Several paths computed by a routing protocol with equal costs. Such paths can be used for load-balancing of traffic. g) What is route-preference (also known as administrative distance )? Priority of different protocols. For example, a route computed by BGP can have higher route preference than the same route computed by OSPF, in which case the OSPF route has preference over the BGP route. h) Explain the hot-potato routing policy If an external route is announced to a network on several exits, a hot-potato routing policy chooses the closest exit. i) What is the difference between a routing information base (RIB) and a forwarding information base (FIB) A RIB contains all routing protocol information necessary for computing routes. A FIB is a compiled table of forwarding information including sufficient information to make a local lookup. RIBs contain per-protocol information. FIBs are optimized for fast lookups. RIBs are in the control-plane, FIBs are made for the data-plane. j) What is route redistribution? A transfer of a route from one routing protocol to another. For example, routes from an internal routing protocol can be redistributed into BGP. k) What is an aggregate route? When is it used? A route composed of several sub-routes. Often used when announcing a more general route from a sub-network. l) What are the most important advantages of link-state routing protocols compared to distance-vector routing protocols? Full topology information causing more correct route computation, faster convergence, better debugging information, and less protocol traffic. m) How does path-vector extend distance-vector? In particular, how does path-vector extend distance-vector in the case of BGP (Border Gateway Protocol)? Path-vector records the path a route has been propagated in order to detect loops. In BGP the path vector consists of an vector of AS numbers. n) Name three methods to counter the count-to-infinity instability problem encountered in distance-vector protocols. Split-horizon, poison reverse, triggered update, hold-down.
8 10. Routing II (5p) A /24 C D 2 8 E F B 10 8 G /24 Regard the multi-homed network in the figure consisting of routers C-G that constitute the autonomous system AS1. A and B are uplinks in two different autonomous systems. Assume routers C-G run a link-state routing protocol such as OSPF (Open Shortest Path First) as intradomain routing protocol. The link metrics are shown in the figure for the internal network. There are two BGP (Border Gateway Protocol) sessions between A-C and B-G. There are two access networks, /24 and /24. All other links are unnumbered point-to-point links, where there is no IP-subnet associated. The router-id's given in the figure (A-G) represent routable IP host addresses. Initially there is no transit traffic passing through AS1. a) Compute the Dijkstra algorithm from router C for the internal network AS1. Use C-G as routerid's that should be a part of the computation along with the two access networks. Complete the table below indicating each step in the computation. Indicate cumulative cost using parenthesis after the routerid/network. Are there any equal-cost multipath routes? (3p) Step Permanent set Tentative set Comment 1 C(0) /24(4), D(2), E(8), F(8) 2 + D(2) /24(4), F(8), E(5), G(12) /24(4) F(8), E(5) G(12), C's neighbors added to tentative D added to permanent, and its neighbors added to tentative 4 + E(5) F(8), G(12), F(8) Note, two equal cost paths to F with two different nexthops! 5 + F(8) G(11) 6 + G(11) /24(15)
9 /24(15) Equal cost-multipath is first found to F (from C) and all networks which pass through F: G, and /24. b) Assume you want all external traffic(both incoming and outgoing) to pass via the C-A peering and no external traffic to pass via the G-B peering. How would you configure your routing? Explain in words how your intra-domain routing protocol and BGP should be configured, routes be announced and/or redistributed.(2p) C announces the prefixes of AS1 externally via BGP while no prefixes are announced by G in order to get all incoming traffic via C. To get all outgoing traffic via C, a default route can be announced from C via OSPF internally, for example. 11. Autoconfiguration (5p) Please answer the following questions: a) How do you ensure that two hosts on the same link do not use the same link-local address? (1p) By probing for addresses, typically using an ARP request for the probed address. If no answer is sent, the address can be used. The address can be constructed via random assignment, in IPv6 also via MAC address append to the link-local prefix. In any case, probing must still be done. b) What are the source and destination IPv4 addresses of initial DHCP requests sent by a host that has not yet obtained a routable address? (1p) and respectively. c) Using IPv6 stateless autoconfiguration, how are routable addresses obtained by a host? (1p) Using router advertisments / router solicitations d) How is expiration of addresses handled by DHCP clients: How do clients know when addresses expire? How do clients act in order to lengthen the lease? How do clients act when an address lease actually expires? (2p) Clients lease addresses for a specific time period. When 50% of the time has expired, a new DHCP request is made, thereafter again when 87.5% of the time has expired. If the server still does not reply, the client will have to start from scratch by obtaining a new address using the discover mechanism. 12. Tunneling and NAT (5p) Please answer the following questions in a concise way: a) Name two uses of tunneling in IP networking (1p) IPv6 over IPv4, Multicast over IP, IPSEC, Mobility, L2/L3 VPN, pseudo-wire, etc, etc. b) TTL(Time To Live) and MTU(Maximum Transmission Unit) may pose problems when using tunneling. Why is this so? (2p) In a tunnel, the TTL is not decremented (automatically). This may lead to reduced debugging possibility, ICMP does not work correctly. MTU: an extra header is used for encapsulation which reduces the (relative) payload so that extra fragmentation may be necessary. c) Suppose a host on a private network with private IPv4 address A, opens a UDP stream to a destination with global IPv4 address B via a symmetric NAT with global IPv4 address C. The source port of the stream at A is P and the destination port of the stream at B is Q.
10 Propose a NAT binding in the NAT after the initial UDP packet has been sent from A to B. (1p) NAT binding: A/P <-> C/X (X is ephemeral) Filtering: B/Q d) In the NAT setting described in the previous question, provide a networking situation where a symmetric and a full-cone NAT would yield different results. Explain why. (1p) In a full-cone NAT, another host, D, can send a packet to C/X and thus reach A. In a symmetric NAT, only B can use the binding from the outside.
Examination DD2393 Protocols and Principles of the Internet EP2120 Internetworking. Date: 10 January 2011 at 14:00 18:00
Examination DD2393 Protocols and Principles of the Internet EP2120 Internetworking Date: 10 January 2011 at 14:00 18:00 a) No help material is allowed - You are not allowed to use dictionaries, books,
More informationExample questions for the Final Exam, part A
ETSF10, ETSF05 Ht 2010 Example questions for the Final Exam, part A 1. In AdHoc routing there are two main strategies, reactive and proactive routing. Describe in a small number of words the concept of
More informationExamination IK2218 Protocols and Principles of the Internet EP2120 Internetworking. Date: 27 October 2015 at 14:00 18:00
Examination IK2218 Protocols and Principles of the Internet EP2120 Internetworking Date: 27 October 2015 at 14:00 18:00 a) No help material is allowed - You are not allowed to use dictionaries, books,
More informationExamination 2D1392 Protocols and Principles of the Internet 2G1305 Internetworking 2G1507 Kommunikationssystem, fk SOLUTIONS
Examination 2D1392 Protocols and Principles of the Internet 2G1305 Internetworking 2G1507 Kommunikationssystem, fk Date: January 17 th 2006 at 14:00 18:00 SOLUTIONS 1. General (5p) a) Draw the layered
More informationDa t e: August 2 0 th a t 9: :00 SOLUTIONS
Interne t working, Examina tion 2G1 3 0 5 Da t e: August 2 0 th 2 0 0 3 a t 9: 0 0 1 3:00 SOLUTIONS 1. General (5p) a) Place each of the following protocols in the correct TCP/IP layer (Application, Transport,
More informationExamination 2D1392 Protocols and Principles of the Internet 2E1605 Internetworking. Date: June 1 st 2007 at 14:00 19:00 SOLUTIONS
Examination 2D1392 Protocols and Principles of the Internet 2E1605 Internetworking Date: June 1 st 2007 at 14:00 19:00 SOLUTIONS 1. IP and addressing (5p) a) Your company would like to have all its 511
More informationExamination 2D1392 Protocols and Principles of the Internet 2E1605 Internetworking. Date: March 9 th 2007 at 8:00 13:00 SOLUTIONS
Examination 2D1392 Protocols and Principles of the Internet 2E1605 Internetworking Date: March 9 th 2007 at 8:00 13:00 SOLUTIONS 1. IP Addressing? (5p) There are ten nodes connected to your network: a
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/Internetteknik, Examination 2G1305 Date: August 18 th 2004 at 9:00 13:00 SOLUTIONS
Internetworking/Internetteknik, Examination 2G1305 Date: August 18 th 2004 at 9:00 13:00 SOLUTIONS 1. General (5p) a) The so-called hourglass model (sometimes referred to as a wine-glass ) has been used
More informationExamination DD2392 Protocols and Principles of the Internet EP2120 Internetworking. Date: 02 June 2009 at 14:00 19:00
Examination DD2392 Protocols and Principles of the Internet EP2120 Internetworking Date: 02 June 2009 at 14:00 19:00 a) No help material is allowed - You are not allowed to use dictionaries, books, or
More informationFundamental Questions to Answer About Computer Networking, Jan 2009 Prof. Ying-Dar Lin,
Fundamental Questions to Answer About Computer Networking, Jan 2009 Prof. Ying-Dar Lin, ydlin@cs.nctu.edu.tw Chapter 1: Introduction 1. How does Internet scale to billions of hosts? (Describe what structure
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 informationinternet technologies and standards
Institute of Telecommunications Warsaw University of Technology 2017 internet technologies and standards Piotr Gajowniczek Andrzej Bąk Michał Jarociński Network Layer The majority of slides presented in
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 8. Network Layer (cont d) Network Layer 1-1
Lecture 8 Network Layer (cont d) Network Layer 1-1 Agenda The Network Layer (cont d) What is inside a router Internet Protocol (IP) IPv4 fragmentation and addressing IP Address Classes and Subnets Network
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 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 informationCOMPUTER NETWORK. Homework #3. Due Date: May 22, 2017 in class
Computer Network Homework#3 COMPUTER NETWORK Homework #3 Due Date: May 22, 2017 in class Question 1 Host A and B are communicating over a TCP connection, and Host B has already received from A all bytes
More informationCSE 473 Introduction to Computer Networks. Exam 2. Your name here: 11/7/2012
CSE 473 Introduction to Computer Networks Jon Turner Exam 2 Your name here: 11/7/2012 1. (10 points). The diagram at right shows a DHT with 16 nodes. Each node is labeled with the first value in its range
More informationExamination IP routning inom enkla datornät, DD2490 IP routing in simple networks, DD2490 KTH/CSC. Date: 20 May :00 19:00 SOLUTIONS
Examination IP routning inom enkla datornät, DD2490 IP routing in simple networks, DD2490 KTH/CSC Date: 20 May 2009 14:00 19:00 SOLUTIONS a) No help material is allowed - You are not allowed to use books
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 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 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 informationIPv6 Protocols and Networks Hadassah College Spring 2018 Wireless Dr. Martin Land
IPv6 1 IPv4 & IPv6 Header Comparison IPv4 Header IPv6 Header Ver IHL Type of Service Total Length Ver Traffic Class Flow Label Identification Flags Fragment Offset Payload Length Next Header Hop Limit
More informationinterface Question 1. a) Applications nslookup/dig Web Application DNS SMTP HTTP layer SIP Transport layer OSPF ICMP IP Network layer
TDTS06 Computer networks, August 23, 2008 Sketched answers to the written examination, provided by Juha Takkinen, IDA, juhta@ida.liu.se. ( Sketched means that you, in addition to the below answers, need
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 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 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 informationcs144 Midterm Review Fall 2010
cs144 Midterm Review Fall 2010 Administrivia Lab 3 in flight. Due: Thursday, Oct 28 Midterm is this Thursday, Oct 21 (during class) Remember Grading Policy: - Exam grade = max (final, (final + midterm)/2)
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 informationCOMPUTER NETWORK. Homework #3. Due Date: May 22, 2017 in class
Computer Network Homework#2 COMPUTER NETWORK Homework #3 Due Date: May 22, 2017 in class Question 1 Host A and B are communicating over a TCP connection, and Host B has already received from A all bytes
More informationTCP/IP Protocol Suite
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
More informationOn Distributed Communications, Rand Report RM-3420-PR, Paul Baran, August 1964
The requirements for a future all-digital-data distributed network which provides common user service for a wide range of users having different requirements is considered. The use of a standard format
More informationNetwork Layer: Control/data plane, addressing, routers
Network Layer: Control/data plane, addressing, routers CS 352, Lecture 10 http://www.cs.rutgers.edu/~sn624/352-s19 Srinivas Narayana (heavily adapted from slides by Prof. Badri Nath and the textbook authors)
More informationEE-311 Data Communication & Networks
National University of Computer & Emerging Sciences, Islamabad, Pakistan Name: Roll No: EE-311 Data Communication & Networks Summer 2007 Final Thursday, 2 nd August 2007 Total Time: 3 Hours Total Marks:
More informationNetworks Fall This exam consists of 10 problems on the following 13 pages.
CSCI 466 Final Networks Fall 2011 Name: This exam consists of 10 problems on the following 13 pages. You may use your two- sided hand- written 8 ½ x 11 note sheet during the exam and a calculator. No other
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 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 informationETSF10 Internet Protocols Network Layer Protocols
ETSF10 Internet Protocols Network Layer Protocols 2012, Part 2, Lecture 3.1 Kaan Bür, Jens Andersson Network Layer Protocols IPv4, IPv6 [ed.4 ch.20.3+19.2] [ed.5 ch.22.1.1-2+22.2] Transition from IPv4
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 informationEP2120 Internetworking/Internetteknik IK2218 Internets Protokoll och Principer
EP2120 Internetworking/Internetteknik IK2218 Internets Protokoll och Principer Homework Assignment 1 (Solutions due 20:00, Mon., 10 Sept. 2018) (Review due 20:00, Wed., 12 Sept. 2018) 1. IPv4 Addressing
More informationEC441 Fall 2018 Introduction to Computer Networking Chapter4: Network Layer Data Plane
EC441 Fall 2018 Introduction to Computer Networking Chapter4: Network Layer Data Plane This presentation is adapted from slides produced by Jim Kurose and Keith Ross for their book, Computer Networking:
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 informationIPv6. IPv4 & IPv6 Header Comparison. Types of IPv6 Addresses. IPv6 Address Scope. IPv6 Header. IPv4 Header. Link-Local
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
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 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 informationECE4110, Internetwork Programming, QUIZ 2 - PRACTICE Spring 2006
Email Address ECE4110, Internetwork Programming, QUIZ 2 - PRACTICE Spring 2006 Name (Print) Prof. John A. Copeland Practice for April 11, 2006 Tel.: 404-894-5177 E-Mail: copeland@ece.gatech.edu RULES.
More informationCSC458 Lecture 6. Administrivia. Inter-domain Routing IP Addressing. Midterm will Cover Following Topics (2) Midterm will Cover Following Topics
CSC458 Lecture 6 Inter-domain Routing IP Addressing Administrivia Homework: #2 due today #3 out today, due in two weeks (same date as midterm) No lecture next week Reading Week Midterm in two weeks 60
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 informationDepartment of Computer and IT Engineering University of Kurdistan. Network Layer. By: Dr. Alireza Abdollahpouri
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
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 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 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 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 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 informationTCP/IP Networking. Training Details. About Training. About Training. What You'll Learn. Training Time : 9 Hours. Capacity : 12
TCP/IP Networking Training Details Training Time : 9 Hours Capacity : 12 Prerequisites : There are no prerequisites for this course. About Training About Training TCP/IP is the globally accepted group
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 informationNetwork Layer PREPARED BY AHMED ABDEL-RAOUF
Network Layer PREPARED BY AHMED ABDEL-RAOUF Network layer transport segment from sending to receiving host on sending side encapsulates segments into datagrams on receiving side, delivers segments to transport
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 informationTDTS06 Computer Networks Final Exam: 14:00-18:00, Friday, November 1, 2013
Final Examination: 14:00-18:00, Friday, November 1, 2013 Time: 240 minutes Total Marks: 40 Grade Requirements: three (20/40); four (28/40); and five (36/40). Assistance: None (closed book, closed notes,
More informationInitial motivation: 32-bit address space soon to be completely allocated. Additional motivation:
IPv6 Initial motivation: 32-bit address space soon to be completely allocated. Additional motivation: header format helps speed processing/forwarding header changes to facilitate QoS IPv6 datagram format:
More informationFinal Exam. Course Grade
7:20pm, May 12th Final Exam Location: To be announced Two pages of letter-size, double-sided cheating sheets, created by hand Calculator required No other equipments allowed Comprehensive; roughly 70%
More informationIPv6: An Introduction
Outline IPv6: An Introduction Dheeraj Sanghi Department of Computer Science and Engineering Indian Institute of Technology Kanpur dheeraj@iitk.ac.in http://www.cse.iitk.ac.in/users/dheeraj Problems with
More informationTDTS04 Computer networks and distributed systems Final Exam: 14:00-18:00, Thursday, March 20, 2014
(TEN1) Final Examination: 14:00-18:00, Thursday, August 20, 2014 Time: 240 minutes Total Marks: 40 Grade Requirements: three (20/40); four (28/40); and five (36/40). Assistance: None (closed book, closed
More informationTSIN02 - Internetworking
Lecture 2: The Internet Protocol Literature: Forouzan: ch 4-9 and ch 27 2004 Image Coding Group, Linköpings Universitet Outline About the network layer Tasks Addressing Routing Protocols 2 Tasks of the
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 informationChapter 19 Network Layer: Logical Addressing
Chapter 19 Network Layer: Logical Addressing 19.1 Copyright The McGraw-Hill Companies, Inc. Permission required for reproduction or display. 19.2 19-1 IPv4 ADDRESSES An IPv4 address is a 32-bit address
More informationIPv4 addressing, NAT. Computer Networking: A Top Down Approach 6 th edition Jim Kurose, Keith Ross Addison-Wesley.
IPv4 addressing, NAT http://xkcd.com/195/ Computer Networking: A Top Down Approach 6 th edition Jim Kurose, Keith Ross Addison-Wesley Some materials copyright 1996-2012 J.F Kurose and K.W. Ross, All Rights
More informationCS164 Final Exam Winter 2013
CS164 Final Exam Winter 2013 Name: Last 4 digits of Student ID: Problem 1. State whether each of the following statements is true or false. (Two points for each correct answer, 1 point for each incorrect
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 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 informationNetwork Layer (4): ICMP
1 Network Layer (4): ICMP Required reading: Kurose 4.4.3, 4.4.4 CSE 4213, Fall 2006 Instructor: N. Vlajic 2 1. Introduction 2. Network Service Models 3. Architecture 4. Network Layer Protocols in the Internet
More informationCS BGP v4. Fall 2014
CS 457 - BGP v4 Fall 2014 Autonomous Systems What is an AS? a set of routers under a single technical administration uses an interior gateway protocol (IGP) and common metrics to route packets within the
More informationInternet Protocol, Version 6
Outline Protocol, Version 6 () Introduction to Header Format Addressing Model ICMPv6 Neighbor Discovery Transition from to vs. Taken from:chun-chuan Yang Basics: TCP/ Protocol Suite Protocol (IP) Features:
More informationIntroduction to IPv6. IPv6 addresses
Introduction to IPv6 (Chapter 4 in Huitema) IPv6,Mobility-1 IPv6 addresses 128 bits long Written as eight 16-bit integers separated with colons E.g. 1080:0000:0000:0000:0000:0008:200C:417A = 1080::8:800:200C:417A
More informationThe Network 15 Layer IPv4 and IPv6 Part 3
1 ÉCOLE POLYTECHNIQUE FÉDÉRALE DE LAUSANNE The Network 15 Layer IPv4 and IPv6 Part 3 Jean Yves Le Boudec 2017 Contents 9. Proxy ARP 10. Fragmentation 11. Interworking h4 h6 with NATs Textbook Chapter 5:
More informationMaster Course Computer Networks IN2097
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
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 informationCS 458 Internet Engineering Spring First Exam
CS 458 Internet Engineering Spring 2005 First Exam Instructions (read carefully): There are 6 problems for a total of 60 points. This is a closed book and closed notes in-class exam. If any problem is
More informationEXAM TCP/IP NETWORKING Duration: 3 hours
SCIPER: First name: Family name: EXAM TCP/IP NETWORKING Duration: 3 hours Jean-Yves Le Boudec January 2017 INSTRUCTIONS 1. Write your solution into this document and return it to us (you do not need to
More informationexam. Number: Passing Score: 800 Time Limit: 120 min CISCO Interconnecting Cisco Networking Devices Part 1 (ICND)
100-105.exam Number: 100-105 Passing Score: 800 Time Limit: 120 min CISCO 100-105 Interconnecting Cisco Networking Devices Part 1 (ICND) Exam A QUESTION 1 Which route source code represents the routing
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 informationCS 356: Computer Network Architectures. Lecture 14: Switching hardware, IP auxiliary functions, and midterm review. [PD] chapter 3.4.1, 3.2.
CS 356: Computer Network Architectures Lecture 14: Switching hardware, IP auxiliary functions, and midterm review [PD] chapter 3.4.1, 3.2.7 Xiaowei Yang xwy@cs.duke.edu Switching hardware Software switch
More informationCSE 461 Midterm Winter 2018
CSE 461 Midterm Winter 2018 Your Name: UW Net ID: General Information This is a closed book/laptop examination. You have 50 minutes to answer as many questions as possible. The number in parentheses at
More informationAddress Translation. Map IP addresses into physical addresses destination host next hop router
Address Translation Map IP addresses into physical addresses destination host next hop router Techniques encode physical address in host part of IP address table-based ARP table of IP to physical address
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 informationThe Netwok 15 Layer IPv4 and IPv6 Part 3
1 ÉCOLE POLYTECHNIQUE FÉDÉRALE DE LAUSANNE The Netwok 15 Layer IPv4 and IPv6 Part 3 Jean Yves Le Boudec 2015 Contents 1. Fragmentation 2. Interworking h4 h6 with NATs 3. Proxy ARP Textbook Chapter 5: The
More informationInformation Network Systems The network layer. Stephan Sigg
Information Network Systems The network layer Stephan Sigg Tokyo, November 1, 2012 Error-detection and correction Decoding of Reed-Muller codes Assume a second order (16, 11) code for m = 4. The r-th order
More informationNET ID. CS519, Prelim (March 17, 2004) NAME: You have 50 minutes to complete the test. 1/17
CS519, Prelim (March 17, 2004) NAME: You have 50 minutes to complete the test. 1/17 Q1. 2 points Write your NET ID at the top of every page of this test. Q2. X points Name 3 advantages of a circuit network
More informationPaper solution Subject: Computer Networks (TE Computer pattern) Marks : 30 Date: 5/2/2015
Paper solution Subject: Computer Networks (TE Computer- 2012 pattern) Marks : 30 Date: 5/2/2015 Q1 a) What is difference between persistent and non persistent HTTP? Also Explain HTTP message format. [6]
More informationEITF25 Internet Techniques and Applications L7: Internet. Stefan Höst
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
More informationUNIVERSITY OF TORONTO FACULTY OF APPLIED SCIENCE AND ENGINEERING
UNIVERSITY OF TORONTO FACULTY OF APPLIED SCIENCE AND ENGINEERING ECE361 Computer Networks Midterm March 06, 2017, 6:15PM DURATION: 80 minutes Calculator Type: 2 (non-programmable calculators) Examiner:
More informationComputer Science 461 Final Exam May 22, :30-3:30pm
NAME: Login name: Computer Science 461 Final Exam May 22, 2012 1:30-3:30pm This test has seven (7) questions, each worth ten points. Put your name on every page, and write out and sign the Honor Code pledge
More informationIPv4 and IPv6 Commands
This module describes the Cisco IOS XR software commands used to configure the IPv4 and IPv6 commands for Broadband Network Gateway (BNG) on the Cisco ASR 9000 Series Router. For details regarding the
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 informationCOMP211 Chapter 4 Network Layer: The Data Plane
COMP211 Chapter 4 Network Layer: The Data Plane All material copyright 1996-2016 J.F Kurose and K.W. Ross, All Rights Reserved Computer Networking: A Top Down Approach 7 th edition Jim Kurose, Keith Ross
More informationRouting. Jens A Andersson Communication Systems
Routing Jens A Andersson Communication Systems R1 Choosing an Optimal Path R4 5 R7 5 10 40 R6 6 5 B R2 15 A 20 4 10 10 R8 R3 5 R5 10 Router A router is a type of internetworking device that passes data
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 informationRouting Unicast routing protocols
Routing Unicast routing protocols Jens A Andersson Electrical and Information Technology R1 Choosing an Optimal Path R4 5 R7 5 10 40 R6 6 5 B R2 15 A 20 4 10 10 R8 R3 5 10 R5 1 Router A router is a type
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 information