Computer Networks - DR - Subbulakshmi T

Scilab Manual for
Computer Networks
by Dr Subbulakshmi T
Computer Engineering
VIT University Chennai1
Solutions provided by
Dr Subbulakshmi T
Computer Engineering
Vit University Chennai
November 26, 2021
1 Funded by a grant from the National Mission on Education through ICT,

http://spoken-tutorial.org/NMEICT-Intro. This Scilab Manual and Scilab codes
written in it can be downloaded from the ”Migrated Labs” section at the website
http://scilab.in
1
Contents
List of Scilab Solutions 4
1 Creation of the Bus topology 7
2 Creation of the Ring topology 14
3 Creation of the Star topology 19
4 Creation of the Mesh topology 23
5 Creation of Tree topology 28
6 Finding the Shortest Path in Bus topology 32
7 Finding the Shortest Path in Ring topology 38
8 Finding the Shortest Path in Star topology 44
9 Finding the Shortest Path in Mesh topology 50
10 Finding the Shortest Path in Tree topology 56
11 Creating a Network Square Area & Coloured Network Topol-

ogy Creation 62
12 Finding the shortest path by using Dijikstra’s Algorithm 69
13 Finding the shortest path by using Prim’s Algorithm 73
14 Manet Simulation 77
2
15 Congestion Control 82
3
List of Experiments
Solution 1.1 Bus Topology Creation . . . . . . . . . . . . . . . 7

Solution 2.1 Ring Topology Creation . . . . . . . . . . . . . . 14
Solution 3.1 Star Topology Creation . . . . . . . . . . . . . . . 19
Solution 4.1 Mesh Topology Creation . . . . . . . . . . . . . . 23
Solution 5.1 Treee Topology . . . . . . . . . . . . . . . . . . . 28
Solution 6.1 Shortest Path in Bus Topology . . . . . . . . . . . 32
Solution 7.1 Shortest Path in Ring Topology . . . . . . . . . . 38
Solution 8.1 Shortest Path in Star Topology . . . . . . . . . . 44
Solution 9.1 Shortest Path in Mesh Topology . . . . . . . . . . 50
Solution 10.1 Shortest Path in Tree Topology . . . . . . . . . . 56
Solution 11.1 Creation of Network Square Area and Coloured Net-
work Topology . . . . . . . . . . . . . . . . . . . . 62
Solution 12.1 Shortest path using Dijikstras Algorithm . . . . . 69
Solution 13.1 Shortest Path Using Prims Algorithm . . . . . . . 73
Solution 14.1 Manet Simulation . . . . . . . . . . . . . . . . . . 77
Solution 15.1 Congestion Control . . . . . . . . . . . . . . . . . 82
4
List of Figures
1.1 Bus Topology Creation . . . . . . . . . . . . . . . . . . . . . 8

1.2 Bus Topology Creation . . . . . . . . . . . . . . . . . . . . . 9
2.1 Ring Topology Creation . . . . . . . . . . . . . . . . . . . . 15

2.2 Ring Topology Creation . . . . . . . . . . . . . . . . . . . . 15
3.1 Star Topology Creation . . . . . . . . . . . . . . . . . . . . . 20

3.2 Star Topology Creation . . . . . . . . . . . . . . . . . . . . . 20
4.1 Mesh Topology Creation . . . . . . . . . . . . . . . . . . . . 24

4.2 Mesh Topology Creation . . . . . . . . . . . . . . . . . . . . 24
5.1 Treee Topology . . . . . . . . . . . . . . . . . . . . . . . . . 29

5.2 Treee Topology . . . . . . . . . . . . . . . . . . . . . . . . . 29
6.1 Shortest Path in Bus Topology . . . . . . . . . . . . . . . . 33

6.2 Shortest Path in Bus Topology . . . . . . . . . . . . . . . . 33
7.1 Shortest Path in Ring Topology . . . . . . . . . . . . . . . . 42

7.2 Shortest Path in Ring Topology . . . . . . . . . . . . . . . . 43
8.1 Shortest Path in Star Topology . . . . . . . . . . . . . . . . 45

8.2 Shortest Path in Star Topology . . . . . . . . . . . . . . . . 49
9.1 Shortest Path in Mesh Topology . . . . . . . . . . . . . . . . 51

9.2 Shortest Path in Mesh Topology . . . . . . . . . . . . . . . . 51
10.1 Shortest Path in Tree Topology . . . . . . . . . . . . . . . . 57

10.2 Shortest Path in Tree Topology . . . . . . . . . . . . . . . . 61
5
11.1 Creation of Network Square Area and Coloured Network Topol-
ogy . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 63
11.2 Creation of Network Square Area and Coloured Network Topol-
ogy . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 63
12.1 Shortest path using Dijikstras Algorithm . . . . . . . . . . . 70

12.2 Shortest path using Dijikstras Algorithm . . . . . . . . . . . 70
13.1 Shortest Path Using Prims Algorithm . . . . . . . . . . . . . 74

13.2 Shortest Path Using Prims Algorithm . . . . . . . . . . . . . 74
14.1 Manet Simulation . . . . . . . . . . . . . . . . . . . . . . . . 78

14.2 Manet Simulation . . . . . . . . . . . . . . . . . . . . . . . . 78
15.1 Congestion Control . . . . . . . . . . . . . . . . . . . . . . . 83

