In this paper, we have presented an efficient RWA protocol for WDM networks. The optimal and sub-optimal lightpaths are found by the ants (control agents) depending upon the number of free wavelengths available, the length of the lightpath (hop count) and number of conversion required from source to destination. When a connection request arrives at a node, the high speed data are routed through the readily available optimal lightpath thereby reducing the processing time. The low speed data are first tried to groom over the existing low speed data, else routed through the readily available lightpath. As opposed to the reactive protocols, our proposed protocol is proactive in the sense that it proactively updates the changes in the network status using the concept of ant colony optimization. Further for survivability backup lightpath is maintained. The selection of backup lightpath is done in such a way that there is no shared link between the primary and backup lightpath but it can be shared with another backup lightpath. By simulation results, we showed that our proposed protocol has low blocking probability and delay.
cited By (since 1996)0; Conference of org.apache.xalan.xsltc.dom.DOMAdapter@6aec4afb ; Conference Date: org.apache.xalan.xsltc.dom.DOMAdapter@3f2edb94 Through org.apache.xalan.xsltc.dom.DOMAdapter@1d51f1f4; Conference Code:89225
T. K. Ramesh, Konda, S. K., and Vaya, P. R., “Survivable traffic grooming RWA protocol for WDM networks”, in Procedia Engineering, Coimbatore, 2012, vol. 30, pp. 334-340.