As the scales of the optical networks grows continuously, the multi-dimensional reconfigurable optical add-drop multiplexer (ROADM) becomes the key node technology in the next generation communication networks. However, because of the high cost of the non-blocking high-degree optical switching fabric, the asymmetric switching fabric (i.e. there are unconnected ports in an optical node) can be widely used. To solve the inner-port connectivity aware (IPCA) routing and wavelength allocation problem, an integer linear programming (ILP) model is first formulated. Then three IPCA routing schemes are proposed, including the IPCA based on K-shortest pathe (IPCA-KSP) scheme, the IPCA-Dijkstra scheme and entire path searching (EPS) scheme. Simulation results show that, the EPS scheme can find the shortest path by enumeration, but its factorial computational complexity is not tolerable. The IPCA-KSP scheme cannot guarantee to find the shortest path, which only works effectively in small-scale networks. By modifying the path search process of the classical Dijkstra′s algorithm, the IPCA-Dijkstra scheme can find the shortest path with low complexity.