Tutorial Sheet 3 (Computer Networks)

Tutorial Sheet #03 (Computer Networks)
T1: Sixteen-bit messages are transmitted usinga Hamming code. How many check bits are needed
to ensure that the receiver can detcct and correct single-bit errors? Show the bit pattern
transmitted
for the message I101001100110101. Assume that even parity is used in the Hamming code
T2: A 12-bit Hanmming code whose hexadecimal value is OxE4F arrives at a receiver. What was
the original value in hexadecimal? Assume that not more than 1bit is in error.
T3: A seven-bit Hamming code is received as l111101. What is the correct code using even
parity
code.
T4: Find the Checksum value of 1001001l110010011 and 1001100001001101 using l6 bit
segment.
T5: The sender side sends the number 7,11,12,0,6. Find the checksumn number using 4 bit
arithmeticand also verify the answer at receiver side using calculated checksum. It is assumed that
there is no error.
T6: The sender side sends the mumber 8, 10, 5,3. Find the checksum number using 4bit arithmetic
and also check the answer at receiver side using calculated checksum. It is assumed that there is
no erTOr.
T7: A sender needs to send the four data items Ox3456, OxABCC, Ox02BC, and OxEEEE.
a. Find the checksum at the sender site.
b. Find the checksum at the receiver site if there is no error.
c. Find the checksum at the receiver site if the second data item is changed to OxABCE.
T8: Given the dataword 1010011110and the divisor 10111, using CRC:
a. Show the generation of the codeword at the sender site (using binary division).
b. Show the checking of the codeword at the receiver site (assume no error).
T9: In stop and wait protocol sth packet is lost and we need to send total 16 packets, how many
transmissions it took to send all the packets?
T10: Station Aneeds to send a mesage consisting of 9 packets to Station Busing a siding windovw
(window size = 3) and G-back-N error control strategy. All packets are ready and immediately available
for transmission. if every Sth packet that Atransmits gets lost (but no acks from Bever get lost), then
what is the number of packets that A will transmit for sending the message to B?
T11: Station A needs to send a message consisting of 12 packets to Station B using a siding window
(window size = 3) and Go-back-N error control strategy. All packets are ready and immediately
available for transmission. If every 4th packet that A transmits gets lost (but no acks from B ever get
lost), then what is the number of packets that A will transmit for sending the message to B?
1/2
T12: In Selective Repeat ARQ, if window size is 5 and we are sending 15 packets where every
5th packet is lost find number of retransmissions?
T13: If transmission delay and propagation delay in asliding window protocol are I msec. and
49,5 msec. respectively, then:
a.
What should be the sender window size to get the maximum efficiency?
b. What is the minimum number of bits required in the sequence number field?
c. If only 6 bits are reserved for sequence numbers, then what will be the efficiency?
T14: 1f transmission delay and propagation delay in a sliding window protocol are 1 msec. and
99.,5 msec. respectively, then:
a What should be the sender window size to get the maximum efficiency?
b. What is the minimum number of bits required in the sequence number field?
c. If only 7bits are reserved for sequence numbers, then what willbe the efficiency?
TI5: A20 Kbps satellite link has a propagation delay of 400msec., the transmitter employs the
"Go back N'" ÅRQ" scheme with Nset to l0. Assuming that each frame is 100 bytes long, what is
the maximum data rate possible?
T16: A1Mbps satellite link connects two ground stations. The altitude of the satellite is 36504
km and speed of the signal is 3 x 10^8 m/sec. What should be the packet size for a channel
utilization of 25% for a satellite link using go back 127 sliding window protocol?
T17: Consider a network connecting two systems located 8000 km apart. The bandwidth of the
network is 500 x 10^6 bits per second. The propagation speed of the media is 4x 10^6 meters per
second. It is needed to design a Go back N sliding window protocol for this network. The average
packet size is 10^7 bits. The network is to be used to its full capacity. Assume that processing
delays at nodes are negligible. What the minimum size in bits of the sequence number field?
T18: Consider a 128 x 10^3 bits/sec satellite communication link with one-way propagation delay
of 150 msec. Selective Retransmission (repeat) protocol is used on this link to send data with a
frame size of 1 KB. Neglect the transmission time of acknowledgement. What is the minimum
number of bits required for the sequence number field to achieve 100% utilization?
T19: Compute approximate optimal window size when packet size is 53 bytes, RTT is 60 msec
and bottleneck bandwidth is 155 Mbps.
T20: Station A uses 32 byte packets to transmit messages to station B using a sliding window
protocol. The round trip delay between Aand B is 80 msec and the bottleneck bandwidth on the
path between Aand Bis 128 Kbps. What is the optimal window size that Ashould use?
2/2

Tutorial Sheet 3 (Computer Networks)

Uploaded by

Copyright:

Available Formats

Tutorial Sheet 3 (Computer Networks)

Uploaded by

Document Information

Original Description:

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Tutorial Sheet 3 (Computer Networks)

Uploaded by

Copyright:

Available Formats

Tutorial Sheet #03 (Computer Networks)

You might also like

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.