Designing Change Assimilation Process using Close-up Down Graph for Switch Based Networks

In today’s modern switch-based interconnected systems require high performance, reliability and availability. These switch based networks changes their topologies due to hot expansion of components, link or node activation and deactivation. Device failures in high-speed computer networks can also result in topological changes. Also, component failures, addition and deletion of components cause changes in the topology and routing paths supplied by the interconnection network. Therefore a network reconfiguration algorithm must be executed to reestablish the connectivity between the network nodes. Now we have two types of reconfiguration techniques and they are static reconfiguration and dynamic reconfiguration. Static reconfiguration techniques significantly reduce network service since the application traffic is temporally stopped in order to avoid deadlocks. But unfortunately this has negative impact on network service availability. Dynamic network reconfiguration is the process of changing from one routing function to another routing function while the network remains up and running. While performing dynamic network reconfiguration, the main challenge is to avoid deadlocks and provide network service availability along with reduced packet dropping rate. In this paper we demonstrate how dynamic reconfiguration is more efficient than the static reconfiguration for switch based networks

Topological Properties and Routing Algorithm Considering Deadlock of the Static k-ary n-tree Interconnection Network

This paper proposes a static k-ary n-tree interconnection network. This network is based on traditional k-ary n-tree network. Different from the traditional k-ary n-tree network which contains compute nodes only in the leaf nodes at the lowest layer and the rest of layers contains only switches, our network consists of identical nodes that contain both the switches and compute nodes. In other words, the traditional k-ary n-tree is an indirect dynamic network and the static k-ary n-tree is a direct static network. Our network has a better diameter than other networks. However, in our network, the shortest-path routing algorithm may cause deadlocks. In this paper, we describe the structure of the static k-ary n-tree, derive its topological properties. We also give a formal shortest-path routing algorithm and a routing algorithm considering deadlock. Finally, we evaluate the cost/performance of the static k-ary n-tree with the comparisons to other networks