15.2 Congestion Control . . . . . . . . . . . . . . . . . . . . . . . 83
6
Experiment: 1
Creation of the Bus topology
Scilab code Solution 1.1 Bus Topology Creation
1 // E x p e r i m e n t No . 1
2 // T h i s f i l e must be u s e d u n d e r t h e t e r m s o f t h e
CeCILL .
3 // T h i s s o u r c e f i l e i s l i c e n s e d a s d e s c r i b e d i n t h e
f i l e COPYING, which
4 // you s h o u l d have r e c e i v e d a s p a r t o f t h i s
d i s t r i b u t i o n . The t e r m s
5 // a r e a l s o a v a i l a b l e a t
6 // h t t p : / /www . c e c i l l . i n f o / l i c e n c e s / L i c e n c e C e C I L L V 2
−en . t x t
7 // T h i s S o u r c e f i l e i s W r i t t e n by Dr . T . Subbulaskhmi
, Professor ,
8 // S c h o o l o f Computing S c i e n c e and E n g i n e e r i n g , VIT
U n i v e r s i t y Chennai
9 // u s i n g t h e NARVAL e x a m p l e s o f S c i l a b f o r Network
Topology C r e a t i o n
10 // The O p e r a t i n g System u s e d f o r w r i t i n g t h e c o d e
7
Figure 1.1: Bus Topology Creation
8
Figure 1.2: Bus Topology Creation
9
f o u n d i n t h i s f i l e i s Windows 8
11 //SCILAB v e r s i o n 5 . 5 . 2 and NARVAL t o o l b o x v e r s i o n
3.1
12 //
|−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−
13 // | T h i s l a b e x p e r i m e n t w i l l do t h e f o l l o w i n g
operations |
14 // | 1 . c r e a t e and D i s p l a y Bus T o p o l o g y
|
15 // | 2 . C o l o u r t h e n o d e s and Edges
|
16 // | 3 . D i s p l a y t h e node number and e d g e number
|
17 // | 4 . D i s p l a y t h e number o f n o d e s and e d g e s
|
18 // | 5 . D i s p l a y t h e Edge I n d e x b e t w e e n two n o d e s
|
19 // | 6 . D i s p l a y t h e l e n g t h o f e v e r y e d g e
|
20 // | 7 . Return t h e s e t o f e d g e s c o n n e c t e d t o a node
i n s i d e a graph |
21 // | 8 . E x t r a c t t h e d a t a f i e l d s o f t h e node
|
22 // | 9 . E x t r a c t t h e d a t a f i e l d s o f t h e Edge
|
23 //
|−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−
24 clear ;
25 clc ;
26 // 1 . c r e a t e and D i s p l a y Bus T o p o l o g y
27 NameOfNetwork = ’ Bus T o p o l o g y ’ ; // Name o f y o u r n e t w o r k
28 NumberOfNodes =15; // Number o f Nodes i n t h e n e t w o r k
29 StartingNodesOfConnection =[1 2 3 4 5 6 7 1 2 3 4 5 6
7]; // S t a r t i n g Nodes o f t h e c o n n e c t i o n l i n e s
30 EndingNodesOfConnection =[2 3 4 5 6 7 8 9 10 11 12 13
14 15]; // Ending Node o f t h e c o n n e c t i o n
10
31 XCoordinatesOfNodes =[100 100 100 100 100 100 100 100
200 300 400 500 600 300 300]; // X−C o o r d i n a t e s
o f the nodes
32 YCoordinatesOfNodes =[300 400 500 600 700 800 900 950
300 400 500 600 700 800 900]; // Y−C o o r d i n a t e s
o f the nodes
33 [ TopologyGraph ]= NL_G_MakeGraph ( NameOfNetwork ,
NumberOfNodes , StartingNodesOfConnection ,
EndingNodesOfConnection , XCoordinatesOfNodes ,
YCoordinatesOfNodes ) // C r e a t e s t h e Bus t o p o p l o g y
34 WindowIndex =1; // Graph Window Number
35 [ Graphparameters ] = NL_G_ShowGraph ( TopologyGraph ,
WindowIndex ) ; // V i s u a l i z e t h e Graph a l o n g w i t h
i n d i c e s f o r Nodes and Edges
36 xtitle ( ” Bus T o p o l o g y ” ,”X−Nodes ” ,”Y−Nodes ” ) ;
37 // 2 . C o l o u r t h e n o d e s and Edges
38 NodeColor =30; // Node C o l o u r 2 : [ B l u e ] , 3 : [ Green ] , 5 : [
Red ]
39 BorderThickness =10; // Node B o r d e r t h i c k n e s s
40 NodeDiameter =25; // Node d i a m e t e r
41 WindowIndex =2; // window i n d e x
42 ListOfNodes =[1 2 4 6 8 10 12 14]; // l i s t o f n o d e s
43 [ graph1 , nodes ]= NL_G_HighlightNodes ( TopologyGraph ,
ListOfNodes , NodeColor , BorderThickness ,
NodeDiameter , WindowIndex ) ; // H i g h l i g h t t h e
s p e c i f i c n o d e s m e n t i o n e d i n t h e ’ nodes ’ v e c t o r
44 xtitle ( ” H i g h l i g h t t h e s p e c i f i c n o d e s m e n t i o n e d i n
t h e n o d e s v e c t o r ” ,”X−Nodes ” ,”Y−Nodes ” ) ;
45 NodeColor =5; // Edge C o l o u r
46 EdgeWidth =5; // Edge Width
48 ListOfEdges =[1 5 7]; // l i s t o f e d g e s
49 [ graph2 , nodes ]= NL_G_HighlightEdges ( TopologyGraph ,
ListOfEdges , NodeColor , EdgeWidth , WindowIndex ) ; //
H i g h l i g h t the s p e c i f i c nodes mentioned in the ’
edges ’ v e c t o r
50 xtitle ( ” H i g h l i g h t t h e s p e c i f i c n o d e s m e n t i o n e d i n
t h e e d g e s v e c t o r ” ,”X−Nodes ” ,”Y−Nodes ” ) ;
11
51 // 3 . D i s p l a y t h e node number and e d g e number
53 [ GraphVisualise ] = NL_G_ShowGraphNE ( TopologyGraph ,
WindowIndex ) ; // V i s u a l i z e t h e Graph a l o n g w i t h
54 xtitle ( ” Graph a l o n g w i t h i n d i c e s f o r Nodes and Edges
” ,”X−Nodes ” ,”Y−Nodes ” ) ;
55 // 4 . D i s p l a y t h e number o f n o d e s and e d g e s
56 [ ExtractedNode , ExtractedEdge ]= NL_G_GraphSize (
TopologyGraph ) ; // E x t r a c t t h e number o f n o d e s and
edges
57 disp ( ’ Number o f n o d e s : ’ , ExtractedNode ) ; // d i s p l a y
t h e number o f n o d e s and e d g e s
58 disp ( ’ Number o f e d g e s : ’ , ExtractedEdge ) ;
59
60 // 5 . D i s p l a y t h e Edge I n d e x b e t w e e n two n o d e s
61 StartingNode =4; // s t a r t i n g node
62 EndingNode =5; // e n d i n g node
63 [ GetEdgeIndex ]= NL_G_Nodes2Edge ( TopologyGraph ,
StartingNode , EndingNode ) ; // Get t h e Edge I n d e x
64 disp ( ’ I n d e x o f Edge a c r o s s n o d e s 4 and 5 : ’ ,
GetEdgeIndex ) ;
65
66 // 6 . D i s p l a y t h e l e n g t h o f e v e r y e d g e
67 [ EdgeLength ]= NL_G_EdgesLength ( TopologyGraph . node_x ,
TopologyGraph . node_y , TopologyGraph . head ,
TopologyGraph . tail ) ; // D i s p l a y t h e l e n g t h o f e v e r y
edge
68 disp ( ’ l e n g t h o f a l l e d g e s ’ , EdgeLength ) ;
69
70 // 7 . Return t h e s e t o f e d g e s c o n n e c t e d t o a node
i n s i d e a graph
71 NodeIndex =2; // node i n d e x
72 [ GetEdgeIndex ]= NL_G_EdgesOfNode ( TopologyGraph ,
NodeIndex ) ; // a p p l i c a t i o n o f NL G EdgesOfNode
73 disp ( ’ I n t e r n a l Edges o f node 2 : ’ , GetEdgeIndex ) ;
74
75 // 8 . E x t r a c t t h e d a t a f i e l d s o f t h e node
12
76 [ node_x , node_y , node_border , node_diameter , node_color ,
node_number ]= NL_G_NodeDataFields ( TopologyGraph ) ;
// E x t r a c t i n g t h e node d a t a f i e l d s
77 disp ( ’ Node x : ’ , XCoordinatesOfNodes ) ; // X
Coordinates
78 disp ( ’ Node y : ’ , YCoordinatesOfNodes ) ; // Y
Coordinates
79 disp ( ’ Node B o r d e r s : ’ , node_border ) ; // Node B o r d e r
80 disp ( ’ Node D i a m e t e r : ’ , node_diameter ) ; // D i a m e t e r
o f t h e node
81 disp ( ’ Node C o l o u r : ’ , node_color ) ; // Node c o l o u r
82 disp ( ’ Node Number : ’ , node_number ) ; // Number o f
Nodes
83
84 // 9 . E x t r a c t t h e d a t a f i e l d s o f t h e Edge
85 [ e_head , e_tail , e_color , e_width , e_length , e_weight ,
e_number ]= NL_G_EdgeDataFields ( TopologyGraph ) //
a p p l i c a t i o n o f NL G EdgeDataFields
86 disp ( ’ Head Nodes ’ , e_head ) ; // Head node d e t a i l s
87 disp ( ’ T a i l Nodes ’ , e_tail ) ; // T a i l Node d e t a i l s
88 disp ( ’ Edge C o l o u r s ’ , e_color ) ; // C o l o u r o f e d g e s
89 disp ( ’ Edge Widths ’ , e_width ) ; // Width o f e d g e s
90 disp ( ’ Edge L e n g t h s ’ , e_length ) ; // Length o f t h e
edges
91 disp ( ’ Edge W e i g h t s ’ , e_weight ) ; // Weight o f t h e e d g e s
92 disp ( ’ Edge Numbers ’ , e_number ) ; // Edge Number
13
Experiment: 2
Creation of the Ring topology
Scilab code Solution 2.1 Ring Topology Creation
1
2
3 // E x p e r i m e n t No . 2
CeCILL .
−en . t x t
, Professor ,
14
Figure 2.1: Ring Topology Creation
Figure 2.2: Ring Topology Creation
15
3.1
14 // Program t o 1 . c r e a t e and D i s p l a y Ring T o p o l o g y 2 .
C o l o u r t h e n o d e s 3 . D i s p l a y t h e node number and
e d g e number 4 . D i s p l a y t h e number o f n o d e s and
e d g e s 5 . i n s e r t new n o d e s i n t h e s p e c i f i e d e d g e
6 . i n s e r t new e d g e s 7 . D i s p l a y t h e number o f
n o d e s and e d g e s a g a i n a f t e r a d d i n g t h e n o d e s and
edges .
15
16 clear ;
17 clc ;
18
19 // 1 . c r e a t e and D i s p l a y Ring T o p o l o g y
20 NameOfNetwork = ’ Ring T o p o l o g y ’ ; // Name o f y o u r
network
22 ConnectionEndingNode =[1 2 3 4 5 6 7 8]; // Ending
Nodes o f t h e c o n n e c t i o n l i n e s
23 ConnectionStartingNode =[2 3 4 5 6 7 8 1]; // S t a r t i n g
Nodes o f t h e c o n n e c t i o n l i n e s
24 XCoordinatedOfNodes =[100 100 200 300 500 600 600
400]; // X−C o o r d i n a t e s o f t h e n o d e s
25 YCoordinatedOfNodes =[400 600 700 700 700 600 400
300]; // Y−C o o r d i n a t e s o f t h e n o d e s
NumberOfNodes , ConnectionEndingNode ,
ConnectionEndingNode , XCoordinatedOfNodes ,
YCoordinatedOfNodes ) // C r e a t e s t h e Ring t o p o p l o g y
27
29
30 [ VisualizeGraph1 ] = NL_G_ShowGraph ( TopologyGraph ,
WindowIndex ) ; // V i s u a l i z e t h e Graph
31
16
32 // 2 . C o l o u r t h e n o d e s
Red ]
37 ListOfNodes =[1 3 5 7]; // l i s t o f n o d e s
38 [ NodeHighlight , VisualizeGraph1 ]= NL_G_HighlightNodes (
TopologyGraph , ListOfNodes , NodeColor ,
BorderThickness , NodeDiameter , WindowIndex ) ; //
H i g h l i g h t the s p e c i f i e d nodes
39
40 WindoeIndex =3; // Graph Window Number
41 [ VisualizeGraph2 ] = NL_G_ShowGraphNE ( TopologyGraph ,
WindoeIndex ) ; // V i s u a l i z e t h e Graph a l o n g w i t h
42
44 [ ExtractNode , ExtractEdge ]= NL_G_GraphSize (
edges
45 disp ( ExtractNode , ExtractEdge ) ; // d i s p l a y t h e number
o f n o d e s and e d g e s
46
47 // 5 . i n s e r t new n o d e s i n t h e s p e c i f i e d e d g e
48 EdgeIndex =8; // e d g e i n d e x
49 NewNodeQuantity =3; // q u a n t i t y o f new n o d e s
50 [ go ]= NL_G_SplitEdge ( TopologyGraph , EdgeIndex ,
NewNodeQuantity ) ; // a p p l i c a t i o n o f N L G S p l i t E d g e
52 VisualizeGraph1 = NL_G_ShowGraphNE ( go , WindowIndex )
53
54 // 6 . i n s e r t new e d g e s
55 NewEdgeHeadVector =[9 7 8 1]; // head v e c t o r o f new
edges
56 NewEdgeTailVector =[5 3 3 6]; // t a i l v e c t o r o f new
edges
57 NewEdgeNameVector =[ ’ e 5 ’ ’ e 6 ’ ’ e 7 ’ ’ e 8 ’ ]; // name
17
v e c t o r o f new e d g e s
58 [ TopologyGraph ] = NL_G_AddEdges ( go ,
NewEdgeHeadVector , NewEdgeTailVector ,
NewEdgeNameVector ) ;
59 WindowIndex =4;
60 VisualizeGraph1 = NL_G_ShowGraphNE ( TopologyGraph ,
WindowIndex ) ;
61
62 // 7 . D i s p l a y t h e number o f n o d e s and e d g e s a g a i n
a f t e r a d d i n g t h e n o d e s and e d g e s .
edges
18
Experiment: 3
Creation of the Star topology
Scilab code Solution 3.1 Star Topology Creation
1 // E x p e r i m e n t No . 3
CeCILL .
−en . t x t
, Professor ,
19
Figure 3.1: Star Topology Creation
Figure 3.2: Star Topology Creation
20
3 . 1 / / Program t o 1 . C r e a t e and V i s u a l i z e t h e S t a r
T o p o l o g y // 2 . C o l o u r t h e n o d e s and v i s u a l i z e 3 .
D i s p l a y t h e node number and e d g e number 4 .
D i s p l a y t h e number o f n o d e s and e d g e s
12
13 clear ;
14 clc ;
15
16 // 1 . C r e a t e and V i s u a l i z e t h e S t a r T o p o l o g y
17 NameOfNetwork = ’ S t a r T o p o l o g y ’ ; // Name o f y o u r
network
19 EndingNodesOfEdge =[1 1 1 1 1 1 1 1]; // Ending Nodes
of the connection l i n e s
20 StartNodesOfEdge =[2 3 4 5 6 7 8 9]; // S t a r t i n g Nodes
of the connection l i n e s
NumberOfNodes , EndingNodesOfEdge , StartNodesOfEdge ,
XCoordinatesOfNodes , YCoordinatesOfNodes ) // C r e a t e s
the Star topoplogy
24 WindowNumber =1; // Graph Window Number
25 [ GraphVisualize ] = NL_G_ShowGraph ( TopologyGraph ,
WindowNumber ) ; // V i s u a l i z e t h e Graph
26 xtitle ( ” S t a r T o p o l o g y ” ,”X−Nodes ” ,”Y−Nodes ” ) ;
27 // 2 . C o l o u r t h e n o d e s and v i s u a l i z e
Red ]
31 WindowNumber =2; // window i n d e x
32
33 [ OutputGraph ]= NL_G_GraphEdgesLength ( TopologyGraph ) ;
21
34
35 disp ( OutputGraph ) ;
36
37 disp ( ’ Edge Length ’ , OutputGraph . edge_length ) ;
38
39 ListOfNodes =[1 3 5 7]; // l i s t o f n o d e s
40 [ NodeHighlight , f2 ]= NL_G_HighlightNodes ( TopologyGraph
, ListOfNodes , NodeColor , BorderThickness ,
NodeDiameter , WindowNumber ) ; // H i g h l i g h t t h e
s p e c i f i e d nodes
41 xtitle ( ” Node H i g l i g h t ” ,”X−Nodes ” ,”Y−Nodes ” ) ;
43 [ VisualizeNodesEdges ] = NL_G_ShowGraphNE (
TopologyGraph , WindowNumber ) ; // V i s u a l i z e t h e
Graph a l o n g w i t h i n d i c e s f o r Nodes and Edges
44
edges
47
edges
50 disp ( ’ Number o f n o d e s : ’ , ExtractNode ) ; // d i s p l a y t h e
number o f n o d e s and e d g e s
51 disp ( ’ Number o f e d g e s : ’ , ExtractEdge ) ;
52 // 5 . D i s p l a y t h e Edge I n d e x b e t w e e n two n o d e s
53 StartingNode =4; // s t a r t i n g node
54 EndingNode =1; // e n d i n g node
55 xtitle ( ” Edge I n d e x ” ,”X−Nodes ” ,”Y−Nodes ” ) ;
56 [ EdgeIndex ]= NL_G_Nodes2Edge ( TopologyGraph ,
StartingNode , EndingNode ) ; // Get t h e Edge I n d e x
57 disp ( ’ I n d e x o f Edge a c r o s s n o d e s 4 and 1 : ’ , EdgeIndex
);
22
Experiment: 4
Creation of the Mesh topology
Scilab code Solution 4.1 Mesh Topology Creation
1 // E x p e r i m e n t No . 4
CeCILL .
−en . t x t
, Professor ,
23
Figure 4.1: Mesh Topology Creation
Figure 4.2: Mesh Topology Creation
24
3.1
12 // Program t o 1 . C r e a t e and v i s u a l i z e a g r a p h w i t h
Mesh T o p o l o g y 2 . C o l o u r t h e n o d e s 3 . V i s u a l i z e
t h e Graph w i t h node number and e d g e number 4 .
D i s p l a y t h e number o f n o d e s and e d g e s i n s c i l a b
prompt 5 . D i s p l a y t h e l e n g t h o f e v e r y e d g e i n
S c i l a b prompt 6 . D i s p l a y t h e s e t o f e d g e s
c o n n e c t e d t o a node i n s i d e a g r a p h i n S c i l a b
Prompt
13
14 clear ;
15 clc ;
16
17 // 1 . C r e a t e and v i s u a l i z e a g r a p h w i t h Mesh T o p o l o g y
18 NameOfNetwork = ’ Mesh T o p o l o g y ’ ; // Name o f y o u r
network
20 EndingNodesOfEdge =[1 1 1 1 1 2 2 2 2 2 3 3 3 3 3 4 4
4 4 4 5 5 5 5 5 6 6 6 6 6]; // Ending Nodes o f
the connection l i n e s
21 StartNodesOfEdge =[2 3 4 5 6 2 3 4 5 6 2 3 4 5 6 2 3
4 5 6 2 3 4 5 6 2 3 4 5 6]; // S t a r t i n g Nodes o f
the connection l i n e s
22 XCoordinatesOfNodes =[300 300 400 500 500 400]; // X−
Coordinates o f the nodes
23 YCoordinatesOfNodes =[500 700 800 700 500 400]; // Y−
Coordinates o f the nodes
XCoordinatesOfNodes , YCoordinatesOfNodes ) // C r e a t e s
t h e Mesh t o p o p l o g y
26 [ GraphVisualize ] = NL_G_ShowGraph ( TopologyGraph ,
WindowNumber ) ; // V i s u a l i z e t h e Graph
27 xtitle ( ” MeshTopology ” ,”X−Nodes ” ,”Y−Nodes ” ) ;
28 // 2 . C o l o u r t h e n o d e s
25
Red ]
33 ListOfNodes =[1 3 5]; // l i s t o f n o d e s
34
35 [ NodeHighlight , Graph1 ]= NL_G_HighlightNodes (
TopologyGraph , ListOfNodes , NodeColor ,
BorderThickness , NodeDiameter , WindowNumber ) ; //
H i g h l i g h t t h e s p e c i f i e d n o d e s and o u t p u t a g r a p h
36
37 // 3 . V i s u a l i z e t h e Graph w i t h node number and e d g e
number
38 xtitle ( ” Node H i g h l i g h t ” ,”X−Nodes ” ,”Y−Nodes ” ) ;
41 xtitle ( ” Edge i n d e x ” ,”X−Nodes ” ,”Y−Nodes ” ) ;
42 // 4 . D i s p l a y t h e number o f n o d e s and e d g e s i n s c i l a b
prompt
edges
45
46 // 5 . D i s p l a y t h e l e n g t h o f e v e r y e d g e i n S c i l a b
prompt
47 [ ExtractEdge ]= NL_G_EdgesLength ( TopologyGraph . node_x ,
TopologyGraph . node_y , TopologyGraph . head ,
TopologyGraph . tail ) ; // D i s p l a y t h e l e n g t h o f e v e r y
edge
48 disp ( ’ l e n g t h o f a l l e d g e s ’ , ExtractEdge ) ;
49
50 // 6 . D i s p l a y t h e s e t o f e d g e s c o n n e c t e d t o a node
i n s i d e a g r a p h i n S c i l a b Prompt
26
51 NodeIndex =2; // node i n d e x
52 [ EdgeApplication ]= NL_G_EdgesOfNode ( TopologyGraph ,
NodeIndex ) ; // a p p l i c a t i o n o f NL G EdgesOfNode
53 disp ( ’ I n t e r n a l Edges o f node 2 : ’ , EdgeApplication ) ;
27
Experiment: 5
Creation of Tree topology
Scilab code Solution 5.1 Treee Topology
1 // E x p e r i m e n t No . 5
CeCILL .
−en . t x t
, Professor ,
28
Figure 5.1: Treee Topology
Figure 5.2: Treee Topology
29
3.1
12 // Program t o 1 . c r e a t e and D i s p l a y T r e e T o p o l o g y 2 .
C o l o u r t h e n o d e s 3 . D i s p l a y t h e node number and
e d g e number 4 . D i s p l a y t h e number o f n o d e s and
edges
13
14 clear ;
15 clc ;
16 NameOfNetwork = ’ T r e e T o p o l o g y ’ ; // g r a p h name
17 NumberOfNodes =7; // no . o f n o d e s
18 // e v e r y e d g e h a s head and t a i l .
19 EndingNodesOfEdge =[1 1 2 2 3 3]; // t a i l o f e a t c h
edge , t h i s i s a node from a e d g e o r l i n k i s
originating
20 StartNodesOfEdge =[2 3 4 5 6 7]; // head o f e a c h edge ,
t h i s i s a node where e d g e o r l i n k i s t e r m i n a t i n g
21 XCoordinatesOfNodes =[500 300 700 200 400 600 800]; //
x−c o o r d i n a t e o f e a c h node
22 YCoordinatesOfNodes =[950 800 800 700 700 700 700]; //
y−c o o r d i n a t e o f e a c h node
XCoordinatesOfNodes , YCoordinatesOfNodes ) //
a p p l i c a t i o n o f NL G MakeGraph
25 GraphVisualize = NL_G_ShowGraphN ( TopologyGraph ,
WindowNumber ) ; // g r a p h v i s u a l i z a t i o n
26 xtitle ( ” T r e e T o p o l o g y ” ,”X−Nodes ” ,”Y−Nodes ” ) ;
Red ]
31 NumberOfNodes =[1 3 5]; // l i s t o f n o d e s
32
33 [ NodeHighlight , Nodes ]= NL_G_HighlightNodes (
30
TopologyGraph , NumberOfNodes , NodeColor ,
BorderThickness , NodeDiameter , WindowNumber ) ; //
H i g h l i g h t the s p e c i f i e d nodes
34 xtitle ( ” Node H i g h l i g h t ” ,”X−Nodes ” ,”Y−Nodes ” ) ;
edges
39 xtitle ( ” I n d i c e s f o r Nodes and Edges ” ,”X−Nodes ” ,”Y−
Nodes ” ) ;
31
Experiment: 6
Finding the Shortest Path in

