Algorithm 1 Multi-Cooperative Communication Channel Path Routing

Initiate position = IP, Final position = fp, Quality of Service intensity = δ Least obtainable bandwidth of present connection = bw available the volume amount of traffic = bwmin (s, r) routing = routing values of sender/receiver pp ← present topology While bwmin > 0 Configure monitoring valueset preprocessing condition of packets = Sp, Initialize buffer pool storage amount Loop traversal:    C = the data package’s choice of operation,    Perform the operation C to get re, se    Keep these values re, se, C to buffer pool storage    If the information in the memory pool is sufficient    Calculate _ Computation of the net carry away percentage Computation Q (re, se, C; θ)    From Eval _ Net to target _ Net, there are N phases.    Target _ Subtract the sampling computation from the net value Computation Q (r’e, s’e, C’; θ’) Preparation neural network to obtain direction Break Else    if ip’ = fp Else    ip = ip’    Final position Routing (s,d) ← Routing Using two nodes in this routing, least amount obtainable bandwidth If bw available ≤ bwmin t[nodes] = 0, to update t