About cookies on this site Our websites require some cookies to function properly (required). In addition, other cookies may be used with your consent to analyze site usage, improve the user experience and for advertising. For more information, please review your options. By visiting our website, you agree to our processing of information as described in IBM’sprivacy statement. To provide a smooth navigation, your cookie preferences will be shared across the IBM web domains listed here.
Publication
IEEE ATM Workshop 1999
Conference paper
Transition matrix generation for complex node representation
Abstract
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.