Study on Dynamic Routing, Wavelength and Timeslot Assignment Algorithm in WDM-TDM Optical Networks

Srinivasan R and Somani A K. A generalized framework foranalyzing time-space switched optical networks [C][J].2001IEEE Conference on Computer Communications(INFOCOM01). Anchorage, Alaska, USA. April.2001, Vol. 1:179-188[2]Wen B, Shenai R, and Sivalingam K. Routing, wavelengthand time-slot-assignment algorithms for wavelength-routedoptical WDM/TDM networks [J].Journal of LightwaveTechnology.2005, 23(9):2598-2609[3]Zang H, Jue J P, and Mukherjee B. A review of routing andwavelength assignment approaches for wavelength-routedoptical WDM networks [J]. Optical Networks Magazine, 2000,1(1): 47-63.[4]Vishwannath A and Liang W. On-line routing in WDM-TDMswitched optical mesh networks [J]. Photon NetworkCommunication, 2006, 12(11): 287-299.[5]Yang W and Hall T J. Distributed dynamic routing,wavelength and timeslot assignment for bandwidth ondemand in agile all-optical networks [C]. 2006 CanadianConference on Electrical and Computer Engineering(CCECE06), Ottawa, Canada. May 2006: 136-139.[6]Lee Peiyuan, Gong Yongtao, and Gu Wanyi. Adaptiverouting and resource assignment in WDM-TDM networkswith multi-rate sessions [C]. Proceedings of SPIE Vol.5626.Bellingham. February 2005: 593-601.[7]Sivakumar M and Sivalingam K M. A routing algorithmframework for survivable optical networks based on resourceconsumption minimization [J].IEEE Journal of LightwaveTechnology.2007, 25(7):1684-1692[8]Yen J. Finding the k shortest loopless paths in a network [J].Management Science.1971, 17(11):712-716