Abstract
We propose a heuristic based on the Simulated Annealing method for efficient routing in the Indirect Star based Multistage Interconnection Networks of O [n]. We assert and demonstrate through simulation results, that this heuristic is more efficient than those previously proposed for this class of MINs since it offers a higher probability of acceptance.
Indexing terms:
Additional information
Notes on contributors
S Kar
Subrat Kar, graduated with Honours in Electrical & Electronics Engineering from the Birla Institute of Technology & Science, Pilani in 1987. He holds a Doctoral Degree in Electrical Communication Engineering from the Indian Institute of Science, Bangalore (1991). He has been with the International Center for Theoretical Physics, Trieste as a Post-Doctoral Fellow (1991–1994). Presently he is an Assistnat Professor at the Department of Electrical Engineering, Indian Institute of Technology, Delhi. His research areas are in optical communication, switching, access technologies and high speed networks.