An F-P routing method is proposed in which a fixed routing policy is adopted for path selection for packets, in principle, and the derouting of traffic depends on the traffic conditions. Although the idea can be applied to other types of networks, this is a loop-free routing policy which is especially matched to the features of the ladder type network. The effectiveness of the F-P routing is quantitatively shown for a system with relatively few stages. A systematic algorithm is derived to examine the system performance when the F-P routing is adopted in an n-stage ladder type computer network.
|Number of pages||9|
|Journal||Systems, computers, controls|
|Publication status||Published - 1981 Jul|
ASJC Scopus subject areas