Scribd
Upload
39 views3 pages

Computer Networks I: Final Exam - Part 2

This document contains a final exam for a computer networks course. It includes 15 true/false questions about networking topics and 3 problems related to efficiency, channel capacity, and analyzing a file transfer using stop-and-wait flow control over two LANs.

Uploaded by

ikejimenes
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
39 views3 pages

Computer Networks I: Final Exam - Part 2

This document contains a final exam for a computer networks course. It includes 15 true/false questions about networking topics and 3 problems related to efficiency, channel capacity, and analyzing a file transfer using stop-and-wait flow control over two LANs.

Uploaded by

ikejimenes
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 3

NAME: ____________________________________

Computer Networks I
FINAL EXAM – PART 2

INSTRUCTIONS:
Write down your name as soon as you receive the questionnaire.
Calculators allowed
Time allowed: 1 hour and 30 minutes

Questions: True or False (3 points)


Fill the box corresponding to each one of the following fifteen questions by: T = correct F = wrong.
Right answer: + 0,2 points Wrong answer: -0,1 No answer: 0 points.

1 F 2 F 3 T 4 F 5 F
6 T 7 T 8 T 9 T 10 F
11 F 12 T 13 T 14 T 15 T

1. In digital communications, we use repeaters to amplify the signal.


2. The data link layer provides flow control, error control, access control and routing mechanisms
3. The physical layer takes bits from the upper layer and generates signals.
4. Optical fiber links operate at lower bit rates than coax cable links.
5. In analog communications, we used repeaters to regenerate the signal.
6. In a wireless network, the directional antennas of the sender and receiver must be aligned.
7. In a token ring, when a station has some data to transmit, it should wait until receives the token, then
holds the token and sends its data.
8. In Aloha each station sends a frame whenever it has a frame to send.
9. When using the CSMA/CD protocol, a station monitors the status of the channel whilst transmitting.
10. The Simplest Protocol and the Stop-and-Wait Protocol have been designed for noisy channels
11. In Aloha, each station is forced to send only at the beginning of a time slot.
12. The implementation of sliding window protocols requires the use of buffers to temporally store the
frames to be acknowledged.
13. In the Stop-and-Wait Protocol, the sender sends one frame, stops until it receives confirmation from
the receiver, and then sends the next frame.
14. When using a sliding window protocol, we will obtain a higher efficiency by increasing the window
size.
15. In the protocol architecture of the IEEE 802.11 Standard, the point coordination function (PCF) is
implemented on top of the Distributed Coordination Function (DCF).
PROBLEM 1 Efficiency (1,5 points)
1. Consider a 10 Mbps channel with a propagation delay of 240 x 10-6 s, and data frames of 1000
Bytes. Determine the efficiency for each of the following flow control protocols:
a) Stop-and-wait protocol.
b) A window protocol with a window size of 127 frames.

a) Efficiency S&W = 1/(1 + 2) where  = tprop/tframe

b) Efficiency WIN = N/(1 + 2) where N = 127

PROBLEM 2 Nyquist and Shannon formulas (1,5 points)


a) Determine the channel capacity expressed in bits per second for a 1200 MHz channel whose
SNR ratio is 20 dB.
b) Determine the bit rate for a noiseless 1200 MHZ channel given that each signaling symbol
corresponds to 8 bits.

a) C = W log2(1 + SNR) where W = 1200

SNRdb = 10 log(SNR)

b) C = 2Wlog2(L)
PROBLEM 3 Flow Control (4 points)

Figure 1. Network

1220 Bytes
Header DATA

20 1200
Figure 2. Data Frame

For this problem, you should refer to Figure 1 and Figure 2.


Assume that Station PC2 in LAN 1 sends a file of 12 x 106 Bytes to Station PC5 in LAN2 making use of
a Stop-and-Wait protocol. The characteristics of the network are as follows:
 LAN1 is a 10BaseT Ethernet whose cable length is 500 m.
 Station PC2 and Hub H1 are placed at the opposite extremes of LAN1. That is to say, the distance
between PC2 and H1 is 500 m.
 LAN2 is a token-ring network operating at 16 Mbps. The cable length of this LAN is 400 m and it
includes three repeaters; each one introduces a 2-bit delay. The transmission takes place clockwise.
 Stations PC4, PC5 and PC6 and hub H1 are placed at equidistant distances from each other.
 All networks use a frame length of 1220 Bytes including a header of 20 Bytes.
 The size of the ACK frame is fixed to 100 Bytes.
 The hub interconnecting both networks introduces a delay of 2 x 10-6 s.
 The signal propagates at a speed of 2 x 108 m/s.

Assuming that no other stations transmit during the file transfer operation from PC2 to PC5 and that the
token is available to the hub H1 and station PC5 as soon as they are ready to transmit a frame:
1. Sketch the timing diagram depicting the transmission of a data frame and its corresponding ACK
frame.
2. Given the frame size being used, determine the total number of frames to be sent.
3. Determine the data frame transmission time over each LAN.
4. Determine the ACK frame transmission time over each LAN
5. Determine the delay in seconds introduced by each repeater.
6. Determine the total propagation time experienced by a data frame, over each LAN.
7. Determine the total propagation time experienced by the ACK frames over each LAN.
8. Determine the total time to deliver a data from PC2 to PC5.
9. Determine the total time to deliver an ACK frame from PC5 to PC2.
10. Calculate the total time required to transfer the whole file.

You might also like