CS 344/444 Computer Network Fundamentals Midterm Exam Spring /07/2007
|
|
- Maryann McKinney
- 5 years ago
- Views:
Transcription
1 CS 344/444 Computer Network undamentals Midterm Exam Spring /07/2007 Question 344 Points 444 Points Score (444 only) - 20 otal: Name: Course: CS344 CS444 Instructions: 1. You have 60 minutes to finish 2. Question 5 is only for 449 students 3. Closed books, closed notes. Write all your answers using the pages on this exam (use back pages if needed) Calculators allowed his exam has 8 pages, including this cover page Page 1
2 Question 1 (10 points) Answer the following using rue/alse. You do not need to explain your answers. 1. One of the functionalities that transport protocols provide is reliable transfer over unreliable channels. 2. he Selective Repeat ARQ protocol is more efficient than the Go-ack-N ARQ protocol. 3. Efficiency of the oken Ring MAC protocol is higher than Ethernet when network utilization is high. 4. ARP is used to bind MAC addresses to IP addresses. 5. A router works at the Networking layer of the protocol stack. 6. Routing on the Internet is divided in two tiers. 7. CSMA/CD is an appropriate MAC protocol for ad-hoc wireless networks. 8. Link State routing protocols suffer from the "count to infinity" problem. 9. Reassembly of IP fragments happens only at the destination host. 10. Each router in OSP broadcasts its routing table to all the other routers in the network. Page 2
3 Question 2: Suppose node A is connected to via an intermediate router R. he A-R link is instantaneous, but the R- link transmits only one packet each second, one at a time (so two packets take 2 seconds). Assume A sends to using the sliding window protocol with SWS=4. or ime=0,1,2, state what packets arrive at and are sent from A and. How large does the queue at R grow? SWS: send window size LAR: last acknowledgement received (its sequence number) LS: last frame sent (its sequence number) LS-LAR <= SWS RWS: receiver window size LA: the largest acceptable frame (its sequence number) LR: the last frame received (its sequence number) LA-LR<=RWS Assume no packets losses. ime A Queue size at R Packets 0,1,2,3 are sent out from 0 A, and arrives at R instantaneously Waiting for packet 0 4(packet 0,1,2,3) Packet 0 arrives at, 1 Waiting for ACK 0 and ACK0 sent out from 3(packet 1,2,3) ACK0 arrives at A, A then sends out packet 4 and it arrives at R instantaneously ACK1 arrives at A, A then sends out packet 5 and it arrives at R instantaneously ACK2 arrives at A, A then sends out packet 6 and it arrives at R instantaneously Packet 1 arrives at, and ACK1 sent out from Packet 2 arrives at, and ACK2 sent out from Packet 3 arrives at, and ACK3 sent out from 3(packet 2,3,4) 3(packet 3,4,5) 3(packet 4,5,6) Page 3
4 Question 3: or the network below, give global distance-vector tables for all nodes in the network when: Note: Each row in the distance-vector table should contain destination and distance to that destination. A 15 1 E D C 2 3 (a) (10 points) Each node knows only the distance to its immediate neighbors. A 15 A 15 A C +OO - C 2 C D 5 D D +OO - E +OO - E 1 E +OO - 8 C A +OO - D A 5 A 2 +OO - D 2 D C 2 C E +OO - E +OO - 3 +OO - E A +OO - A +OO C +OO - C 3 C D +OO - D +OO - 3 E 3 E Page 4
5 (b) (10 points) Each node has reported the information it had in the preceding step to its immediate neighbors A 15 A 15 A C 7 D C 2 C D 5 D D 4 C E 16 E 1 E 23 4 E C A 7 D D A 5 A 2 4 C D 2 D C 2 C E 3 E +OO C E A 16 A E C 3 C 3 C D +OO - D 5 C 3 E 3 E Page 5
6 (c) (10 points) Step (b) happens a second time A 9 D A 9 C C 7 D C 2 C D 5 D D 4 C E 10 D E 1 E 10 D 4 E C A 7 D D A 5 A 2 4 C D 2 D C 2 C E 3 E 5 C 3 5 C E A 16 A 10 C 1 4 E C 3 C 3 C D 5 D 5 C 3 E 3 E Page 6
7 Question 4: (30 points) Consider the situation involving the creation of a routing loop in the network below, when the A-E link goes down. List a sequence of table updates among A,, and C, pertaining the destination E, that leads to a loop. Assume that table updates are done one at a time, that the split horizon technique is used by all participants, and that A sends an initial report of E's unreachability to before C. You man ignore updates that don't result in changes. A E C D G (1) A sends E s unreachability to and C (packets A1 and A2) (2) C sends the periodic update containing E s reachability to (packet C1) (3) sends the periodic update containing E s reachability to C (packet 1) (4) Packets A1 and A2 arrive at and C respectively (5) Packet C1 reaches (6) Packet 1 reaches C (7) sends E s reachability to A (packet 2) (8) C sends E s reachability to A (packet C2) (9) Packet 2 arrives at A (10)Packet C2 arrives at A Now, A s table contains: node dest cost nexthop A E 4 C s table contains: node dest cost nexthop E 3 C C s table contains: node dest cost nexthop C E 3 Page 7
8 Question 5: (CS444 Only) Consider the shortest path problem from every node to node 1 and Dijkstra's algorithm. Suppose that we have already calculated the shortest path from every node to node 1, and assume that a single arc length increases. Modify Dijkstra's algorithm to recalculate as efficiently as you can the shortest paths. he last run of the Dijkstra s algorithm gives the OldDistance(1, j ) where j 1,2,..., n. And also for each node j, there is a OldPath( j ) that contains the node sequence of the optimal path from 1 to j. or example, OldPath(5) might be [1,4,9,3] and it means the optimal path from 1 to 5 is 1->4->9->3->5. Suppose the length of the arc between nodes p and q increases. Node j need to be checked only when q Path( j) or p Path( j). he algorithm below will find out those nodes and put them into set entative and recheck them. Clear set Confirmed and entative. minpq = min(olddistance(1,q), OldDistance(1,p)); for i = 1 to n if (OldDistance(1, i) < minpq) Add i to set Confirmed ; NewDistance(1, i) = OldDistance(1, i); NewPath(i) = OldPath(i); else Add i to set entative; for each i in set entative tmppath = reverse OldPath(i); needmove = 1; for each j in tmppath if (j == q j == p) needmove = 0; break; if (OldDistance(1, j)<= minpq) break; if (needmove) Page 8
9 Add i to set Confirmed ; remove i from set entative; NewDistance(1, i) = OldDistance(1, i); NewPath(i) = OldPath(i); Start Dijkstra's algorithm with Confirmed and entative. Page 9
CS 344/444 Computer Network Fundamentals Midterm Exam Spring /07/2007
CS 344/444 Computer Network Fundamentals Midterm Exam Spring 2007 03/07/2007 Question 344 Points 444 Points Score 1 10 10 2 30 30 3 30 20 4 30 20 5 (444 only) 20 otal: 100 100 Name: Course: CS344 CS444
More informationCS 349/449 Internet Protocols Midterm Exam Winter /21/2003
CS 349/449 Internet Protocols Midterm Exam Winter 2003 10/21/2003 Question 349 Points 449 Points Score 1 10 10 2 20 10 3 20 20 4 20 20 5 30 20 6 (449 only) - 20 Total: 100 100 Name: Instructions: 1. You
More informationComputer Networks. Routing Algorithms
Computer Networks Routing Algorithms Topics Routing Algorithms Shortest Path (Dijkstra Algorithm) Distance Vector Routing Count to infinity problem Solutions for count to infinity problem Link State Routing
More informationMID II Tuesday, 1 st April 2008
Data Communication & Networks MID II Exam (Spring 2008) Page 1 / 8 Data Communication & Networks Spring 2008 Semester MID II Tuesday, 1 st April 2008 Total Time: 60 Minutes Total Marks: 40 Roll Number
More informationRouting Protocols and the IP Layer
Routing Protocols and the IP Layer CS244A Review Session 2/0/08 Ben Nham Derived from slides by: Paul Tarjan Martin Casado Ari Greenberg Functions of a router Forwarding Determine the correct egress port
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 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 informationData Communication Networks Final
Data Communication Networks Final Saad Mneimneh Visiting Professor Hunter College of CUNY NAME: This final test is take home... There are 8 Problems (but each problem has multiple parts, possibly on separate
More informationHomework 3 Discussion
Homework 3 Discussion Address Resolution Protocol (ARP) Data Link Layer Network Layer Data Link Layer Network Layer Protocol Data Unit(PDU) Frames Packets Typical Device Switch/Bridge Router Range Local
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 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 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 Science 425 Distributed Systems CS 425 / ECE 428. Fall 2013
Computer Science 425 Distributed Systems CS 425 / ECE 428 Fall 2013 Indranil Gupta (Indy) October 10, 2013 Lecture 14 Networking Reading: Chapter 3 (relevant parts) 2013, I. Gupta, K. Nahrtstedt, S. Mitra,
More informationCOMP 361 Computer Communications Networks. Spring Semester Final Examination Solution Key
COMP 361 Computer Communications Networks Spring Semester 2004 inal Examination Solution Key Date: May 24, 2004. ime: 4:30pm 7:30pm. Venue: Rm LG4204 Name: Student ID: Email: Instructions: 1. his examination
More informationECE/CSC 570 Section 001. Final test. December 11, 2006
ECE/CSC 570 Section 001 Final test December 11, 2006 Questions 1 10 each carry 2 marks. Answer only by placing a check mark to indicate whether the statement is true of false in the appropriate box, and
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 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 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 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 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 informationComputer Networks 1 (Mạng Máy Tính 1) Lectured by: Dr. Phạm Trần Vũ
Computer Networks 1 (Mạng Máy Tính 1) Lectured by: Dr. Phạm Trần Vũ Lecture 5: Network Layer Reference: Chapter 5 - Computer Networks, Andrew S. Tanenbaum, 4th Edition, Prentice Hall, 2003. Contents The
More informationCS 421: Computer Networks SPRING MIDTERM II May 5, minutes
CS 4: Computer Networks SPRING 004 MIDTERM II May 5, 004 0 minutes Name: Student No: ) a) (8 pts) List the reasons why Internet has a hierarchical routing architecture. (Use at most four sentences) b)
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 informationOverview. Problem: Find lowest cost path between two nodes Factors static: topology dynamic: load
Dynamic Routing Overview Forwarding vs Routing forwarding: to select an output port based on destination address and routing table routing: process by which routing table is built Network as a Graph C
More informationThe Open System Interconnect model
The Open System Interconnect model Telecomunicazioni Undergraduate course in Electrical Engineering University of Rome La Sapienza Rome, Italy 2007-2008 1 Layered network design Data networks are usually
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 informationIP Review. CS144 Review Session 3 April 18, 2008 Ben Nham
IP Review CS144 Review Session 3 April 18, 2008 Ben Nham Layering Review ApplicaBon Data Transport Data TCP/UDP Header Network Data TCP/UDP Header IP Header Link Data TCP/UDP Header IP Header Ethernet
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 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 informationCIS 632 / EEC 687 Mobile Computing
CIS 63 / EEC 687 Mobile Computing IP Software: Routing Prof. Chansu Yu Network Protocols for Wired Network: Ethernet Ethernet address 48-bit, also called hardware/physical/mac/layer address Globally unique:
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 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 informationComputer Networks. Routing
Computer Networks Routing Topics Link State Routing (Continued) Hierarchical Routing Broadcast Routing Sending distinct packets Flooding Multi-destination routing Using spanning tree Reverse path forwarding
More informationECE 333: Introduction to Communication Networks Fall 2001
ECE : Introduction to Communication Networks Fall 00 Lecture : Routing and Addressing I Introduction to Routing/Addressing Lectures 9- described the main components of point-to-point networks, i.e. multiplexed
More informationLecture 9. Reminder: Homework 3, Programming Project 2 due today. Questions? Thursday, September 22 CS 475 Networks - Lecture 9 1
Lecture 9 Reminder: Homework 3, Programming Project 2 due today. Questions? Thursday, September 22 CS 475 Networks - Lecture 9 1 Outline Chapter 3 - Internetworking 3.1 Switching and Bridging 3.2 Basic
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 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 informationDATA COMMUNICATOIN NETWORKING
DATA COMMUNICATOIN NETWORKING Instructor: Ouldooz Baghban Karimi Course Book & Slides: Computer Networking, A Top-Down Approach By: Kurose, Ross Introduction Course Overview Basics of Computer Networks
More informationMID-TERM EXAM TCP/IP NETWORKING Duration: 2 hours With Solutions
MID-TERM EXAM TCP/IP NETWORKING Duration: 2 hours With Solutions Jean-Yves Le Boudec 2005 December 8 Do not forget to put your names on all sheets of your solution. If you need to make assumptions in order
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 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 informationDepartment of Computer Science and Engineering. Final Examination. Instructor: N. Vlajic Date: April 15, 2011
Department of Computer Science and Engineering CSE 3214: Computer Network Protocols and Applications Final Examination Instructor: N. Vlajic Date: April 15, 2011 Instructions: Examination time: 180 min.
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 informationEE Spring 1997 Midterm #1-15 % of course grade March 12, 1997 (closed book)
EE 122 - Spring 1997 Midterm #1-15 % of course grade March 12, 1997 (closed book) EE122, Midterm #1, Spring 1997 1) Multiple Choice & Why (17 possible points) In this problem, you are to select which of
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 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 informationECE/CS 438: Communication Networks Fall Machine Problem 3. Abstract
ECE/CS 438: Communication Networks Fall 2018 Machine Problem 3 Handed Out: Nov 12 th, 2018 TA: Ashutosh Dhekne Due: Nov 25, 2018 (11:59pm) [Firm deadline] Abstract This machine problem tests your understanding
More informationCS 348 Computer Networks. IP and Routing. Indian Institute of Technology, Bombay
Computer Networks IP and Routing Network Interconnections Data Link Layer Delivery of frames on the same LAN Extend reach using switches/bridges and hubs Limitations Solution? Cannot address heterogeniety
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 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 informationHow Routing Algorithms Work
How Routing Algorithms Work A router is used to manage network traffic and find the best route for sending packets. But have you ever thought about how routers do this? Routers need to have some information
More informationCSCE 463/612 Networks and Distributed Processing Spring 2018
CSCE 463/612 Networks and Distributed Processing Spring 2018 Network Layer IV Dmitri Loguinov Texas A&M University April 12, 2018 Original slides copyright 1996-2004 J.F Kurose and K.W. Ross 1 Chapter
More informationLecture 13: Routing in multihop wireless networks. Mythili Vutukuru CS 653 Spring 2014 March 3, Monday
Lecture 13: Routing in multihop wireless networks Mythili Vutukuru CS 653 Spring 2014 March 3, Monday Routing in multihop networks Figure out a path from source to destination. Basic techniques of routing
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 informationCSCI Spring Final Exam Solution
CSCI 4211 16Spring Final Exam Solution 1. When an IP packet arrives a router, how the router decides what is the next router (output link) this packet to be forwarded to? What are the routing table and
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 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 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 informationSC250 Computer Networking I. Review Exercises. Prof. Matthias Grossglauser. School of Computer and Communication Sciences EPFL.
SC250 Computer Networking I Review Exercises Prof. Matthias Grossglauser School of Computer and Communication Sciences EPFL http://lcawww.epfl.ch 1 Reliable transport: rdt3.0 ACK packets receiver->sender
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 informationCS 6543 Computer Networks
CS 6543 Computer Networks Spring 2007 Midterm II April 19, 2007 Name: Score: /20 This exam has 6 questions in 10 pages You have 75 minutes Good luck 1 (6 points) In this question, you will explain/discuss
More informationOutline: Connecting Many Computers
Outline: Connecting Many Computers Last lecture: sending data between two computers This lecture: link-level network protocols (from last lecture) sending data among many computers 1 Review: A simple point-to-point
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 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 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 informationDistance vector and RIP
DD2490 p4 2008 Distance vector and RIP Olof Hagsand KTHNOC/NADA Literature RIP lab RFC 245: RIPv2. Sections 1 2 contains some introduction that can be useful to understand the context in which RIP is specified..1.4
More informationIntra-domain Routing
Intra-domain Routing Outline Introduction to Routing Distance Vector Algorithm CS 640 1 Goal Build router forwarding tables in an internetwork using intra-domain routing protocols High level approach Distributed
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 informationName Student ID Department/Year. Final Examination. Introduction to Computer Networks Class#: 901 E31110 Fall 2006
Name Student ID Department/Year Final Examination Introduction to Computer Networks Class#: 901 E31110 Fall 2006 9:20-11:00 Tuesday January 16, 2007 Prohibited 1. You are not allowed to write down the
More informationHierarchical Routing. Our routing study thus far - idealization all routers identical network flat not true in practice
Hierarchical Routing Our routing study thus far - idealization all routers identical network flat not true in practice scale: with 200 million destinations: can t store all destinations in routing tables!
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 informationNetworks. Distributed Systems. Philipp Kupferschmied. Universität Karlsruhe, System Architecture Group. May 6th, 2009
Networks Distributed Systems Philipp Kupferschmied Universität Karlsruhe, System Architecture Group May 6th, 2009 Philipp Kupferschmied Networks 1/ 41 1 Communication Basics Introduction Layered Communication
More informationNetwork Systems ( / ), Test 3 March 24, 2017, 13:45 15:15
Network Systems (201600146/201600197), Test 3 March 24, 2017, 13:45 15:15 This is an open-book exam: you are allowed to use the book by Peterson & Davie and the reader that belongs to this module. Furthermore,
More informationReview. Some slides are in courtesy of J. Kurose and K. Ross
Review The Internet (IP) Protocol Datagram format IP fragmentation ICMP: Internet Control Message Protocol NAT: Network Address Translation Routing in the Internet Intra-AS routing: RIP and OSPF Inter-AS
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 informationCommunication network problem. How the routers need to store and forward packets as in Internet/internets/intranets on a hop-by-hop basis.
Graph Algorithms. A graph portrays the topology of a distributed system (both in 2-D and in 3-D). A special area of distributed systems algorithm is Graph algorithms. Typical examples: Communication network
More informationCOM-208: Computer Networks - Homework 6
COM-208: Computer Networks - Homework 6. (P22) Suppose you are interested in detecting the number of hosts behind a NAT. You observe that the IP layer stamps an identification number sequentially on each
More informationCS557 Spring 2013 Midterm Exam
CS557 Spring 2013 Midterm Exam Take Home Exam Due by 11:59 Friday 3/15/11 This exam has 11 pages, including this cover page. Do all your work on these exam sheets, use the backs of the pages if needed.
More informationCS 5565 Final Exam. Name (printed)
CS 5565 This is a closed-book, closed-internet, closed-cellphone and closed-computer exam. However, you may refer to your 2 sheets of prepared notes. Your exam should have 11 pages with 6 questions totaling
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 informationNetwork Layer. The Network Layer. Contents Connection-Oriented and Connectionless Service. Recall:
Network Layer The Network Layer Recall: The network layer is responsible for the routing of packets The network layer is responsible for congestion control 1 2 Contents 4.1.1 Connection-Oriented and Connectionless
More informationNetwork Layer. Recall: The network layer is responsible for the routing of packets The network layer is responsible for congestion control
The Network Layer 1 Network Layer Recall: The network layer is responsible for the routing of packets The network layer is responsible for congestion control 2 Contents Connection-Oriented (virtual circuit)
More informationInformal Quiz #01: SOLUTIONS
ECSE-6600: Internet Protocols Informal Quiz #01: SOLUTIONS : GOOGLE: Shiv RPI shivkuma@ecse.rpi.edu 1 Review of Networking Concepts (I): Informal Quiz SOLUTIONS For each T/F question: Replace the appropriate
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 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 informationFINAL May 21, minutes
CS 421: COMPUTER NETWORKS SPRING 2004 FINAL May 21, 2004 160 minutes Name: Student No: 1) a) Consider a 1 Mbits/sec channel with a 20 msec one-way propagation delay, i.e., 40 msec roundtrip delay. We want
More information15-441: Computer Networks Spring 2010 Homework #2
15-441: Computer Networks Spring 2010 Homework #2 Due: Feb 23 rd 2010, in class Lead TA: Rui Meireles (firstname@cmu.edu) Ethernet 1. Five prisoners are locked up in adjacent cells in a prison. They would
More informationCopyright 2011 Sakun Sharma
Communication at Network Layer (Layer 3) Network layer is layer 3 of OSI Model. Network layer adds support of connecting multiple networks with each other. Network layer uses its own unique addressing
More informationLecture 15 Networking Fundamentals. Today s Plan
Lecture 15 Networking Fundamentals Slides attributed to Neil Spring Today s Plan Talk about networking in general Layers, Routing Specifically about IP and TCP Service model, what TCP provides Work our
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 informationTelecommunication Protocols Laboratory Course. Lecture 3
Telecommunication Protocols Laboratory Course Lecture 3 Course map Last time: we discussed protocols of the Medium Access Control (MAC) sub-layer Deal with broadcast channels and their (multi-party) protocols
More informationChapter 5. The Network Layer. Network Layer Design Isues. Store-and-Forward Packet Switching 10/7/2010. Implementation of Connectionless Service
Network Layer Design Isues Chapter 5 The Network Layer Store-and-Forward Packet Switching Services Provided to the Transport Layer Implementation of Connectionless Service Implementation of Connection-Oriented
More informationChapter 5. The Network Layer
Chapter 5 The Network Layer 1 Network Layer Design Isues Store-and-Forward Packet Switching Services Provided to the Transport Layer Implementation of Connectionless Service Implementation of Connection-Oriented
More informationScribe Notes -- October 31st, 2017
Scribe Notes -- October 31st, 2017 TCP/IP Protocol Suite Most popular protocol but was designed with fault tolerance in mind, not security. Consequences of this: People realized that errors in transmission
More informationChapter 4 roadmap. CS555, Spring /14/2005. WMU-CS, Dr. Gupta 1. Multicast Routing: Problem Statement. Approaches for building mcast trees
Chapter 4 roadmap 4. Introduction and Network Service Models 4.2 VC and Datagram Networks 4.3 What s Inside a Router 4.4 The Internet (IP) Protocol 4.5 Routing Algorithms 4.6 Routing in the Internet 4.7
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 informationICS 451: Today's plan. Network Layer Protocols: virtual circuits Static Routing Distance-Vector Routing
ICS 451: Today's plan Network Layer Protocols: virtual circuits Static Routing Distance-Vector Routing Virtual Circuits: Motivation Implementing the routing table in hardware can be expensive to make it
More informationEE122 - Midterm 1 Examination EECS-UC Berkeley October 2000
EE122 - Midterm 1 Examination EECS-UC Berkeley October 2000 B This is a closed book exam. The paper consists of 7 pages including the cover page. THe total poin obtinable for the paper is 100. Students
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 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 information