Algorithm 1:

1. Node 1 and 3 send packets in size of 100 kb at intervals of one second to node 42, denoting arrived curves as ${\alpha }_1\left(t\right)$ and ${\alpha }_2\left(t\right)$.

2. Send node 42 packets of data to node 11 after synchronization.

3. No. 5, 12, 14, 17, 18, 20, 21, 23, 22, 29 nodes send competing data packets to node 8, to constitute competing flow $R_3\left(t\right)$, which reaches curve ${\alpha }_3\left(t\right)$.

4. No. 4, 13, 15, 16, 19, 24, 25, 26, 27, 28 nodes send competing data packets to node 8, to constitute competing flow $R_4\left(t\right)$, which reaches curve ${\alpha }_4\left(t\right)$.

5. No. 31, 32, 33, 34, 35, 36, 37, 38, 39, 40 nodes send competing data packets to node 8, to constitute competing flow $R_5\left(t\right)$, which reaches curve ${\alpha }_5\left(t\right)$.

6. All the links take bandwidth of 10 Mb. For all routers, the same configuration is used.