Welcome to the InfoSci Platform
Reference Hub1
Adaptive Routing Strategy for Large Scale Rearrangeable Symmetric Networks

Adaptive Routing Strategy for Large Scale Rearrangeable Symmetric Networks

Amitabha Chakrabarty, Martin Collier, Sourav Mukhopadhyay
Copyright: © 2010 |Volume: 2 |Issue: 2 |Pages: 11
ISSN: 1938-0259|EISSN: 1938-0267|EISBN13: 9781609604097|DOI: 10.4018/jghpc.2010040105
Cite Article Cite Article

MLA

Chakrabarty, Amitabha, et al. "Adaptive Routing Strategy for Large Scale Rearrangeable Symmetric Networks." IJGHPC vol.2, no.2 2010: pp.53-63. http://doi.org/10.4018/jghpc.2010040105

APA

Chakrabarty, A., Collier, M., & Mukhopadhyay, S. (2010). Adaptive Routing Strategy for Large Scale Rearrangeable Symmetric Networks. International Journal of Grid and High Performance Computing (IJGHPC), 2(2), 53-63. http://doi.org/10.4018/jghpc.2010040105

Chicago

Chakrabarty, Amitabha, Martin Collier, and Sourav Mukhopadhyay. "Adaptive Routing Strategy for Large Scale Rearrangeable Symmetric Networks," International Journal of Grid and High Performance Computing (IJGHPC) 2, no.2: 53-63. http://doi.org/10.4018/jghpc.2010040105

Export Reference

Mendeley
Favorite Full-Issue Download

Abstract

This paper proposes an adaptive unicast routing algorithm for large scale symmetric networks comprising 2 × 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.

Request Access

You do not own this content. Please login to recommend this title to your institution's librarian or purchase it from the IGI Global bookstore.