Research on Routing Algorithm Based on Limitation Arrangement Principle in Mathematics

Table 4

Performance table of LAPSN algorithm under Hypothesis 1 and Hypothesis 2.

Nodes	40	75	80	85	90	95	100	105	110
Total nodes coped under Hypothesis 1	1520	5475	6240	7055	7920	8835	9800	10815	11880
Total nodes coped under Hypothesis 2	1006	3554	4048	4557	5124	5702	6301	6965	7647
Performance	0.3381	0.3508	0.3513	0.3541	0.3530	0.3546	0.3570	0.3560	0.3563
Nodes	115	120	160	200	240	280	320	360	400
Total nodes coped under Hypothesis 1	12995	14160	25280	39600	57120	77840	101760	128880	159200
Total nodes coped under Hypothesis 2	8353	9096	16151	25233	36323	49405	64526	81620	100805
Performance	0.3572	0.3576	0.3611	0.3628	0.3641	0.3653	0.3659	0.3667	0.3668