On Distributed Polarization-Dependent Loss Monitoring and Mitigation: An Optical Layer Approach Enabled by Pilot Tone Technique
Bibliographic record
Abstract
Polarization-dependent loss (PDL) presents a significant challenge in modern optical fiber networks by causing variations in signal attenuation that depend on the polarization state. This variability degrades the optical signal-to-noise ratio and overall system performance. In most optical links, PDL primarily originates from wavelength selective switches (WSSs), and the variation in signal power occurs because the polarization state of light is not preserved throughout the fiber. Most existing approaches either focus on compensating aggregated PDL through advanced algorithms at the transceiver level or estimating the PDL of each WSS to optimize margin design. In this paper, we introduce a method that integrates distributed PDL monitoring and compensation using low-cost amplitude pilot tone (PT) technology. Our approach involves modulating a polarization-multiplexed signal with two different PT frequencies on each polarization. By measuring the power difference between these polarizations at any PT detection point along the link, we can determine the PDL of devices within the link. Additionally, by placing a polarization controller (PC) between two WSSs, we can adjust the overall PDL by tuning the PC. This enables effective PDL compensation based on our distributed monitoring technique. Extensive experiments have been performed, and the results demonstrate that our method accurately estimates the wavelength-dependent PDL of WSS devices with an accuracy better than <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"><tex-math notation="LaTeX">$ 0.1$</tex-math></inline-formula> dB. Moreover, it reduces the total PDL of two WSSs from approximately <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"><tex-math notation="LaTeX">$ 1.5$</tex-math></inline-formula> dB to <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"><tex-math notation="LaTeX">$ 0.3$</tex-math></inline-formula> dB over a <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"><tex-math notation="LaTeX">$ 675$</tex-math></inline-formula> km multiple-span optical link.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame distilled prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.000 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 0.001 |
| Insufficient payload (model declined to judge) | 0.000 | 0.000 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one teacher head, not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".