Enrollment No.

201310132112
PRACTICAL-1

AIM: Calculate the number of links required for a fully connected network using point to
point connection links without centralized exchange.

PROGRAM:

clc;
n=input('No of Entities = ');
y=(n*(n-1)/2);
str1=sprintf(' No. of Links required = %d ',y);
disp(str1);

for i=1:1000
x(i)=i;
y(i)=((i*(i-1))/2);

end
plot(x,y);
xlabel('No of Entities');
ylabel('Required Point to Point Links');
title('Entities vs. Point to Point Links for Fully Connected Network');

OUTPUT:

No of Entities = 50

No. of Links required = 1225

GRAPH:

OBSERVATION TABLE:

Entities involved in Number of Entities Point to Point Links

Network Requirement
5 Refer to graph 1
Less 10 Refer to graph 2
15 Refer to graph 3
200 Refer to graph 4
Moderate 500 Refer to graph 5
800 Refer to graph 6
10000 Refer to graph 7
Large 30000 Refer to graph 8
50000 Refer to graph 9
Graph 1: Graph 2:

Graph 3: Graph 4:
Graph 5: Graph 6:

C
O
N
C
L
U
S
I
O
N
:

Graph 7: Graph 8:

Graph 9:

In this experiment, we successfully calculated the number of point-to-point connection links

required for a fully connected network without a centralized exchange. The plotted data illustrates
the relationship between the number of entities and the corresponding number of required links,
providing valuable insights into network design and scalability.
Enrollment No. 201310132112
PRACTICAL-2

AIM: To generate pulse dialing waveforms for Rotary dial telephone.

PROGRAM:

clc;
t=0:0.0001:0.019
f=50
A=squarewave(2*3.14*f*t);
B=squarewave(2*3.14*f*t,33);
C=squarewave(2*3.14*f*t,33)+1;
D=(squarewave(2*3.14*f*t,33)+1)/2;
E1=ones(1,2500)
E2=zeros(1,50)
E =[E1 E2]

for i=1:3
y(i)=input('Enter the digit = ')
end

AZ= [repmat(D,1,y(1)) E repmat(D,1,y(2)) E repmat(D,1,y(3)) E ]

plot(AZ)
xlabel('Time');
ylabel('Magnitude');
title('Pulse Waveforms of Dialed Digits');

OUTPUT:

Enter the digit = 2

Enter the digit = 3

Enter the digit = 5

GRAPH:

OBSERVATION TABLE:
Digit1 Digit2 Digit3 Screen shot of Pulse waveform
3 1 4
Digit1 Digit2 Digit3 Screen shot of Pulse waveform
6 2 7

9 5 3

5 7 1
 Digit1 Digit2 Digit3 Screen shot of Pulse waveform
3 6 9

CONCLUSION:

The program effectively generated pulse dialing waveforms for rotary dial telephones based on
user-inputted digits. The waveforms accurately represented the pulse signals for dialing specific
numbers. The observed waveforms matched expected patterns, demonstrating successful
waveform generation.
 Enrollment No.201310132112
PRACTICAL-3

AIM: To generate the signaling tones waveforms in automatic exchange.

PROGRAM:

clc;
t=0:0.01:10
f=input ('Frequency = ');
A1=sin (2*3.14*f*t)
Dial_Tone=repmat(A1,1,13)
subplot(511) plot(Dial_Tone)
title('Dial Tone');

t1=0:0.01:10
A1=sin(2*3.14*f*t1)
B1=zeros(1,500)
C1=zeros(1,5000)
Ringing_Tone=[A1 B1 A1 C1 A1 B1 A1 ]
subplot(512)
plot(Ringing_Tone)
title('Ringing Tone');

x=input('x = ');
t2=0:0.01:((10*x)/0.4)
A2=sin(2*3.14*f*t2)
S2=length(A2)
B2=zeros(1,S2)
Busy_Tone=[ A2 B2 A2 B2 A2]
subplot(513)
plot(Busy_Tone)
title('Busy Tone');

y=input('y = '); t3=0:0.01:

((10*y)/0.4)
A3=sin(2*3.14*f*t3)
S3=length(A3)
S33=round(S3*0.2 )
B3=zeros(1,S33)
Call_in_Progress=[ A3 B3 A3 B3]
subplot(514) plot(Call_in_Progress)
title('Call_in_Progress Tone');
t0=0:0.01:10
A0=sin(2*3.14*f*t0)
Number_Unobtainable=repmat(A0,1,13)
subplot(515) plot(Number_Unobtainable)
title('Number Unobtainable Tone');

OUTPUT:

Frequency = 0.4

x = 0.75

y = 2.5
OBSERVATION TABLE:

Tone
Frequency Separation Screen shot of signaling tones waveforms
(KHz) (Second)
x y

0.2 1 Refer to graph 1

