Node placement optimization in ShuffleNets

Node placement problem in ShuffleNets is a combinatorial optimization problem. In this paper an efficient node placement algorithm, called the gradient algorithm, is proposed. A communication cost function between a node pair is defined and the gradient algorithm places the node pairs one by one, based on the gradient of the cost function. Then two lower bounds on the traffic weighted mean internodal distance h are proposed. The performance of the gradient algorithm is compared to the lower bounds as well as to some algorithms in the literature. Significant reduction of h is obtained with the use of the gradient algorithm, especially for highly skewed traffic distributions. For a ShuffleNet with N=64 nodes, the h found is only 22% above the lower bound for the uniform random traffic distribution, and 14.7% for a highly skewed traffic distribution with skew factor /spl gamma/=100.

[1]  Yiu-Wing Leung,et al.  Multistar implementation of expandable shufflenets , 1994, TNET.

[2]  Mario Gerla,et al.  Multilevel optical networks , 1992, [Conference Record] SUPERCOMM/ICC '92 Discovering a New World of Communications.

[3]  Yedidyah Langsam,et al.  Data structures using C and C , 1989 .

[4]  A.S. Acampora,et al.  An overview of lightwave packet networks , 1989, IEEE Network.

[5]  Manoj Kumar,et al.  Performance of Unbuffered Shuffle-Exchange Networks , 1986, IEEE Transactions on Computers.

[6]  Duncan H. Lawrie,et al.  Access and Alignment of Data in an Array Processor , 1975, IEEE Transactions on Computers.

[7]  N. F. Maxemchuk,et al.  Regular mesh topologies in local and metropolitan area networks , 1985, AT&T Technical Journal.

[8]  Kumar N. Sivarajan,et al.  Lightwave networks based on de Bruijn graphs , 1994, TNET.

[9]  Biswanath Mukherjee,et al.  Algorithms for Optimized Node Arrangements in ShuffleNet Based Multihop Lightwave Networks , 1995, J. High Speed Networks.

[10]  Tse-Yun Feng,et al.  Data Manipulating Functions in Parallel Processors and Their Implementations , 1974, IEEE Transactions on Computers.

[11]  Kumar N. Sivarajan,et al.  Multihop lightwave networks based on De Bruijn graphs , 1991, IEEE INFCOM '91. The conference on Computer Communications. Tenth Annual Joint Comference of the IEEE Computer and Communications Societies Proceedings.

[12]  Biswanath Mukherjee,et al.  Heuristic algorithms for constructing optimized structures of linear multihop lightwave networks , 1994, IEEE Trans. Commun..

[13]  Ender Ayanoglu.  Signal flow graphs for path enumeration and deflection routing analysis in multihop networks , 1989, IEEE Global Telecommunications Conference, 1989, and Exhibition. 'Communications Technology for the 1990s and Beyond.

[14]  V.O.K. Li,et al.  Routing for all-optical networks using wavelengths outside erbium-doped fiber amplifier bandwidth , 1994, Proceedings of INFOCOM '94 Conference on Computer Communications.

[15]  Soung Chang Liew,et al.  Nlog N dual shuffle-exchange network with error-correcting routing , 1994, IEEE Trans. Commun..

[16]  M. J. Karol,et al.  ShuffleNet: an application of generalized perfect shuffles to multihop lightwave networks , 1988, IEEE INFOCOM '88,Seventh Annual Joint Conference of the IEEE Computer and Communcations Societies. Networks: Evolution or Revolution?.