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

Similar documents
ETSF10 Internet Protocols Transport Layer Protocols

CS 421: COMPUTER NETWORKS FALL FINAL January 10, minutes

CS 421: COMPUTER NETWORKS SPRING FINAL May 16, minutes

MCS-377 Intra-term Exam 1 Serial #:

CSE 473 Introduction to Computer Networks. Final Exam. Your name here: 12/17/2012

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

Transport Layer Review

CS 421: COMPUTER NETWORKS FALL FINAL January 12, minutes

Your Name: Your student ID number:

CSCI 466 Midterm Networks Fall 2013

Lecture 5: Flow Control. CSE 123: Computer Networks Alex C. Snoeren

CS164 Final Exam Winter 2013

OSI Layer OSI Name Units Implementation Description 7 Application Data PCs Network services such as file, print,

Transport Over IP. CSCI 690 Michael Hutt New York Institute of Technology

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

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

Answers to Sample Questions on Transport Layer

II. Principles of Computer Communications Network and Transport Layer

CS1302 / Computer Networks

Guide To TCP/IP, Second Edition UDP Header Source Port Number (16 bits) IP HEADER Protocol Field = 17 Destination Port Number (16 bit) 15 16

PLEASE READ CAREFULLY BEFORE YOU START

PLEASE READ CAREFULLY BEFORE YOU START

CS 421: COMPUTER NETWORKS SPRING FINAL May 8, minutes

ECE697AA Lecture 3. Today s lecture

Just enough TCP/IP. Protocol Overview. Connection Types in TCP/IP. Control Mechanisms. Borrowed from my ITS475/575 class the ITL

Chapter 3 Review Questions

COMPUTER NETWORK. Homework #3. Due Date: May 22, 2017 in class

UNIT IV -- TRANSPORT LAYER

Outline. Connecting to the access network: DHCP and mobile IP, LTE. Transport layer: UDP and TCP

CS 421: COMPUTER NETWORKS FALL FINAL January 5, minutes. Name: Student No: TOT

CS 421: COMPUTER NETWORKS SPRING FINAL May 21, minutes

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

CCNA Exploration Network Fundamentals. Chapter 04 OSI Transport Layer

c) With the selective repeat protocol, it is possible for the sender to receive an ACK for a packet that falls outside of its current window.

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

Assignment - 1 Chap. 1 Wired LAN s

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

Networking Technologies and Applications

Lecture 20 Overview. Last Lecture. This Lecture. Next Lecture. Transport Control Protocol (1) Transport Control Protocol (2) Source: chapters 23, 24

Transport Layer PREPARED BY AHMED ABDEL-RAOUF

PLEASE READ CAREFULLY BEFORE YOU START

UDP, TCP, IP multicast

Preview Test: HW3. Test Information Description Due:Nov. 3

First Exam for ECE671 Spring /22/18

FINAL May 21, minutes

05 Transmission Control Protocol (TCP)

Student ID: CS457: Computer Networking Date: 5/8/2007 Name:

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

PLEASE READ CAREFULLY BEFORE YOU START

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

CS4700/CS5700 Fundamentals of Computer Networks

Da t e: August 2 0 th a t 9: :00 SOLUTIONS

Test2: Solutions. Silvia Giordano ICA, EPFL. t2-1

Intro to LAN/WAN. Transport Layer

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

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

Internetworking/Internetteknik, Examination 2G1305 Date: August 18 th 2004 at 9:00 13:00 SOLUTIONS

Lecture 3: The Transport Layer: UDP and TCP

6. The Transport Layer and protocols

OSI Transport Layer. objectives

Student ID: CS457: Computer Networking Date: 3/20/2007 Name:

INSTRUCTIONS TO CANDIDATES

First Semester Examinations 2015/16 (Model Solution) INTERNET PRINCIPLES

Problem Set 7 Due: Start of Class, November 2

CPSC 441 COMPUTER COMMUNICATIONS MIDTERM EXAM SOLUTION

Problem 7. Problem 8. Problem 9

Computer Networks. Homework #4: No Grading

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

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

EECS489 Computer Networks, Take-home Makeup Midterm (Winter 2007) due in class Wednesday 3/28

Student ID: CS457: Computer Networking Date: 5/8/2007 Name:

COMPUTER NETWORK. Homework #3. Due Date: May 22, 2017 in class

CSCI 1680 Computer Networks Fonseca. Exam - Midterm. Due: 11:50am, 15 Mar Closed Book. Maximum points: 100

CCNA 1 Chapter 7 v5.0 Exam Answers 2013

Communication Networks

STEVEN R. BAGLEY PACKETS

TCP /IP Fundamentals Mr. Cantu

SE 4C03 Winter Sample Midterm Test. Instructor: Kartik Krishnan

ICS 451: Today's plan. Sliding Window Reliable Transmission Acknowledgements Windows and Bandwidth-Delay Product Retransmission Timers Connections

Paper solution Subject: Computer Networks (TE Computer pattern) Marks : 30 Date: 5/2/2015

Transport Protocols and TCP

