Routing and wavelength assignment for 3-ary n-cube in array-based optical network
The k-ary n-cube, denoted Q(n)(k), is one of the popular communication patterns of parallel algorithms. This paper addresses the routing and wavelength assignment for Q(n)(3) communication pattern in array-based WDM optical network. By using congestion estimation and giving a routing and wavelength assignment strategy, we prove that the optimal number of wavelengths is 3(n) - 1. (C) 2011 Elsevier B.V. All rights reserved.
routing and wavelength assignment 3-ary n-cube algorithms wdm optical network congestion linear array