Name: Personnr: Include this page with your answers

Similar documents
Exam in Computer Networks

Name: Personnr: Course: [ ] 1DT131 (DV, 4p) [ ] 1DT633 (MN, 5p)

Exam in Computer Networks

ECS 152A Computer Networks Instructor: Liu. Name: Student ID #: Final Exam: March 17, 2005

Exam in Computer Networks

Sirindhorn International Institute of Technology Thammasat University

PLEASE READ CAREFULLY BEFORE YOU START

Written examination in TDTS06 Computer Networks at 8 12

EITF25 Internet Techniques and Applications L7: Internet. Stefan Höst

MIDTERM 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

CS 421: COMPUTER NETWORKS SPRING FINAL May 16, minutes

CS 5520/ECE 5590NA: Network Architecture I Spring Lecture 13: UDP and TCP

Guide to Networking Essentials, 6 th Edition. Chapter 5: Network Protocols

CMPE150 Midterm Solutions

PROGRAMMING Kyriacou E. Frederick University Cyprus. Network communication examples

TDTS04 Computer networks and distributed systems Final Exam: 14:00-18:00, Thursday, March 20, 2014

UNIVERSITY OF TORONTO FACULTY OF APPLIED SCIENCE AND ENGINEERING

Data Link Control Protocols

Computer Communication EDA344, EDA343, DIT 420

Assignment - 1 Chap. 1 Wired LAN s

EECS 122: Introduction to Communication Networks Final Exam Solutions

Computer Science 461 Midterm Exam March 14, :00-10:50am

Network Model. Why a Layered Model? All People Seem To Need Data Processing

Announcements. No book chapter for this topic! Slides are posted online as usual Homework: Will be posted online Due 12/6

No book chapter for this topic! Slides are posted online as usual Homework: Will be posted online Due 12/6

Your favorite blog : (popularly known as VIJAY JOTANI S BLOG..now in facebook.join ON FB VIJAY

Washington State University CptS 455 Sample Final Exam (corrected 12/11/2011 to say open notes) A B C

QUESTION BANK EVEN SEMESTER

INSTRUCTIONS TO CANDIDATES

Layer 4: UDP, TCP, and others. based on Chapter 9 of CompTIA Network+ Exam Guide, 4th ed., Mike Meyers

Chapter 12 Network Protocols

Sirindhorn International Institute of Technology Thammasat University

CNBK Communications and Networks Lab Book: Purpose of Hardware and Protocols Associated with Networking Computer Systems

Scribe Notes -- October 31st, 2017

School of Engineering Department of Computer and Communication Engineering Semester: Fall Course: CENG415 Communication Networks

5105: BHARATHIDASAN ENGINEERING COLLEGE NATTARMPALLI UNIT I FUNDAMENTALS AND LINK LAYER PART A

QUIZ: Longest Matching Prefix

User Datagram Protocol

PLEASE READ CAREFULLY BEFORE YOU START

PLEASE READ CAREFULLY BEFORE YOU START

a. (4pts) What general information is contained in a LSR-PDU update that A might send?

Special expressions, phrases, abbreviations and terms of Computer Networks

Computer Networks. 19 December This exam consists of 6 questions with subquestions. Every subquestion counts for 10 points.

Final Exam. Course Grade

Computer Communications DIT 420 EDA343

(a) Client server model (b) MAN (c) Interfaces and services. [4+6+6] FirstRanker

CSc 466/566. Computer Security. 18 : Network Security Introduction

Chapter 09 Network Protocols

Concept Questions Demonstrate your knowledge of these concepts by answering the following questions in the space that is provided.

CSE 473 Introduction to Computer Networks. Midterm Exam Review

Fundamental Questions to Answer About Computer Networking, Jan 2009 Prof. Ying-Dar Lin,

Faculty of Science Final Examination. Computer Science B Basics of Computer Networks

Chapter 7. Local Area Network Communications Protocols

Outline: Connecting Many Computers

1. (10 points): For each of the following, choose exactly one best answer.

TDTS06 Computer Networks Final Exam: 14:00-18:00, Friday, November 1, 2013

Internet Applications and the Application Layer Material from Kurose and Ross, Chapter 2: The Application Layer

Computer Networks. Dr. Abdel Ilah ALshbatat Dept. of Communication and Computer Engineering Faculty of Engineering Tafila Technical University

THE UNIVERSITY OF NEW SOUTH WALES

CS 421: COMPUTER NETWORKS SPRING FINAL May 24, minutes. Name: Student No: TOT

Computer Networks - Midterm

COMP 361 Computer Communications Networks. Fall Semester Final Examination: Solution key

Local Area Networks and the Network Protocol Stack

CS3516 B10 Computer Networks Final Exam December 14, 2010

CSCI 466 Midterm Networks Fall 2013

14-740: Fundamentals of Computer and Telecommunication Networks

Carnegie Mellon Computer Science Department Spring 2005 Final

Internet II. CS10 : Beauty and Joy of Computing. cs10.berkeley.edu. !!Senior Lecturer SOE Dan Garcia!!! Garcia UCB!

Telecom Systems Chae Y. Lee. Contents. Overview. Issues. Addressing ARP. Adapting Datagram Size Notes

CSE 473 Introduction to Computer Networks. Exam 2. Your name here: 11/7/2012

FINAL Wednesday, 30 th July 2008

MTA_98-366_Vindicator930

Introduction... xiii Chapter 1: Introduction to Computer Networks and Internet Computer Networks Uses of Computer Networks...

ECSE 414 Fall 2014 Final Exam Solutions

Defining Networks with the OSI Model. Module 2

FINAL May 21, minutes

COMS3200/7201 Computer Networks 1 (Version 1.0)

Different Layers Lecture 20

UDP, TCP, IP multicast

Mobile MOUSe ROUTING AND SWITCHING FUNDAMENTALS ONLINE COURSE OUTLINE

Politecnico di Milano Scuola di Ingegneria Industriale e dell Informazione. Link Layer. Fundamentals of Communication Networks

Outline. Inter-Process Communication. IPC across machines: Problems. CSCI 4061 Introduction to Operating Systems

PLEASE WRITE NEATLY I need to be able to read your answers! (seemingly encrypted solutions can not be decrypted!)

CCNA 1 Chapter 7 v5.0 Exam Answers 2013

STEVEN R. BAGLEY PACKETS

Written Exam in Information Networks TSIN01

No, the bogus packet will fail the integrity check (which uses a shared MAC key).!

Networking interview questions

NWEN 243. Networked Applications. Layer 4 TCP and UDP

TCP/IP Networking. Training Details. About Training. About Training. What You'll Learn. Training Time : 9 Hours. Capacity : 12

CPE 548 Exam #1 (50 pts) February 17, 2016

CS61C : Machine Structures

interface Question 1. a) Applications nslookup/dig Web Application DNS SMTP HTTP layer SIP Transport layer OSPF ICMP IP Network layer

