EXERCISE CHAPTER 4 DATA LINKS AND TRANSMISSION

1. In order to transmit a 500-page book with an average of 1,000

characters per page between places 5,000 km apart, we assume that
each character uses 8 bits, that all signals travel at the speed of light,
and that no link-control protocol is used.
a. How much time is required if a digital voice circuit operating at the
speed of 64 kb/s is used?
b. How much time is required if a 620 Mb/s fiber-optic transmission
system is used?
c. Repeat parts (a) and (b) for a library with 2 million volumes of books.

Diketahui :

Tprop =

5000 10 3 m
=16.7 m/s
3 10 8 m/ s

Total size = (500 page)(100 char/page)(8 bits/char) = 4 Mb

Ditanya :
a. T yang dibutuhkan saat menggunakan kecepatan 64 kb/s?
b. T yang dibutuhkan saat 620 Mb/s transmisi fiber optic digunakan?
c. Ulangi A dan B menggunakan 2 juta volume dari buku
Jawab :
a. T = 16.7 ms + 4 Mb/(64 kb/s) = 62.51 s
b. T = 16.7 ms + 4 Mb/(620 mb/s) = 23.15 ms
c. Dengan volume buku sebesar 2 juta
Total size = 4 Mb x 2 x 106 = 8000 Gb

i.

T = 16.7 ms + 8000 Gb/(64 kb/s) = 1.25 x 108 s

ii.

T = 16.7 ms + 8000 Gb/(620 kb/s) = 12903.2167 s

4 tahun

3.6

jam
2. Assume that a wireless system with 200 terminals uses TDMA for

its channel access. The packet lengths are T in average and are
considered short compared with the TDMA long channel length.
Compare the efficiency of two strategies: polling and CSMA.

3. Design a CRC process unit for the following two standard generators of
computer networking:
a. CRC-12
b. CRC-16

4. For the example presented in the CRC section, we had 1010111 as a

block of data (D), and the common value of generator, G, 10010, as the
divisor.
a. Show the dividend and the divisor in polynomial forms.
b. Divide the dividend and the divisor in polynomial forms.
c. Compare the results of part (b) to its binary form obtained in
example.
Diketahui : D = 1010111
G = 10010
Ditanya : a. Pembagi (Divisor) dan terbagi (Dividend) dalam bentuk
polinomial?
b. Hasil bagi (Quotient) dan sisa pembagian (Remainder) dalam
bentuk polinomial?
Jawab :
a. Bentuk biner nilai dividend : 10101110000 (penambahan 4 nol
diperoleh dari ketentuan rumus G-1, dimana G = 5 bit,
sehingga 5-1 = 4)
Sehingga dapat diketahui bentuk polinomial dari nilai dividend
adalah
= X10 + X8 + X6 + X5 + X4
Bentuk biner nilai dividend adalah 10010 sehingga dapat diketahui
bentuk polinomialnya adalah X4 + X
b. Untuk mengetahui nilai quotient (hasil bagi) dalam bentuk polinomial
maka kita harus mengetahui terlebih dahulu hasil baginya dalam
bentuk biner

5. For data D, CRC = 1010111,1000, presented in the example of the CRC

section, and the common value of generator, G is 10010 as the divisor.
Sketch a picture of Figure 4.9 as many as needed and every time you
shift in a bit, show the content of each register. Prove that the final
contents of the registers show the value of CRC.
Diketahui dari data D, nilai CRC yang dihasilkan adalah 1010111,1000
dan nilai G adalah 10010.
Ditanya : Bukti bahwa nilai CRC yang dihasilkan berasal dari nilai awal
D!
Jawab :
Nilai D,0 = 1010111,0000 (D awal sebelum diproses)
G = 10010
Untuk perhitungan awal dapat kita hitung nilai pembagian antara nilai D

( D,G0 )

dengan nilai G

sehingga menghasilkan nilai CRC = 0001

(MSB dari kanan)

Karena sudah didapatkan nilai D, CRC = 1010111,1000 maka dapat kita

