Total /75 xxxxxxxxxx

Similar documents
Multiple Access Links and Protocols

Lesson 2-3: The IEEE x MAC Layer

CHAPTER 8: LAN Standards

Medium Access Control. MAC protocols: design goals, challenges, contention-based and contention-free protocols

Solutions to Exercise Session 4,

Mohamed Khedr.

Data and Computer Communications. Chapter 13 Wireless LANs

Chapter 6 Medium Access Control Protocols and Local Area Networks

Chapter 6 Wireless and Mobile Networks. Csci 4211 David H.C. Du

Local Area Networks NETW 901

Getting Connected (Chapter 2 Part 4) Networking CS 3470, Section 1 Sarah Diesburg

Data Communications. Data Link Layer Protocols Wireless LANs

Wireless and Mobile Networks

CMPE 257: Wireless and Mobile Networking

Lecture 16: QoS and "

CSE 461: Wireless Networks

The Link Layer II: Ethernet

Topics for Today. More on Ethernet. Wireless LANs Readings. Topology and Wiring Switched Ethernet Fast Ethernet Gigabit Ethernet. 4.3 to 4.

Wireless Network and Mobility

4.3 IEEE Physical Layer IEEE IEEE b IEEE a IEEE g IEEE n IEEE 802.

MSIT 413: Wireless Technologies Week 8

Wireless Networked Systems

WiFi Networks: IEEE b Wireless LANs. Carey Williamson Department of Computer Science University of Calgary Winter 2018

MAC. Fall Data Communications II 1

IEEE , Token Rings. 10/11/06 CS/ECE UIUC, Fall

Unit 7 Media Access Control (MAC)

Last Lecture: Data Link Layer

Wireless Protocols. Training materials for wireless trainers

ICE 1332/0715 Mobile Computing (Summer, 2008)

standard. Acknowledgement: Slides borrowed from Richard Y. Yale

Wireless Local Area Networks (WLANs)) and Wireless Sensor Networks (WSNs) Computer Networks: Wireless Networks 1

Wireless Local Area Networks (WLANs) Part I

CSCD 433 Network Programming Fall Lecture 7 Ethernet and Wireless

Computer Networks. Wireless LANs

CSC344 Wireless and Mobile Computing. Department of Computer Science COMSATS Institute of Information Technology

MAC in /20/06

Wireless Local Area Networks. Networks: Wireless LANs 1

Department of Electrical and Computer Systems Engineering

Mohammad Hossein Manshaei 1393

Logical Link Control (LLC) Medium Access Control (MAC)

CS 348: Computer Networks. - WiFi (contd.); 16 th Aug Instructor: Sridhar Iyer IIT Bombay

Advanced Computer Networks WLAN

CS263: Wireless Communications and Sensor Networks

Rahman 1. Application

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

Medium Access Control. IEEE , Token Rings. CSMA/CD in WLANs? Ethernet MAC Algorithm. MACA Solution for Hidden Terminal Problem

Wireless LAN -Architecture

IEEE MAC Sublayer (Based on IEEE )

Introduction to IEEE

04/11/2011. Wireless LANs. CSE 3213 Fall November Overview

ECEN 5032 Data Networks Medium Access Control Sublayer

Wireless LANs. ITS 413 Internet Technologies and Applications

IEEE Medium Access Control. Medium Access Control

Announcements: Assignment 4 due now Lab 4 due next Tuesday Assignment 5 posted, due next Thursday

Mobile & Wireless Networking. Lecture 7: Wireless LAN

Outline: Connecting Many Computers

IEEE Wireless LANs Part I: Basics

CSMC 417. Computer Networks Prof. Ashok K Agrawala Ashok Agrawala. Fall 2018 CMSC417 Set 1 1

Computer Communication III

Wireless Communication and Networking CMPT 371

WLAN Performance Aspects

15-441: Computer Networking. Wireless Networking

Wireless Communication and Networking CMPT 371

IEEE Technical Tutorial. Introduction. IEEE Architecture

Overview. Wireless networks basics IEEE (Wi-Fi) a/b/g/n ad Hoc MAC protocols ad Hoc routing DSR AODV

Wireless Communications

Telecommunication Protocols Laboratory Course. Lecture 2

SENSOR-MAC CASE STUDY

Medium Access Control Sublayer

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

Wireless Networks (MAC)

Topic 2b Wireless MAC. Chapter 7. Wireless and Mobile Networks. Computer Networking: A Top Down Approach

ECE 653: Computer Networks Mid Term Exam all

CSE 6811 Ashikur Rahman

Nomadic Communications WLAN MAC Fundamentals

Final Exam for ECE374 05/03/12 Solution!!

original standard a transmission at 5 GHz bit rate 54 Mbit/s b support for 5.5 and 11 Mbit/s e QoS

