TELE 3118 Tutorial 2 (weeks 4 and 5)

Framing, error control, layers & MAC

Q1: Framing The High-Level Data Link Control (HDLC) protocol uses the byte with binary representation 01111110 to flag the beginning and end of a frame. It uses bit stuffing to prevent strings of more than 5 1s occurring within the frame payload, and so also prevent confusion about apparent flag bytes within the frame payload. What bit sequence would be physically output by a source using HDLC framing if it were to transmit the following two frames: Frame 1: 0011001100110000 Frame 2: 0001111110110000 Q2: Protocol stacks Consider the Internet protocol stack consisting of Physical, Link, Network, Transport and Application layers, and a client application (e.g. web browser) that sends a request to a server. If the path from client to server passes through an Ethernet switch and then a router, then list the names of the protocol stack layers that the request would pass through, in order of passage, at client, switch, router and server. Q3: Ethernet Suppose nodes A and B are on the same 10 Mbps Ethernet segment, and the propagation delay between the two nodes is 225 bit times. Suppose node A begins transmitting a frame and, before it finishes, node B begins transmitting a frame. Can A finish transmitting before it detects that B has transmitted? Why or why not? If the answer is yes, then A incorrectly believes that its frame was successfully transmitted without a collision. Use 512 + 64 bits as the minimum frame size. [Kurose Ross problem 5.P15] Q4: Wireless MAC Five stations, A through E, are arranged in a line, with each station only within communication range of its immediate neighbours. If these stations are using the CSMA/CA protocol and two transmissions are to take place simultaneously, then between which stations (name both the source and destination) can these transmissions occur? Explain your answer. [Based on Tanenbaum Problem 4.11] Q5: Error Control You are designing an error control strategy for sending 4-bit messages. (a) What is the minimum number of redundant bits required for the receiver to be able to detect all 1-bit errors? Describe how the redundant bits are generated. (b) What is the minimum number of redundant bits required for the receiver to be able to correct all 1-bit errors? Show how you determine this. (c) What is the minimum number of redundant bits required for the receiver to be able to correct all errors of up to 2 bits? Show how you determine this.