Scribd
Upload
46 views

EE230x Hw#3 Solutions

The document contains solutions to homework problems about networking concepts. It discusses: 1) The capacity and available capacity of a T1 line is 1.544 Mbps and 1.52856 Mbps respectively. Statistical multiplexing can boost the number of devices using the line by 7-8 times if sources are only active 10% of the time. 2) Synchronous TDM provides 9600 bps * 10 = 96 kbps while statistical TDM provides 9600 bps * 10 * 0.5/0.8 = 60 kbps. 3) The overhead of initial circuit setup and teardown is not considered in an argument about circuit switching vs other methods.

Uploaded by

Nur Amiera Syuhadha
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
46 views

EE230x Hw#3 Solutions

The document contains solutions to homework problems about networking concepts. It discusses: 1) The capacity and available capacity of a T1 line is 1.544 Mbps and 1.52856 Mbps respectively. Statistical multiplexing can boost the number of devices using the line by 7-8 times if sources are only active 10% of the time. 2) Synchronous TDM provides 9600 bps * 10 = 96 kbps while statistical TDM provides 9600 bps * 10 * 0.5/0.8 = 60 kbps. 3) The overhead of initial circuit setup and teardown is not considered in an argument about circuit switching vs other methods.

Uploaded by

Nur Amiera Syuhadha
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

EE230x Hw#3 Solutions

8.12 The capacity of the T1 line is 1.544 Mbps. The available capacity is 1.544
⋅0.99 =1.52856 Mbps = AC.
a. AC/110 = 13,896
b. AC/300 = 5,095
c. AC/1200 = 1273
d. AC/9600 = 159
e. AC/64000 = 23
If the sources were active only 10% of the time, a statistical multiplexer could be
used to boost the number of devices by a factor of about seven or eight in each
case. This is a practical limit based on the performance characteristics of a
statistical multiplexer.

8.13 Synchronous TDM: 9600 bps ⋅ 10 = 96 kbps


Statistical TDM: 9600 bps ⋅10⋅ 0.5/0.8 = 60 kbps

10.4 The argument ignores the overhead of the initial circuit setup and the circuit
teardown.

10.5
a. Circuit Switching
T = C1 + C2 where
C1 = Call Setup Time
C2 = Message Delivery Time
C1 = S = 0.2
C2 = Propagation Delay + Transmission Time
= N ⋅ D + L/B
= 4 ⋅ 0.001 + 3200/9600 = 0.337
T = 0.2 + 0.337 = 0.537 sec

Datagram Packet Switching


T = D1 + D2 + D3 + D4 where
D1 = Time to Transmit and Deliver all packets through first hop
D2 = Time to Deliver last packet across second hop
D3 = Time to Deliver last packet across third hop
D4 = Time to Deliver last packet across forth hop
There are P – H = 1024 – 16 = 1008 data bits per packet.
A message of 3200 bits requires four packets
(3200 bits/1008 bits/packet = 3.17 packets which we round up to 4 packets).
D1 = 4 ⋅ t + p where
t = transmission time for one packet
p = propagation delay for one hop
D1 = 4 ⋅ (P/B) + D
= 4 ⋅ (1024/9600) + 0.001
= 0.428
D2 = D3 = D4 = t + p
= (P/B) + D
= (1024/9600) + 0.001 = 0.108
T = 0.428 + 0.108 + 0.108 + 0.108
= 0.752 sec

Virtual Circuit Packet Switching


T = V1 + V2 where
V1 = Call Setup Time
V2 = Datagram Packet Switching Time
T = S + 0.752 = 0.2 + 0.752 = 0.952 sec

b. Circuit Switching vs. Diagram Packet Switching


Tc = End-to-End Delay, Circuit Switching
Tc = S + N ⋅ D + L/B
Td = End-to-End Delay, Datagram Packet Switching
⎡ L ⎤
Np = Number of packets = ⎢ ⎥
⎢P−H ⎥
Td = D1 + (N – 1)D2
D1 = Time to Transmit and Deliver all packets through first hop
D2 = Time to Deliver last packet through a hop
D1 = Np(P/B) + D
D2 = P/B + D
T = (Np + N – 1)(P/B) + N x D
T = Td
S + L/B = (Np + N – 1)(P/B)

Circuit Switching vs. Virtual Circuit Packet Switching


TV = End-to-End Delay, Virtual Circuit Packet Switching
TV = S + Td
TC = TV
L/B = (Np + N – 1)(P/B)

Datagram vs. Virtual Circuit Packet Switching


Td = TV – S

10.11
Ttd × Ru
k=2+2⋅
8 × Ld
= 2 + 2a
Where the variable a is the same one defined in Chapter 7. In essence,
the upper part of the fraction is the length of the link in bits, and the lower
part of the fraction is the length of a frame in bits. So the fraction tells you
how many frames can be laid out on the link at one time. Multiplying by 2
gives you the round-trip length of the link. You want your sliding window to
accommodate that number of frames so that you can continue to send
frames until an acknowledgment is received. Adding 1 to that total takes
care of rounding up to the next whole number of frames. Adding 2 instead
of 1 is just an additional margin of safety.
See Figure 7.11.

You might also like