| 摘要 |
<p><P>PROBLEM TO BE SOLVED: To allow optimum shortest path to be selected taking into consideration the link state information of inter-node virtual links the domains of which in a lower hierarchy have, when selecting the shortest path between domains in the lower hierarchy. <P>SOLUTION: When the shortest path is selected by hierarchical distributed routing, the shortest path cost between boundary routers of lower sub-networks is acquired from in-area shortest path lists which PCSs 1012 to 1017 in a lower layer manage, by a PCS 1011 in a higher layer and is regarded as a virtual link cost. The shortest path from the start point to the end point is obtained, on the basis of the acquired virtual link cost between boundary nodes and the link cost between sub-networks which the PCS 1011 in the higher layer. <P>COPYRIGHT: (C)2007,JPO&INPIT</p> |
