ECE 544 Computer Networks II Mid-Term Exam March 29, 2002 Profs. D. Raychaudhuri & M. Ott

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

===================================================================== Exercises =====================================================================

CS 3516: Computer Networks

EL Wireless and Mobile Networking Spring 2002 Mid-Term Exam Solution - March 6, 2002

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

TDTS06: Computer Networks

CS 640: Introduction to Computer Networks

CSCI Spring Final Exam Solution

CSCI 466 Midterm Networks Fall 2011

Midterm Review. EECS 489 Computer Networks Z. Morley Mao Monday Feb 19, 2007

Homework 4 assignment for ECE374 Posted: 04/06/15 Due: 04/13/15

Department of EECS - University of California at Berkeley EECS122 - Introduction to Communication Networks - Spring 2005 Final: 5/20/2005

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

Question Score 1 / 19 2 / 19 3 / 16 4 / 29 5 / 17 Total / 100

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

Question Points Score total 100

Review. Error Detection: CRC Multiple access protocols. LAN addresses and ARP Ethernet. Slotted ALOHA CSMA/CD

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

NET ID. CS519, Prelim (March 17, 2004) NAME: You have 50 minutes to complete the test. 1/17

CSCI 466 Midterm Networks Fall 2011

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

CSE 473 Introduction to Computer Networks. Final Exam. Your Name: 12/17/2014 PLEASE WRITE LEGIBLY NO POINTS FOR ILLEGIBLE ANSWERS

FACULTY OF COMPUTING AND INFORMATICS

ECE4110, Internetwork Programming, QUIZ 2 - PRACTICE Spring 2006

FINAL May 21, minutes

CS 421: COMPUTER NETWORKS SPRING FINAL May 21, minutes

Final Exam Computer Networks Fall 2015 Prof. Cheng-Fu Chou

CS 421: COMPUTER NETWORKS SPRING FINAL May 16, minutes

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

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

Homework #4. Due: December 2, 4PM. CWND (#pkts)

Data Link Control Protocols

Chapter 2 - Part 1. The TCP/IP Protocol: The Language of the Internet

CS 6543 Computer Networks

Reliable Transmission

Computer Communications DIT 420 EDA343

EE-311 Data Communication & Networks

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

SC250 Computer Networking I. Review Exercises. Prof. Matthias Grossglauser. School of Computer and Communication Sciences EPFL.

College of Computer and Information Sciences Department of Computer Engineering CEN444 Computer Networks Midterm 2 Exam Second Semester 1434/1435

ECEN Final Exam Fall Instructor: Srinivas Shakkottai

Introduction to Communication Networks Spring Unit 13 Network extensions Bridges.

CS 349/449 Internet Protocols Final Exam Winter /15/2003. Name: Course:

CS 640: Introduction to Computer Networks

ICE 1332/0715 Mobile Computing (Summer, 2008)

TCP/IP Performance ITL

Midterm Review EECS 122. University of California Berkeley

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

CS3516 B10 Computer Networks Final Exam December 14, 2010

Data Networks. Lecture 1: Introduction. September 4, 2008

Department of Electrical Engineering and Computer Science MASSACHUSETTS INSTITUTE OF TECHNOLOGY Spring Quiz III

Computer Networks. Fall 2012 (M 6:15-9:00 in Jbarry 201B) Mirela Damian.

6.033 Computer System Engineering

1. The Internet 2. Principles 3. Ethernet 4. WiFi 5. Routing 6. Internetworking 7. Transport 8. Models 9. WiMAX & LTE 10. QoS 11. Physical Layer 12.

Networks Fall This exam consists of 10 problems on the following 13 pages.

Name Student ID Department/Year. Final Examination. Introduction to Computer Networks Class#: Fall :20-11:00 Tuesday January 13, 2004

Reminder: Datalink Functions Computer Networking. Datalink Architectures

Ethernet Switches (more)

UNIVERSITY OF TORONTO FACULTY OF APPLIED SCIENCE AND ENGINEERING

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

CSE 123: Computer Networks

Part 5: Link Layer Technologies. CSE 3461: Introduction to Computer Networking Reading: Chapter 5, Kurose and Ross

CS244a: An Introduction to Computer Networks

EE 122 Fall st Midterm. Professor: Lai Stoica

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

Module objectives. Integrated services. Support for real-time applications. Real-time flows and the current Internet protocols

COMP3331/9331 XXXX Computer Networks and Applications Final Examination (SAMPLE SOLUTIONS)

Indian Institute of Technology, Kharagpur

CSMA/CD (Collision Detection)

Total /75 xxxxxxxxxx

ADVANCED COMPUTER NETWORKS

ECE 653: Computer Networks Mid Term Exam all

High Level View. EE 122: Ethernet and Random Access protocols. Medium Access Protocols

Communication Networks

Department of Electrical and Computer Systems Engineering

Network Layer Enhancements

Problem Set Name the 7 OSI layers and give the corresponding functionalities for each layer.

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