Lecture 7: Flow Control"

First Semester Examinations 2013/14 (Model Solution) INTERNET PRINCIPLES

The Transmission Control Protocol (TCP)

SE 4C03 Winter Midterm Test Answer Key. Instructor: Kartik Krishnan

Transport Layer (TCP/UDP)

8. TCP Congestion Control

SIDDHARTH GROUP OF INSTITUTIONS :: PUTTUR Siddharth Nagar, Narayanavanam Road QUESTION BANK (DESCRIPTIVE)

EE-311 Data Communication & Networks

Exam - Final. CSCI 1680 Computer Networks Fonseca. Closed Book. Maximum points: 100 NAME: 1. TCP Congestion Control [15 pts]

EXAMGOOD QUESTION & ANSWER. Accurate study guides High passing rate! Exam Good provides update free of charge in one year!

( A ) 1. WAP is a (A) protocol (B) hardware (C) software (D) network architecture

Sirindhorn International Institute of Technology Thammasat University

Name Student ID Department/Year. Midterm Examination. Introduction to Computer Networks Class#: 901 E31110 Fall 2007

bitcoin allnet exam review: transport layer TCP basics congestion control project 2 Computer Networks ICS 651

FINAL Wednesday, 30 th July 2008

6.1 Internet Transport Layer Architecture 6.2 UDP (User Datagram Protocol) 6.3 TCP (Transmission Control Protocol) 6. Transport Layer 6-1

EECS 3214: Computer Network Protocols and Applications. Final Examination. Department of Computer Science and Engineering

ECE 333: Introduction to Communication Networks Fall 2001

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

Transcription:

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 check to make sure that you have the entire exam before beginning. You may use a calculator, otherwise no electronics; closed-book, open-notes. 1. (20 pts) In column A, number the protocol layers named in column B in order from 1, for the lowest to 5 for the highest. A B C Application layer Physical layer Transport layer Network layer Link layer web page serving operates between directly connected hosts primarily characterized by electrical or optical signalling techniques reliable bytestream delivery to applications deliver datagrams across multiple connected links Draw a line connecting each protocol layer name in column B to the one best corresponding description or characteristic in column C. 2. (15) Describe in detail the TCP connection-establishment protocol (sometimes called the threeway-handshake). Make sure to describe the use of features of the TCP header, such as the SYN bit, the sequence number and acknowledgement number fields, etc.

3. (20) Suppose that the largest ACK that a TCP sender has received is a, that the most recently received receiver window size is w and the sender's current congestion window is c. If the highest sequence number it has sent so far is h then how many more bytes is it allowed to send? 4. (20) IP Network addressing If a host s IPv4 address and netmask are given as 134.121.127.22 and 255.255.248.0, respectively: a) (5 pts) How many bits make up the subnet part of the address? b) (5 pts) How many bits make up the host part of the address? c) (5 pts) Is a host with address 134.121.255.22 on the same subnet? Explain. d) (5 pts) What is the broadcast address for this subnet?

5. (15 pts) Consider a communication link with round-trip latency of 80 msec., and bandwidth 1 Mbit/s. Assume that the transmission time (but not the latency!) for ACKs/NAKs is 0. If a sender sends 1600 bit packets what is the maximum bandwidth that can be achieved (show your work and please be careful to properly distinguish bits and bytes) a. (5 pts) if the sender waits for an acknowledgement after each packet before sending the next? b. (5 pts) if the sender uses a protocol such as TCP that allows multiple packets to be unacknowledged? c. (5 pts) What is the required window size in order to achieve the maximum bandwidth in part b. 6. (15) Draw an illustration of how a TCP congestion window typically varies over time. Label a) regions where slow-start is occurring b) regions where additive increase is occurring c) points where time-outs occur d) threshold values. E) What on the diagram corresponds to the multiplicative decrease in the so-called additive increase, multiplicative decrease congestion window strategy. 7. (10 pts) Explain how the idea of a exponential moving average is used in computing TCP round-trip times, and RTT variation.

8. (20) Suppose a program executes the statement res = select(...); a. After select returns, what are the meanings of the various values that might be stored in res: 0? a positive number? a negative number? b. After select returns how does the calling program determine which file descriptors are now ready to perform I/O? 9. (20) Consider RSA cryptography with p=5, q=11. a. What are n and z? b. Why is e=27 an appropriate choice for an encryption key given this p and q? c. Why is d=3 the correct choice for the corresponding decryption key? d. If the ciphertext, c=20, what was the original message, m?

10. (10) Cryptographic hash functions map arbitrary messages to fixed length strings. What characteristics are important for a hash function to be considered cryptographic? 11. (10) Given a cryptographic hash function H, describe how to use H for a message authentication code? 12. (15) Why is UDP preferred to TCP as the protocol for carrying voice signals when doing telephony over the Internet (so-called VOIP)?

13. (20) Suppose that G=1101 is used as a generator for a CRC calculation for the data 100111. a. How many bits are in the generated CRC? Explain. b. What is the generated CRC? Show your work.