Bus topology
Scilab code Solution 6.1 Shortest Path in Bus Topology
1 // E x p e r i m e n t No . 6
CeCILL .
−en . t x t
, Professor ,
32
Figure 6.1: Shortest Path in Bus Topology
Figure 6.2: Shortest Path in Bus Topology
33
3 . 1 / / T h i s Program i s W r i t t e n by S o u a r v kumar
S u r y a ( 1 5 b c e 1 3 6 4 ) , Prayag B h a t i a ( 1 5 b c e 1 3 6 3 ) , Maaz
Ahmed ( 1 5 b c e 1 2 6 1 ) , S c h o o l o f Computing S c i e n c e
and E n g i n e e r i n g , VIT U n i v e r s i t y Chennai u s i n g t h e
NARVAL e x a m p l e s o f S c i l a b f o r f i n d i n g t h e
s h o r t e s t path
12 // T h i s i s t h e s c i l a b c o d e t o f i n d t h e S h o r t e s t p a t h
from s o u r c e t o d e s t i n a t i o n i n bus t o p o l o g y
n e t w o r k u s i n g f l o o d f o r 12 n o d e s .
13 clear ;
14 clc ;
15 NameOfNetwork = ’ S h o r t e s t p a t h from s−−>d i n bus
t o p o l o g y w i t h 12 n o d e s u s i n g f l o o d ’ ; // g r a p h name
18 EndingNodesOfConnection =[1 2 3 4 5 6 2 3 4 5 6]; //
Ending Node o f t h e c o n n e c t i o n
19 StartNodesOfConnection =[2 3 4 5 6 7 8 9 10 11 12]; //
S t a r t i n g Nodes o f t h e c o n n e c t i o n l i n e s
20 // so , an e d g e can be r e p r e s e n t a s ( t a i l , head ) , t a i l
and head b o t h a r e node no . e g . : t a i l [ 1 ] = 2 , head
[ 1 ] = 1 means e d g e 1 i s o r i g i n a t i n g from 2 and
t e r m i n a t i n g on 1 t h a t i m p l i e s t h e r e i s an e d g e
betweem node 1 and node 2
300 400 550 600]; // x−c o o r d i n a t e o f e a c h node
500 200 600 100]; // y−c o o r d i n a t e o f e a c h node
NumberOfNodes , EndingNodesOfConnection ,
StartNodesOfConnection , XCoordinatesOfNodes ,
YCoordinatesOfNodes ) // C r e a t e s t h e Bus t o p o p l o g y
24 NetworkSize = length ( TopologyGraph . node_x ) ; // R e a l
network s i z e
34
25 NeworkLinkQuantity = length ( TopologyGraph . head ) ; //
Quantity o f network l i n k s
26 [ ne , nr ]= NL_F_RandIntNiNj ( NetworkSize ) //Random
S e l e c t i o n o f two d i s t i n c t n o d e s
27 TimeToLive =15; // Time−To−L i v e u p d a t e
28 [ path ]= NL_R_Flood ( TopologyGraph , ne , nr , TimeToLive ) //
A p p l i c a t i o n o f NL R Flood
29 ShortestPathLinks = NL_G_Nodes2Path ( path , TopologyGraph
) ; // L i n k s o f t h e s h o r t e s t p a t h
30 EdgeColor = ones (1 , NeworkLinkQuantity ) ; // D i s p l a y t h e
p a t h b e t w e e n i and j : e d g e c o l o r
31 EdgeBorder =1.5* ones (1 , NeworkLinkQuantity ) ; // Edge
width
32 EdgeColor ( ShortestPathLinks ) =5; // D e f i n e p a t h c o l o r
33 EdgeBorder ( ShortestPathLinks ) =5; // D e f i n e w i d t h
34 NodeBorder =4* ones (1 , NetworkSize ) ; // Node b o r d e r
35 NodeBorder ( path ) =10; // Node b o r d e r f o r s o u r c e t o
d e s t i n a t i o n path
36 TopologyGraph . node_border = NodeBorder ; // Node b o r d e r
37 TopologyGraph . edge_color = EdgeColor ; // D e f i n e e d g e
color
38 TopologyGraph . edge_width = EdgeBorder ; // Edge w i d t h
39 windownumber =1; // window i n d e x
windownumber ) ; // g r a p h v i s u a l i z a t i o n
41 xtitle ( ” S h o r t e s t p a t h i n Bus T o p o l o g y n e t w o r k u s i n g
f l o o d f o r 12 n o d e s ” ,”X−Nodes ” ,”Y−Nodes ” ) ;
42
43 // T h i s i s s c i l a b c o d e t o f i n d t h e S h o r t e s t p a t h from
s o u r c e t o d e s t i n a t i o n i n bus t o p o l o g y n e t w o r k
u s i n g f l o o d f o r 30 n o d e s .
44 NameofNetwork = ’ S h o r t e s t p a t h from s−−>d i n bus
t o p o l o g y w i t h 30 n o d e s u s i n g f l o o d ’ ; // g r a p h name
46 // e v e r y e d g e h a s S t a r t i n g N o d e s O f C o n n e c t i o n and t a i l .
47 EndingNodesOfConnection =[1 2 23 3 29 4 24 5 6 25 7
13 14 15 16 2 23 3 29 4 24 5 6 25 7 13 14 15 16];
// t a i l o f e a t c h edge , t h i s i s a node from a e d g e
35
or l i n k i s o r i g i n a t i n g
48 StartingNodesOfConnection =[2 23 3 29 4 24 5 6 25 7
13 14 15 16 17 8 26 9 30 10 27 11 12 28 18 19 20
21 22]; // head o f e a c h edge , t h i s i s a node where
edge or l i n k i s t e r m i n a t i n g
300 400 550 600 750 800 850 900 950 700 750 800
850 900 200 500 650 200 500 650 350 350]; // x−
c o o r d i n a t e o f e a c h node
500 200 600 100 300 300 300 300 300 200 400 500
100 100 300 300 300 500 200 250 300 100]; // y−
52 [ TopologyGraph ]= NL_G_MakeGraph ( NameofNetwork ,
StartingNodesOfConnection , XCoordinatesOfNodes ,
YCoordinatesOfNodes ) // a p p l i c a t i o n o f
NL G MakeGraph
53 NetworkSize = length ( TopologyGraph . node_x ) ; // r e a l
network s i z e
54 NeworkLinkQuantity = length ( TopologyGraph . head ) ; //
q u a n t i t y o f network l i n k s
55 [ Node1 , Node2 ]= NL_F_RandIntNiNj ( NetworkSize ) //
s e l e c t i o n o f two d i s t i n c t n o d e s
56 TTL =15; // Time−To−L i v e u p d a t e
57 [ path ]= NL_R_Flood ( TopologyGraph , Node1 , Node2 , TTL ) //
a p p l i c a t i o n o f NL R Flood
58 ShortestPathLinks = NL_G_Nodes2Path ( path , TopologyGraph
) ; // l i n k s o f t h e s h o r t e s t p a t h
59 EdgeColor = ones (1 , NeworkLinkQuantity ) ; // d i s p l a y t h e
p a t h b e t w e e n i and j : e d g e c o l o r
60 EdgeBorder =1.5* ones (1 , NeworkLinkQuantity ) ; // e d g e
width
36
61 EdgeColor ( ShortestPathLinks ) =5; // d e f i n e p a t h c o l o r
62 EdgeBorder ( ShortestPathLinks ) =5; // d e f i n e w i d t h
63 NodeBorder =4* ones (1 , NetworkSize ) ; // node b o r d e r
64 NodeBorder ( path ) =10; // node b o r d e r f o r s o u r c e t o
65 TopologyGraph . node_border = NodeBorder ; // node b o r d e r
66 TopologyGraph . edge_color = EdgeColor ; // d e f i n e e d g e
color
67 TopologyGraph . edge_width = EdgeBorder ; // e d g e w i d t h
WindowIndex ) ; // g r a p h v i s u a l i z a t i o n
70 xtitle ( ” S h o r t e s t p a t h i n Bus T o p o l o g y n e t w o r k u s i n g
37
Experiment: 7

Ring topology
Scilab code Solution 7.1 Shortest Path in Ring Topology
1 // E x p e r i m e n t No . 7
CeCILL .
−en . t x t
, Professor ,
38
NARVAL e x a m p l e s o f S c i l a b
from s o u r c e t o d e s t i n a t i o n i n r i n g t o p o l o g y
13 clear ;
14 clc ;
15
16 NameOfNetwork = ’ s h o r t e s t p a t h from s o u r c e t o
d e s t i n e t i o n i n r i n g t o p o l o g y w i t h 10 n o d e s u s i n g
f l o o d ’ ; // g r a p h name
19 EndingNodesOfConnection =[2 3 5 5 6 4 9 7 8 6]; //
t a i l o f e a t c h edge , t h i s i s a node from a e d g e o r
link is originating
20 StartNodesOfConnection =[1 1 3 4 2 9 7 8 10 10]; //
head o f e a c h edge , t h i s i s a node where e d g e o r
link is terminating
500 550]; // x−c o o r d i n a t e o f e a c h node
600 300]; // y−c o o r d i n a t e o f e a c h node
NL G MakeGraph
network s i z e
39
26 NetworkQuantity = length ( TopologyGraph . head ) ; //
29 [ path ]= NL_R_Flood ( TopologyGraph , Node1 , Node2 ,
TimeToLive ) // a p p l i c a t i o n o f NL R Flood
30 ShortestPath = NL_G_Nodes2Path ( path , TopologyGraph ) ; //
l i n k s o f the s h o r t e s t path
31 EdgeColor = ones (1 , NetworkQuantity ) ; // d i s p l a y t h e p a t h
b e t w e e n i and j : e d g e c o l o r
32 EdgeBorder =1.5* ones (1 , NetworkQuantity ) ; // e d g e w i d t h
33 EdgeColor ( ShortestPath ) =5; // d e f i n e p a t h c o l o r
34 EdgeBorder ( ShortestPath ) =5; // d e f i n e w i d t h
color
40 WinodeNumber =1; // window i n d e x
WinodeNumber ) ; // g r a p h v i s u a l i z a t i o n
42 xtitle ( ” S h o r t e s t p a t h i n Ring T o p o l o g y n e t w o r k u s i n g
from s o u r c e t o d e s t i n a t i o n i n r i n g t o p o l o g y
d e s t i n e t i o n i n r i n g t o p o l o g y w i t h 30 n o d e s u s i n g
3 13 1 1 15 17 18 19 20 6 22 21 23 26 27 24 30 29
28 30]; // t a i l o f e a t c h edge , t h i s i s a node
from a e d g e o r l i n k i s o r i g i n a t i n g
40
48 StartNodesOfConnection =[1 2 17 7 19 10 5 16 4 12 3
13 14 14 15 2 18 9 8 6 22 21 23 26 27 24 25 29 28
10 25]; // head o f e a c h edge , t h i s i s a node where
edge or l i n k i s t e r m i n a t i n g
600 900 100 100 150 150 300 300 400 500 750 500
700 650 800 900 900 900 900 950 1000 950]; // x−
700 600 600 500 300 200 100 700 700 700 650 100
100 100 100 300 400 100 200 550 500 400]; // y−
NL G MakeGraph
network s i z e
41
Figure 7.1: Shortest Path in Ring Topology