0.4
0.5 1.6 Refer to graph 2
0.75 2.5 Refer to graph 3
0.2 1 Refer to graph 4
0.8
0.5 1.6 Refer to graph 5
0.75 2.5 Refer to graph 6
0.2 1 Refer to graph 7
1
0.5 1.6 Refer to graph 8
0.75 2.5 Refer to graph 9

Graph 1: Graph 2:
Graph 3:

Graph 4: Graph 5:
Graph 6:

Graph 7: Graph 8:
 Graph 9:

CONCLUSION:

We effectively generated signaling tones waveforms using MATLAB, illustrating their essential
role in telecommunications. The waveforms depicted dial tone, ringing tone, busy tone, call in
progress tone, and number unobtainable tone, showcasing diverse applications in automatic
exchanges. The observed frequency-tone separation combinations and corresponding graphical
representations elucidate the versatility of signaling tones for efficient communication systems.
 Enrollment No.201310132112
PRACTICAL-4

AIM: To generate waveforms of touch dial telephone.

PROGRAM:

clc;
t= 0:0.04:8
f1=697
a1=sin(2*3.14*f1*t)
f2=770
a2=sin(2*3.14*f2*t)
f3=852
a3=sin(2*3.14*f3*t)
f4=941
a4=sin(2*3.14*f4*t)
f5=1209
a5=sin(2*3.14*f5*t)
f6=1336
a6=sin(2*3.14*f6*t)
f7=1477
a7=sin(2*3.14*f7*t)

one=a1+a5;
subplot(3,3,1);
plot(t,one,'LineWidth',1.5);
title('one');

two=a1+a6;
subplot(3,3,2);
plot(t,two,'LineWidth',1.5);
title('two');

three=a1+a7;
subplot(3,3,3);
plot(t,three,'LineWidth',1.5);
title('three');

four=a2+a5;
subplot(3,3,4);
plot(t,four,'LineWidth',1.5);
title('four');
five=a2+a6;
subplot(3,3,5);
plot(t,five,'LineWidth',1.5);
title('five');

six=a2+a7;
subplot(3,3,6);
plot(t,six,'LineWidth',1.5);
title('six');

seven=a3+a5;
subplot(3,3,7);
plot(t,seven,'LineWidth',1.5);
title('seven');

eight=a3+a6;
subplot(3,3,8);
plot(t,eight,'LineWidth',1.5);
title('eight');

nine=a3+a7;
subplot(3,3,9);
plot(t,nine,'LineWidth',1.5);
title('nine');

OUTPUT:
OBSERVATION TABLE:

Frequencies (Hz) Screen Shot of Waveform

F1 F2 F3 F4 F5 F6 F7
650 750 830 920 1180 1310 1450 Refer to graph 1
670 760 840 930 1190 1320 1460 Refer to graph 2
710 780 860 950 1220 1350 1490 Refer to graph 3
720 790 870 960 1230 1360 1500 Refer to graph 4

Graph-1: Graph-2:

Graph-3: Graph-4:

CONCLUSION:

We successfully generated touch dial telephone waveforms by combining various frequencies. The
resulting waveforms depicted recognizable tones corresponding to digits on a telephone keypad.
The observed frequencies and their graphical representations highlight the distinct waveforms
associated with each digit, showcasing the fundamental principle behind touch-tone dialing in
telecommunications.
Enrollment No. 201310132112
PRACTICAL-5

AIM: Analyze the number of calls for each hour in a day using histogram.

PROGRAM:

clc;
N=input ('Enter the no. of hours of consideration for Traffic Engineering = '); for i=1:N
y(i)=input(' Enter the no. of calls in particular hour ='); end
bar(y)
xlabel('Hours');
ylabel('Number of calls');
title('Busy hour calling');

OUTPUT:

Hour No. of Calls

1 2
2 5
3 7
4 3
5 8
6 10
7 12
8 15
9 17
10 18
11 30
12 35
13 27
14 18
15 17
16 20
17 25
18 27
19 15
20 19
21 13
22 12
23 9
24 5
Histogram
OBSERVATION TABLE:

Case 1 Case 2 Case 3 Case 4

Hour No. of Calls No. of Calls No. of Calls No. of Calls
1 3 6 8 2
2 1 2 5 7
3 2 4 7 5
4 7 5 4 3
5 9 10 7 6
6 13 11 12 9
7 15 14 10 14
8 19 13 15 16
9 18 17 20 21
10 28 29 27 25
11 36 39 32 33
12 45 42 40 37
13 34 35 36 38
14 25 27 28 26
15 23 25 22 20
16 28 29 27 24
17 32 33 35 34
18 48 45 42 40
19 35 32 31 38
20 21 22 23 24
21 19 18 17 16
22 12 10 11 13
23 8 9 7 5
24 4 5 4 3

Histogram of Case 1: Histogram of Case 2:

 Histogram of Case 3: Histogram of Case 4:

CONCLUSION:
We analyzed the distribution of calls for each hour in a day using histograms. The data provided
insights into the variation of call volumes throughout different hours, aiding in traffic engineering
assessments. Histograms visually represented call counts, enabling a clear understanding of hourly
call patterns and aiding decision-making for optimizing telecommunication resources.
Enrollment No.201310132112
PRACTICAL-6

