First Exam for ECE671 Spring /22/18
|
|
- Joseph Harold Wilkerson
- 6 years ago
- Views:
Transcription
1 ECE67: First Exam First Exam for ECE67 Spring /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 smart exam taker - if you get stuck on one problem go on to another problem. Also, don't waste your time giving irrelevant (or not requested) details. The total number of points for each question is given in parenthesis. There are 00 points total. Show all your work. Partial credit is possible for an answer, but only if you show the intermediate steps in obtaining the answer. If you make a mistake, it will also help the grader show you where you made a mistake. Good luck. Problem Max. Points Points Total 00
2 ECE374: First Midterm 2 Problem : (Quickies 32 Points (4 each)) a. In the case of an SDN, explain the difference between a proactive and reactive flow installation? A: Re-active: When a new flow comes into the switch a lookup in the switch s flow table is performed. If no match for the flow is found, the switch consults the controller and creates a rule in the flow table based on the instruction. Pro-active: Rather than reacting to a packet, the controller could populate the flow tables ahead of time for all traffic matches that could come into the switch. b. Server A runs a web server on port 80 and an SMTP server on port 25. Client opens local port 5500 to establish a TCP session to the web server on Server A. What are the numbers of the destination and source ports in the TCP segments sent to the server? Client 2 opens local port 6600 to establish a TCP session to the SMTP server on Server A. What are the numbers of the destination and source ports in the TCP segments sent to the server? Answer: Client D=80, S=5500, Client 2 D=25, S=6600 c. Name the highest layer up to which a header modification can be made by each of the following entities: switch, router, transport layer system, and end system? A: MAC, Network, Transport, Application d. A caravan of 2 cars propagates at 00 km/hr on a 00 km long toll road. At the beginning of the road, at the toll booth, it takes 40 seconds to service each individual car. How long does it take for the last car to arrive at the end of the toll road? Cars now propagate at 000 km/hr (it still takes 40 seconds to service each car). Will cars arrive at the end of the toll road before all cars are serviced at first booth? If so, at what time will that happen? A: 00km/h: 480 seconds + 60 minutes = ~67 minutes 000km/h: 480 seconds seconds. Yes, after 400 seconds (40+360) the first car will arrive at the end of the toll road with 2 cars still waiting at the toll booth to be processed. e. Name the three major functionalities of the TCP protocol. To transmit a text file from the server to client, would you base your application on TCP or UDP? Briefly explain why? A: Reliability, congestion control, flow control. TCP, since it provides reliable data transfer. f. Assuming traditional congestion avoidance in TCP, how long would it take for the congestion window to increase from 50,000 to 00,000 if the RTT is 00ms? A: 50,000 * 00ms = 5000s = minutes.4 hours! g. When a client broadcast an ARP message to find the destination MAC address for another node that has a specific IP address, what are MAC destination and
3 ECE67: First Exam 3 source addresses of that frame? Who responds to this ARP request? Answer: Dest: FF:FF:FF:FF:FF:FF; Source: Client MAC address; Node that has assigned IP address responds; h. Explain the functionality of a trunk port in VLAN switching? In 802.Q, how many different VLANs can be supported? A: trunk port: carries frames between VLANS defined over multiple physical switches. 802.Q: 2 2 =4096 Problem 2: Delays, Throughput (8 Points) Figure Consider the network shown in Figure. a. (4 Points) Based on this figure explain how the traceroute application determines the round-trip-time (RTT) between your host, the individual routers on the path to the receiving host, and the receiving host? A: sends three packets that will reach router i on path towards destination, router i will return packets to sender, sender times interval between transmission and reply. b. (2 Points) The following line represents a typical single output line from traceroute: ar0.needham.ma.boston.comcast.net( ) 4.682ms 3.927ms 9.944ms Why do the values for the three RTTs shown at the end of that line change? Answer: RTTs highly depend on the queue length of the routers located between the sender and the receiver. Based on other traffic there can be more or less waiting packets in a routers queue at a certain instance in time. Thus, the RTT between individual pings can vary. c. (4 Points) Now assume a static RTT of 20 milliseconds between the two hosts. A TCP session between Hosts A and B is starting. How long will it take for the congestion window to reach a value of 32? (Assuming no losses and an initial window size of.) List all individual congestion window size increases and the times at which those increases occur. A: 2 = 20ms, 4 = 240ms, 8 = 360 ms, 6 = 480 ms, 32 = 600ms. Impact of different RTTs on TCP d. (8 Points) For this problem, consider the network shown in Figure 2. Assume that source A and sink A communicate via TCP Reno (TCP), while source B and sink B also communicate via TCP Reno (TCP2). At t=700ms a packet loss (detected via triple duplicate ACKs) occurs for TCP2. Similarly, at t=000 ms
4 ECE374: First Midterm 4 a packet loss (detected via triple duplicate ACKs) occurs for TCP. Use the empty diagram given below to indicate the size of the congestion window over time for both TCP connections. ssthresh for both is 6 segments! Source A Sink A 0 ms Router 30 ms 5 ms 0 ms Router 2 5 ms 5 ms Source B Router 3 Sink B Figure 2 Congestion window (segments) Time (ms) Figure 3
5 ECE67: First Exam 5 A: Problem 3: MAC and IP (20 Points) For this problem consider the network shown in Figure 4. X Y BB:89:34:E6:0:3B C Switch Switch (i) AA:0:F3:5C:02:04 (iii) Switch R 3 0:D4:E:A8:95:F0 (ii) Switch B A 20:FF:3A:BC:0:4E 2 Figure 4
6 ECE374: First Midterm 6 a. (6 points) Assign IP addresses to hosts A, B, C, and interfaces, 2, and 3 of R. Note: Each of the subnets should be able to host a maximum of 28 nodes. A: Because each subnet should be able to host a maximum of 28 hosts, five address bits are needed for each subnet. So let s assign the left subnet XX.YY.ZZ.xx0*****/27, where the XX.YY.ZZ are 8 bit numbers. Each x is a bit and the three * s correspond to the five address bits for this network. For the right subnet, we ll use XX.YY.ZZ.xx*****/27. Any address in the range XX.YY.ZZ.xx00000 to XX.YY.ZZ.xx00 can be used for A, C, and interface. Any address in the range XX.YY.ZZ.xx0000 to XX.YY.ZZ.xx0 can be used for B and interface. Any address in the range XX.YY.ZZ.x00000 to XX.YY.ZZ.x00 can be assigned to interface 3. b. (3 points) Now consider a frame that contains an IP datagram that is sent from Host B to Host A. What are the MAC source and destination address of this frame and the IP source and destination addresses in the encapsulated IP datagram at points (i), (ii), and (iii)? A: (i) MAC-S: BB:89:34:E6:0:3B, MAC-D: 0:D4:E:A8:95:F0, IP-D: e.g., XX.YY.ZZ.xx0000, IP-S: e.g., XX.YY.ZZ.xx00000 (ii) same as (i). (iii) MAC-S: 20:FF:3A:BC:0:4E, MAC-D: AA:0:F3:5C:02:04, IP-D: e.g., XX.YY.ZZ.xx0000, IP-S: e.g., XX.YY.ZZ.xx00000 c. (2 Points) Does the MAC address of the switches ever appear in a frame? Explain. A: No. Ethernet switches are transparent. d. (5 Points) Assume that node B initially did not know the MAC address of router interface 3. How does it obtain that MAC address? Describe the process for the case where node B needs to find out the MAC address of node Y. What happens if node B needs to find out the MAC address of node A? A: B sends and ARP request for the MAC address of interface 3 of the router. Since it is not known which node hosts this interface the ARP request is sent as a broadcast. Only the node that has the IP address contained in the ARP request will reply with the reply message containing its MAC address. Same procedure as in the case above. Finally, there is no need for B to find out A s MAC address! e. (4 Points) Imagine all switches in Figure 4 are replaced by SDN switches and controlled by a single controller. No traffic has been transmitted in this network so far and no flow rules are implemented in the switches. Now, Node B starts sending data to Node Y. What would happen to the very first frame when it reaches the switch that connects B and Y? What logic would the controller have to provide to assure that this frame is forwarded to Y? A: First frame is sent to the controller. Logic that resembles the one of a learning switch needs to be implemented. Problem 4: Crossbar Switch (30 Points)
7 ECE67: First Exam 7 Output Output 2 Output 3 Output 4 Input Number indicates output port Input 2 Input 3 Input 4 Figure 5: Enter solution for 4 c) in template Output Output 2 Output 3 Output 4 Input Number indicates output port Input 2 Input 3 Input 4 Figure 6: Enter solution for 4 d) in template For this problem consider a crossbar switch with four input and four output ports as shown in Figure 5. a. (3 points) Briefly explain why a crossbar switch outperforms a switch that is based on virtual memory. A: The access to the virtual memory is the bottleneck. It still uses a bus. That s not the case with a crossbar switch where transmissions can go on in parallel at full line speed. b. (3 Points) Explain the term head of line (HOL) blocking and how it influences the performance of a crossbar switch. A: HOL occurs when one or more packets are held up in a queue by the first
8 ECE374: First Midterm 8 packet in the queue. The first packet in the queue can be blocked because of several reasons. c. (4 Points) Use Figure 5 to give an example for a scenario in which NO HOL blocking occurs. (To make this example, assign output port numbers to the first four packets in each input queue. An example is given for the first packets in input queue ). A: Output Output 2 Output 3 Output 4 Input Input Input Input 4 d. (4 Points) Use Figure 6 to give an example for a scenario in which HOL blocking occurs. (To make this example, assign output port numbers to the first four packets in each input queue. An example is given for the first packets in input queue ). A: Output Output 2 Output 3 Output 4 Input Input Input Input 4 e. (4 Points) Explain why virtual queues can be used to avoid HOL blocking? How many virtual queues in total are required in the case of the scenario
9 ECE67: First Exam 9 shown in Figure 6. A: For each outgoing port, a virtual input queue is created at each physical input port. If HOL blocking at on of these queues occurs a packet from one of the other virtual queues can be chosen for switching. 6. Now we switch our focus to the Ethernet learning switch mechanism. Figure 7: Learning switch example f. (6 Points) Use Figure 7 to explain the functionality of an Ethernet learning switch. To explain the mechanism assume that the switch s table is completely empty and that Host A wants to sent data to Host A. A: Host A sends a frame to the switch. Since the switches table is empty, it ll flood the frame to all other nodes in the network. In parallel the switch learns that Host A s MAC address is connected to port and stores this in its forwarding table. A is the only one who replies to the flooded copy it receives from the switches. From this response frame the switches learns that Host A is connected to port 4 and it enters this info in its table. To forward the packet to Host A it uses its forwarding table to determine which output port to use. No flooding necessary. g. (6 Points) In this problem it is your task to calculate the line speed packet rate (pps) for a 0Gbps interface. You should calculate the rate for the smallest possible Ethernet frame (46 bytes) and for the case that frames have an MTU size of 500 bytes. Remember that in addition to the MAC header (4 bytes) and CRC (4 bytes), there is an 8 byte MAC preamble, 2 byte interframe gap. Showing the equation to determine the pps is sufficient for this problem. You do not have calculate the actual value! A: Peak packet rate for smallest frame: (0*0 9 )bits/sec / (84 bytes * 8) = 4,880,952 pps 500 MTU: (0*0 9 )bits/sec / (538 * 8) = 82,744 pps
Final Exam for ECE374 05/03/12 Solution!!
ECE374: Second Midterm 1 Final Exam for ECE374 05/03/12 Solution!! Instructions: Put your name and student number on each sheet of paper! The exam is closed book. You have 90 minutes to complete the exam.
More informationYour Name: Your student ID number:
CSC 573 / ECE 573 Internet Protocols October 11, 2005 MID-TERM EXAM Your Name: Your student ID number: Instructions Allowed o A single 8 ½ x11 (front and back) study sheet, containing any info you wish
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 FALL FINAL January 10, minutes
CS 4: COMPUTER NETWORKS FALL 00 FINAL January 0, 0 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
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 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 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 informationCS 421: COMPUTER NETWORKS SPRING FINAL May 24, minutes. Name: Student No: TOT
CS 421: COMPUTER NETWORKS SPRING 2012 FINAL May 24, 2012 150 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
More informationChapter 4: network layer. Network service model. Two key network-layer functions. Network layer. Input port functions. Router architecture overview
Chapter 4: chapter goals: understand principles behind services service models forwarding versus routing how a router works generalized forwarding instantiation, implementation in the Internet 4- Network
More informationCMPE 150/L : Introduction to Computer Networks. Chen Qian Computer Engineering UCSC Baskin Engineering Lecture 11
CMPE 150/L : Introduction to Computer Networks Chen Qian Computer Engineering UCSC Baskin Engineering Lecture 11 1 Midterm exam Midterm this Thursday Close book but one-side 8.5"x11" note is allowed (must
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 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 informationComputer Communication Networks Midterm Review
Computer Communication Networks Midterm Review ICEN/ICSI 416 Fall 2018 Prof. Aveek Dutta 1 Instructions The exam is closed book, notes, computers, phones. You can use calculator, but not one from your
More informationFinal Exam for ECE671 Spring /29/18
ECE67: Eam II Final Eam for ECE67 Spring 28 3/29/8 Instructions: Put our name and student number on each sheet of paper! The eam is closed book. You have 75 minutes to complete the eam. Be a smart eam
More informationLecture 16: Network Layer Overview, Internet Protocol
Lecture 16: Network Layer Overview, Internet Protocol COMP 332, Spring 2018 Victoria Manfredi Acknowledgements: materials adapted from Computer Networking: A Top Down Approach 7 th edition: 1996-2016,
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 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 informationProblem Set 7 Due: Start of Class, November 2
CS242 Computer Networks Handout # 14 Randy Shull October 26, 2017 Wellesley College Problem Set 7 Due: Start of Class, November 2 Reading: Kurose & Ross, Sections 3.6, 3.7, 3.8 Wireshark Lab [26] In these
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 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 informationCSC 401 Data and Computer Communications Networks
CSC 401 Data and Computer Communications Networks Link Layer, Switches, VLANS, MPLS, Data Centers Sec 6.4 to 6.7 Prof. Lina Battestilli Fall 2017 Chapter 6 Outline Link layer and LANs: 6.1 introduction,
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 informationCS244a: An Introduction to Computer Networks
Do not write in this box MCQ 9: /10 10: /10 11: /20 12: /20 13: /20 14: /20 Total: Name: Student ID #: CS244a Winter 2003 Professor McKeown Campus/SITN-Local/SITN-Remote? CS244a: An Introduction to Computer
More informationCSE 473 Introduction to Computer Networks. Final Exam. Your name here: 12/17/2012
CSE 473 Introduction to Computer Networks Jon Turner Final Exam Your name here: 12/17/2012 1. (8 points). The figure below shows a network path connecting a server to a client. 200 km 2000 km 2 km X Y
More informationSchool of Engineering Department of Computer and Communication Engineering Semester: Fall Course: CENG415 Communication Networks
School of Engineering Department of Computer and Communication Engineering Semester: Fall 2012 2013 Course: CENG415 Communication Networks Instructors: Mr Houssam Ramlaoui, Dr Majd Ghareeb, Dr Michel Nahas,
More informationCS 421: COMPUTER NETWORKS FALL FINAL January 12, minutes
CS 421: COMPUTER NETWORKS FALL 2011 FINAL January 12, 2012 150 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
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 informationComputer Networks & Security 2016/2017
Computer Networks & Security 2016/2017 Protocol Layering (02) Dr. Tanir Ozcelebi Courtesy: Kurose & Ross TU/e Computer Science Security and Embedded Networked Systems Your typical lunch Slide 2 What is
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 informationQuestion Points Score total 100
CS457: Computer Networking Date: 5/8/2007 Name: Instructions: 1. Be sure that you have 8 questions 2. Write your Student ID (email) at the top of every page 3. Be sure to complete the honor statement after
More informationEECS 3214: Computer Network Protocols and Applications. Final Examination. Department of Computer Science and Engineering
Department of Computer Science and Engineering EECS 3214: Computer Network Protocols and Applications Final Examination Instructor: N. Vlajic Date: April 9, 2016 Instructions: Examination time: 180 min.
More informationWashington State University CptS 455 Sample Final Exam (corrected 12/11/2011 to say open notes) A B C
Washington State University CptS 455 Sample Final Exam (corrected 12/11/2011 to say open notes) Your name: This exam consists 13 numbered problems on 6 pages printed front and back on 3 sheets. Please
More informationChapter 4 Network Layer: The Data Plane
Chapter 4 Network Layer: The Data Plane A note on the use of these Powerpoint slides: We re making these slides freely available to all (faculty, students, readers). They re in PowerPoint form so you see
More informationInternet Applications and the Application Layer Material from Kurose and Ross, Chapter 2: The Application Layer
Midterm Study Sheet Below is a list of topics that will be covered on the midterm exam. Some topics may have summaries to clarify the coverage of the topic during the lecture. Disclaimer: the list may
More informationCarnegie Mellon Computer Science Department Spring 2005 Final
Carnegie Mellon Computer Science Department. 15-441 Spring 2005 Final Name: Andrew ID: INSTRUCTIONS: There are 16 pages (numbered at the bottom). Make sure you have all of them. Please write your name
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 informationCS 421: COMPUTER NETWORKS SPRING FINAL May 8, minutes
CS 421: COMPUTR NTWORKS SPRIN 2016 INL May 8, 2016 150 minutes Name: Student No: Q1 Q2 Q3 TOT 1) a) (6 pts) iven the following parameters for a datagram packet switching network: N: number of hops between
More informationHomework 4 assignment for ECE374 Posted: 04/06/15 Due: 04/13/15
ECE374: Homework 4 1 Homework 4 assignment for ECE374 Posted: 04/06/15 Due: 04/13/15 Note: In all written assignments, please show as much of your work as you can. Even if you get a wrong answer, you can
More informationCS 455/555 Intro to Networks and Communications. Link Layer Addressing, Ethernet, and a Day in the Life of a Web Request
CS 455/555 Intro to Networks and Communications Link Layer Addressing, ernet, and a Day in the Life of a Web Request Dr. Michele Weigle Department of Computer Science Old Dominion University mweigle@cs.odu.edu
More informationCSC 4900 Computer Networks: Network Layer
CSC 4900 Computer Networks: Network Layer Professor Henry Carter Fall 2017 Villanova University Department of Computing Sciences Review What is AIMD? When do we use it? What is the steady state profile
More informationCS 344/444 Computer Network Fundamentals Final Exam Solutions Spring 2007
CS 344/444 Computer Network Fundamentals Final Exam Solutions Spring 2007 Question 344 Points 444 Points Score 1 10 10 2 10 10 3 20 20 4 20 10 5 20 20 6 20 10 7-20 Total: 100 100 Instructions: 1. Question
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 informationProblem 7. Problem 8. Problem 9
Problem 7 To best answer this question, consider why we needed sequence numbers in the first place. We saw that the sender needs sequence numbers so that the receiver can tell if a data packet is a duplicate
More informationReview problems (for no credit): Transport and Network Layer
Review problems (for no credit): Transport and Network Layer V. Arun CS 653, Fall 2018 09/06/18 Transport layer 1. Protocol multiplexing: (a) If a web server has 100 open connections, how many sockets
More informationComputer Communication Networks Midterm Review
Computer Communication Networks Midterm Review ICEN/ICSI 416 Fall 2017 Prof. Dola Saha 1 Instructions Put your name and student id on each sheet of paper! The exam is closed book. You cannot use any computer
More informationCPSC 441 COMPUTER COMMUNICATIONS MIDTERM EXAM
CPSC 441 COMPUTER COMMUNICATIONS MIDTERM EXAM Department of Computer Science University of Calgary Professor: Carey Williamson November 1, 2005 This is a CLOSED BOOK exam. Textbooks, notes, laptops, personal
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 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 informationUNIVERSITY OF TORONTO FACULTY OF APPLIED SCIENCE AND ENGINEERING
UNIVERSITY OF TORONTO FACULTY OF APPLIED SCIENCE AND ENGINEERING ECE361 Computer Networks Midterm March 09, 2016, 6:15PM DURATION: 75 minutes Calculator Type: 2 (non-programmable calculators) Examiner:
More informationReview Questions for Midterm Exam-2 Fall 2016
Review Questions for Midterm Exam-2 Fall 2016 1. (Reference Page 340 of textbook) Which of the following statement is true? a. All hosts on the same subnet are configured with the same subnet mask. b.
More informationCS 421: COMPUTER NETWORKS SPRING FINAL May 21, minutes
CS 421: COMPUTER NETWORKS SPRING 2015 FINAL May 21, 2015 150 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
More informationPLEASE READ CAREFULLY BEFORE YOU START
Page 1 of 20 MIDTERM EXAMINATION #1 - B COMPUTER NETWORKS : 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 Fall 2008-75 minutes This examination document
More informationPLEASE READ CAREFULLY BEFORE YOU START
Page 1 of 20 MIDTERM EXAMINATION #1 - A COMPUTER NETWORKS : 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 Fall 2008-75 minutes This examination document
More informationLecture 4 - Network Layer. Transport Layer. Outline. Introduction. Notes. Notes. Notes. Notes. Networks and Security. Jacob Aae Mikkelsen
Lecture 4 - Network Layer Networks and Security Jacob Aae Mikkelsen IMADA September 23, 2013 September 23, 2013 1 / 67 Transport Layer Goals understand principles behind network layer services: network
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 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 informationa. (4pts) What general information is contained in a LSR-PDU update that A might send?
B1: Networks (25 points) Link State Routing (LSR). (Hint: flooding and Dijkstra s Algorithm). Assume Router A has physical links to Routers W, X, Y, Z. a. (4pts) What general information is contained in
More informationECSE-6600: Internet Protocols Spring 2007, Exam 1 SOLUTIONS
ECSE-6600: Internet Protocols Spring 2007, Exam 1 SOLUTIONS Time: 75 min (strictly enforced) Points: 50 YOUR NAME (1 pt): Be brief, but DO NOT omit necessary detail {Note: Simply copying text directly
More informationNetwork Layer: Router Architecture, IP Addressing
Network Layer: Router Architecture, IP Addressing UG3 Computer Communications & Networks (COMN) Mahesh Marina mahesh@ed.ac.uk Slides thanks to Myungjin Lee and copyright of Kurose and Ross Router Architecture
More informationQ23-5 In a network, the size of the receive window is 1 packet. Which of the follow-ing protocols is being used by the network?
CS368: Exercise 5 Q23-5 In a network, the size of the receive window is 1 packet. Which of the follow-ing protocols is being used by the network? a) Stop_and_Wait b) Go-Back-N c) Selective-Repeat Q23-6.
More informationInterconnecting Networks with TCP/IP. 2000, Cisco Systems, Inc. 8-1
Interconnecting Networks with TCP/IP 2000, Cisco Systems, Inc. 8-1 Objectives Upon completion of this chapter you will be able to perform the following tasks: Identify the IP protocol stack, its protocol
More informationSwitching and Forwarding Reading: Chapter 3 1/30/14 1
Switching and Forwarding Reading: Chapter 3 1/30/14 1 Switching and Forwarding Next Problem: Enable communication between hosts that are not directly connected Fundamental Problem of the Internet or any
More informationPLEASE READ CAREFULLY BEFORE YOU START
Page 1 of 11 MIDTERM EXAMINATION #1 OCT. 16, 2013 COMPUTER NETWORKS : 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 Fall 2013-75 minutes This examination
More informationTHE HONG KONG POLYTECHNIC UNIVERSITY. Department of Computing. This is an open-book examination.
THE HONG KONG POLYTECHNIC UNIVERSITY Department of Computing This is an open-book examination. () Internetworking Protocols and Software 7 January 2013 3 hours [Answer all ten questions.] 2 Please answer
More informationComputer Networks Principles
Computer Networks Principles Introduction Prof. Andrzej Duda duda@imag.fr http://duda.imag.fr 1 Contents Introduction protocols and layered architecture encapsulation interconnection structures performance
More informationStudent ID: CS457: Computer Networking Date: 3/20/2007 Name:
CS457: Computer Networking Date: 3/20/2007 Name: Instructions: 1. Be sure that you have 9 questions 2. Be sure your answers are legible. 3. Write your Student ID at the top of every page 4. This is a closed
More informationECE 461 Internetworking. Problem Sheet 6
ECE 461 Internetworking Problem Sheet 6 Problem 1. Consider the state of a sliding window at the sending side of a TCP connections as shown in Figure 1. (Each number corresponds to one byte).. (a) Explain
More informationECS 152A Computer Networks Instructor: Liu. Name: Student ID #: Final Exam: March 17, 2005
ECS 152A Computer Networks Instructor: Liu Name: Student ID #: Final Exam: March 17, 2005 Duration: 120 Minutes 1. The exam is closed book. However, you may refer to one sheet of A4 paper (double sided)
More informationECE 697J Advanced Topics in Computer Networks
ECE 697J Advanced Topics in Computer Networks Network Measurement 12/02/03 Tilman Wolf 1 Overview Lab 3 requires performance measurement Throughput Collecting of packet headers Network Measurement Active
More informationMCS-377 Intra-term Exam 1 Serial #:
MCS-377 Intra-term Exam 1 Serial #: This exam is closed-book and mostly closed-notes. You may, however, use a single 8 1/2 by 11 sheet of paper with hand-written notes for reference. (Both sides of the
More informationPLEASE READ CAREFULLY BEFORE YOU START
MIDTERM EXAMINATION #2 NETWORKING 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 Fall 2011 Question Paper NOTE: Students may take this question
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 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 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 informationTopic 4a Router Operation and Scheduling. Ch4: Network Layer: The Data Plane. Computer Networking: A Top Down Approach
Topic 4a Router Operation and Scheduling Ch4: Network Layer: The Data Plane Computer Networking: A Top Down Approach 7 th edition Jim Kurose, Keith Ross Pearson/Addison Wesley April 2016 4-1 Chapter 4:
More informationSE 4C03 Winter Sample Midterm Test. Instructor: Kartik Krishnan
Name Student number SE 4C03 Winter 2004 Sample Midterm Test Instructor: Kartik Krishnan You have 50 minutes to complete this test consisting of 6 pages and 18 questions. The test is open book and class
More informationRouters. Session 12 INST 346 Technologies, Infrastructure and Architecture
Routers Session 12 INST 346 Technologies, Infrastructure and Architecture Goals for Today Finish up TCP Flow control, timeout selection, close connection Network layer overview Structure of a router Getahead:
More informationComputer Networks (Fall 2011) Homework 2
5-744 Computer Networks (Fall 20) Homework 2 Name: Due: Oct. 2th, 20, 3:00PM (in class) Andrew ID: October 2, 20 A Short Questions. Which of the following is true about modern high-speed routers? A. A
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 informationMidterm Exam CSCE 232: Computer Networks Fall Instructions:
Midterm Exam CSCE 232: Computer Networks Fall 2007 Last Name: First Name: Student ID: Instructions: 1. This is a close-book and close-notes exam. 2. There are seven questions in total. The number of points
More informationQuiz 7 May 14, 2015 Computer Engineering 80N
Quiz 7 May 14, 2015 Computer Engineering 80N Left Neighbor: Right Neighbor: Keep this side up on your desk until you are told to turn the page over. This is a closed book quiz. No calculators. First Name
More informationChapter 4 Network Layer: The Data Plane
Chapter 4 Network Layer: The Data Plane Chapter 4: outline 4.1 Overview of Network layer data plane control plane 4.2 What s inside a router 4.3 IP: Internet Protocol datagram format fragmentation IPv4
More informationThis Lecture. BUS Computer Facilities Network Management. Switching Network. Simple Switching Network
This Lecture BUS0 - Computer Facilities Network Management Switching networks Circuit switching Packet switching gram approach Virtual circuit approach Routing in switching networks Faculty of Information
More informationComputer Networking. Introduction. Quintin jean-noël Grenoble university
Computer Networking Introduction Quintin jean-noël Jean-noel.quintin@imag.fr Grenoble university Based on the presentation of Duda http://duda.imag.fr 1 Course organization Introduction Network and architecture
More informationComputer Networks. Homework #4: No Grading
Computer Networks Homework #4: No Grading Problem #1. Assume you need to write and test a client-server application program on two hosts you have at home. a. What is the range of port numbers you would
More informationCSE 473 Introduction to Computer Networks. Midterm Exam Review
CSE 473 Introduction to Computer Networks Midterm Exam Review John DeHart 10/12/2015 1. (10 points). A user in Chicago, connected to the internet via a 100 Mb/s (b=bits) connection retrieves a 250 KB (B=bytes)
More informationSE 4C03 Winter Midterm Test Answer Key. Instructor: Kartik Krishnan
Name Student number SE 4C03 Winter 2004 Midterm Test Answer Key Instructor: Kartik Krishnan You have 50 minutes to complete this test consisting of 6 pages and 18 questions. The test is open book and class
More informationCS244 Advanced Topics in Computer Networks Midterm Exam Monday, May 2, 2016 OPEN BOOK, OPEN NOTES, INTERNET OFF
CS244 Advanced Topics in Computer Networks Midterm Exam Monday, May 2, 2016 OPEN BOOK, OPEN NOTES, INTERNET OFF Your Name: Answers SUNet ID: root @stanford.edu In accordance with both the letter and the
More informationECE 650 Systems Programming & Engineering. Spring 2018
ECE 650 Systems Programming & Engineering Spring 2018 Networking Introduction Tyler Bletsch Duke University Slides are adapted from Brian Rogers (Duke) Computer Networking A background of important areas
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 informationCSC 4900 Computer Networks: Link Layer (2)
CSC 4900 Computer Networks: Link Layer (2) Professor Henry Carter Fall 2017 Link Layer 6.1 Introduction and services 6.2 Error detection and correction 6.3 Multiple access protocols 6.4 LANs addressing,
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 informationThe Network Layer and Routers
The Network Layer and Routers Daniel Zappala CS 460 Computer Networking Brigham Young University 2/18 Network Layer deliver packets from sending host to receiving host must be on every host, router in
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 informationPRACTICE QUESTIONS ON RESOURCE ALLOCATION
PRACTICE QUESTIONS ON RESOURCE ALLOCATION QUESTION : Internet Versus Station Wagon A famous maxim, sometimes attributed to Dennis Ritchie, says Never underestimate the bandwidth of a station wagon full
More informationComputer Networks and the Internet. CMPS 4750/6750: Computer Networks
Computer Networks and the Inter CMPS 4750/6750: Computer Networks Outline What Is the Inter? Access Networks Packet Switching and Circuit Switching A closer look at delay, loss, and throughput Interconnection
More informationEXAM TCP/IP NETWORKING Duration: 3 hours With Solutions
SCIPER: First name: Family name: EXAM TCP/IP NETWORKING Duration: 3 hours With Solutions Jean-Yves Le Boudec January 2013 INSTRUCTIONS 1. Write your solution into this document and return it to us (you
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 informationApplied Networks & Security
Applied Networks & Security TCP/IP Protocol Suite http://condor.depaul.edu/~jkristof/it263/ John Kristoff jtk@depaul.edu IT 263 Spring 2006/2007 John Kristoff - DePaul University 1 ARP overview datalink
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 information