University of Southern California EE450: Introduction to Computer Networks

Examination 2D1392 Protocols and Principles of the Internet 2G1305 Internetworking 2G1507 Kommunikationssystem, fk SOLUTIONS

There are 10 questions in total. Please write your SID on each page.

King Fahd University of Petroleum and Minerals College of Computer Sciences and Engineering Department of Computer Engineering

CS 421: COMPUTER NETWORKS FALL FINAL January 10, minutes

Networking for Data Acquisition Systems. Fabrice Le Goff - 14/02/ ISOTDAQ

ECS 15; Lectures 17 and 18. The Internet. What is the internet, and how does it work? TA feedback

Transcription:

Exam in Computer Networks (SAMPLE VG EXAM) Date 20051213 Course code 1DT633 Exam time 3 hours Problems 5 (out of 6), Total 50 points Teacher LarsÅke Larzon Phone 0705228109 Aid English dictionary Name: Personnr: Indicate what problems you have handed in solutions to with an X in the handin column. Clearly indicate what problems you have chosen to exclude in the rightmost column. Problem Handin Grading 1 [ ] Excluded from exam 2 [ ] Excluded from exam 3 [ ] Excluded from exam 4 [ ] Excluded from exam 5 [ ] Excluded from exam 6 [ ] Excluded from exam TOTAL Grade Include this page with your answers

Exam in Computer Networks (SAMPLE VG EXAM) Date 20051213 Course code 1DT633 Exam time 3 hours Problems 5 (out of 6), Total 50 points Teacher LarsÅke Larzon Phone 0705228109 Aid English dictionary This exam contains 6 problems, but no more than 5 can be handed in. Choose any 5 problems and clearly specify what problems you have chosen to exclude at the front of the envelope You must answer the questions instructively. Only one problem/sheet. If details needed to solve a problem have been left out, make reasonable assumptions and present them in your solution. You may answer in English or Swedish. The problems will be discussed on December 13:th. For VG, you need 30 points, distributed over at least 4 of the chosen problems. Good Luck! Good luck!

