Computer Network Dynamic Balance Flow Distribution Based on Closed-Loop Particle Swarm Feedback Model

Table 3

Optimization solution process of particle swarm combination.

Steps number:	Algorithm solution process steps	For (int i = 0; i < sizeof(srcnum)/4; i++)
1	The receiving end mechanism of the protocol	Int main()
2	The returned load index code represents it	{Int i,j,low,high,mid,temp
3	Copy from the header of the data	Int srcsum [10] = {10,91,8,71,61,5,41,3,21,1}
4	From packet to the ACK packet	for(i = 2; i < sizeof(srcsum)/4; i++)
5	The iMLCP sender is built for	srcsum[i] makes the degree of network congestion
6	The same as the MLCP protocol	{temp = srcsum[i]
7	Similar to the MLCP protocol, it is	low = 0; high = i-1; }
8		while(low ≤ high)
9	When packet loss occurs on the link	Public void bubbleSort(int arr[])
10	For item in queue	{mid = (low + high)/2; }
11	Its mechanism is the same as the TCP protocol	If (srcsum[mid]>temp)high = mid-1
12	The 3 bits of the exponent are sorted	else srcnum[j+1] = temp
13	The corresponding strategy on the TCP sender	low = mid+1
14	The value of the minimum capacity field	For (int i = 0; i < sizeof(srcnum)/4; i++)
15	It sends feedback based on the ACK packet	printf (“srcnum[%d] = %d”,i,srcnum[i])