color
70 xtitle ( ” S h o r t e s t p a t h i n Ring T o p o l o g y n e t w o r k u s i n g
42
Figure 7.2: Shortest Path in Ring Topology
43
Experiment: 8

Star topology
Scilab code Solution 8.1 Shortest Path in Star Topology
1 // E x p e r i m e n t No . 8
CeCILL .
−en . t x t
, Professor ,
44
Figure 8.1: Shortest Path in Star Topology
from s o u r c e t o d e s t i n a t i o n i n S t a r t o p o l o g y
13 clear ;
14 clc ;
15
16 NameOfNetwork = ’ s t a r n e t w o r k w i t h 10 node ’ ; // g r a p h
name
17 NumberOfNodes =10; // no o f n o d e s
19 EndingNodesOfConnection =[6 6 6 6 6 6 6 6 6 ]; // t a i l
o f e a t c h edge , t h i s i s a node from a e d g e o r
link is originating
20 StartNodesOfConnection =[1 2 3 4 5 7 8 9 10]; // head
o f e a c h edge , t h i s i s a node where e d g e o r l i n k i s
45
terminating
400 600]; // x−c o o r d i n a t e o f e a c h node
500 600]; // y−c o o r d i n a t e o f e a c h node
24 // node i can r e p r e s e n t a s n o d e x [ i ] , n o d e y [ i ]
NL G MakeGraph
network s i z e
color
46
43
44 xtitle ( ” S h o r t e s t p a t h i n S t a r T o p o l o g y n e t w o r k u s i n g
45
from s o u r c e t o d e s t i n a t i o n i n S t a r t o p o l o g y
47
48 NameOfNetwork = ’ s t a r n e t w o r k w i t h 30 node ’ ; // g r a p h
name
49 NumberOfNodes =30; // no o f n o d e s
51 EndingNodesOfConnection =[6 6 6 6 6 6 6 6 6 6 6 6 6 6
6 6 6 6 6 6 6 6 6 6 6 6 6 6 6]; // t a i l o f e a t c h
edge , t h i s i s a node from a e d g e o r l i n k i s
originating
52 StartNodesOfConnection =[1 2 3 4 5 7 8 9 10 11 12 13
14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29
30]; // head o f e a c h edge , t h i s i s a node where e d g e
or l i n k i s terminating
400 600 300 200 500 400 700 800 900 850 950 450
550 650 350 250 150 725 825 925 300 650]; // x−
500 600 250 350 700 300 200 500 400 600 700 700
350 550 450 235 750 100 353 770 400 950]; // y−
47
NL G MakeGraph
network s i z e
color
75 xtitle ( ” S h o r t e s t p a t h i n s t a r T o p o l o g y n e t w o r k u s i n g
48
Figure 8.2: Shortest Path in Star Topology
49
Experiment: 9

Mesh topology
Scilab code Solution 9.1 Shortest Path in Mesh Topology
1 // E x p e r i m e n t No . 9
CeCILL .
−en . t x t
, Professor ,
50
Figure 9.1: Shortest Path in Mesh Topology
Figure 9.2: Shortest Path in Mesh Topology
51
from s o u r c e t o d e s t i n a t i o n i n Mesh t o p o l o g y
13 clear ;
14 clc ;
15
16 NameOfNetwork = ’ mesh t o p o l o g y w i t h 11 n o d e s ’ ; // g r a p h
name
7 7 7 7 7 7 8 8 8 8 8 8 8 9 9 9 9 9 9 9 9 10 10
10 10 10 10 10 10 10 11 11 11 11 11 11 11 11 11
11]; // t a i l o f e a t c h edge , t h i s i s a node from a
edge or l i n k i s o r i g i n a t i n g
20 StartNodesOfConnection =[1 2 3 1 2 1 2 3 4 1 2 3 4 5
1 2 3 4 5 6 1 2 3 4 5 6 7 1 2 3 4 5 6 7 8 1 2 3 4
5 6 7 8 9 1 2 3 4 5 6 7 8 9 10]; // head o f e a c h
edge , t h i s i s a node where e d g e o r l i n k i s
terminating
700 450 800]; // x−c o o r d i n a t e o f e a c h node
52
700 450 650]; // y−c o o r d i n a t e o f e a c h node
NL G MakeGraph
network s i z e
34 EdgeBorder ( ShortestPath ) =5; // d e f i n e w i d t h c o l o r
color
42 xtitle ( ” S h o r t e s t p a t h i n mesh T o p o l o g y n e t w o r k u s i n g
from s o u r c e t o d e s t i n a t i o n i n Mesh t o p o l o g y
44 NameOfNetwork = ’ mesh t o p o l o g y w i t h 15 n o d e s ’ ; // g r a p h
53
name
7 7 7 7 7 7 8 8 8 8 8 8 8 9 9 9 9 9 9 9 9 10 10
10 10 10 10 10 10 10 11 11 11 11 11 11 11 11 11
11 12 12 12 12 12 12 12 12 12 12 12 13 13 13 13
13 13 13 13 13 13 13 13 14 14 14 14 14 14 14 14
14 14 14 14 14 15 15 15 15 15 15 15 15 15 15 15
15 15 15]; // t a i l o f e a t c h edge , t h i s i s a node
from a e d g e o r l i n k i s o r i g i n a t i n g
48 StartNodesOfConnection =[1 2 3 1 2 1 2 3 4 1 2 3 4 5
1 2 3 4 5 6 1 2 3 4 5 6 7 1 2 3 4 5 6 7 8 1 2 3 4
5 6 7 8 9 1 2 3 4 5 6 7 8 9 10 1 2 3 4 5 6 7 8 9
10 11 1 2 3 4 5 6 7 8 9 10 11 12 1 2 3 4 5 6 7 8
9 10 11 12 13 1 2 3 4 5 6 7 8 9 10 11 12 13 14];
// head o f e a c h edge , t h i s i s a node where e d g e o r
link is terminating
700 450 800 900 600 600 200]; // x−c o o r d i n a t e o f
e a c h node
700 450 650 900 500 400 300]; // y−c o o r d i n a t e o f
e a c h node
NL G MakeGraph
network s i z e
54
63 EdgeBorder ( ShortestPath ) =5; // d e f i n e w i d t h c o l o r
color
71 xtitle ( ” S h o r t e s t p a t h i n mesh T o p o l o g y n e t w o r k u s i n g
55
Experiment: 10

Tree topology
Scilab code Solution 10.1 Shortest Path in Tree Topology
1 // E x p e r i m e n t No . 1 0
CeCILL .
−en . t x t
, Professor ,
56
Figure 10.1: Shortest Path in Tree Topology
from s o u r c e t o d e s t i n a t i o n i n T r e e t o p o l o g y
13 clear ;
14 clc ;
15
d e s t i n e t i o n i n s t a r t o p o l o g y w i t h 14 n o d e s u s i n g
17 NumberOfNodes =14; // g r a p h p a r a m e t e r s
13 13]; // t a i l o f e a t c h edge , t h i s i s a node from
a edge or l i n k i s o r i g i n a t i n g
57
4]; // head o f e a c h edge , t h i s i s a node where e d g e
or l i n k i s terminating
600 400 700 600 650 850]; // x−c o o r d i n a t e o f e a c h
node
350 550 750 850 550 550]; // y−c o o r d i n a t e o f e a c h
node
NL G MakeGraph
network s i z e
58
color
42 xtitle ( ” S h o r t e s h Path i n T r e e T o p o l o g y f o r 14 Nodes ”
,”X−Nodes ” ,”Y−Nodes ” )
43
from s o u r c e t o d e s t i n a t i o n i n T r e e t o p o l o g y
d e s t i n e t i o n i n t r e e t o p o l o g y w i t h 30 n o d e s u s i n g
13 13 15 16 17 18 19 20 21 22 23 24 25 26 27 28 9
5]; // t a i l o f e a t c h edge , t h i s i s a node from a
edge or l i n k i s o r i g i n a t i n g
4 2 15 16 5 18 13 13 14 22 11 14 25 8 12 29 30];
// head o f e a c h edge , t h i s i s a node where e d g e o r
link is terminating
600 400 700 600 650 850 500 600 700 300 200 700
500 900 900 700 950 900 900 600 600 150]; // x−
350 550 750 850 550 550 150 100 100 600 700 400
700 650 800 900 500 400 900 950 250 500]; // y−
59
NL G MakeGraph
54
network s i z e
color
72
73 xtitle ( ” S h o r t e s h Path i n T r e e T o p o l o g y f o r 30 Nodes ”
,”X−Nodes ” ,”Y−Nodes ” )
60
Figure 10.2: Shortest Path in Tree Topology
61
Experiment: 11
Creating a Network Square

