0% found this document useful (0 votes)
114 views

Netwoking Assignment

The document is a student assignment submission for a computer networking course. It contains 10 questions related to computer networking topics like CRC checksums, TDM bandwidth calculations, digitization of audio, error rates in ATM networks, and stop-and-wait ARQ protocol timing. For each question, the student provides an answer explaining the relevant concepts and showing work. The summary provides high-level responses to assessment questions without replicating the full content.

Uploaded by

Biplob
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
114 views

Netwoking Assignment

The document is a student assignment submission for a computer networking course. It contains 10 questions related to computer networking topics like CRC checksums, TDM bandwidth calculations, digitization of audio, error rates in ATM networks, and stop-and-wait ARQ protocol timing. For each question, the student provides an answer explaining the relevant concepts and showing work. The summary provides high-level responses to assessment questions without replicating the full content.

Uploaded by

Biplob
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 6

Government College of Engg.

& Textile
Technology, Serampore, Hooghly, West Bengal
Department of Information Technology

Assignment/gcetts/IT/IT-602
Topic:- Computer Networking

Submitted by
Biplob Banik
It,3rd year, 6th Semester, 2020
University Roll No: 11000217043
1. Applying CRC algorithm, determine the checksum and the
transmitted frame for the frame 11010111 and for the generator
polynomial x3 +x2+1.
Ans:- Generator Polynomial
 X3+x2+1
= 1.x3+1.x2+0.x1+1.x0
= 1 1 0 1

Message signal M(x)


 11010111
= 11010111000 (Adding extra 3 bit '0’ because Generator is of 3 bit)

Transmitted data:-

1101 11010111000 10000101


000001110
1101
001100
1101
01 Remainder
Transmitted frame:-
 11010111000
+ 001
11010111001

Now we check:-

1101 11010111001 10000101


000001110
1101
001101
1101
00
The remainder is '00’ that mean there is no error.
2. Suppose 3 signals each with a bandwidth of 4 khz are
transmitted under TDM with a frame guard band of 1 khz. What
is the minimum bandwidth of the path required for the purpose?
Ans:-
No of signals = 3
Bandwidth = 4 kHz
Guard band = 1kHz
As there are 3 signals, so we need 2 guard band
 Minimum Bandwidth Required:-
= 3 * 4 + 2 kHz
= 14 kHz

3. We want to digitize human voice(frequencies ranging from 0 to


4 khz). What is the bit rate assuming 8 bits per sample?
Ans:- The Human voice normally contains frequencies from 0 to 4000hz. So
the sampling rate and bit rate are calculated as follows:
Sampling rate= 4000*2= 8000 samples/s
Bit rate= 8000*8= 64000 bps = 64 kbps.

4. Calculate the probability of single bit error in a message of size


m where the probability of a bit in error is P.
Ans:-
Probability of bit error : 0 < P < 1
We have 1 bit in frame
Now let,
P1 = Probability frame arrives with no bit errors.
P2 = Probability frame arrives with one or more undetected errors.
P3 = Probability frame arrives with one or more detected errors and no
undetected errors.
Suppose we have no error detection so that is P3=0.
Then we can write –
P1 = (1 - P)^m
P2 = 1 – (1 – P)^m
5. If the received string is 110110111011 then calculate the actual
data string. The data is encoded by 1 bit error correcting
code(Hamming code).
Ans:- The received bit stream is 110110111011 (Hamming code with even
parity(Let))

Now, The syntax of Hamming code implies-


D8 D7 D6 D5 P4 D4 D3 D2 P3 D1 P2 P1
1 1 0 1 1 01 1 1 0 1 1

Therefore, Parity bits are P1=1, P2=1, P3=1, P4=1.


Received data will be (11010110)
Now, for error correction,

 for parity P1 error bit E1 –


P1 D1 D2 D4 D5 D7
1 0 1 0 1 1- even(no error-E1=0)

 for parity P2 error bit E2 –


P2 D1 D3 D4 D6 D7
1 0 1 0 0 1- odd(error-E2=1)

 for parity P3 error bit E3 –


P3 D2 D3 D4 D8
1 1 1 0 1- even( no error-E3=0)

 for parity P4 error bit E4 –


P4 D5 D6 D7 D8
1 1 0 1 1- even (no error-E4=0)
Therefore,
The error location –E4 E3 E2 E1
1 0 1 0 =2
So, the actual data string is (110110111001).

6. For 10 devices in a network, what is the number of cable links


needed for a mesh, ring and star topologies?
Ans:- For 10 devices in a network,
 The number of cable links needed for a mesh= n(n-1) / 2 = 10(10-
1) / 2 = 45
 The number of cable links needed for a ring = 10
 The number of cable links needed for star topologies = 10

7. Identify the class of the IP address: 200.58.20.165;


128.167.23.20; 16.196.128.50; 150.156.10.10.
Ans:-
a. 200.58.20.165
 11001000.00111010.00010100.10100101
This IP address belongs to Class C

b. 128.167.23.20
 10000000.10100111.00010111.00010100
This IP address belongs to Class B

c. 16.196.128.50
 00010000.11000100.10000000.00110010
This IP address belongs to Class A

d. 150.156.10.10
 10010110.10010110.00000010.00000010
This IP address belongs to Class B

8. In a leaky bucket used to control liquid flow, how many gallon


of liquid are left in the bucket if the output rate is 6 gal/min,
there is an input burst of 100 gal/min for 11s, and there is no
input for 49s?
Ans:-The input is 100 gal/min, will be 100/60 = 1.667 gal/sec. and 1.667*11
= 18.337 in 11 sec.
Total output in (11+49) sec = 1 min = 6 gallon
So, liquid left after 1 minute = (18.337-6) = 12.337 gallon

9. An ATM network has lost 5 cells out of 12,000 and 3 are in


error. What is the CLR? What is the CER?
Ans:- CLR (Cell Loss Ratio)= Lost Cell/Total no. of Cell
=5/12000=1/2400
CER (Cell Error Ratio)= Error Cell/Total no. of all
=3/12000=1/4000

10. A system uses the stop-and-wait ARG protocol. If each packet


carries 1000 bits of data, how long does it takes to send 1 million
bits of data if the distance between the sender and receiver is 5000
km and the propagation speed is 2*108m? Ignore transmission,
waiting and processing delays? We assume no data or control
frame is lost or damaged.
Ans:- Packet size= 103 bits
Total data to be transmitted = 106 bits
Number of packets to be transmitted= 106/103 =1000
Propagation delay for one packet= Distance/Propagation speed= (5*106)/
(2*108) = 0.025 s
Propagation delay for one ACK= Distance/Propagation speed= (5*106) /
(2*108) = 0.025 s
Here, transmission delay is 0.
So, Total time to transmit one packet and receive its ACK= 2*0.025= 0.05 s

You might also like