Scribd
Upload
51 views

Sheet 1 Solution

This document discusses different methods of transmitting data over computer networks including circuit switching, packet switching with and without acknowledgment, and message switching. It provides examples calculating transmission times for different sized files using each method over networks with various parameters. The key points made are: - Circuit switching transmission time is the circuit setup time plus transmission time plus circuit release time. - Packet switching transmission time is the time to transmit the first packet plus the transmission time of remaining packets, and may include acknowledgment times. - Message switching transmission time is the propagation delay across links plus transmission times at each node. - For a given file size and network configuration, different transmission methods will have different performance times that can be calculated

Uploaded by

NhocSkyz
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
51 views

Sheet 1 Solution

This document discusses different methods of transmitting data over computer networks including circuit switching, packet switching with and without acknowledgment, and message switching. It provides examples calculating transmission times for different sized files using each method over networks with various parameters. The key points made are: - Circuit switching transmission time is the circuit setup time plus transmission time plus circuit release time. - Packet switching transmission time is the time to transmit the first packet plus the transmission time of remaining packets, and may include acknowledgment times. - Message switching transmission time is the propagation delay across links plus transmission times at each node. - For a given file size and network configuration, different transmission methods will have different performance times that can be calculated

Uploaded by

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

Cairo University Fourth Year

Faculty of Engineering ELC403A : Computers 4A


Electronics and Communications Computer Networks
Department 2012-2013

Sheet (1) Solution


1. First we calculate the time needed to transport the data:
Time = distance / speed
= 5000 km / 1000 km/h = 5 hrs.
Each floppy weighs 30 gm, and load capacity of airplane is 104 kg = 107
gms.
Hence, number of floppies carried = 107 gms / 30 gms = 333333
Each floppy contains 1.44 Mbytes = 1.44 x 220 x 8 bits = 12.079x 106 bits
So, 333333 floppies will contain:
12.079 x 106 x 333333 bits = 4026329 x 106 bits
Now data transmission speed = data carried in bits / time
= 4026329 x 106 bits / (5 hrs x 60 mins x 60 secs )
= 223.68 x 106 bits/sec
= 223.68 Mbps.

2. No. of devices = 5.
No. of guard bands required between them is 4.
Hence total bandwidth = (4000 x 5) + (200 x 4) = 20.8 KHz.

3. Telephone link loss = 20 dB, Input signal power = 0.9 watt ,Output
noise power =10 uwatt .
a) Output SNR(dB) =10*log10 ( Output signal power/output noise power)
Since
Line loss (dB)=10*Log(Input signal power/Output signal power)=20 dB
It follows
Input signal power/Output signal power =10^2
& Output signal power=0.9 wa /10^2 = 9 mwa
Hence, Output SNR (dB) = 10*log( (9*10^-3)/(10*10^-6))= 29.54 dB

1
b) Capacity of phone line is computed from:
Capacity = B*Log2 (1+SNR)
where: B =2500 KHz
SNR(ratio)= 9 mwa /10 uwatt =900
Hence, Capacity = 2500*10^3*Log2 (1+900) = 24.538 Mbit/sec
c) Length of phone line is computed as follows:
Phone line attenuation rate = 6 dB/Km
Input signal power =0.9 wa
Minimum output signal power =0.005 watt
Hence,
Max allowable line attenuation = 10*Log(input signal /output signal)
= 10*Log(0.9/0.005)=22.55 dB
Max allowable line length (Max attenuation / attenuation rate)
22.55 /6 =.758 Km

4. Analog broadcast television channel has bandwidth (B)= 10 MHZ

a) For (64-QAM) signal with Symbol rate = 8*10^6 QAM symbol/sec


Bit rate = Symbol rate * Log2M (M=number of symbols =64)
=8*10^6 *Log2(64) = 48 Mbit/sec
b) To get minimum channel SNR, we use Shannon’s law :
Bit rate = B*Log2 (1+SNR)
48*10^6 = 10*10^6 *Log2 (1+SNR)
Hence, SNR= 26.857

c) If bandwidth is doubled ( B2 =2 *B1)