hitung kembali dengan membagi nilai D,CRC dengan pembagi G

)
( D, CRC
G
2

sehingga jika nilai hasil perhitungannya adalah 0 0 0 0

maka hal itu menunjukkan bahwa tidak ada eror dalam data tersebut.

6. Assume that 101011010101111 is a block of data (D) to be transmitted

using the CRC error-checking method. Suppose that the common value
of generator, G, is 111010. Using modulo-2 arithmetic.
a. Produce the final value that the transmitter sends on the link (D,
CRC).
b. Show the detail of the error-detection process at the receiver.
Diketahui : D = 1010 1101 0101 111
G = 1110 10 (6 bit)
Ditanya : a. D, CRC?
b. error detection process?
Jawab :
a. D = 1010 1101 0101 111
G = 1110 10
Karena g=6 , sehingga g-1=5
Maka, D,0 = 101011010101111 ,0000 0
CRC =

D,0

G 2

Setelah dilakukan perhitungan maka diperoleh :

Dividend = 101011010101111,00000
Divisor = 111010
Quotient = 111011111000010
Remainder = 10100
CRC = 10100
D,CRC = 1010 1101 0101 111,10100
b. D,CRC = 1010 1101 0101 111,10100
G = 1110 10

D , CRC
2
G

Setelah dilakukan perhitungan maka dapat diperoleh nilai :

Dividend = 101011010101111,10100
Divisor = 111010
Quotient = 111011111000010
Reminder = 0
Karena nilai reminder 0 maka kita dapat menyimpulkan bahwa data
tersebut benar (tidak error).

7. Consider a coaxial transmission link that uses the stop-and-wait protocol

requiring a propagation time to transmission time ratio of 10. Data is
transmitted at rate 10 Mb/s, using 80-bit frames.
a. Calculate the efficiency of this link.
b. Find the length of this link.
c. Find the propagation time.
d. Sketch a plot of link efficiency when the ratio of propagation time to
transmission time is reduced to 8, 6, 4, and 2.
Diketahui : v = 3 x 108 m/sec
l = 80 b/frame
r = 10 x 106 bits/sec, tp/tf = 10
Ditanya : a. E?
b. d?
c. tp?
d. plot of link efficiency when the ratio of propagation time to
transmission time is reduced to 8, 6, 4, and 2
Jawab :
a.

t
t
1
1
E= f = f =
=
=0.047624.76
t t f +2t 1+2 t p t f 1+ 2(10)
p

b. Dengan mengasumsikan nilai kecepatan cahaya 3 x 108 maka

10 =

d
d
8
tp v
d( 10 106)
3 10
= =

tf l
80
80(3 10 8)
r 10 106

d = 24 km
c.

d 24 km
t p= =
=8 105 s
v 3 10 8

d. Saat 8 ;

E=

1
=0.0588=5.88
1+2(8)

t p =6.4 10 sec ,d =19.2 km

Saat 6 ;

E=

1
=0.0769=7.69
1+2(6)

t p =4.8 105 sec ,d =14.4 km

= 10

Saat 4 ;

E=

1
=0.111=11.11
1+2(4)

t p =3.2 105 sec , d=9.6 km

Saat 2 ;

E=

1
=0.2=20
1+2(2)

t p =1.6 10 sec , d=4.8 km

8. Consider a 2 Mb/s satellite transmission link through which 800-bit

frames are transmitted. The propagation time is 200 ms.
a. Find the link efficiency, using the stop-and-wait protocol.
b. Find the link efficiency, using the sliding-window protocol if the
window size is = 6.
Diketahui : tp = 0.2 s
r = 2 Mb/s
f = 800 b

f
800
4
tf= =
=4 10 s
r 2 106

Ditanya : a. Efisiensi dengan stop and wait protokol?

b. efisiensi dengan sliding window protokol? (w=6)
Jawab :

a. Stop and wait protokol

E=

tf
=
t

4
tf
4 10
=
=0.0010 0.1
t f + 2t p 4 104 +2(2)

b. Sliding window protocol, w=6

E=
c.

t
w +2 p
tf

()

6
0.2
6 +2
4
4 10

=0.00596 0.6

9. Consider the bidirectional control of links with the sliding-window

method applied between two routers R2 and R3 (window size = 5) and
stop-and-wait control between routers R3 and R4. Assume that the
distance between R2 and R3 is 1,800 km and is 800 km between R3 and
R4. Data frames with average size of 5,000 bits flow from R2 to R3 at 1
Gb/s rate. Acknowledgment frames are small enough to be ignored in
the calculations. All links generate 1 s/km propagation delay.
a. Determine a condition on the data rate at the output port of R3
toward R4 so that R3 remains congestion-free.
b. Find the link efficiency for the R2R3 link.

c. Find the link efficiency for the R3R4 link.

Diketahui : Frame = 5000 b

t p =1 s /km
Ditanya : a. Rate on R3-R4?
b.

E R 2R 3 ?

c.

E R 3R 4 ?

Jawab :
a. Rate on R2-R3 = 1Gb/s
Required condition on R3-R4: Link R3-R4 must transfer slower. Such
that :
Rate on R3-R4 =

b.

t p =1800 km

ER 3R 4
1Gb/s
E R 2R 3

1 s
=1800 s
km

b
frame
=5 s
Gb
1
s

5000
tf=

E R 2R 3=

w +2

c.

tf=

b
frame

E R 3 R 4
E R 2 R 3

E R 3R 4=

5
3
=6.8 10
1800 s
5+2
5 s

1 s
=800 s
km

t p =800 km
5000

tp
tf

( )

E R 3 R 4
6.8 103
0.034
=5
=5
=
ER 2R 3
ER 3R 4
E R 3 R 4
Gb
1
s

1
1+ 2

tp
tf

()

) (

5
3
=4.6 10
800
0.034
5+2
E R 3R 4

( )