Adaptive Routing Strategy for Large Scale Rearrangeable Symmetric Networks

This paper proposes an adaptive unicast routing algorithm for large scale symmetric networks comprising 2 A— 2 switch elements such as Bene?s networks. This algorithm trades off the probability of blocking against algorithm execution time. Deterministic algorithms exploit the rearrangeability property of Bene?s networks to ensure a zero blocking probability for unicast connections, at the expense of extensive computation. The authors' algorithm makes its routing decisions depending on the status of each switching element at every stage of the network, hence the name adaptive routing. This method provides a low complexity solution, but with much better blocking performance than random routing algorithms. This paper presents simulation results for various input loads, demonstrating the tradeoffs involved.

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

[2]  Keang-Po Ho,et al.  Analysis of homodyne crosstalk in optical networks using Gram-Charlier series , 1999 .

[3]  Nathan Linial,et al.  Interpolation Between Bases and the Shuffle Exchange Network , 1989, Eur. J. Comb..

[4]  Kuo-Chan Huang,et al.  Effective Resource Allocation and Job Scheduling Mechanisms for Load Sharing in a Computational Grid , 2009 .

[5]  Tse-Yun Feng,et al.  On a Class of Multistage Interconnection Networks , 1980, IEEE Transactions on Computers.

[6]  Abraham Waksman,et al.  A Permutation Network , 1968, JACM.

[7]  Peter Newman A fast packet switch for the integrated services backbone network , 1988, IEEE J. Sel. Areas Commun..

[8]  JingTao Yao,et al.  Novel Developments in Granular Computing: Applications for Advanced Human Reasoning and Soft Computation , 2010 .

[9]  Charles Clos,et al.  A study of non-blocking switching networks , 1953 .

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

[11]  Sartaj Sahni,et al.  A Self-Routing Benes Network and Parallel Permutation Algorithms , 1981, IEEE Transactions on Computers.

[12]  Wen-Xiu Zhang,et al.  On Characterization of Relation Based Rough Set Algebras , 2010 .

[13]  John F. Beetem,et al.  The GF11 supercomputer , 1985, ISCA '85.

[14]  A. Yavuz Oruç,et al.  A Fast Parallel Algorithm for Routing Unicast Assignments in Benes Networks , 1995, IEEE Trans. Parallel Distributed Syst..

[15]  Kyungsook Y. Lee,et al.  A New Benes Network Control Algorithm , 1987, IEEE Trans. Computers.

[16]  F.K. Hwang,et al.  On Noninterruptive Rearrangeable Networks , 2006, IEEE/ACM Transactions on Networking.

[17]  Hasan Çam,et al.  Work-Efficient Routing Algorithms for Rearrangeable Symmetrical Networks , 1999, IEEE Trans. Parallel Distributed Syst..

[18]  Srinivasan Keshav,et al.  An Engineering Approach to Computer Networking: ATM Networks , 1996 .

[19]  D. C. Opferman,et al.  On a class of rearrangeable switching networks part I: Control algorithm , 1971 .

[20]  Sartaj Sahni,et al.  Parallel Algorithms to Set Up the Benes Permutation Network , 1982, IEEE Transactions on Computers.

[21]  Pranay Chaudhuri,et al.  An Algorithm for Task Scheduling in Heterogeneous Distributed Systems Using Task Duplication , 2011, Int. J. Grid High Perform. Comput..

[22]  G. Jack Lipovski,et al.  Banyan networks for partitioning multiprocessor systems , 1973, ISCA '73.

[23]  F. Leighton,et al.  Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes , 1991 .

[24]  V. Benes,et al.  Mathematical Theory of Connecting Networks and Telephone Traffic. , 1966 .

[25]  David Nassimi A self routing Benes network , 1980, ISCA '80.

[26]  Kyungsook Y. Lee On the Rearrangeability of 2(log2N) - 1 Stage Permutation Networks , 1985, IEEE Trans. Computers.

[27]  S. Andresen The Looping Algorithm Extended to Base 2tRearrangeable Switching Networks , 1977, IEEE Trans. Commun..

[28]  Jorge L. C. Sanz,et al.  An EREW PRAM Algorithm for Image Component Labeling , 1989, IEEE Trans. Pattern Anal. Mach. Intell..

[29]  Chao-Tung Yang,et al.  On Construction of a Diskless Cluster Computing Environment in a Computer Classroom , 2012, Int. J. Grid High Perform. Comput..

[30]  Joseph Yu Hui,et al.  Switching and Traffic Theory for Integrated Broadband Networks , 1990 .

[31]  Shih-Hao Hung,et al.  Migrating Android Applications to the Cloud , 2011, Int. J. Grid High Perform. Comput..

[32]  Seung Ryoul Maeng,et al.  On the Correctness of Inside-Out Routing Algorithm , 1997, IEEE Trans. Computers.

[33]  Tse-Yun Feng,et al.  On a Class of Rearrangeable Networks , 1992, IEEE Trans. Computers.

[34]  Gordon S. Blair,et al.  Overlay-Based Middleware for the Pervasive Grid , 2010 .

[35]  Jack Dongarra,et al.  Handbook of Research on Scalable Computing Technologies , 2009 .

[36]  Antonio Liotta,et al.  Handbook of Research on P2P and Grid Systems for Service-oriented Computing: Models, Methodologies a , 2010 .

[37]  Frank Z. Wang,et al.  Handbook of Research on Grid Technologies and Utility Computing: Concepts for Managing Large-Scale Applications , 2009 .

[38]  Cees T. A. M. de Laat,et al.  A Trusted Data Storage Infrastructure for Grid-Based Medical Applications , 2008, 2008 Eighth IEEE International Symposium on Cluster Computing and the Grid (CCGRID).

[39]  Nick McKeown,et al.  On the speedup required for combined input- and output-queued switching , 1999, Autom..

[40]  Richard McClatchey,et al.  On the Pervasive Adoption of Grid Technologies: A Grid Operating System , 2009 .