Professional Documents
Culture Documents
256 b
103 m
88 b
103 m
+
+
+
b 200 106
b 200 106
106
106
s
s
)(
354 106 s
b
8 10 ch )
(
ch
s)
b/ packet
6
( 354 106
167
= 16 s/packet
b. One cycle time = (transmission time+propagation time) for data
packet + (transmission time+propagation time)
for ack packet
(
=
( 1002 )1 b +
256 b+
10 6
b
s
)(
103 m
50 nodes 1 b /node
+
+
6
6b
200 10 m/s
2
10
s
366 106 s
b
8 10 ch )
(
ch
s)
6
( 366 106
167 b / packet
= 16.54 s/packet
2. We want to design a coaxial LAN for 12 offices arranged on three similar
floors, each floor having two rows with 2 offices and the rows separated
by a hallway. Each office is 5 m x 5 m with a height of 3 m. The LAN
center is in the center of the ground floor beneath the three office floors.
Assume that each office requires two IP telephone lines and retrieves
two Web pages per minute at the average rate of 22 K per page.
a. Estimate the distance from each office to the LAN center.
b. Estimate the required available bit rate for the LAN.
Jawab :
a. Lantai 2 : d=5+3+5=13 m
Lantai 3 : d=5+3+3+5=16 m
Lantai 4 : d=5+3+3+3+3+5=19 m
b. VoIP rate tiap office = 64 x 2 = 128 Kb/s
Web rate tiap office =
LAN rate =
22
KB
page 1
8b
( 2 min ) =5.86 Kb /s
s
60
B
( 128+5.86 ) 12 office=1.6 Mb /s
100 10 b/ s
200 m/s
Frame = 1000 b
Untuk pertanyaan a dan b akan dijawab sebagai a dan untuk jawaban c
akan dijawab menjadi b.
a. Jarak rata-rata = 0.375 km
total time/frame = (transmission time) + (propagation time)
103 b/ frame
100 10 6 b /s
11.87
b. Time is seconds = to sense a collision in the midpoint of two users
distance = total time to send a frame up to the midpoint leading to a
collision, and then sense back the collision = 0.5 (11.87 s) + 0.5
(11.87 s) = 11.87 s
107 b
=1.187 b
Time in bits = 11.87 11.87 s
s
4. Consider a 100 Mb/s 100BaseT Ethernet LAN with four attached users,
as shown in Figure 5.5. In a nonpersistent CSMA/CD algorithm, a user
normally waits 512g bit times after a collision before sending its frame,
where g is drawn randomly. Assume that a 96 bit times of waiting period
are needed for clearing the link from the jammed signal in the 100BaseT
Ethernet LAN. Assume that only user 1 and user 4 are active and that
the propagation delay between them is 180 bit times. Suppose that
these two users try to send frames to each other and that their frames
collide at the half-way LAN link. User 1 then chooses g = 2, whereas
user 4 picks g = 1, and both retransmit.
a. How long does it take for user 1 to start its retransmission?
b. How long does it take for user 4 to start its retransmission?
c. How long does it take the frame from user 4 take to reach user
1?
Jawab :
100 Mb/s
96 bit time to clear
tp = 180 b
a. g=2
Retransmission time =
b. g=2
Retransmission time =
c.
l
180 b
t p= =
=1.8 106 s
c 100 Mb /s
tp
T
=T
R=
Pt
=
t B +t
t p
T +2 t p
1e
1
+
t p
p
( T +2 t p ) + e
T
U n=
=
( T + 2 )+ e +2 + e
b.
c.
0.01
e
T
Un2=
+2 ( 0.01 )+ e0.01
0.1
e
T
Un1=
+ 2 ( 0.1 )+ e0.1
1
e
T
1
Un1=
+2 ( 1 ) + e
7. A 10 Gb/s Ethernet LAN with ten users attached to it uses CSMA/CD. The
bus is about 10 meters, and users' frames are restricted to a maximum
size 1,500 bytes. Based on the statistics, four users in average are
active at the same time.
a. Find the frame propagation and transmission times.
b. Find the average utilization of the bus.
c. Find the probability that a user attempts to transmit frames in an
empty time slot.
d. Find the probability that a user attempts seven different times in
seven different empty slots to transmit its frame and is not
successful, owing to collision, but is successful on the eighth
attempt.
e. Find the average number of contentions.
Jawab :
a.
a=4
l=10
f =1500 byte x 8
n=10
b
=12, 00 b
1 byte
a.
l
10
tp= =
3.33 x 108 s
c 3 x 10 8
b.
u=
c.
n 1
pc = a
na
d.
na =7,i=7
f 12,000 bits
tr= =
=1.2 x 106 s
r 10 x 109 b/ s
tr
1.2 x 10 s
=
=0.973 s
tr+ tp 1.2 x 106 s+ 3.33 x 108 s
na1
( ) ( )
n a1
na
na1
41
4
71
7
=0.422
71
( ) ( )
pc =
41
=0.387
na =4
E [ c ]=
1p c 10.387
=
=1.5 2
pc
0.387
8. Using the CSMA details discussed in this chapter, sketch a block diagram
that represents the implementation of this algorithm for the following
cases:
a. Nonpersistent CSMA
b. p-persistent CSMA
Jawab :
a. Nonpersistent CSMA
b. p-persistent CSMA
9. Design (show only the network) a LAN system for a small five-story
building. One floor is dedicated to two mail servers and separated three
database servers. Each of remaining floor has four computers with
broadband access. Your design should meet the following restrictions
and conditions: three-input hubs, one bridge, and unlimited Ethernet
buses. The incoming broadband Internet access must be connected to a
six-repeater ring, no bus LAN is allowed outside of a floor, and a traffic
analyzer must be attached to the network.
Jawab :