Wireless Challenges : Computer Networking. Overview. Routing to Mobile Nodes. Lecture 25: Wireless Networking

IEEE WLAN (802.11) Copyright. Nomadic Communications

ECE442 Communications Lecture 3. Wireless Local Area Networks

EE 122: Ethernet and

WLAN (802.11) Nomadic Communications. Renato Lo Cigno - Tel: Dipartimento di Ingegneria e Scienza dell Informazione

WLAN Technology: LAN: a review WLAN: applications & key parameters. protocol architectures

Multiple Access in Cellular and Systems

Mobile Communications Chapter 7: Wireless LANs

Analysis of Throughput and Energy Efficiency in the IEEE Wireless Local Area Networks using Constant backoff Window Algorithm

MULTIPLE ACCESS PROTOCOLS 2. 1

An energy-efficient MAC protocol for infrastructure WLAN based on modified PCF/ DCF access schemes using a bidirectional data packet exchange

IEEE Wireless LANs

CMPE 150/L : Introduction to Computer Networks. Chen Qian Computer Engineering UCSC Baskin Engineering Lecture 16

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

Page 1. Outline : Wireless Networks Lecture 11: MAC. Standardization of Wireless Networks. History. Frequency Bands

Appendix A Pseudocode of the wlan_mac Process Model in OPNET

Wireless Networks (MAC) Kate Ching-Ju Lin ( 林靖茹 ) Academia Sinica

Lecture (08) Wireless Traffic Flow and AP Discovery

The Link Layer and LANs. Chapter 6: Link layer and LANs

CMPE 257: Wireless and Mobile Networking

6th Slide Set Computer Networks

Wireless Networks. CSE 3461: Introduction to Computer Networking Reading: , Kurose and Ross

Delivering Voice over IEEE WLAN Networks

Transcription:

ECE 358 Midterm Exam, F 2014 Dept. of Electrical and Computer Engineering ECE 358 Computer Networks Instructor: Sagar Naik Exam. Date and Time: Oct. 20, 2014, 1:30 PM 2:45 PM Rooms: EIT 1015 and RCH 307 Instructions You have 75 minutes to complete the exam. This is a closed book exam. Should there be a need, make reasonable assumptions and proceed. Mega means 10 6 and kilo means 10 3. You may use a basic calculator. All acronyms have their standard expansions as explained in class. UW ID Your Name (Last, First) Signature Questions Marks Marked by Q1 /18 Q2 /16 Q3 /21 Q4 /20 Total /75 xxxxxxxxxx Total number of pages: 11

ECE 358 Midterm Exam Page 2 of 11 Q1. [18] (Introduction) a) What is a communication protocol? A communication protocol is a set of rules for transferring data from one communicating entity (e.g. computer/router/access point/ ) to another. A protocol defines message formats, sequences of messages to be transmitted and received, and actions to be taken upon sending/receiving messages. b) Explain the concept of store and forward in packet switching networks. When a router starts receiving bits from another router, it waits until the complete IP packet is received. If the IP packet is received without errors, it is stored in a local buffer. Next, the router determines the next-hop for the packet and forwards the packet to the corresponding 1-hop router. c) Explain the concept of statistical multiplexing and its advantage(s). Statistical multiplexing is a technique for sharing the bandwidth of communication links among many computers. In this technique, bandwidth is allocated to individual computers on a demand basis, instead of making static allocations. The advantages are: (i) the technique s implementation is simpler than other multiplexing techniques (TDM/FDM); (ii) more number of users can be supported than what FDM/TDM would yield; and (iii) bandwidth is not wasted if there is an imbalance in demand from all the connected users. d) What are three performance characteristics of a network link? Speed (say, in Mbps), link delay (say, in milliseconds), and BER are three important performance characteristics of a network link. e) Give two reasons for routers dropping IP packets. Routers drop packets if: (i) a received packet has bit errors; or (ii) if there is no space in its input/output buffers.

ECE 358 Midterm Exam Page 3 of 11 f) Explain the concept of bottleneck bandwidth by means of an example. Two computers A and B have been interconnected with three routers (R1 R3) and four links (L1 L4). L2 has the minimum bandwidth among all the links between A and B, and this puts a limit on the data rate between A and B. Therefore, the end-to-end data transfer between A and B is at most 1 Mbps. T g) What is message encapsulation in a protocol stack? Explain its advantages and disadvantage. In the Internet protocol stack, when Layer-N receives a message M from Layer-(N+1), it (Layer-N) creates a new message M = <Header, M> and gives it to Layer-(N-1). The message M is said to have been encapsulated within M. Adv.: Protocols can be designed in a layered manner. Disadv.: Encapsulation through a stack of protocols successively increase the length of the message to be eventually transmitted. In other words, encapsulation is done at the expense of increasing the length of messages. h) Why are network protocols organized in a layered fashion on hosts and routers? Layering supports independent design of different protocols. Therefore, if one protocol layer is modified, a faraway layer is not affected by the modifications. i) Show the differences between the ISO/OSI protocol stack and the Internet protocol stack. Refer to the lecture notes. The Internet protocol stack does not have a separate Presentation Layer and a separate Session Layer. If needed, those functionalities are implemented in the application layer.