To have same the bit rate
B1*Log2 (1+SNR1) = B2 *Log2 (1+SNR2)
(½)*Log2 (1+SNR1) = Log2 (1+SNR2)
Log2 (1+SNR1) ^ (½) = Log2 (1+SNR2)
(1+SNR2) = (1+SNR1)^(½)
SNR1 =26.8576 SNR2 = 4.278
SNR2 Signal 2 * Noise 1
& Noise 1 B1
=1
SNR1 Signal 1 * Noise 2 Noise 2 B2 2
Signal 2 2 * 4 . 278
0 . 318
Signal 1 26 . 8576
2
5. File to be transmitted along path between source and destination over
3 switches
The time to deliver the file consists of the time it takes to establish the
circuit (1 sec), the propagation delay (tp=2 ms), the time it takes to
transmit the file over the link (= K/4*106), and time of circuit release
(=1sec) (Take it as circuit setup if not given)

tr1= tr2= tr3= tr4 = tr; tp1= tp2= tp3= tp4 = tp =2ms
Total Delay=t setup + tr(Data) +t release
Total Delay=1+ +1=(2+ )sec

3
a) Packet Switching with acknowledgment with packet size =1Kbits=
1000bits (payload)+ 24bits(header)

Since, number of packets =

Then time needed to transfer this file = number of packets*[time to


transfer one packet+ time of receiving packet acknowledge]

Time to transfer one packet = 4* tp +4*tr


= 4*2ms + 4*1024/(4*106)
= 9.042 ms
Time needed to transfer this file = *[9.042 +10]msec
4
= 19.042 *10-6 K sec

b) Packet Switching without acknowledgment with packet size =1Kbits=


1000 bits (payload)+ 24bits (header)
Time needed to transfer this file = time to transfer last packet +
transmission time of remaining packets
Time to transfer first packet is (as before) = 9.042 ms
Transmission time of remaining packets= [ -1]* tr1
Time needed to transfer this file= 9.042 +0.256* [ -1] ms

For scenario (a) to be faster than scenario (c) , we should have:


Delay of scenario (a) < Delay of scenario(c)
(2+ ) < 9.042*10-3 + 0.256*[ -1] *10-3
or 0.256*10-6*K - 0.25*10-6*K > 2 - 9.042*10-3+ 0.256*10-3
K > 331.7836*106bits

5
c) Virtual-circuit packet-switching

tr'1=tr'2=tr'3=tr'4 , t p1=tp2=tp3=tp4
Time needed to deliver the file= tsetup+ tr (of all data packets) + trelaease
= 1+ 0.256*10-3* [ ]+1 = 2+0.256*10-3* [ ]sec

6
d) message switching

tr1=tr2=tr3=tr4=tr; tp1=tp2=tp3=tp4=tp
Time needed to deliver file
= propagation time on the four links + transmission time at source+
transmission time at three intermediate nodes
6
= 4* tp +4*tr(message) = 4*2ms + 4*K/(4*10 )
= (8+ 10-3 K )ms

f)

ADC Packetization
packet

DAC Depacketization packet

The maximum time elapses if the bit falls at the beginning of a new
packet. We must first wait for the entire packet to be generated, for the
packet to be transmitted over the 4 Mbps link, and for propagation delay
on four links:
7
Time delay= Packetization time + Time to transfer one packet
= +4*tr+4*tp = +4* +4*2*10 =0.014009 sec

One may suggest that Host B reproduces the first bit as soon as the first
bit of the first packet arrives (without waiting for the entire packet to
arrive). In practice, it is more logical to wait for the full packet to arrive
(to be able to check it for errors, among other things) then decode it again.

6. (For your answer to be complete, you should draw time sequence


diagrams before writing down the mathematical expressions)
a) With Circuit switching: tr = 3000*8/5*106 = 4.8 ms

Hence, total time = setup time+ tr + release time

= 1 + 4.8*10-3+1 = 2004.8 ms (tsetup = trelease = 1 sec, not 1 ms)

b) With Packet switching, 2 intermediate points, Packet size = 1 KB


Header = 24 B, without waiting acknowledgment
Total time = time to transfer first packet+ transmission time of
remaining packets
tp= =3.33 ms
3000
Number of packets = 3
210 24
Time to transfer 1st packet= 3*tp +3* tr = 3* +3*4.8 = 24.40 ms
Transmission Time of remaining packets = (3-1)* 4.8*10 -3 =9.6 ms
Total time = 24.4 + 9.6 = 34.0 ms
c) For Packet switching, with acknowledgment
Time needed to transfer file = Number of packets*[time to transfer
one packet+ time of receiving packet acknowledge]
= 3* [24.40 ms+ 3* ms] = 0.1032 sec
(Assume time of receiving packet acknowledge = 3* ms)
d) With Packet switching serving 30 users
Probability that 5 users are active = 30C5 * (.4) ^5 *(.6)^25=0.0041

You might also like