Area & Coloured Network
Topology Creation
Scilab code Solution 11.1 Creation of Network Square Area and Coloured
Network Topology
1 // E x p e r i m e n t No . 1 1
CeCILL .
−en . t x t
, Professor ,
62
Figure 11.1: Creation of Network Square Area and Coloured Network Topol-
ogy
Figure 11.2: Creation of Network Square Area and Coloured Network Topol-
ogy
63
3 . 1 / / T h i s Program i s W r i t t e n by Dr . T .
Subbulaskhmi , P r o f e s s o r , S c h o o l o f Computing
S c i e n c e and E n g i n e e r i n g , VIT U n i v e r s i t y Chennai
u s i n g t h e NARVAL e x a m p l e s o f S c i l a b f o r Network
T o p o l o g y C r e a t i o n and d i s p l a y u s i n g v a r i o u s
methods
12
13 // 1 . T o p o l o g y c r e a t i o n and c o l o u r i n g u s i n g g r i d
method 2 . T o p o l o g y c r e a t i o n and c o l o u r i n g u s i n g
random method 3 . T o p o l o g y C r e a t i o n u s i n g d e t a i l e d
method
14
15
16 // 1 . T o p o l o g y c r e a t i o n and c o l o u r i n g u s i n g g r i d
method
17 clear ;
18 clf ;
19
20 NumberOfRows =10; // number o f r o w s
21 NumberOfColumns =10; // number o f c o l u m n s
22 XCoordinatesOfArea =1000; // Area o f n e t w o r k x
coordinates
23 YCoordinatesOfArea =1000; // Area o f n e t w o r k y
coordinates
24 radius = 100;
25 colour = 2;
26 [ TopologyGraph ]= NL_T_Grid ( NumberOfRows ,
NumberOfColumns , XCoordinatesOfArea ,
YCoordinatesOfArea ) ; // g e n e r a t i o n o f a t o p o l o g y
i n r e s p e c t w i t h t h e g r i d method
64
28 NameOfNetwork = ” Network C r e a t e d w i t h G r i d and
Showgraph method ” ;
29 InitialSquareArea = NL_M_Background ( WindowIndex ,
NameOfNetwork ) ; // i n i t i a l s q u a r e a r e a
30
31 xlabel ( ” x c o o r d i n a t e s o f node ” , ” f o n t s i z e ” , 2)
32 ylabel ( ”Y c o o r d i n a t e s o f node ” ) ;
33
34 InitialSquareArea = NL_M_GraphDisplayUpdate (
TopologyGraph , WindowIndex , radius , colour ) ;
35
36 // 2 . T o p o l o g y c r e a t i o n and c o l o u r i n g u s i n g random
method
37 NetworkSize =5; // n e t w o r k s i z e
38 NetworkAreaSide =1000; // n e t w o r k s q u a r e d a r e a s i d e
39 LocalityRadius =1000; // L o c a l i t y r a d i u s
40 [ TopologyGraph ]= NL_T_LocalityConnex ( NetworkSize ,
NetworkAreaSide , LocalityRadius ) ; // g e n e r a t i o n o f a
topology
42 InitialSquareArea = NL_G_ShowGraphN ( TopologyGraph ,
43 xtitle ( ” Channel C r e a t i o n ” ,”X−Node ” ,”Y−Node ” ) ;
44 [ go ,n , e ]= NL_G_WCDS ( TopologyGraph )
45 ListOfChannels =[2]; // l i s t o f c h a n e l s
46 [ goc ]= NL_G_WCDSChannel ( go , NetworkSize ,e ,
ListOfChannels ) ; // a p p l i c a t i o n o f NL G WCDSChannel
48 InitialSquareArea = NL_G_ShowGraph ( goc , WindowIndex ) ; //
graph v i s u a l i z a t i o n
49 xtitle ( ” Channel C r e a t i o n ” ,”X−Node ” ,”Y−Node ” ) ;
50 disp ( go , NetworkSize ,e , ListOfChannels ) ;
51
52
53 // 3 . T o p o l o g y C r e a t i o n u s i n g d e t a i l e d method
54 NameOfNetwork = ’ D e t a i l e d t o p o l o g y ’ ; // Name o f y o u r
network
55 NetworkSize =8; // Number o f Nodes i n t h e n e t w o r k
65
56 StartingNodes =[1 2 3 4 1 2 3 4 6 7 8 6 7 8]; //
S t a r t i n g Nodes o f t h e c o n n e c t i o n l i n e s
57 EndingNodes =[2 3 4 5 3 6 7 8 2 4 5 1 2 3]; // Ending
Node o f t h e c o n n e c t i o n
58 XCoordinatesOfNode =[100 200 500 300 400 600 700
59 YCoordinatesOfNode =[300 400 500 600 700 800 900
60 [ g1 ]= NL_G_MakeGraph ( NameOfNetwork , NetworkSize ,
StartingNodes , EndingNodes , XCoordinatesOfNode ,
YCoordinatesOfNode ) // C r e a t e s t h e Bus t o p o p l o g y
62 [ f1 ] = NL_G_ShowGraph ( g1 , WindowIndex ) ; // V i s u a l i z e
t h e Graph a l o n g w i t h i n d i c e s f o r Nodes and Edges
63 xtitle ( ” Bus T o p o l o g y C r e a t i o n ” ,”X−Node ” ,”Y−Node ” ) ;
64 NumberOfLines =5; // number o f l i n e s
66 XCoordinatesOfArea =1000; // n e t w o r k a r e a x−s i d e
67 YCoordinatesOfArea =1000; // n e t w o r k a r e a x−s i d e
68 [ TopologyGraph ]= NL_T_Grid ( NumberOfLines ,
YCoordinatesOfArea ) ; // g e n e r a t i o n o f a t o p o l o g y i n
r e s p e c t w i t h t h e g r i d method
69 WIndowIndex =5; // window i n d e x
70 [ f ]= NL_G_ShowGraph ( TopologyGraph , WIndowIndex ) ; //
a p p l i c a t i o n o f NL G ShowGraph
71 xtitle ( ” Nodes m e n t i o n e d i n node v e c t o r a r e a s q u a e
1 0 0 0 ” ,”X−Node ” ,”Y−Node ” ) ;
78 [ f ]= NL_G_ShowGraph ( TopologyGraph , WindowIndex ) ; //
66
79 xtitle ( ” Nodes m e n t i o n e d i n node v e c t o r ” ,”X−Node ” ,”Y−
Node ” ) ;
80
87 [ f ]= NL_G_ShowGraph ( TopologyGraph , WindowIndex ) ; //
88 xtitle ( ” T o p o l o g y G e n e r a t i o n G r i d Method ” ,”X−Node ” ,”Y
−Node ” ) ;
edges
91 disp ( ’ Number o f n o d e s : ’ , ExtractNode ) ; // d i s p l a y t h e
number o f n o d e s and e d g e s
92 disp ( ’ Number o f e d g e s : ’ , ExtractEdge ) ;
93
94 // 2 . C o l o u r t h e n o d e s and Edges
Red ]
99 nodes =[1 2 4 6 8 10 12 14]; // l i s t o f n o d e s
100 [ GraphHighlight , NodeVector ]= NL_G_HighlightNodes (
TopologyGraph , nodes , NodeColor , BorderThickness ,
NodeDiameter , WindowIndex ) ; // H i g h l i g h t t h e
s p e c i f i c n o d e s m e n t i o n e d i n t h e ’ nodes ’ v e c t o r
101 xtitle ( ” Nodes m e n t i o n e d i n node v e c t o r ” ,”X−Node ” ,”Y−
Node ” ) ;
67
102 EdgeColor =5; // Edge C o l o u r
103 EdgeWidth =5; // Edge Width
104 WIndowIndex =9; // window i n d e x
105 edges =[1 5 7]; // l i s t o f e d g e s
106 [ GraphHighlight , NodeVector ]= NL_G_HighlightEdges (
GraphHighlight , edges , EdgeColor , EdgeWidth ,
WIndowIndex ) ; // H i g h l i g h t t h e s p e c i f i c n o d e s
mentioned in the ’ edges ’ v e c t o r
107 xtitle ( ” Nodes m e n t i o n e d i n e d g e v e c t o r ” ,”X−Node ” ,”Y−
Node ” ) ;
68
Experiment: 12
Finding the shortest path by

using Dijikstra’s Algorithm
Scilab code Solution 12.1 Shortest path using Dijikstras Algorithm
1 // E x p e r i m e n t No . 1 2
CeCILL .
−en . t x t
, Professor ,
69
Figure 12.1: Shortest path using Dijikstras Algorithm
Figure 12.2: Shortest path using Dijikstras Algorithm
70
12
13 clear ;
14 clc ;
15
17 NeworkSquareArea =1000; // n e t w o r k s q u a r e a r e a s i d e
18 LocalityRadius =1000; // l o c a l i t y r a d i u s
NeworkSquareArea , LocalityRadius ) ; // g e n e r a t i o n o f
a random t o p o l o g y i n r e s p e c t w i t h t h e L o c a l i t y
method .
20 for i =1:1: NetworkSize
21 disp (i , ” node number : ” ) ;
22 [ dist , pred ]= NL_R_Dijkstra ( TopologyGraph , i ) ; //
a p p l i c a t i o n of NL R Dijkstra
23 j = dist ;
24 for x = j
25 disp ( x ) ;
26 plot ( j ) ;
27 xlabel ( ” Nodenumber ” , ” f o n t s i z e ” , 2)
28 ylabel ( ” D i s t a n c e ” ) ;
29 end
30 end
31 for i =1:1: NetworkSize
NeworkSquareArea , LocalityRadius ) ; // g e n e r a t i o n
o f a random t o p o l o g y i n r e s p e c t w i t h t h e
L o c a l i t y method .
33 [ dist , pred ]= NL_R_Dijkstra ( TopologyGraph , i ) ; //
71
a p p l i c a t i o n of NL R Dijkstra
34 TopologyGraph . node_diam ( i ) =40; // node d i a m e t e r
35 TopologyGraph . node_border ( i ) =10; // node b o r d e r
36 TopologyGraph . node_color ( i ) =5; // node c o l o r
37 [ GraphVisualize ]= NL_G_ShowGraphN ( TopologyGraph , i )
; // g r a p h v i s u a l i z a t i o n
38 xtitle ( ” L o c a l i t y C o n n e x M e t h o d ” ,” NodeNumber ” ,” D i s t a n c e
”);
39 end
72
Experiment: 13
Finding the shortest path by