ECE 358 Midterm Exam Page 4 of 11 Q2. [16] (Link Layer) a) Identify four services provided by the link layer protocols on the Internet. The services provided by Link Layer protocols are: medium (link) access, error detection and correction, addressing, and flow control. b) What are the three broad classes of MAC protocols? The three broad classes of MAC protocols are: channel partitioning, random access, and taking-turns. c) Explain the concept of Binary Exponential Backoff and its purpose in CSMA/CD. Let i be the retransmit count and Tp be the propagation delay. Then, the wait period in the BEB box of CSMA/CD is computed as W = Tp x Random(0, 2 i -1). Statistically, the wait period is exponentially increased as (re)transmissions continue to fail. The purpose of BEB is to dynamically adapt the wait period to the traffic intensity (or, the number of transmitting users) in order reduce the collision rate. d) Why is there no concept of acknowledgment (ACK) in the CSMA/CD protocol? The CSMA/CD protocol is run over copper or fiber physical media which have very low BER values (10-8 or 10-12 ). On the other hand, the CSMA/CA protocol is run over free-space with a BER value of 10-5, which is considered to be very high. To reduce retransmissions in upper-layer protocols, an ACK mechanism is built into the CSMA/CA protocol. However, the BER offered by copper or fiber is very low; hence, there is no ACK mechanism in CSMA/CD and the upper-layer protocols are asked to retransmit occasionally. e) What is an ARP table? Why does a host computer need an ARP table? ARP stands for Address Resolution Protocol. An ARP table has entries of the form: <IP address, MAC address, TTL>. Given an IP address of a 1-hop neighbor (host or router), the ARP protocol finds out the MAC address of the neighbor so that the neighbor can be reached with a 1-hop transmission of a frame. A host computer needs an ARP table because it must be able to transmit frames to its first-hop router without flooding its frames on the broadcast link. The TTL (Time To Live) value of an entry specifies the time duration for which the mapping between an IP address and a MAC address is valid.

ECE 358 Midterm Exam Page 5 of 11 f) What kinds of communication errors can a completely reliable data transfer protocol withstand? - Bit errors - Packet loss - Duplication of packets - Reordering of packets g) What is a MAC table? What networking entities create and manage MAC tables? A MAC table comprises of entries of the form: <MAC address, port#, TTL>. The TTL value specifies the time duration for which the mapping between a MAC address and a port# is valid. Link layer switches create and manage MAC tables so MAC tables exist on link layer switches. An entry of the form <X, n1, t> in the MAC table means a device (host/router) with MAC address X is reachable via port# n1 of the switch, and this mapping is valid for t units of time. h) How does an AP (access point) switch the modes of its WLAN between PCF and DCF? Put the WLAN in PCF mode: When an AP finds the medium to be idle for PIFS interval, it broadcasts a Beacon frame containing a time duration value in its CFPMaxDuration field. Upon receiving the Beacon frame, all nodes set their NAV to CFPMaxDuration and wait for control/data frame from the AP. Now the WLAN is operating in the PCF mode. Put the WLAN in the DCF mode: Upon the expiry of the previously announced CFPMaxDuration period in a Beacon frame, the AP broadcasts a CF End frame. When nodes receive a CF End frame, they reset their NAV to 0, thereby entering into the DCF mode of operation.

