A routing algorithm in WDM mesh networks with grooming capacities
- 28 Downloads
Most of the work in traffic grooming has been in the area of providing efficient network designs in Wavelength division multiplexing (WDM). The objective of these traffic rooming algorithms is to reduce the cost of overall networks. In this paper, a routing algorithm based on transiently chaotic neural network is proposed to solve the problem in WDM logical topology. The objectives of the routing algorithm are accomodating all traffic requirements and using less network resource. The simulation shows that the proposed algorithm is efficient in the routing selection, meanwhile the algorithm can use less network resource.
Key wordswavelength division multiplexing optical communication network traffic grooming routing
CLC numberTP 929.11
Unable to display preview. Download preview PDF.
- Thiagarajan S, Somani A K. Performance Analysis of WDM Optical Networks with Grooming CapabilitiesSPIE Technical Conference on Terabit Optical Networking: Architecture, Control, and Management Issues, Boston, Nov 2000. 312–321.Google Scholar
- Gerstel O, Lin P, Sasaki G. Combined WDM and SONET Network Design.Proc of IEEE INFOCOM. New York: IEEE Press, 1999. 734–743.Google Scholar
- Zhang X, Qiao C. Scheduling in Unidirectional WDM Rings and Its Extensions.SPIE’s All-Optical Communication Systems: Architecture, Control and Protocol Issues, 1997,3230:208–219.Google Scholar
- Narula A, Modiano E. Dynamic Load Balancing for WDM-ased Packet Networks.Proc of IEEE INFORCOM. New York: IEEE Press, 2000, 1010–1019.Google Scholar