using Prim’s Algorithm
Scilab code Solution 13.1 Shortest Path Using Prims Algorithm
1 // E x p e r i m e n t No . 1 3
CeCILL .
−en . t x t
, Professor ,
73
Figure 13.1: Shortest Path Using Prims Algorithm
Figure 13.2: Shortest Path Using Prims Algorithm
74
12
13 clear ;
14 clc ;
15
17 NeworkSquareArea =1000; // n e t w o r k s q u a r e a r e a s i d e
18 LocalityRadius =1000; // l o c a l i t y r a d i u s
19 [ ToplogyGraph ]= NL_T_LocalityConnex ( NetworkSize ,
NeworkSquareArea , LocalityRadius ) ; // g e n e r a t i o n o f
a random t o p o l o g y i n r e s p e c t w i t h t h e L o c a l i t y
method .
20 for SourceNode =1:1: NetworkSize
21 disp ( SourceNode , ” node number : ” ) ;
22 dw = 2;
23 WindowSize = SourceNode ;
24 [ go ,v , pred ]= NL_R_Prim ( ToplogyGraph , SourceNode , dw
, WindowSize ) // a p p l i c a t i o n o f NL R Prim
25 // d i s p ( go ) ;
26 disp ( v ) ;
27 disp ( pred ) ;
28 j = pred ;
29 for x = j
30 disp ( x ) ;
31 plot ( j ) ;
32 xlabel ( ” Nodenumber ” , ” f o n t s i z e ” , 2)
33 ylabel ( ” D i s t a n c e ” ) ;
34 end
35 end
36 for SourceNode =1:1: NetworkSize
75
37 [ ToplogyGraph ]= NL_T_LocalityConnex ( NetworkSize ,
NeworkSquareArea , LocalityRadius ) ; // g e n e r a t i o n
o f a random t o p o l o g y i n r e s p e c t w i t h t h e
L o c a l i t y method .
38 dw = 2;
39 WindowSize = SourceNode ;
40 [ go ,v , pred ]= NL_R_Prim ( ToplogyGraph , SourceNode , dw
, WindowSize ) // a p p l i c a t i o n o f NL R Prim
41 // [ d i s t , p r e d ]= N L R D i j k s t r a ( g , i ) ; / / a p p l i c a t i o n
of NL R Dijkstra
42 go . node_diam ( SourceNode ) =40; // node d i a m e t e r
43 go . node_border ( SourceNode ) =10; // node b o r d e r
44 go . node_color ( SourceNode ) =5; // node c o l o r
45 [ GraphVisualize ]= NL_G_ShowGraphN ( go , SourceNode ) ;
// g r a p h v i s u a l i z a t i o n
46 xtitle ( ” L o c a l i t y C o n n e x M e t h o d ” ,” NodeNumber ” ,” D i s t a n c e
”)
47 end
48 5
76
Experiment: 14
Manet Simulation
Scilab code Solution 14.1 Manet Simulation
1 // E x p e r i m e n t No . 1 4
CeCILL .
−en . t x t
, Professor ,
77
Figure 14.1: Manet Simulation
Figure 14.2: Manet Simulation
78
12
13 clear ;
14 clc ;
15
16 RadiusMovingNode =10; // d i s p l a y r a d i u s o f moving n o d e s
17 RadiusFixedNodes =15; // d i s p l a y r a d i u s o f f i x e d n o d e s
18 MovingNodeConnection =20; // d i s p l a y r a d i u s o f t h e
moving n o d e s b e l o n g i n g t o t h e c o n n e c t i o n u n d e r
studies
19 NodeQuantity =50; // 5 q u a n t i t y o f moving n o d e s
20 FixedNodeQuantity =5; // q u a n t i t y o f f i x e d n o d e s
21 NetworkArea =1000; // n e t w o r k s q u a r e a r e a s i d e
22 MaximumSpeed =20; //maximum s p e e d
23 MinSimuDuration =100; // s i m u l a t i o n d u r a t i o n
24 MaxSimuDuration =100; // maximal w a i t i n g t i m e
25 RadiusForLinks =180; // L o c a l i t y r a d i u s f o r t h e l i n k s
attribution
27 NL_M_Simulation1N2AllAP ( RadiusMovingNode ,
RadiusFixedNodes , MovingNodeConnection ,
NodeQuantity , FixedNodeQuantity , NetworkArea ,
MaximumSpeed , MinSimuDuration , MaxSimuDuration ,
RadiusForLinks , WindowIndex ) ; // a p p l i c a t i o n o f
NL M Simulation1N2AllAP
28 xtitle ( ” Manet S i m u l a t i o n 50 Nodes ” ,”X−Nodes ” ,”Y−
Nodes ” )
29
79
studies
33 NodeQuantity =100; // q u a n t i t y o f moving n o d e s
37 MinSimuDuration =25; // s i m u l a t i o n d u r a t i o n i n s e c s
38 MaxSimuDuration =10; // maximal w a i t i n g t i m e i n s e c s
attribution
Nodes ” )
43
studies
47 NodeQuantity =200; // q u a n t i t y o f moving n o d e s
51 MinSimuDuration =100; // s i m u l a t i o n d u r a t i o n
52 MaxSimuDuration =100; // maximal w a i t i n g t i m e
attribution
80
Nodes ” )
81
Experiment: 15
Congestion Control
Scilab code Solution 15.1 Congestion Control
1 // E x p e r i m e n t No . 1 5
CeCILL .
−en . t x t
, Professor ,
82
Figure 15.1: Congestion Control
Figure 15.2: Congestion Control
83
12
13 clear ;
14 clc ;
15
17 NetworkSquareArea =1000; // n e t w o r k s q u a r e d a r e a s i d e
19 Color =1; // c o l o r
NetworkSquareArea , LocalityRadius ) ; // g e n e r a t i o n o f
a topology
22 NameOfNetwork = ” C o n g e s t i o n Map o f 100 n o d e s w i t h r =50
” ; // Name o f t h e g r a p h
TopologyGraph , WindowIndex , LocalityRadius , Color ) ;
25 // f=NL G ShowGraphN ( g , w) ; / / g r a p h v i s u a l i z a t i o n
26 n = TopologyGraph . node_number ; // g r a p h s i z e
27 sink = NL_F_RandInt1n ( n ) ; // s e l e c t i o n o f t h e s i n k
28 [ cm , np , pred ]= NL_R_CongestionSinkFlood ( TopologyGraph ,
sink ) // a p p l i c a t i o n o f N L R C o n g e s t i o n S i n k F l o o d
29 xtitle ( ” C o n g e s t i o n Map o f 100 Nodes w i t h R a d i u s 50 ” ,
”X−Nodes ” ,”Y−Nodes ” ) ;
84
a topology
36 NameOfNetwork = ” C o n g e s t i o n Map o f 100 n o d e s w i t h r
=100 ” ;
43 xtitle ( ” C o n g e s t i o n Map o f 100 Nodes w i t h R a d i u s 100 ”
, ”X−Nodes ” ,”Y−Nodes ” ) ;
a topology
50 NameOfNetwork = ” C o n g e s t i o n Map o f 100 n o d e s w i t h r
=150 ” ;
57 xtitle ( ” C o n g e s t i o n Map o f 100 Nodes w i t h R a d i u s 150 ”
, ”X−Nodes ” ,”Y−Nodes ” ) ;
85
a topology
64 NameOfNetwork = ” C o n g e s t i o n Map o f 10 n o d e s w i t h r =50”
;
65 f = NL_M_Background ( WindowIndex , NameOfNetwork ) ; //
i n i t i a l square area
a topology
”;
86
a topology
”;
87

