Title :
Transition matrix generation for complex node representation
Author :
Iliadis, Ilias ; Scotton, Paolo
Author_Institution :
Zurich Res. Lab., IBM Res. Div., Ruschlikon, Switzerland
Abstract :
The ATM Forum has defined the private network-network interface (PNNI) for routing and signalling in ATM networks. 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(eloge), 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
Keywords :
asynchronous transfer mode; computational complexity; graph colouring; matrix algebra; telecommunication network routing; telecommunication signalling; telecommunication traffic; ATM Forum; PNNI peer group; bandwidth; complex node representation; computational complexity; dynamic behavior; graph coloring; ingress-egress nodes; private network-network interface; routing; signalling; symmetric restrictive costs; traffic parameters; transition matrix generation; updating; Bandwidth; Computational complexity; Costs; Electronic mail; Laboratories; Network topology; Peer to peer computing; Routing; Symmetric matrices; Telecommunication traffic;
Conference_Titel :
ATM Workshop, 1999. IEEE Proceedings
Conference_Location :
Kochi
Print_ISBN :
4-88552-164-5
DOI :
10.1109/ATM.1999.786901