IMPORTANT You must choose one problem to exclude from the exam. Indicate what problems you have chosen to solve at the cover sheet before handing it in. 1 Short answers The statements below describe a property of different protocols, terms or mechanisms in the Internet architecture. Identify the corresponding protocols/terms/mechanisms by simply giving their name. Same protocol/term/mechanism can occur multiple times. a) Using extra bits to distinguish actual data from special tokens used to delimit frames. b) Used for IPrelated error reports and queries. c) Delivery of IP datagrams to multiple receivers (not necessarily in the same LAN). d) Used together with IP addresses on a perinterface basis to determine whether a packet must be routed or not. e) Link layer protocol used on top of modem connections. f) Framework for encryption and authentication of IP packets g) Transport protocol normally used by the DNS system h) Mechanism to avoid data loss due to full buffers at the receiver i) Trusted intermediary in a system using asymmetric encryption j) Translates from IP addresses to link layer addresses. 2 Collision handling in Ethernet Two machines A and B are attached to a 10 Mbit/s CSMA/CD Ethernet with 600m cable between them. The signal propagation of the cable is 2 10 8 m/s. At time t a = 0, A transmits the message m A to B. At time t b = 1µs, machine B wants to transmit the message m B to A. m A contains an IPv4 datagram with 20 bytes IP payload, while m B is a maximumsized Ethernet frame. In case of a detected collision, A will always choose K = 0, while B will always chose the largest possible value of K. At what times will the frames be successfully received at the destination? Use 10 7 instead of 10 2 20 to represent 10 Mbit/s to simplify the calculations. For full points, you need to present a time line showing in what order different key events occur so that it is clear how you have obtained the answer. (10p) 3 Network security a) Compare filterbased firewalls to proxybased (a.k.a. application gateways) with respect to differences in operation, limitations and impact from IPsec and SSL (5p) b) Alice works in a company that uses Kerberos for authentication. Now, Alice wants to contact the server Bob and access a service on it. Describe the steps involved to set up an encrypted session between Alice and Bob. c) Worms are becoming more and more common in the Internet. Assuming the risk of being infected is independent of the OS you are using, give two suggestions of how to reduce the risk of being infected. (2p)

4 Routing and Forwarding a) A routing domain is illustrated in figure 1. One of the routers have an error in its routing table. Locate this error and fix it before continuing. (1p) b) The link between router 2 and router 3 goes down. After this event, routing information is exchanged between the routers to reflect the new topology. What will the forwarding tables in each of the routers look like after all update messages have been processed? c) A gnome sneaks into the network and modifies two of the links between the routers so that they become oneway links. The link between router 1 and 3 can only forward packets in the direction towards router 3, and the link between router 2 and 3 can only forward packets in the direction towards router 2. What will the forwarding tables look like in the routers after all update messages have been updated? d) All of a sudden, the gnome decides to be even more evil. After having changed two of the links to be unidirectional and awaiting the forwarding tables to stabilize as described in the previous subproblem, he now disables the capability to exchange routing messages between routers. After doing this, he restores the forwarding table of router 3 to its original state (as presented in the figure). How will his actions affect the connectivity between the three endnodes in the figure? (Describe who will be able to connect whom and through what routers) Router 2 Interface 10.42.23.2 10.42.2.2 10.42.12.2 10.42.23.2 10.42.1.2 10.42.3.2 10.42.12.1 Router 1 10.42.12.2 Interface 10.42.12.1 Router 3 Interface 10.42.23.2 Figure 1: Routing domain

192.1.3.3/24 DNS 192.1.3.2/24 WWW 192.1.1.42/24 a.org 192.1.1.3/24 192.1.1.1/24 192.1.1.2/24 192.1.3.1/24 192.1.2.136/16 192.1.2.1/24 router b.org 192.1.2.2/24 192.1.2.3/24 DHCP SMTP POP DHCP Figure 2: Network setup for problem 4 5 The big picture a) Consider the network outlined in figure 2 where the IP address and netmask of all interfaces are shown. The servers in the figure provides the named services. After a major power failure, all machines are rebooted and all caches used for address resolving, DNS queries, routing tables etc. are cleared so that each machines don t know anything about the rest of the network other than the IP address of the default router. Now, the machine a.org wants to send some data to b.org using TCP. Outline what packets/frames are sent up until the first packet containing the actual data. For each packet/frame, you don t have to specify the exact format and content. However, you must specify the source, destination and the function/intent/content of the packet/frame. (10p) 6 Error detection and handling a) The message 1101100100111011 is protected with a CRC using the polynom X 7 + X 5 + X 4 + X 2 + 1 as generator. The calculated CRC is attached immediately after the message and thereafter sent over a wireless link. It turns out, that in the 24 bits sent (message+crc), the last bit (i.e., the least significant bit in the CRC) is inverted when delivered. The receiver will of course detect this when it does its verification of the CRC checksum. What will the calculated remainder at the receiver side be? b) Illustrate a scenario in which there is an error that the Internet checksum can not detect. (2p) c) Illustrate how a sliding window using cumulative ACK:s works by completing figure 3. X indicates lost packets. Solid arrows represent transmission on data, while dotted arrows are the ACK:s sent in the opposite direction. The receiver buffer size is three packets and the sender has approximately infinite window size on the sending side. No piggybacking is used. Numbers in the squares represents sequence numbers of packets sent and/or received. Values of ACK:s are filled in into the dotted squares. The timeout value is set so that 7 packets can be sent between the original transmission and the retransmission caused by the timeout. Fast retransmission occurs after one duplicate ACK. (5p) Sent 3 Received ACK:s X X Figure 3: A sliding window problem