Computer Networks - DR - Subbulakshmi T

Uploaded by

Document Information

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Computer Networks - DR - Subbulakshmi T

Uploaded by

Copyright:

Available Formats

Scilab Manual for

November 26, 2021

1 Funded by a grant from the National Mission on Education through ICT,

List of Scilab Solutions 4

1 Creation of the Bus topology 7

2 Creation of the Ring topology 14

3 Creation of the Star topology 19

4 Creation of the Mesh topology 23

5 Creation of Tree topology 28

6 Finding the Shortest Path in Bus topology 32

7 Finding the Shortest Path in Ring topology 38

8 Finding the Shortest Path in Star topology 44

9 Finding the Shortest Path in Mesh topology 50

10 Finding the Shortest Path in Tree topology 56

11 Creating a Network Square Area & Coloured Network Topol-

12 Finding the shortest path by using Dijikstra’s Algorithm 69

13 Finding the shortest path by using Prim’s Algorithm 73

Solution 1.1 Bus Topology Creation . . . . . . . . . . . . . . . 7

1.1 Bus Topology Creation . . . . . . . . . . . . . . . . . . . . . 8

2.1 Ring Topology Creation . . . . . . . . . . . . . . . . . . . . 15

3.1 Star Topology Creation . . . . . . . . . . . . . . . . . . . . . 20

