Paper
1 October 2003 Amplifier placement in transparent DWDM ring networks
Tao Deng, Suresh Subramaniam
Author Affiliations +
Proceedings Volume 5285, OptiComm 2003: Optical Networking and Communications; (2003) https://doi.org/10.1117/12.533323
Event: OptiComm 2003: Optical Networking and Communications, 2003, Dallas, TX, United States
Abstract
In high speed DWDM (Dense Wavelength Division Multiplexing) networks, meeting the targeted physical-layer performance is largely dependent on the total number and the placement of the optical amplifiers. An efficient design not only cuts down the network cost by minimizing the required number of amplifiers, but also effectively reduces the undesirable fiber nonlinearities and the end-to-end OSNR (Optical Signal-to-Noise Ratio) degradation on the propagating channels. By capturing major transmission impairments, such as fiber attenuation, nonlinear effects, amplifier and receiver noises, this paper proposes an algorithm for a given static lightpath scenario to find the most efficient solution of the amplifier placement that satisfies the performance constraints. We then adapt this algorithm to the dynamic traffic case. Numerical results show that our algorithm outperforms uniform placement schemes in controlling the nonlinear effects and providing targeted BER performance using the minimum number of amplifiers.
© (2003) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Tao Deng and Suresh Subramaniam "Amplifier placement in transparent DWDM ring networks", Proc. SPIE 5285, OptiComm 2003: Optical Networking and Communications, (1 October 2003); https://doi.org/10.1117/12.533323
Lens.org Logo
CITATIONS
Cited by 3 scholarly publications.
Advertisement
Advertisement
RIGHTS & PERMISSIONS
Get copyright permission  Get copyright permission on Copyright Marketplace
KEYWORDS
Amplifiers

Optical amplifiers

Fiber amplifiers

Signal attenuation

Dense wavelength division multiplexing

Detection and tracking algorithms

Head

Back to Top