On the distribution of routing computation in hierarchical ATM networks

ATM private network-to-network interface (PNNI) is a hierarchical and dynamic link-state routing protocol, designed to scale to the largest possible ATM networks, encompassing thousands of nodes. This paper investigates the route computation load imposed by the PNNI routing scheme, and shows that this load is unevenly distributed among the network nodes. More specifically, the routing computation load associated with the setup of a single virtual path grows exponentially with the hierarchy level. As a result, some of the network nodes-mainly those that function as border nodes of high levels-may be overloaded with route computation, while other nodes are rarely involved in this process. This paper also proposes a possible scheme for spreading the route computation burden more evenly. According to this scheme, heavily loaded nodes transfer route computation tasks to lightly loaded nodes.