Transition matrix generation for complex node representation

This paper presents a novel graph coloring technique to compute the transition matrix of a PNNI peer group. The transition matrix shows traffic parameters associated with traversing a PNNI peer group between each pair of ingress-egress nodes. This matrix is computed for symmetric restrictive costs (e.g. bandwidth) with a computational complexity of O(e log e), e being the number of edges in the peer group. This algorithm also features very interesting dynamic behavior that allows the transition matrix to be updated without having to rerun the entire algorithm.