Administrative weight allocation for PNNI routing algorithms
Rauf Izmailov, B. Sengupta, Akira Iwata · 2002
The paper addresses the issue of assigning administrative weights used by routing algorithms in private network-network interface (PNNI) networks. We consider two versions of the problem: with and without the knowledge of the traffic matrix. For both versions, we propose methods capable of improving the routing performance of PNNI routing algorithms. Depending on the network and traffic patterns, the call blocking probabilities could be reduced by about 50% or more. The methods are verified by analysis and simulations.