AIM: Find the availability and unavailability of single processor and dual processor
systems.

PROGRAM:

clc;
y1=input ('Enter the mean time between failure (MTBF) in hours = ')
y2=input ('Enter the mean time to repair (MTTR) in hours = ')
y3 = ((y1) / (y1+y2))
disp('Availability of single processor system =');
disp(y3)

y4=1 - ((y1) / (y1+y2))

disp('Unavailability of single processor system =');
disp(y4)

y5 = (2*(y2).^2) / (y1.^2)
disp('Unavailability of dual processor system
='); disp(y5)

y6 = 1-y5
disp('Availability of dual processor system
='); disp(y6)

for i=1:1000
y2(i)=i;
y3(i)= ((y1) / (y1+ y2(i)));
y6(i)= 1 - (2*(y2(i)).^2) /
(y1.^2) end

subplot(211)
plot(y2, y3);
xlabel('Mean Time to Repair (MTTR)');
ylabel('Availability of Single Processor System');
title('MTTR vs. Availability of Single Processor System');

subplot(212)
plot(y2, y6);
xlabel('Mean Time to Repair (MTTR)');
ylabel('Availability of Dual Processor System');
title('MTTR vs. Availability of Dual Processor System');
OUTPUT:

Enter the mean time between failure (MTBF) in hours = 2000

Enter the mean time to repair (MTTR) in hours = 4

Availability of single processor system = 0.998004

Unavailability of single processor system = 0.001996

Unavailability of dual processor system = 0.000008

Availability of dual processor system = 0.999992

GRAPH:
OBSERVATION TABLE:

Mean time Mean time to repair Unavailability of Unavailability of

between failure (MTTR) (in hours) single processor dual processor
(MTBF) system system
(in hours)
500 3 0.0059642 0.000072
1000 7 0.0069513 0.000098
1500 9 0.0059642 0.000072
2500 20 0.0079365 0.000128
3000 50 0.0163934 0.0005556
5000 100 0.0196078 0.0008

Graph-1: Graph-2:

Graph-3: Graph-4:
 Graph-5: Graph-6:

CONCLUSION:
 Single processor systems have high availability and low unavailability, making them
reliable. Dual processor systems offer even higher availability and almost negligible
unavailability, ensuring operational continuity. Increased mean time to repair (MTTR)
results in decreased system availability for both single and dual processor systems.
 Dual processor systems are preferable for critical applications due to their superior
availability and resilience to failure, minimizing downtime. Efficient MTBF and MTTR
optimization are essential for designing robust and reliable systems.
Enrollment No. 201310132112
PRACTICAL-7

AIM: Calculate the number of trunks supported on time multiplexed space switch.
Estimate the cost of a switch.

PROGRAM:

clc;
M=input ('Enter number of multiplexed channels = ');
Tm=input ('Enter control memory access time in ns = ');
Tt=input ('Enter bus switching and sample transfer time in ns = ');
Ts = Tm + Tt;
disp('Total switching time in ns = ');
disp(Ts)
N = (125)*(10^3)/(M*Ts);
disp('Number of trunks supported on time multiplexed space switch = ');
disp(N)
C = (2*N) + (M*N);
disp('Cost of a time multiplexed space switch = ');
disp(C)

OUTPUT:

Enter number of multiplexed channels = 32

Enter control memory access time in ns = 100

Enter bus switching and sample transfer time in ns = 100

Total switching time in ns = 200

Number of trunks supported on time multiplexed space switch = 19.53125

Cost of a time multiplexed space switch = 664.0625

OBSERVATION TABLE:

Case 1 :

Tm = 150 ns, Tt = 100 ns

Multiplexed Trunks (N) Cost of a time multiplexed space switch

Channels (M) (C)
25 20 540
100 5 510
300 1.666 503.33
500 1 502
1000 0.5 501
1500 0.33 500.667

Case 2 :

Tm = 200 ns, Tt = 100 ns

Multiplexed Trunks (N) Cost of a time multiplexed space switch

Channels (M) (C)
25 16.66 450
100 4.166 425
300 1.388 419.44
500 0.833 418.33
1000 0.416 417.5
1500 0.277 417.22

Case 3 :
Tm = 500 ns, Tt = 250 ns

Multiplexed Trunks (N) Cost of a time multiplexed space switch

Channels (M) (C)
25 6.666 180
100 1.66 170
300 0.555 167.777
500 0.333 167.33
1000 0.166 167
1500 0.111 166.889

CONCLUSION:

 The study highlights the crucial impact of control memory access time (Tm), bus
switching time (Tt), and the number of multiplexed channels (M) on time-multiplexed
space switch performance and cost. Increased switching and access times reduce supported
trunks (N), raising overall costs. Optimization is vital to balance trunks (N) and
multiplexed channels (M) for an efficient and cost-effective design.