The postal network: A recursive network for parameterized communication model

The postal network is an interconnection network that possesses many desirable properties in networking applications. It includes hypercubes and Fibonacci cubes as its special cases. Basically, the postal network forms a series (with series number lambda) that is based on the sequence N-lambda(n)=N-lambda(n-1)+N-lambda(n-lambda), where n is the dimension and N-lambda(n) represents the number of nodes in an n-dimensional postal network in series lambda. In this paper, we study topological properties of postal networks and relationships between different postal networks. One application of postal networks is also shown in implementing barrier synchronization using a special spanning tree called a postal tree. The postal network can also be considered as a flexible version of the hypercube by relaxing the restriction on the number of nodes, and hence, makes it possible to construct multicomputers with arbitrary sizes.