Link state aggregation using a shufflenet in ATM PNNI networks

In this paper, we present an algorithm for efficiently aggregating link state information needed for source routing in PNNI networks. In this algorithm, each border node in a peer group is mapped to a node of a shufflenet. By this mapping, the number of links for which state information is maintained becomes pN (p is an integer, N is the number of border nodes) which is significantly smaller than N² in the full-mesh approach. Another novel aspect of our algorithm is that it can be applied to asymmetric networks, while many previous algorithms such as the spanning tree approach can be applied only to symmetric networks. Experimental results show that our shufflenet algorithm performs as good as the full-mesh approach, with only a much smaller amount of information