Chapter 12 Network Protocols

Example questions for the Final Exam, part A

Congestion Control 3/16/09

Computer Network Fundamentals Spring Week 3 MAC Layer Andreas Terzis

Internet protocol stack

CS118 Discussion 1A, Week 9. Zengwen Yuan Dodd Hall 78, Friday 10:00 11:50 a.m.

Final Exam. Course Grade

Midterm Review. Topics. Review: Network. Review: Network. Layers & Protocols. Review: Network WAN. Midterm Review EECS 122 EECS 122

Midterm Review EECS 122. University of California Berkeley

CS 344/444 Computer Network Fundamentals Final Exam Solutions Spring 2007

Congestion Control in Communication Networks

Internetworking Protocols and Software (COMP416)

Chapter 4. The Medium Access Control Sublayer. Points and Questions to Consider. Multiple Access Protocols. The Channel Allocation Problem.

CSC 401 Data and Computer Communications Networks

EE 122: Ethernet and

Direct Link Networks (II)

EECS 122. University of California Berkeley

EECS 122. University of California Berkeley. Network Architecture Network hierarchy Layering Performance. Link Layer Ethernet Wi-Fi

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

CS244a: An Introduction to Computer Networks

The Link Layer II: Ethernet

ETSF10 Internet Protocols Transport Layer Protocols

Transcription:

ECE544 Mid-Term Page ECE 544 Computer Networks II Mid-Term Exam March 29, 2002 Profs. & M. Ott Instructions: This is a 2 hr, OPEN BOOK exam. (Only the textbook, Peterson & Davie, Computer Networks, A Systems Approach and 2 pages of notes are permitted.) Answer Q (40 points) and ANY THREE from Q 2-6 (20 points for each question). If you answer more than 3, your grade will be determined as Q + the best 3 from Q2-6. In addition to the correct final answer, credit will be given for logical development of each problem using network architecture diagrams, protocol definitions, timing diagrams, flow charts, pseudo-code, etc. where appropriate. Please be sure to state your assumptions, give concise explanations (no essays!), organize your work logically, and write with legible handwriting. Question : Network Architecture: A company with offices in three locations wishes to establish an IP-based broadband services data network with the following requirements:. Geographic locations: Atlanta, GA; Princeton, NJ and Palo Alto, CA. 2. ~00 employees at each location, each with a networked PC; 25% of these users have an additional laptop computer with wireless access. 3. A file server and compute server at each site. 4. Primary applications for PC users: email, www, ftp, mbone, NetMeeting (an IP-based multiparty teleconference application). 5. Estimated traffic per active user is 00 Kbps average and ~ Mbps peak. Design an IP network that provides both local-area and wide-area connectivity for this company. Your answer should concentrate on Layer 2 & 3 functionality and must provide a complete view of components and protocols used. Use the following outline:. A high-level drawing of the whole network, identifying each major networking component (including Ethernet or wireless LAN, ARP servers, internal routers/ switches, DHCP servers, Internet backbone, etc.). [0 pts] 2. Specify the protocol stack(s) used at each network node in the system for (a) control, including addressing, routing, QoS management, etc.; and (b) for data transfer from application-to-application (for each application listed above) 3. Explain how end-users addresses (MAC address, IP address, etc.) are assigned, by what entities and using what protocols. 4. Each of the 3 locations can be considered an IP intra-domain. How is intradomain routing done, by what entities and using what protocols? 5. What protocol is used for inter-domain routing (i.e. from one site to another) over the public Internet? Identify the network elements which use interdomain routing, explain how it works, and draw the routing protocol stack at each such node.

ECE544 Mid-Term Page 2 6. Would you recommend any special features such as IP QoS or multicast for this network? If so, indicate what network elements are needed to support these features and show what changes are required in the protocol stacks drawn in item 2 above. 7. Estimate the link bandwidth required for each local site s connection to the Internet, based on the ~00 users with traffic profiles specified above. [Make suitable assumptions for local vs. external traffic flows.] Question 2. Shared Media LAN:. Explain the basic principle of Ethernet local area networks. Why is the length of an Ethernet segment limited to ~500m? What is the reason for exponential backoff after a collision occurs? Sketch the typical throughput vs. offered traffic curve for Ethernet. 2. Explain the basic principle of 802.b WLAN. Why is collision avoidance used instead of collision detection? How does the RTS/CTS procedure help avoid hidden terminal problems? 3. Consider the Ethernet LAN with three users as shown in the figure below. Shared Media (Ethernet) U Prop del = U2 Prop del = U3 T/2 T/2 In the above, assume that users U, U2 and U3 transmit packets of fixed length 0T, where T is the end-to-end propagation delay. Assume for simplicity that packet arrivals and transmissions at terminals occur at virtual slot boundaries t=0,t,2t,3t,4t, nt. Also, assume that the shortest Ethernet packet (after collision) is T sec, and that backoff algorithms delay by kt units of time, where k=,2,3... Now suppose U, U2 and U3 wish to transmit a new packet at times t=0, t2=0 and T3=5T respectively. Draw the sequence of transmissions and retransmissions on the channel from t=0 to the time when all three packets P, P2, P3 have been transmitted successfully (assuming no other traffic on the LAN). Provide explanations for each channel event. Use the following tabular format to give your results, and explain each entry with numbered footnotes. [0 pts] Time T activity or state T2 activity or state T3 activity or state 0 Packet arrives and is Packet arrives and is Idle transmitted transmitted T 2T 3T

