You are on page 1of 7

KATHMANDU UNIVERSITY

SCHOOL OF ENGINEERING
DEPARTMENT OF ELECTRICAL & ELECTRONICS ENGINEERING

LAB 1
MATSWIT.EXE: SPACE SWITCHING
Submitted By:
Shravan K. Luitel
Roll no: 42015

5 June, 2012

MATSWIT A: Blocking in a multistage switch


Connection:
Inlet:
Outlet:
Distribution
Matrix

Algorithm
A

1
9
6
0

2
11
2
1

3
14
9
2

4
8
10
3

Simulation No

5
6
11
0

6
7
12
1

7
3
5
2

Block
5
7

No of successful connection
1
2
3
4
5
6
7
8
9
10
11
12
1
2
3
4
5
6
7
8
9
10
11
12
1
2
3
4
5
6

10
14
10
16
9
7
7
8
14
16
11
8
16
13
13
16
16
12
11
13
16
14
16
13
16
11
13
8
8
10
1

7
8
9
10
11
12

14
12
9
14
16
9

Conclusion:
Algorithm

Average

Efficiency

10.83

67.708

14.08

88.02

11.667

72.916

From the above data we see that the efficiency of algorithm b is the maximum followed by c; a
having the minimum. As algorithm b tries connection using matrices in the cyclic order of 0-1-23 in the distribution stage (second stage), it ensures maximum connectivity. Algorithm b has
least blocking probability.

MATSWIT B: Switch performance statistics


Connections:

10

11

12

13

14

15

16

Number:

%:

10

15

10

20

20

Average number of successful connections=11.0


Number of sequence: 1154
Connections:

10

11

12

13

14

15

16

Number:

11

10

23

66

95

111

137

156

152

100

56

127

%:

1.1

2.2

6.3

9.1

10.6 13.1 14.9 14.9 9.6

5.4

0.0

12.2

Conclusion: There are four intermediate matrices present. This means that for a particular inletoutlet pair four paths are always provided in this switching system. Hence the number of
connection starts with 4 as shown in the table, meaning that at least 4 numbers of connections are
always available via 4 intermediate matrices.
Algorithm
a

Simulation No

No of successful connection
1
2
3
4
5
6
7
8
9
10
11
12
1
2
3
4
5
6
7
8
9
10
11
12
1
2
3
4
5
6
7
8
9
10
11
12

10.9
11.3
11.0
11.1
11.0
11.1
11.1
10.9
10.9
11.0
11.0
11.0
13.6
13.5
13.4
13.5
13.5
13.5
13.4
13.6
13.5
13.6
13.6
13.4
11.4
11.4
11.4
11.5
11.4
11.3
11.5
11.5
11.3
11.4
11.4
11.4

Conclusion: Efficiency= Number of successful Connections/Total number of connections*100


Algorithm a Efficiency=11.025/16*100=68.9
Algorithm b Efficiency=13.508/16*100=84.42
Algorithm c Efficiency= 11.408/16*100=71.302
Hence we can conclude that algorithm b is the most efficient one as it makes the highest
number of successful connections out of possible 16.

MATSWIT C: Continuous Switch operation


Algorithm

Traffic Erlang

Distribution Stage Connection

Traffic (Erlang)

Maximum Lost

Carried

Lost

3772

2.13

3.81

12

4948

2.88

9.33

15

5214

3.32

12.4

1952

1.24

0.8

3766

2.18

3.87

12

4930

2.84

9.13

15

5153

3.3

11.92

1610

1.32

0.66

2938

2.78

3.23

12

10

3097

5.32

6.71

15

14

2337

8.42

6.94

Algorithm

Algorithm

Traffic Erlang

Distribution Stage Connection

Traffic (Erlang)

Maximum Lost

Carried

Lost

38

1.98

0.02

11

517

5.26

0.73

12

12

1564

8.11

3.94

15

12

1822

9.41

5.54

34

2.06

0.02

11

528

5.40

0.76

12

12

1563

8.06

3.91

15

12

1855

9.41

5.68

31

0.02

11

468

5.38

0.67

12

13

1512

8.35

3.89

15

12

1794

9.56

5.52

Traffic Erlang

Distribution Stage Connection

Traffic (Erlang)

Maximum Lost

Carried

Lost

2.01

0.00

13

104

5.72

0.15

12

15

660

10.17

1.83

15

16

881

12.07

2.98

2.05

0.00

13

71

5.89

0.11

12

16

641

10.21

1.78

15

16

841

12.10

2.84

Algorithm

16

852

12.25

2.91

16

783

11.32

1.98

12

16

875

12.02

2.93

15

16

881

12.04

2.97

Traffic Erlang

Distribution Stage Connection

Traffic (Erlang)

Maximum Lost

Carried

Lost

1.93

0.00

14

0.00

12

16

11

11.82

0.03

15

16

27

14.90

0.10

2.01

0.00

13

5.88

0.00

12

16

1.99

0.00

15

16

14.98

0.01

16

15

11.93

0.06

14

11.43

0.09

12

16

27

14.73

0.09

15

16

36

14.86

0.13

Conclusion: It is seen that with the increasing traffic the lost traffic and the lost connections are
also being increased (the number of distribution matrices remaining the same). It is intuitively
known that the increase in traffic causes blocking probability to increase. Again when the
distribution stages are increased with the same traffic, the blocking is less as more paths are
available for the calls. The above data suggest that the performance of the algorithm c is better
at less traffic. Also the maximum number of connections made is higher with algorithm c in
comparison to others.