| 摘要 |
Systems involving generation of a complex node representation of a PNNI peer group are provided. Use is made of a set of restrictive costs, such as a transition matrix, defining the restrictive costs of paths between pairs of border nodes of the peer group. The complex node representation generation method is based on the group evolution process of the logical group representation of a peer group, and use is also made of the spanning tree representation of a network. Complex node representations generated by the disclosed methods are optimal in that they contain the minimum possible number of exception bypasses.
|