ECE 358 Midterm Exam Page 6 of 11 Q3. [21] (Link Layer) A BSS (Basic Service Set) has only two nodes as shown in the figure below: an AP and one laptop with a WiFi interface with a physical-layer transmission rate of 1 Mbps. Assume that the laptop is transmitting DATA frames containing 118 bytes of IP layer data. The lengths of RTS, CTS, and ACK frames are 20, 14, and 14 bytes, respectively. The total length of all the control information in the header of a DATA frame is 34 bytes. Assume that the lengths of SIFS and aslot intervals are 20 µs and 10 µs, respectively. a) [2] Calculate the value of the DIFS interval? DIFS = SIFS + aslot + aslot = (20 + 10 + 10) µs = 40 µs. b) [3] What is the value of the duration field in the CTS frames transmitted by the laptop? (It should have been AP instead of laptop. All assumptions will be accepted.) Duration = Time to transmit (one DATA + one ACK) + 2*SIFS = Time to transmit ( 152 (=34 + 118) bytes + 14 bytes) + 2*20 µs = Time to transmit 166 bytes + 40 µs = Time to transmit 1328 bits + 40 µs = 1328 µs + 40 µs = 1368 µs c) [12] What is the maximum long-term data rate available to the IP layer, if the laptop is operating in the handshake mode of DCF? Show the details of your calculations. As shown in the left-hand figure (DCF mode with handshake) below, duration in CTS = 1368 µs, as calculated before. The cycle time for repetitive transmission by the laptop, denoted by Tc, is as follows: Tc = DIFS + Time to transmit (one RTS frame + one CTS frame) + one SIFS + duration in CTS = DIFS + Time to transmit (20 x 8 bits + 14 x 8 bits) + 20 µs + 1368 µs = 40 µs + 272 µs + 20 µs + 1368 µs = 1700 µs In 1700 µs, the IP layer can send 118x8 bits of data. In 1 second, the IP layer can send 118 x 8/1700 Mbits of data = 555294 bits.

ECE 358 Midterm Exam Page 7 of 11 Max data rate of the IP layer = 555 Kbps (approximately) Additional space for all calculations needed for Q3. d) [4] What is the maximum long-term data rate available to the IP layer, if the laptop is operating in the without-handshake mode of DCF? Show the details of your calculations. As shown in the right-hand (DCF mode without handshake) below, the cycle time for repetitive transmission by the laptop, denoted by Tc, is as follows: Tc = DIFS + Time to transmit (one DATA + one ACK) + one SIFS = DIFS + Time to transmit (152 x 8 bits + 14 x 8 bits) + one SIFS = DIFS + Time to transmit (1328 bits) + one SIFS = 40 µs + 1328 µs + 20 µs = 1388 µs In 1388 µs, the IP layer can send 118x8 bits of data. In 1 second, the IP layer can send 118 x 8/1388 Mbits of data = 680115 bits. Max data rate of the IP layer = 680 Kbps (approximately)

ECE 358 Midterm Exam Page 8 of 11 Q4. [20] (Link Layer) In the above figure, the Link Layers use the rdt 3.0 protocol to communicate. For simplicity, assume that node A is the sender and B the receiver. The formats of the DATA and ACK frames have been shown below. Bit errors are detected by means of CRC. a) [5] Show the receiver s behavior in the form of a finite-state machine. You may use the following template. The level of details considered in class is good enough.

ECE 358 Midterm Exam Page 9 of 11 b) [15] Assume that the sender and the receiver use the generator pattern 10011 to compute CRC bits. Note that CRC bits are computed from <Seq. #, Frame Type, User Data> -- and NOT just User Data -- because you want to know if the header as well is corrupted. The receiver receives a frame given by the bit pattern 011010110111110 in the Wait for 0 from below state. Now answer the following questions. Did the receiver detect bit errors? Do the actual calculations on the following pages. Provide and justify your answer in the box given below. The result of dividing 011010110111110 by the generator 10011 produces 0000 remainder. Therefore, the receiver does not detect bit errors. If the receiver delivers data to the IP layer, what data is delivered to the IP layer? Provide and justify your answer in the box given below. Parse the frame 011010110111110 according to the format <Seq. #, Frame Type, User Data>. Since the receiver did not detect bit errors, the error-free data is 101011011, which is delivered to the IP layer. If the receiver sends a frame back to the sender, what bit pattern represents the frame? Provide and justify your answer in the box given below. Do all your calculations on the following pages. The receiver sends back an ACK frame with sequence number 0 and the corresponding CRC bits: <0, 0, CRC>. Essentially, generate four bits of CRC for 00, and the result is 0000. Therefore, the complete frame is 000000.

ECE 358 Midterm Exam Page 10 of 11 Space for all calculations needed for 4(b) Find the CRC bits by dividing the received frame (11010110111110) by the generator pattern 10011. 11010110111110 10011,,.,,... -----,,.,,... 10011,.,,... 10011,.,,... -----,.,,... 00001.,,... 00000.,,... -----.,,... 00010,,... 00000,,... -----,,... 00101,... 00000,... -----,... 01011... 00000... -----... 10111... 10011... -----... 01001.. 00000.. -----.. 10011. 10011. -----. 00000 00000 ----- 0000 = Remainder As an alternative to the procedure executed above, set the CRC bits in the received frame to all zeros, compute the new CRC bits, and evaluate if the computed CRC bits are equal to the CRC bits received in the frame. Both the approaches are acceptable.

ECE 358 Midterm Exam Page 11 of 11 Space for all calculations needed for 4(b) Divide 000000 by 10011. Since no bit in 000000 is a 1, the input pattern will never be XORed with the divisor (10011). Therefore, the remainder will be 0000.