ECE544 Mid-Term Page 3 Question 3. Network: Consider the network shown below. The terminal TA connects to a server SA to download a video-on-demand movie. The application program at the TA first retrieves a program guide via TCP/AAL5 over a UBR VC, and then after the TA selects a movie, the SA sends an MPEG2 movie via UDP/AAL5 using a VBR VC.. Show the sequence of signaling events at each node in the network necessary to set up the path for (a) the program guide query, and (b) video delivery. Present your results in the form of a protocol timing diagram at each node, using the format shown in the figure. 2. Fill in the corresponding VPI/VCI forwarding table entries at each adapter and switch in the end-to-end connection. Use port numbers as indicated in the figure and assign VCI numbers arbitrarily in the range 28-256; set VPI=0. 3. Show how the AAL segments the first TCP query message into the cell format used for data transfer. [5pts] 4. Explain how quality-of-service (QoS) is set up for the video connection. Describe applicable traffic shaping, call admission control and scheduling functions. Port 2 Port 4 5 3 TA Port 2 4 SA Adaptor (TA) Port 3 Switch A 3 Switch B 2 Switch C Adaptor (SA) Format of VCI/VPI forwarding table at each switch: Input Port # VPI/VCI Output Port # VPI/VCI 2 0.37 4 0.2....

ECE544 Mid-Term Page 4 Question 4. Intra-Domain IP Routing:. Explain the basic principle of distance-vector (DV) routing using the network example given below. Describe the RIP packet format and explain how it is used to implement a DV routing protocol. [4 pts] R 2 4 5 R2 R3 R4 R5 2. For the network given above, give global distance vector tables (as in Table 4.5, Pg. 285 of Peterson and Davie, 2 nd ed) for each of the following: a. Each node knows only the distance to its immediate neighbors b. Each node has reported the information it had in its preceding step to its immediate neighbors c. Step (b) is repeated. [6 pts] 3. Explain the principle of link-state routing using the network example in Fig 4.. Describe the OSPF routing protocol and explain how it is used to implement a link-state routing protocol. [4 pts] 4. Give the steps in the forward search routing algorithm (as in Table 4.9, Pg. 297, Peterson & Davie, 2 nd ed) from initialization to completion for the network given above. [6 pts] Question 5. Quality-of-Service:. What are the four mechanisms used to provide quality-of-service in IP networks? Explain each how each of these mechanisms helps to guarantee QoS. Label the network given below to show where each of these QoS mechanisms applies. Discuss how end-toend QoS is ensured referring to the example network. [8 pts] CPE-Access Network Interface Access-Core Network i/f Access-Core Network i/f CPE-Access Network Interface Sender Router Router 2 Router 3 Router 4 Receiver Core Internet

ECE544 Mid-Term Page 5 2. Suppose a router has three input flows and one output. It receives the packets listed in the table below all at about the same time in the order listed during a period in which the output port is busy but all queues are otherwise empty. Give the order in which packets are transmitted, assuming: a. fair queuing [3pts] b. weighted fair queuing with flow #2 having weight 2, and flows #,3 with weight. [3pts] Packet Size Flow 00 2 00 3 00 4 00 5 90 2 6 200 2 7 0 3 8 50 3 3. Suppose a router has accepted flows with TSpecs as shown below, described in terms of bucket filters with token rate r packets per sec and bucket depth B packets. All flows are in the same direction, and the router can forward one packet every 0. sec. a. What is the maximum delay a packet can face? [3 pts] b. What is the maximum number of packets from the third flow that the router would send over 2.0 sec, assuming the flow sent packets at its maximum rate uniformly? [3 pts] TSpec table: Question 6. TCP: Flow # r B 37 0 206 2 4 42 4. Explain the role of a reliable end-to-end transport layer protocol like TCP. List and explain each of the services provided by TCP. Illustrate with traffic traces or protocol timing diagrams where appropriate. [0 pts] 2. Suppose a TCP connection has a window size of 8 segments, an RTT of 800 ms, a periodic sending rate of one segment every 00 ms, and the receiver sends back ACKs at the same rate with no delay. A segment is lost, and the loss is detected by the fast retransmit algorithm on receipt of the third duplicate ACK. At the point when the ACK of the retransmitted segment finally arrives, how much time has the sender lost compared to lossless transmission if: (a) the sender waits for the ACK from the retransmitted lost packet before sliding the window forward again (b) the sender uses the continued arrival of each duplicate ACK as an indication it may slide the window forward one segment. [0 pts]