| 摘要 |
<p>PURPOSE:To obtain a flow assignment system with a short calculation time by obtaining the shortest path and the shortest path distance of an outgoing/ incoming node pair according to each link distance. CONSTITUTION:A flow increment of both signals smaller than the traffic flow of a line exchange signal and a packet exchange signal given between the outgoing/incoming node pair is decided to obtain the shortest path and its distance of the outgoing/incoming node according to each link distance for every the line exchange signal and the packet exchange signal. When the distance is infinite, it is decided that there is no routing realized to complete the flow assignment and when it is finite, the flow increment is added to each link on the path and the recalculation of the link distance is repeated till the traffic flow of both the signals given between all outgoing/incoming node pairs is assigned.</p> |