4.1 Mesh Topology Creation . . . . . . . . . . . . . . . . . . . . 24

5.1 Treee Topology . . . . . . . . . . . . . . . . . . . . . . . . . 29

6.1 Shortest Path in Bus Topology . . . . . . . . . . . . . . . . 33

7.1 Shortest Path in Ring Topology . . . . . . . . . . . . . . . . 42

8.1 Shortest Path in Star Topology . . . . . . . . . . . . . . . . 45

9.1 Shortest Path in Mesh Topology . . . . . . . . . . . . . . . . 51

10.1 Shortest Path in Tree Topology . . . . . . . . . . . . . . . . 57

12.1 Shortest path using Dijikstras Algorithm . . . . . . . . . . . 70

13.1 Shortest Path Using Prims Algorithm . . . . . . . . . . . . . 74

14.1 Manet Simulation . . . . . . . . . . . . . . . . . . . . . . . . 78

15.1 Congestion Control . . . . . . . . . . . . . . . . . . . . . . . 83

Creation of the Bus topology

Scilab code Solution 1.1 Bus Topology Creation

Creation of the Ring topology

Scilab code Solution 2.1 Ring Topology Creation

Figure 2.2: Ring Topology Creation

Creation of the Star topology

Scilab code Solution 3.1 Star Topology Creation

Figure 3.2: Star Topology Creation

Creation of the Mesh topology

Scilab code Solution 4.1 Mesh Topology Creation

Figure 4.2: Mesh Topology Creation

Creation of Tree topology

Scilab code Solution 5.1 Treee Topology

Figure 5.2: Treee Topology

Finding the Shortest Path in

Scilab code Solution 6.1 Shortest Path in Bus Topology

Figure 6.2: Shortest Path in Bus Topology

Finding the Shortest Path in

Scilab code Solution 7.1 Shortest Path in Ring Topology

63 NodeBorder =4* ones (1 , NetworkSize ) ; // node b o r d e r

Finding the Shortest Path in

Scilab code Solution 8.1 Shortest Path in Star Topology

Finding the Shortest Path in

Scilab code Solution 9.1 Shortest Path in Mesh Topology

Figure 9.2: Shortest Path in Mesh Topology

Finding the Shortest Path in

Scilab code Solution 10.1 Shortest Path in Tree Topology

Creating a Network Square

Finding the shortest path by

Scilab code Solution 12.1 Shortest path using Dijikstras Algorithm

Figure 12.2: Shortest path using Dijikstras Algorithm