Problem Max. Points Act. Points Grader
|
|
- Darrell Samson Barker
- 5 years ago
- Views:
Transcription
1 Networks and Protocols Course: 00 Jacobs University Bremen Date: Dr. Jürgen Schönwälder Duration: 75 minutes Midterm Examination The Jacobs University s Code of Academic Integrity applies to this examination. Please fill in your name (please write readable) and sign below. Name: Signature: This exam is open book in the sense that you are allowed to use course slides, papers and your personal notes during the exam. You are not allowed to use any electronic equipment such as computers or cell phones. Please answer the questions on the problem sheets. If you need more space, feel free to write on the back of the pages. Please keep the papers stapled. Problem Max. Points Act. Points Grader M. 0 M. 0 M. 0 M.4 0 M.5 0 M.6 0 Total 00
2 Problem M.: fundamental concepts (++++ = 0 points) Indicate which of the following statements are correct or incorrect by marking the appropriate boxes. For every correctly marked box, you will earn two points. For every incorrectly marked box, you will loose one point. Statements which are not marked or which are marked as true and false will be ignored. The minimum number of points you can achieve is zero. true false When using Differential Manchester Encoding, it is possible to communicate even if the signal got inverted (for example by swapping wires). For an Ethernet interface using CSMA-CD, it is sufficient to listen for collisions only during the beginning of the transmission of a large Ethernet frame. The Internet checksum is able to detect more errors than the CRC- checksum. It is possible to design protocols that (a) only work with ACKs, (b) only work with NACKs, (c) use both ACKs and NACKs. Flow control deals with the sender s/receiver s finite buffers while congestion control deals with the finite buffers on forwarding devices (e.g., router, bridges) within the network. Solution: true false When using Differential Manchester Encoding, it is possible to communicate even if the signal got inverted (for example by swapping wires). For an Ethernet interface using CSMA-CD, it is sufficient to listen for collisions only during the beginning of the transmission of a large Ethernet frame. The Internet checksum is able to detect more errors than the CRC- checksum. It is possible to design protocols that (a) only work with ACKs, (b) only work with NACKs, (c) use both ACKs and NACKs. Flow control deals with the sender s/receiver s finite buffers while congestion control deals with the finite buffers on forwarding devices (e.g., router, bridges) within the network.
3 Problem M.: spanning tree protocol (0+0 = 0 points) Consider a Local Area Network (LAN) with the following topology: Segment A P. B P. P. Segment B B P. P. P. P. B P. Segment F Segment G Segment C P4. P5. Segment E Segment D B4 P4. P4. P5. B5 P5. Assume that the delay and cost on all segments is the same and that all systems use the same default priorities. a) Compute the spanning tree generated by the IEEE 80. spanning tree algorithm by marking the root bridge, the root port in all the other bridges, and the designated port for each LAN segment. If there is a tie, use the bridge/port with the lower ID. Which port(s) will be blocked? b) Assume bridge B4 fails. Compute the new spanning tree as in a). Solution: a) Bridge B has the lowest ID and becomes the root bridge. The root ports of the other bridges are P., P., P 4., P 5.. The designated ports of the segments A-G are P., P., P., P 4., P., P. and P 4.. The ports P., P 5. and P 5. will be blocked. b) Bridge B still has lowest ID and becomes the root bridge. The root ports of the other bridges are P., P., P 5.. The designated ports of the segments A,B,C,F are P., P., P., P.. The port P 5. will be blocked.
4 Problem M.: IPv4 over Ethernet (0 points) Consider the following Ethernet network topology. a b c A R B C e d E D The devices A, C, D, and E are IP hosts and R is an IP router and B a transparent bridge. The IP devices have static forwarding tables so that they can reach each other. The network just got initialized and no dynamic state information (except the static IP forwarding tables) is present in the devices. Let mac(x) denote the MAC address of node X and ip(x) denote the IP address of node X. The notation mac( ) denotes an Ethernet broadcast address an ip( ) an IP broadcast address. A first sends an IP datagram to C. Afterwards, D sends an IP datagram to E. Write down the messages that are exchanged over the various segments by filling out the following table: step proto mac-src mac-dst segments ip-src ip-dst description The proto column identifies the protocol contained in an Ethernet frame. The columns mac-src and mac-dst contain the Ethernet source and destination address while the columns ip-src and ip-dst contain the IP source and destination address where applicable. The column segments list the segments over which a frame is carried and the column description describes the contents of the frame.
5 Solution: step proto mac-src mac-dst segments ip-src ip-dst description ARP mac(a) mac(*) a who has ip(r)? ARP mac(r) mac(a) a ip(r) is at mac(r) IP mac(a) mac(r) a ip(a) ip(c) ip packet 4 ARP mac(r) mac(*) b,c,d who has ip(c)? 5 ARP mac(c) mac(r) c,b ip(c) is at mac(c) 6 IP mac(r) mac(c) b,c ip(a) ip(c) ip packet 7 ARP mac(d) mac(*) d,c,b who has ip(r) 8 ARP mac(r) mac(d) b,d ip(r) is at mac(r) 9 IP mac(d) mac(r) d,b ip(d) IP(E) ip packet 0 ARP mac(r) mac(*) e who has ip(e)? ARP mac(e) mac(r) e ip(e) is at mac(e) IP mac(r) mac(e) e ip(d) IP(E) ip packet
6 Problem M.4: IPv4 packet forwarding (4+8+8 = 0 points) a) During normal IPv4 packet forwarding by a router, which of the following packet fields are updated? Why? IPv4 header source address IPv4 header destination address IPv4 header time-to-live (TTL) IPv4 header checksum b) You are given the following network prefixes: / / / / / /4 Aggregate the prefixes together into the smallest possible number of shorter prefixes. What is the smallest number of prefixes, and what are they? prefix; / prefixes; /0, / 4 prefixes; /, /4, /4, / prefixes; /, /4 prefixes /0, /4, / Explain how you arrived at your answer. c) Explain how programs such as traceroute determine the route taken by packets on the Internet. Which protocol features on the networking layer are essential for traceroute to work? Solution: a) The time-to-live (TTL) field and the checksum field are updated while forwarding IPv4 datagrams. The source and destination address contained in an IPv4 datagram identify the communicating endpoints and never change during normal forwarding. (The exception to this rule are so called network address translators.) b) The two prefixes /4 and /4 can be aggregated to /. Similarly, the two prefixes /4 and /4 can be aggregated to /. A prefix combining / with /4 would include addresses from other prefixes and hence this combination does not work. A similar argument can be made for the prefix /4 and the aggregated prefix /. Hence, 4 prefixes are needed. c) Traceroute uses the following simplified algorithm: for (ttl = ; ttl < max; ttl++) { for (r = 0; r < retries; r++) { send-icmp-echo-request(dest, ttl); if (icmp-time-exceeded-received()) { print(icmp.source); continue } if (icmp-echo-reply-received()) { print(icmp.source); break; } } } Essential for traceroute to function is the ICMP protocol and a certain set of ICMP messages. Sites that filter ICMP messages will appear as black holes.
7 Problem M.5: open shortest path first (8+ = 0 points) Consider the following network topology: C 4 F A B E H D 4 G a) Determine the shortest-paths from node A to all destinations using Dijkstra s algorithm. For each step of the algorithm, fill in a row in a table structured as follows: step A B C D E F G H current permanent The column current indicates the current node and the column permanent indicates the set of nodes already marked as permanent. The columns A-H keep node specific information. After completing the algorithm, draw the shortest path spanning tree rooted at A. b) The OSPF protocol uses Dijkstra s algorithm to compute shortest paths. What is the motivation to support multiple areas in OSPF?
8 Solution: a) Computation of shortest paths using Dijkstra s algorithm: step A B C D E F G H current permanent A (A) B A (B) C A,B 4 4(B) D A,B,C 5 5(C) E A,B,C,D 6 5(C) F A,B,C,D,E 7 6(E) G A,B,C,D,E,F 8 7(E) H A,B,C,D,E,F,G C 4 F A B E H D 4 G b) Multiple areas (i) reduce the amount of traffic needed in the areas to distribute the link state information and (ii) reduce the effort to compute shortest pathes within an area.
9 Problem M.6: sockets (++++ = 0 points) Indicate which of the following statements are correct or incorrect by marking the appropriate boxes. For every correctly marked box, you will earn two points. For every incorrectly marked box, you will loose one point. Statements which are not marked or which are marked as true and false will be ignored. The minimum number of points you can achieve is zero. true false The socket API uses different C structs to represent IPv4 and IPv6 addresses. The accept() function must be used by a server to accept clients sending datagrams (SOCK DGRAM). The select() function can be used to implement server that can handle multiple clients in a single process. The getaddrinfo() function can map a given node name into multiple addresses and multiple address families. In order to communicate, a client and a server must use the same socket domain, type, and protocol. Solution: true false The socket API uses different C structs to represent IPv4 and IPv6 addresses. The accept() function must be used by a server to accept clients sending datagrams (SOCK DGRAM). The select() function can be used to implement server that can handle multiple clients in a single process. The getaddrinfo() function can map a given node name into multiple addresses and multiple address families. In order to communicate, a client and a server must use the same socket domain, type, and protocol.
Problem Max. Points Act. Points Grader
Networks and Protocols Course: 320301 Jacobs University Bremen Date: 2007-12-12 Dr. Jürgen Schönwälder Duration: 90 minutes Final Examination The Jacobs University s Code of Academic Integrity applies
More informationQuestion Score 1 / 19 2 / 19 3 / 16 4 / 29 5 / 17 Total / 100
NAME: Login name: Computer Science 461 Midterm Exam March 10, 2010 3:00-4:20pm This test has five (5) questions. Put your name on every page, and write out and sign the Honor Code pledge before turning
More informationProblem Max. Points Act. Points Grader
dvanced Networking ourse: 320471 International University remen ate: 2006-10-17 r. Jürgen Schönwälder eadline: 2006-10-17 Midterm xamination The IU ode of cademic Integrity applies to this examination.
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 informationECPE / COMP 177 Fall Some slides from Kurose and Ross, Computer Networking, 5 th Edition
ECPE / COMP 177 Fall 2016 Some slides from Kurose and Ross, Computer Networking, 5 th Edition Course Organization Top-Down! Starting with Applications / App programming Then Transport Layer (TCP/UDP) Then
More informationECPE / COMP 177 Fall Some slides from Kurose and Ross, Computer Networking, 5 th Edition
ECPE / COMP 177 Fall 2012 Some slides from Kurose and Ross, Computer Networking, 5 th Edition Application Layer Transport Layer Network Layer Link Layer Physical Layer 2 Application Layer HTTP DNS IMAP
More informationComputer Networks. 19 December This exam consists of 6 questions with subquestions. Every subquestion counts for 10 points.
Computer Networks 19 December 2014 This exam consists of 6 questions with subquestions. Every subquestion counts for 10 points. Mark every page with name and student number. Use of books, additional course
More information===================================================================== Exercises =====================================================================
===================================================================== Exercises ===================================================================== 1 Chapter 1 1) Design and describe an application-level
More informationThis is a sample Lab report from ECE 461 from previous years. L A B 6
This is a sample Lab report from ECE 461 from previous years. L A B 6 Part 1 1. o the source and destination M A C/IP addresses change when a packet traverses a bridge? Provide an explanation and include
More informationUniversity of Toronto Faculty of Applied Science and Engineering. Final Exam, December ECE 461: Internetworking Examiner: J.
University of Toronto Faculty of Applied Science and Engineering Final Exam, December 2009 ECE 461: Internetworking Examiner: J. Liebeherr Exam Type: A Calculator: Type 2 There are a total of 10 problems.
More informationChapter 3 Part 2 Switching and Bridging. Networking CS 3470, Section 1
Chapter 3 Part 2 Switching and Bridging Networking CS 3470, Section 1 Refresher We can use switching technologies to interconnect links to form a large network What is a hub? What is a switch? What is
More informationData Link Layer. Our goals: understand principles behind data link layer services: instantiation and implementation of various link layer technologies
Data Link Layer Our goals: understand principles behind data link layer services: link layer addressing instantiation and implementation of various link layer technologies 1 Outline Introduction and services
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 informationCSCI Networking Name:
CSCI 3335- Networking Name: Final Exam Problem 1: Error Checking and TCP (15 Points) (a) True or false: [2.5 points for circling correct answers, -1 points for each wrong answer] i. CRC can both correct
More informationReview. Error Detection: CRC Multiple access protocols. LAN addresses and ARP Ethernet. Slotted ALOHA CSMA/CD
Review Error Detection: CRC Multiple access protocols Slotted ALOHA CSMA/CD LAN addresses and ARP Ethernet Some slides are in courtesy of J. Kurose and K. Ross Overview Ethernet Hubs, bridges, and switches
More informationCSCI 466 Midterm Networks Fall 2011
CSCI 466 Midterm Networks Fall 2011 Name: This exam consists of 7 problems on the following 9 pages. You may use your single- sided hand- written 8 ½ x 11 note sheet and a calculator during the exam. No
More informationH
H12-711 Number: H12-711 Passing Score: 600 Time Limit: 120 min File Version: 1.0 Exam A QUESTION 1 The network administrator wants to improve the performance of network transmission, what steps can the
More informationCisco Exam Cisco Certified Network Associate (CCNA) Version: 14.7 [ Total Questions: 653 ]
s@lm@n Cisco Exam 640-802 Cisco Certified Network Associate (CCNA) Version: 14.7 [ Total Questions: 653 ] Topic 1, Describe how a network works Cisco 640-802 : Practice Test Question No : 1 - (Topic 1)
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 informationH
H12-223 Number: H12-223 Passing Score: 600 Time Limit: 120 min Exam A QUESTION 1 The network administrator wants to improve the performance of network transmission, what steps can the administrator take?
More informationDuke University CompSci 356 Midterm Spring 2016
Duke University CompSci 356 Midterm Spring 2016 Name (Print):, (Family name) (Given name) Student ID Number: Date of Exam: Feb 25, 2016 Time Period: 11:45am-1pm Number of Exam Pages: 15 (including this
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 informationIntroduction to Communication Networks Spring Unit 13 Network extensions Bridges.
Introduction to Communication Networks Spring 2007 Unit 13 Network extensions Bridges. Acknowledgements slides coming from: The book by Peterson/Davie The book by Wiliam Stallings Slides from lectures
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 informationCS 3516: Advanced Computer Networks
Welcome to CS 3516: Advanced Computer Networks Prof. Yanhua Li Time: 9:00am 9:50am M, T, R, and F Location: Fuller 320 Fall 2017 A-term 1 Some slides are originally from the course materials of the textbook
More informationOutline. Addressing on the network layer ICMP IPv6 Addressing on the link layer Virtual circuits
Lecture 2 Outline Addressing on the network layer ICMP IPv6 Addressing on the link layer Virtual circuits TCP/IP protocol suite Good name for our book! User application, e.g., http with Mozilla Communication
More informationLink Layer Review. CS244A Winter 2008 March 7, 2008 Ben Nham
Link Layer Review CS244A Winter 2008 March 7, 2008 Ben Nham Announcements PA3 due today PS3 due next Wednesday PA4 due next Friday Final Exam Review session next Friday 7-10 PM on Thursday, March 20 Multiple
More informationCS244a: An Introduction to Computer Networks
Name: Grade: S MC: L MC: 15: 16: 17: Total: CS244a: An Introduction to Computer Networks Midterm Exam: Thursday You are allowed 1 hour to complete this exam. (i) This exam is closed book and closed notes.
More informationH3C S10500 Attack Protection Configuration Examples
H3C S10500 Attack Protection Configuration Examples Copyright 2015 Hangzhou H3C Technologies Co., Ltd. All rights reserved. No part of this manual may be reproduced or transmitted in any form or by any
More informationLink layer: introduction
Link layer: introduction terminology: hosts and routers: nodes communication channels that connect adjacent nodes along communication path: links wired links wireless links LANs layer-2 packet: frame,
More informationCS 43: Computer Networks Switches and LANs. Kevin Webb Swarthmore College December 5, 2017
CS 43: Computer Networks Switches and LANs Kevin Webb Swarthmore College December 5, 2017 Ethernet Metcalfe s Ethernet sketch Dominant wired LAN technology: cheap $20 for NIC first widely used LAN technology
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.1: Internetworking Dr. Nghi Tran (ECE-University of Akron) ECE 4450:427/527 Computer
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 informationMedium Access Protocols
Medium Access Protocols Summary of MAC protocols What do you do with a shared media? Channel Partitioning, by time, frequency or code Time Division,Code Division, Frequency Division Random partitioning
More informationSwitching & ARP Week 3
Switching & ARP Week 3 Module : Computer Networks Lecturer: Lucy White lbwhite@wit.ie Office : 324 Many Slides courtesy of Tony Chen 1 Ethernet Using Switches In the last few years, switches have quickly
More informationLast time. Network layer. Introduction. Virtual circuit vs. datagram details. IP: the Internet Protocol. forwarding vs. routing
Last time Network layer Introduction forwarding vs. routing Virtual circuit vs. datagram details connection setup, teardown VC# switching forwarding tables, longest prefix matching IP: the Internet Protocol
More informationSirindhorn International Institute of Technology Thammasat University
Name.............................. ID............... Section...... Seat No...... Thammasat University Final Exam: Semester, 205 Course Title: Introduction to Data Communications Instructor: Steven Gordon
More informationEE122 Midterm Exam UC Berkeley, Spring 1999
Problem 1: (10 points) EE122 Midterm Exam UC Berkeley, Spring 1999 (a)(1) briefly define time-division multiplexing (TDM) and statistical multiplexing (b)(2) assume 4 data sources each have a peak rate
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 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 informationECE 461 Internetworking Fall Quiz 1
ECE 461 Internetworking Fall 2013 Quiz 1 Instructions (read carefully): The time for this quiz is 50 minutes. This is a closed book and closed notes in-class exam. Non-programmable (Type 2) calculators
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 informationMidterm Exam II CMPSCI 453: Computer Networks Fall 2010 Prof. Jim Kurose
Midterm Exam II CMPSCI 453: Computer Networks Fall 200 Prof. Jim Kurose Instructions: Please use two exam blue books answer questions, 2 in one book, and the remaining two questions in the second blue
More informationCS 421: COMPUTER NETWORKS SPRING FINAL May 16, minutes
CS 4: COMPUTER NETWORKS SPRING 03 FINAL May 6, 03 50 minutes Name: Student No: Show all your work very clearly. Partial credits will only be given if you carefully state your answer with a reasonable justification.
More informationCarnegie Mellon Computer Science Department Spring 2015 Midterm Exam
Carnegie Mellon Computer Science Department. 15-744 Spring 2015 Midterm Exam Name: Andrew ID: INSTRUCTIONS: There are 7 pages (numbered at the bottom). Make sure you have all of them. Please write your
More informationFINAL EXAM - SLOT 2 TCP/IP NETWORKING Duration: 90 min. With Solutions
First name: Family name: FINAL EXAM - SLOT 2 TCP/IP NETWORKING Duration: 90 min. With Solutions Jean-Yves Le Boudec, Patrick Thiran 2011 January 15 INSTRUCTIONS 1. The exam is in two time slots. Slot 1
More informationComputer Networks CS 552
Computer Networks CS 552 Badri Nath Rutgers University badri@cs.rutgers.edu 1. Link Layer, Multiple access 2. IP addressing, CIDR, NAT 3. IP/L3 routing, OSPF (link state), RIP(DV), Issues 4. L2 routing
More informationCS244a: An Introduction to Computer Networks
Grade: MC: 7: 8: 9: 10: 11: 12: 13: 14: Total: CS244a: An Introduction to Computer Networks Final Exam: Wednesday You are allowed 2 hours to complete this exam. (i) This exam is closed book and closed
More informationIntroduction to Computer Networks. CS 166: Introduction to Computer Systems Security
Introduction to Computer Networks CS 166: Introduction to Computer Systems Security Network Communication Communication in modern networks is characterized by the following fundamental principles Packet
More informationEECS 122: Introduction to Communication Networks Final Exam Solutions
EECS 22: Introduction to Communication Networks Final Exam Solutions Problem. (6 points) How long does it take for a 3000-byte IP packet to go from host A to host B in the figure below. Assume the overhead
More informationECSE 414 Fall 2014 Final Exam Solutions
ECSE 414 Fall 2014 Final Exam Solutions Question 1 a. The five main layers of the internet protocol stack, along with the service provided by each, and the place where each is implemented are as follows:
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 informationFirst Exam for ECE671 Spring /22/18
ECE67: First Exam First Exam for ECE67 Spring 208 02/22/8 Instructions: Put your name and student number on each sheet of paper! The exam is closed book. You have 75 minutes to complete the exam. Be a
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 informationLehrstuhl für Informatik 4 Kommunikation und verteilte Systeme. Auxiliary Protocols
Auxiliary Protocols IP serves only for sending packets with well-known addresses. Some questions however remain open, which are handled by auxiliary protocols: Address Resolution Protocol (ARP) Reverse
More informationDepartment of Computer Science and Engineering. COSC 4213: Computer Networks II (Fall 2005) Instructor: N. Vlajic Date: November 3, 2005
Department of Computer Science and Engineering COSC 4213: Computer Networks II (Fall 2005) Instructor: N. Vlajic Date: November 3, 2005 Midterm Examination Instructions: Examination time: 75 min. Print
More informationCSCI 466 Midterm Networks Fall 2011
CSCI 466 Midterm Networks Fall 2011 Name: This exam consists of 7 problems on the following 9 pages. You may use your single- sided hand- written 8 ½ x 11 note sheet and a calculator during the exam. No
More informationSummary of MAC protocols
Summary of MAC protocols What do you do with a shared media? Channel Partitioning, by time, frequency or code Time Division, Code Division, Frequency Division Random partitioning (dynamic) ALOHA, S-ALOHA,
More informationVirtual University of Pakistan. Describe the Hidden Node and Exposed Node problems in Standard? VUSR. [Larry L. Peterson]
www..net Solution Assignment No. 2 Question No. 1 Describe the Hidden Node and Exposed Node problems in 802.11 Standard? Hidden Node Problem: Consider the figure below. [Larry L. Peterson] B can exchange
More informationPART X. Internetworking Part 1. (Concept, IP Addressing, IP Routing, IP Datagrams, Address Resolution)
PART X Internetworking Part 1 (Concept, IP Addressing, IP Routing, IP Datagrams, Address Resolution) CS422 Part 10 1 Spring 1999 Motivation For Internetworking LANs Low cost Limited distance WANs High
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 information19: Networking. Networking Hardware. Mark Handley
19: Networking Mark Handley Networking Hardware Lots of different hardware: Modem byte at a time, FDDI, SONET packet at a time ATM (including some DSL) 53-byte cell at a time Reality is that most networking
More informationModule 7 Internet And Internet Protocol Suite
Module 7 Internet And Internet Protocol Suite Lesson 22 IP addressing. ICMP LESSON OBJECTIVE General The lesson will continue the discussion on IPv4 along with the idea of ICMP. Specific The focus areas
More informationCMPE 150/L : Introduction to Computer Networks. Chen Qian Computer Engineering UCSC Baskin Engineering Lecture 18
CMPE 150/L : Introduction to Computer Networks Chen Qian Computer Engineering UCSC Baskin Engineering Lecture 18 1 Final project demo Please do the demo THIS week to the TAs. Or you are allowed to use
More informationIndian Institute of Technology, Kharagpur
Indian Institute of Technology, Kharagpur End-Autumn Semester 2018-19 Date of Examination: 27-11-2018 Session: FN (9-12 pm) Duration: 3 hrs Subject No.: IT30037 Subject: INTRODUCTION TO INTERNET Department/Center/School:
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 informationNetwork Security Fundamentals. Network Security Fundamentals. Roadmap. Security Training Course. Module 2 Network Fundamentals
Network Security Fundamentals Security Training Course Dr. Charles J. Antonelli The University of Michigan 2013 Network Security Fundamentals Module 2 Network Fundamentals Roadmap Network Fundamentals
More informationExercise Sheet 4. Exercise 1 (Routers, Layer-3-Switches, Gateways)
Exercise Sheet 4 Exercise 1 (Routers, Layer-3-Switches, Gateways) 1. What is the purpose of Routers in computer networks? (Also explain the difference to Layer-3-Switches.) 2. What is the purpose of Layer-3-Switches
More informationLAB THREE STATIC ROUTING
LAB THREE STATIC ROUTING In this lab you will work with four different network topologies. The topology for Parts 1-4 is shown in Figure 3.1. These parts address router configuration on Linux PCs and a
More informationELEC / COMP 177 Fall Some slides from Kurose and Ross, Computer Networking, 5 th Edition
ELEC / COMP 177 Fall 2016 Some slides from Kurose and Ross, Computer Networking, 5 th Edition Presentation 2 Security/Privacy Presentations Nov 3 rd, Nov 10 th, Nov 15 th Upload slides to Canvas by midnight
More informationInternetworking Part 1
CMPE 344 Computer Networks Spring 2012 Internetworking Part 1 Reading: Peterson and Davie, 3.1 22/03/2012 1 Not all networks are directly connected Limit to how many hosts can be attached Point-to-point:
More informationUniversity of Toronto Faculty of Applied Science and Engineering. Final Exam, December ECE 461: Internetworking Examiner: J.
University of Toronto Faculty of Applied Science and Engineering Final Exam, December 2010 ECE 461: Internetworking Examiner: J. Liebeherr Exam Type: B Calculator: Type 2 There are a total of 10 problems.
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 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 informationHubs. twisted pair. hub. 5: DataLink Layer 5-1
Hubs Hubs are essentially physical-layer repeaters: bits coming from one link go out all other links at the same rate no frame buffering no CSMA/CD at : adapters detect collisions provides net management
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 informationELEC / COMP 177 Fall Some slides from Kurose and Ross, Computer Networking, 5 th Edition
ELEC / COMP 177 Fall 2011 Some slides from Kurose and Ross, Computer Networking, 5 th Edition Topics This week: Network layer (IP, ARP, ICMP) Next week: More network layer (Routers and routing protocols)
More informationExam : Cisco Title : Update : Demo. Cisco Certified Network Associate
Exam : Cisco 640-802 Title : Cisco Certified Network Associate Update : Demo 1. Refer to the exhibit. What could be possible causes for the "Serial0/0 is down" interface status? (Choose two.) A. A Layer
More informationCS 3516: Computer Networks
Welcome to CS 3516: Computer Networks Prof. Yanhua Li Time: 9:00am 9:50am M, T, R, and F Location: AK219 Fall 2018 A-term 1 Some slides are originally from the course materials of the textbook Computer
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 informationUNIVERSITY OF TORONTO FACULTY OF APPLIED SCIENCE AND ENGINEERING
UNIVERSITY OF TORONTO FACULTY OF APPLIED SCIENCE AND ENGINEERING FINAL EXAMINATION: April 25, 2017 DURATION: 2V2 hrs. ECE361 - Computer Networks Exam Type: B Calculator Type: 2 (non-programmable calculators)
More informationCSCI 1680 Computer Networks Fonseca. Exam - Midterm. Due: 11:50am, 15 Mar Closed Book. Maximum points: 100
CSCI 1680 Computer Networks Fonseca Exam - Midterm Due: 11:50am, 15 Mar 2011 Closed Book. Maximum points: 100 NAME: 1. Sending Data - [12 pts] a. If TCP provides reliable, in-order delivery of bytes end-to-end,
More informationUnit 5: Internet Protocols skong@itt-tech.edutech.edu Internet Protocols She occupied herself with studying a map on the opposite wall because she knew she would have to change trains at some point. Tottenham
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 informationCompSci 356: Computer Network Architectures. Lecture 7: Switching technologies Chapter 3.1. Xiaowei Yang
CompSci 356: Computer Network Architectures Lecture 7: Switching technologies Chapter 3.1 Xiaowei Yang xwy@cs.duke.edu Types of switching Datagram Virtual circuit Source routing Today Bridges and LAN switches
More informationCOMP 361 Computer Communications Networks. Fall Semester Final Examination: Solution key
COMP 361 Computer Communications Networks all Semester 2003 inal Examination: Solution key Date: Dec 15, 2003, ime 8:30am - 11:30am, venue Rm 3007 Name: Student ID: Email: Instructions: 1. his examination
More informationCourse Contents. The TCP/IP protocol Stack
Course Contents PART 1 Overview and Introduction PART 2 Communication Reference Models PART 3 Data Communication Fundamentals and Physical Layer PART 4 Datalink Layer and Emerging Network Technologies
More informationInternet Layers. Physical Layer. Application. Application. Transport. Transport. Network. Network. Network. Network. Link. Link. Link.
Internet Layers Application Application Transport Transport Network Network Network Network Link Link Link Link Ethernet Fiber Optics Physical Layer Wi-Fi ARP requests and responses IP: 192.168.1.1 MAC:
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 informationMIDTERM EXAMINATION #2 OPERATING SYSTEM CONCEPTS U N I V E R S I T Y O F W I N D S O R S C H O O L O F C O M P U T E R S C I E N C E
MIDTERM EXAMINATION #2 OPERATING SYSTEM CONCEPTS 03-60-367-01 U N I V E R S I T Y O F W I N D S O R S C H O O L O F C O M P U T E R S C I E N C E Intersession 2008 Last Name: First Name: Student ID: PLEASE
More informationCHAPTER 18 INTERNET PROTOCOLS ANSWERS TO QUESTIONS
CHAPTER 18 INTERNET PROTOCOLS ANSWERS TO QUESTIONS 18.1 (1) The communications network may only accept blocks of data up to a certain size. (2) Error control may be more efficient with a smaller PDU size.
More informationCIS-331 Final Exam Fall 2015 Total of 120 Points. Version 1
Version 1 1. (25 Points) Given that a frame is formatted as follows: And given that a datagram is formatted as follows: And given that a TCP segment is formatted as follows: Assuming no options are present
More informationCSE 123: Computer Networks
CSE 123: Computer Networks Homework 3 Out: 11/19 Due: 11/26 Instructions 1. Turn in a physical copy at the beginning of the class on 11/26 2. Ensure the HW cover page has the following information clearly
More informationSession Exam 1. EG/ES 3567 Worked Solutions. (revised)
Session 003-00 Exam 1 EG/ES 3567 Worked Solutions. (revised) Please note that both exams have identical solutions, however the level of detail expected in ES is less, and the questions are phrased to provide
More informationCommunication and Networks. Problems
Electrical and Information Technology Communication and Networks Problems Network Layer (IP) 2016 Problems 1. The table below describes the next hop for each destination in the network for all nodes in
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 information1. (10 points): For each of the following, choose exactly one best answer.
IS 450/650 Final Exam Martens 20 December 2010 Answer all twelve questions. Write your name on the first sheet. Short answers are better than long ones. No electronics. 1. (10 points): For each of the
More informationKing Fahd University of Petroleum and Minerals College of Computer Sciences and Engineering Department of Computer Engineering
Student Name: Section #: King Fahd University of Petroleum and Minerals College of Computer Sciences and Engineering Department of Computer Engineering COE 344 Computer Networks (T072) Final Exam Date
More informationCIS 83 Midterm Spring 2004 Answer Sheet Name Score Grade Question Answer Question Answer
CIS 83 Midterm Spring 2004 Answer Sheet Name: Score: Grade: Question Answer Question Answer 1 A B C D E F 51 A B C D E F 2 A B C D E F 52 A B C D E F 3 A B C D E F 53 A B C D E F 4 A B C D E F 54 A B C
More informationHands-On Network Security: Practical Tools & Methods
Hands-On Network Security: Practical Tools & Methods Security Training Course Dr. Charles J. Antonelli The University of Michigan 2012 Hands-On Network Security Module 2 Network Fundamentals Roadmap Network
More information