PERFORMANCE STUDY OF ROUTING AND LOAD BALANCING IN MOBIUS CUBES

Abstract

The Hypercube network has proved to be one of the most popular interconnection networks. Its popularity is due to small diameter and small number of connections per processor. But the hypercube does not have the smallest diameter possible for its resources. If we exchange or twist the end points, diameter of the network reduces significantly - giving Mobius cubes. The Mobius cubes are hypercube variants that give better performance with the same number of links and processors. The diameter of the Mobius cubes is about one half the diameter of the equivalent hypercube, and that the average number of steps between processors for a Mobius cube is about two-thirds of the average for a hypercube. The static and dynamic properties of this new topology have been studied based on a concept of n-dimensional vector space over {O,1) with addition and scalar multiplication mod 2. Efficient routing algorithms have been developed from the existing algorithms with some modifications. The possibility for enhancing the performance by embedding some other networks onto the Mobius cube and by applying load balancing techniques, have also been verified by simulation.