CS244a: An Introduction to Computer Networks
|
|
- Dale Cooper
- 5 years ago
- Views:
Transcription
1 Grade: MC: 7: 8: 9: 10: 11: 12: 13: 14: Total: CS244a: An Introduction to Computer Networks Final Exam: Wednesday You are allowed 2 hours to complete this exam. (i) This exam is closed book and closed notes. However, you may refer to a sheet of 8.5"x11" paper (double-sided) of your own design. (ii) Write your solution directly onto this exam. Be sure to write your name and student ID clearly on the front of the exam. (iii) Don t panic! Be sure to start by reading the exam all the way through. Then answer the questions in whatever order you choose. (iv) Show your reasoning clearly. If your reasoning is correct, but your final answer is wrong, you will receive most of the credit. If you just show the answer without reasoning, and your answer is wrong, you may receive no points at all. The Stanford Honor Code In accordance with both the letter and spirit of the Honor Code, I didn't cheat on this exam. Signature: Page 1 of 14
2 Short Multiple Choice Questions. Instructions: in the following questions, check all listed assertions that appear to be correct. There is at least one correct assertion per question, but there may be more. Each correct assertion checked will earn you one point. For each incorrect assertion you check, you will lose one point. If you don t know an answer, checking no assertion will neither earn you nor lose you any points. 1. Layering. "Layering" is commonly used in computer networks because: (a.) It forces all network software to be written in ANSI C. (b.) Encapsulation is the lowest overhead method to transmit data. (c.) It allows widespread code and implementation re-use. (d.) It keeps networks warm enabling them to run faster. 2. Elasticity Buffer. An elasticity buffer is used to store bits arriving at a network interface. If the receiving station uses a 200-bit elasticity buffer and the clocks of the transmitter and receiver have a minimum frequency of MHz and a maximum frequency of MHz, which of the following statements are true: (a.) All packets have to be less than or equal to 12,500 bytes long. (b.) All packets have to be less than or equal to 4500 bytes long. (c.) The two clocks have a tolerance of +/- 100ppm. (d.) The two clocks have a tolerance of +/- 10ppm. (e.) The transmitter s clock is always faster than the receiver s clock. 3. TCP. The TCP protocol uses a sliding window protocol. The window size varies because: (a.) Routers along the route advertise a varying window size to prevent congestion. (b.) The destination advertises a reduced window size when its buffers are congested. (c.) The destination advertises a reduced window size when packets take a long time to reach it. (d.) The source reduces its window size when it detects that congestion is occurring. 4. Fair Queueing. Which of the following are true: (a.) A fair queueing scheduler used in a router transmits one packet at a time. (b.) A fair queueing scheduler used in a router transmits just one bit from each packet at a time before moving onto the next packet. (c.) If traffic arriving at each router in a network is leaky-bucket constrained, and if each router uses weighted fair queueing schedulers, then bounds can be placed on the end-to-end delay of each packet. (d.) If a fair queueing scheduler calculates the finishing time of two packets, A and B, such that A is scheduled to depart before B, then at a later time as new packets arrive, the scheduler may change its mind and schedule B ahead of A. (e.) Weighted fair queueing allows a router to provide each flow with a weighted share of the link capacity. Page 2 of 14
3 5. TCP. TCP guarantees a reliable, in-order stream of data. Which of the following are true? (a.) TCP guarantees that if a byte did not reach the receiver, the sender will find out and be able to retransmit the data. (b.) TCP guarantees that any error that corrupts the TCP header is detected by the receiver (c.) TCP guarantees that any error that corrupts the TCP payload is detected by the receiver (d.) When a sender receives an acknowledgement with ACK sequence number A, it should assume that all the data up to and including byte A-1 has been correctly received by the destination (e.) When a sender receives an acknowledgement with ACK sequence number A, it should assume that all the data with a sequence number greater than A has not been received by the destination 6. Link layer. Which of the following are true? (a.) An Ethernet switch can interconnect a 10Mb/s Ethernet network and a 1Gb/s Ethernet. (b.) An Ethernet hub can interconnect a 10Mb/s Ethernet network and a 1Gb/s Ethernet. (c.) An Ethernet network cannot detect collisions until it has computed a checksum over the frame. (d.) 4B/5B is considered more efficient than Manchester encoding because more user data is transmitted in same amount of time. (e.) The b wireless protocol incorporates a link-layer ACK not present in regular Ethernet. Page 3 of 14
4 Short questions 7. (3 points) IP. Explain why IPv4 fragments are reassembled at the end-point, rather than at an intermediate router along the path. 8. (3 points) Physical Layer. You are asked to implement an 8-level coding scheme for a high speed electrical link, in which 3 bits are sent every 2ns. You measure the signal to noise ratio of the link, and find it to be 30dB. With a spectrum analyzer you determine that the bandwidth of the cable is 100MHz. Assuming that the noise is Gaussian, is it possible to design the link so that it has an arbitrarily low bit-error rate? Explain your answer. 9. (5 points) TCP sequence numbers. (a.) Why does TCP use a 32-bit sequence number, instead of, say, 16 bits? (b.) Compute the maximum data rate at which a sender needs to worry about TCP sequence number wrap-around, assuming a maximum segment lifetime of two minutes. 10. (6 points) Security. Great floods have flown from simple sources. Alice, upon moving to Costa Rica, starts a small website using a local ISP for hosting. The ISP guarantees her a 5Mb/s connection. After a couple of days, evil Trudy (the bot queen), launches a SYN flood against Alice's simple setup. (a.) Explain how and why Alice s machine is unable to continue providing service. Be as specific as you can, and use your knowledge of how TCP is implemented. Page 4 of 14
5 (b.) In response, Alice turns on SYN cookies at her server. Explain how SYN cookies solve the problem of SYN flood attacks. (c.) Explain how Trudy could increase her attack and still deny access to legitimate clients. Page 5 of 14
6 Longer questions 11. (20 points) Ethernet switched networks. Consider the Ethernet network below consisting of switches that run the Spanning Tree Protocol. S5 S5 S4 S4 S6 S6 S1 S1 S7 S7 S9 S9 S2 S2 S3 S3 S8 S8 A B (a.) Sketch the logical spanning tree that the Spanning Tree Protocol will create. (b.) What use is S9? Page 6 of 14
7 (c.) Write down three differences between the Spanning Tree Protocol and Dijkstra s algorithm, used to calculate routes in OSPF. (d.) What path will packets take from Host A to Host B? How does this compare to the shortest distance from A to B? (e.) After A and B have exchanged messages and the Ethernet switches have learned addresses, what will the forwarding table contain for each switch? Write your answer next to each switch in the figure above. 12. (20 points) Routing. Use the Bellman Ford algorithm to find the lowest cost path to computer A from every other computer in the network below. Show how the algorithm evolves at each step, showing the current lowest cost to reach A, and the next hop router to get there from each computer. Assume all the links are bidirectional and symmetric (i.e. the cost of using a link is the same in both directions). Page 7 of 14
8 A C R R 3 R 4 R 3 4 R 4 D B R 22 6 R R 55 1 F E G 9 R 77 H Page 8 of 14
9 13. (20 points) TCP throughput. In this question we will explore the throughput of a TCP flow during the initial slow-start phase. In our model, we will assume that during slow-start, a TCP source sets the window size, W, equal to one initially, and then increases W by one for each packet for which it receives an acknowledgement. We will assume that the RTT is constant. (a.) On the axes below, sketch the evolution of W as a function of time until the first packet is dropped. 64 W RTT 2RTT 3RTT 4RTT (b.) Assume that the first packet is dropped when W = W max. Show that the throughput, T, of the flow (up until the first drop) is approximately: 2W max 1 T =. ( 1+ log W )RTT 2 max Page 9 of 14
10 (c.) Find an expression for T as a function of RTT and p (the probability that a packet is dropped). (d.) Suppose now the TCP source sets the window size to W 1 initially and as before it increases W by one for every ACK it receives. The TCP receiver sends an ACK for every b-th packet. Show that the number of slow-start rounds needed to transfer L packets in unconstrained slow-start (i.e. no packet drops or a limit on the source s window size) is: L( α 1) i = log 1 α, W 1 1 where α = 1+. b [Hint: sender s cwnd in round (i + 1) evolves as cwnd i+1 = cwnd i (1 + 1/ b). ] (e.) Continuing with the assumptions in part (d), let ( L) W ss denote the TCP window size after sending L packets in unconstrained slow-start. Find an W ss L in terms of W α, and L. expression for ( ) 1, Page 10 of 14
11 (f.) Suppose now, b=2, W 1 = 1 Kbytes, C =1.5 Mbps, RTT = 70 ms and most flows have transfer sizes less than 10 Kbytes. Using this information and your answer from part (e), conclude that most Internet flows spend their lifetimes in slow-start phase. Page 11 of 14
12 14. (20 points) Leaky-buckets. In the figure below, source S sends packets through a router with a buffer of size B to destination D. The link from S to the router runs at rate R1, and the link from the router to the destination runs at rate R2. R2 > R1. B S R1 R2 D (a.) Write down the leaky bucket parameters that are an upper bound on the burstiness and rate of arrivals to D, regardless of the process of packets that S sends into the network. (b.) Sketch on the axes below a tight upper bound on the cumulative arrivals to D. Your answer should clearly show R1, R2 and B. You only need to show the constraints starting from t=0. Page 12 of 14
13 A source sends packets, all of length P, belonging to a single flow through k store-andforward routers (each with B packet buffers), as shown in the figure below. All the links are l meters long and operate at data-rate R. The source uses a leaky-bucket regulator to limit the burstiness of the flow to σ packets, and the long-term average rate to ρ bits per second. S R b/s B > σ ρ R b/s B > σ ρ R b/s B > σ R ρ D Router 1 Router 2 Router k Page 13 of 14
14 (c.) Assuming that the scheduler in each router is work-conserving, what is the shortest time for a packet from S to reach D? Explain your answer. (d.) What is the worst-case end-to-end delay for this flow, assuming it shares the links with many other leaky-bucket constrained flows? Page 14 of 14
CS244a: An Introduction to Computer Networks
Name: Student ID #: Campus/SITN-Local/SITN-Remote? MC MC Long 18 19 TOTAL /20 /20 CS244a: An Introduction to Computer Networks Final Exam: Thursday February 16th, 2000 You are allowed 2 hours to complete
More informationCS244a: An Introduction to Computer Networks
Do not write in this box MCQ 13: /10 14: /10 15: /0 16: /0 17: /10 18: /10 19: /0 0: /10 Total: Name: Student ID #: Campus/SITN-Local/SITN-Remote? CS44a Winter 004 Professor McKeown CS44a: An Introduction
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 informationCS244a: An Introduction to Computer Networks
mgrade: MC: 19: 20: 21: 22: 23: 24: Total: CS244a: An Introduction to Computer Networks Final Exam: Monday You are allowed 3 hours to complete this exam. (i) This exam is closed book and closed notes.
More informationCS244a: An Introduction to Computer Networks
Name: Grade: S MC: L MC: 15: 16: 17: Total: CS244a: An Introduction to Computer Networks Midterm Exam: Thursday You are allowed 1 hour to complete this exam. (i) This exam is closed book and closed notes.
More informationCS144: Intro to Computer Networks Homework 1 Scan and submit your solution online. Due Friday January 30, 4pm
CS144: Intro to Computer Networks Homework 1 Scan and submit your solution online. Due Friday January 30, 2015 @ 4pm Your Name: SUNet ID: @stanford.edu Check if you would like exam routed back via SCPD:
More informationEECS 122: Introduction to Communication Networks Final Exam Solutions
EECS 22: Introduction to Communication Networks Final Exam Solutions Problem. (6 points) How long does it take for a 3000-byte IP packet to go from host A to host B in the figure below. Assume the overhead
More informationDepartment of EECS - University of California at Berkeley EECS122 - Introduction to Communication Networks - Spring 2005 Final: 5/20/2005
Name: SID: Department of EECS - University of California at Berkeley EECS122 - Introduction to Communication Networks - Spring 2005 Final: 5/20/2005 There are 10 questions in total. Please write your SID
More informationCS144: Intro to Computer Networks Homework 1 Scan and submit your solution online. Due Friday January 30, 4pm
CS144: Intro to Computer Networks Homework 1 Scan and submit your solution online. Due Friday January 30, 2015 @ 4pm Your Name: Answers SUNet ID: root @stanford.edu Check if you would like exam routed
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 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 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 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 informationThere are 10 questions in total. Please write your SID on each page.
Name: SID: Department of EECS - University of California at Berkeley EECS122 - Introduction to Communication Networks - Spring 2005 to the Final: 5/20/2005 There are 10 questions in total. Please write
More informationMIDTERM EXAMINATION #2 OPERATING SYSTEM CONCEPTS U N I V E R S I T Y O F W I N D S O R S C H O O L O F C O M P U T E R S C I E N C E
MIDTERM EXAMINATION #2 OPERATING SYSTEM CONCEPTS 03-60-367-01 U N I V E R S I T Y O F W I N D S O R S C H O O L O F C O M P U T E R S C I E N C E Intersession 2008 Last Name: First Name: Student ID: PLEASE
More informationCPE 448 Exam #2 (50 pts) April Name Class: 448
Name Class: 448 1) (5 pts) Draw the three way handshake used to establish a TCP connection. Show all SYN and ACK packets. Also show all sequence and acknowledgement numbers associated with the SYN and
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 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 informationQuality of Service (QoS)
Quality of Service (QoS) The Internet was originally designed for best-effort service without guarantee of predictable performance. Best-effort service is often sufficient for a traffic that is not sensitive
More informationECE4110, Internetwork Programming, QUIZ 2 - PRACTICE Spring 2006
Email Address ECE4110, Internetwork Programming, QUIZ 2 - PRACTICE Spring 2006 Name (Print) Prof. John A. Copeland Practice for April 11, 2006 Tel.: 404-894-5177 E-Mail: copeland@ece.gatech.edu RULES.
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 informationCS/ECE 438: Communication Networks for Computers Spring 2018 Midterm Examination Online
1 CS/ECE 438: Communication Networks for Computers Spring 2018 Midterm Examination Online Solutions 1. General Networking a. In traditional client-server communication using TCP, a new socket is created.
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 informationCSE 473 Introduction to Computer Networks. Exam 2. Your name here: 11/7/2012
CSE 473 Introduction to Computer Networks Jon Turner Exam 2 Your name here: 11/7/2012 1. (10 points). The diagram at right shows a DHT with 16 nodes. Each node is labeled with the first value in its range
More informationCS 640: Introduction to Computer Networks
CS 640: Introduction to Computer Networks Midterm II 12/14/2006 Allotted time: 11:00AM to 12:40 PM (100 minutes) Name: UW -ID Number: 1. There are 7 questions in this mid-term. All 7 must be answered for
More informationCHAPTER 3 EFFECTIVE ADMISSION CONTROL MECHANISM IN WIRELESS MESH NETWORKS
28 CHAPTER 3 EFFECTIVE ADMISSION CONTROL MECHANISM IN WIRELESS MESH NETWORKS Introduction Measurement-based scheme, that constantly monitors the network, will incorporate the current network state in the
More informationUniversity of California at Berkeley College of Engineering Department of Electrical Engineering and Computer Sciences
University of California at Berkeley College of Engineering Department of Electrical Engineering and Computer Sciences CS168 MIDTERM EXAMINATION Monday, 20 October 2014 INSTRUCTIONS READ THEM NOW! This
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 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 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 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 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 informationMid Sweden University Dept. of IT and Media (ITM) Magnus Eriksson Tel , Jan 2009.
Mid Sweden University Dept. of IT and Media (ITM) Magnus Eriksson Tel 060-148740, 070-562 5502. Email magnus.eriksson@miun.se 9 Jan 2009 Page 1 of 6 Exam in DT024G, Computer Networks A Answers Time: 8:00-12:00
More informationWritten examination in TDTS06 Computer Networks at 8 12
LiTH, The Institute of Technology at Linköping University 1(6) IDA, The Department of Computer and Information Science Juha Takkinen 2010-10-26 Written examination in TDTS06 Computer Networks 2010-10-23
More information14-740: Fundamentals of Computer and Telecommunication Networks
14-740: Fundamentals of Computer and Telecommunication Networks Fall 2018 Quiz #2 Duration: 75 minutes ANSWER KEY Name: Andrew ID: Important: Each question is to be answered in the space provided. Material
More informationFinal 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 informationFINAL Tuesday, 20 th May 2008
Data Communication & Networks FINAL Exam (Spring 2008) Page 1 / 23 Data Communication & Networks Spring 2008 Semester FINAL Tuesday, 20 th May 2008 Total Time: 180 Minutes Total Marks: 100 Roll Number
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 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 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 informationTCP so far Computer Networking Outline. How Was TCP Able to Evolve
TCP so far 15-441 15-441 Computer Networking 15-641 Lecture 14: TCP Performance & Future Peter Steenkiste Fall 2016 www.cs.cmu.edu/~prs/15-441-f16 Reliable byte stream protocol Connection establishments
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 informationEEC-484/584 Computer Networks
EEC-484/584 Computer Networks Lecture 13 wenbing@ieee.org (Lecture nodes are based on materials supplied by Dr. Louise Moser at UCSB and Prentice-Hall) Outline 2 Review of lecture 12 Routing Congestion
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 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 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 informationTopics. TCP sliding window protocol TCP PUSH flag TCP slow start Bulk data throughput
Topics TCP sliding window protocol TCP PUSH flag TCP slow start Bulk data throughput 2 Introduction In this chapter we will discuss TCP s form of flow control called a sliding window protocol It allows
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 informationReliable Transport I: Concepts and TCP Protocol
Reliable Transport I: Concepts and TCP Protocol Stefano Vissicchio UCL Computer Science COMP0023 Today Transport Concepts Layering context Transport goals Transport mechanisms and design choices TCP Protocol
More informationMidterm II December 4 th, 2006 CS162: Operating Systems and Systems Programming
Fall 2006 University of California, Berkeley College of Engineering Computer Science Division EECS John Kubiatowicz Midterm II December 4 th, 2006 CS162: Operating Systems and Systems Programming Your
More informationReliable Transport II: TCP and Congestion Control
Reliable Transport II: TCP and Congestion Control Stefano Vissicchio UCL Computer Science COMP0023 Recap: Last Lecture Transport Concepts Layering context Transport goals Transport mechanisms and design
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 informationSwitch Configuration message sent 1 (1, 0, 1) 2
UNIVESITY COLLEGE LONON EPATMENT OF COMPUTE SCIENCE COMP00: Networked Systems Problem Set istributed: nd November 08 NOT ASSESSE, model answers released: 9th November 08 Instructions: This problem set
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 informationEECS489 Computer Networks, Take-home Makeup Midterm (Winter 2007) due in class Wednesday 3/28
EECS489 Computer Networks, Take-home Makeup Midterm (Winter 2007) due in class Wednesday 3/28 Note that this is entirely optional, taking this exam will only improve your grade, and not taking it will
More informationcs/ee 143 Communication Networks
cs/ee 143 Communication Networks Chapter 4 Transport Text: Walrand & Parakh, 2010 Steven Low CMS, EE, Caltech Recap: Internet overview Some basic mechanisms n Packet switching n Addressing n Routing o
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 informationOutline Computer Networking. TCP slow start. TCP modeling. TCP details AIMD. Congestion Avoidance. Lecture 18 TCP Performance Peter Steenkiste
Outline 15-441 Computer Networking Lecture 18 TCP Performance Peter Steenkiste Fall 2010 www.cs.cmu.edu/~prs/15-441-f10 TCP congestion avoidance TCP slow start TCP modeling TCP details 2 AIMD Distributed,
More information15-441: Computer Networks Homework 3
15-441: Computer Networks Homework 3 Assigned: Oct 29, 2013 Due: Nov 12, 2013 1:30 PM in class Name: Andrew ID: 1 TCP 1. Suppose an established TCP connection exists between sockets A and B. A third party,
More informationUNIT IV TRANSPORT LAYER
Transport Layer UNIT IV TRANSPORT LAYER Congestion Control and Quality of Service Ref: Data Communication & Networking, 4 th edition, Forouzan IV-1 DATA TRAFFIC The main focus of congestion control and
More informationSirindhorn International Institute of Technology Thammasat University
Name...ID....Section. Seat No.. Sirindhorn International Institute of Technology Thammasat University Midterm Examination: Semester 2/2006 Course Title : ITS 413 Internet Technologies and Applications
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 informationEE 122 Fall st Midterm. Professor: Lai Stoica
EE 122 Fall 2001 1 st Midterm Professor: Lai Stoica Question 1 (15 pt) Layering is a key design principle in computer networks. Name two advantages, and one disadvantage to layering. Explain. Use no more
More informationFINAL Wednesday, 30 th July 2008
Data Communication & Networks Summer 2008 Semester FINAL Wednesday, 30 th July 2008 Total Time: 120 Minutes Total Marks: 80 Roll Number Name Section Signature: Signature of Invigilator Course Instructors:
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 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 informationYour favorite blog :www.vijay-jotani.weebly.com (popularly known as VIJAY JOTANI S BLOG..now in facebook.join ON FB VIJAY
VISIT: Course Code : MCS-042 Course Title : Data Communication and Computer Network Assignment Number : MCA (4)/042/Assign/2014-15 Maximum Marks : 100 Weightage : 25% Last Dates for Submission : 15 th
More informationPractice Problems: P22, 23, P24, P25, P26, P27, P28, P29, P30, P32, P44 and P45. Hand-in the following: P27, P28, P32, P37, P44
Practice Problems: P, 3, P4, P5, P6, P7, P8, P9, P30, P3, P44 and P45. Hand-in the following: P7, P8, P3, P37, P44 Chapter-3 Assigned/ Practice - Problems Problem a) Here we have a window size of N=3.
More informationTCP. CSU CS557, Spring 2018 Instructor: Lorenzo De Carli (Slides by Christos Papadopoulos, remixed by Lorenzo De Carli)
TCP CSU CS557, Spring 2018 Instructor: Lorenzo De Carli (Slides by Christos Papadopoulos, remixed by Lorenzo De Carli) 1 Sources Fall and Stevens, TCP/IP Illustrated Vol. 1, 2nd edition Congestion Avoidance
More informationEE122 MIDTERM EXAM: Scott Shenker, Ion Stoica
EE MITERM EXM: 00-0- Scott Shenker, Ion Stoica Last name Student I First name Login: ee- Please circle the last two letters of your login. a b c d e f g h i j k l m n o p q r s t u v w x y z a b c d e
More informationData Communication & Networks Final Exam (Fall 2008) Page 1 / 13. Course Instructors: Engr. Waleed Ejaz. Marks Obtained Marks
Data Communication & Networks Final Exam (Fall 2008) Page 1 / 13 Data Communication & Networks Fall 2008 Semester FINAL Thursday, 4 th December 2008 Total Time: 180 Minutes Total Marks: 100 Roll Number
More informationChapter 24. Transport-Layer Protocols
Chapter 24. Transport-Layer Protocols 23.1 Introduction 23.2 User Datagram Protocol 23.3 Transmission Control Protocol 23.4 SCTP Computer Networks 24-1 Position of Transport-Layer Protocols UDP is an unreliable
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 informationEC441 Midterm Two Fall 2017
EC441 Midterm Two Fall 2017 This is an open-book, open-computer, open-notes exam. You may work with a partner, but you must submit one joint answer for each problem. You may not complete any exam with
More informationTransmission Control Protocol. ITS 413 Internet Technologies and Applications
Transmission Control Protocol ITS 413 Internet Technologies and Applications Contents Overview of TCP (Review) TCP and Congestion Control The Causes of Congestion Approaches to Congestion Control TCP Congestion
More informationBandwidth Allocation & TCP
Bandwidth Allocation & TCP The Transport Layer Focus Application Presentation How do we share bandwidth? Session Topics Transport Network Congestion control & fairness Data Link TCP Additive Increase/Multiplicative
More informationChapter 23 Process-to-Process Delivery: UDP, TCP, and SCTP
Chapter 23 Process-to-Process Delivery: UDP, TCP, and SCTP 23.1 Copyright The McGraw-Hill Companies, Inc. Permission required for reproduction or display. 23-1 PROCESS-TO-PROCESS DELIVERY The transport
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 informationUser Datagram Protocol
Topics Transport Layer TCP s three-way handshake TCP s connection termination sequence TCP s TIME_WAIT state TCP and UDP buffering by the socket layer 2 Introduction UDP is a simple, unreliable datagram
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 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 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 informationCS4700/CS5700 Fundamentals of Computer Networks
CS4700/CS5700 Fundamentals of Computer Networks Lecture 14: TCP Slides used with permissions from Edward W. Knightly, T. S. Eugene Ng, Ion Stoica, Hui Zhang Alan Mislove amislove at ccs.neu.edu Northeastern
More information4. What is the sequence number of the SYNACK segment sent by spinlab.wpi.edu to the client computer in reply to the SYN? Also Seq=0 (relative
1. What is the IP address and TCP port number used by your client computer (source) to transfer the file to spinlab.wpi.edu? My computer is at 10.211.55.3. The source port is 49247. See screenshot below.
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 informationNetwork Architecture
Unit 7 Network Architecture Acknowledgments: These slides were originally developed by Prof. Jean Walrand for EE122. The past and current EE122 instructors including Kevin Fall, Abhay Parekh, Shyam Parekh,
More informationCMPE150 Midterm Solutions
CMPE150 Midterm Solutions Question 1 Packet switching and circuit switching: (a) Is the Internet a packet switching or circuit switching network? Justify your answer. The Internet is a packet switching
More informationHomework 1. Question 1 - Layering. CSCI 1680 Computer Networks Fonseca
CSCI 1680 Computer Networks Fonseca Homework 1 Due: 27 September 2012, 4pm Question 1 - Layering a. Why are networked systems layered? What are the advantages of layering? Are there any disadvantages?
More informationLecture 21: Congestion Control" CSE 123: Computer Networks Alex C. Snoeren
Lecture 21: Congestion Control" CSE 123: Computer Networks Alex C. Snoeren Lecture 21 Overview" How fast should a sending host transmit data? Not to fast, not to slow, just right Should not be faster than
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 informationEE-311 Data Communication & Networks
National University of Computer & Emerging Sciences, Islamabad, Pakistan Name: Roll No: EE-311 Data Communication & Networks Summer 2007 Final Thursday, 2 nd August 2007 Total Time: 3 Hours Total Marks:
More informationRecap. TCP connection setup/teardown Sliding window, flow control Retransmission timeouts Fairness, max-min fairness AIMD achieves max-min fairness
Recap TCP connection setup/teardown Sliding window, flow control Retransmission timeouts Fairness, max-min fairness AIMD achieves max-min fairness 81 Feedback Signals Several possible signals, with different
More informationCCNA 1 Chapter 7 v5.0 Exam Answers 2013
CCNA 1 Chapter 7 v5.0 Exam Answers 2013 1 A PC is downloading a large file from a server. The TCP window is 1000 bytes. The server is sending the file using 100-byte segments. How many segments will the
More informationSolutions to Select Exercises
Solutions to Select Exercises CHAPTER. We will count the transfer as completed when the last data bit arrives at its destination (a). MB = 89 bits. initial RTTs (6 ms) +,8,9/,, bps (transmit) + RTT/ (propagation).8
More informationCode No: RR Set No. 1
Code No: RR320503 Set No. 1 III B.Tech II Semester Regular Examinations, Apr/May 2007 COMPUTER NETWORKS ( Common to Computer Science & Engineering, Information Technology, Electronics & Control Engineering,
More informationLecture 14: Congestion Control"
Lecture 14: Congestion Control" CSE 222A: Computer Communication Networks George Porter Thanks: Amin Vahdat, Dina Katabi and Alex C. Snoeren Lecture 14 Overview" TCP congestion control review Dukkipati
More informationCS457 Transport Protocols. CS 457 Fall 2014
CS457 Transport Protocols CS 457 Fall 2014 Topics Principles underlying transport-layer services Demultiplexing Detecting corruption Reliable delivery Flow control Transport-layer protocols User Datagram
More informationAN exam March
AN exam March 29 2018 Dear student This exam consists of 7 questions. The total number of points is 100. Read the questions carefully. Be precise and concise. Write in a readable way. Q1. UDP and TCP (25
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 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 information