Login / Signup
A proof of wavelength conversion not improving Lagrangian bounds of the sliding scheduled RWA problem.
James Yiming Zhang
Jing Wu
Gregor von Bochmann
Published in:
Comput. Commun. (2013)
Keyphrases
</>
routing and wavelength assignment
upper bound
sliding window
theorem prover
optimal solution
lower bound
scheduling problem
infrared
worst case bounds
linear logic
optical networks
wavelength division multiplexing
data sets
wdm networks
tight bounds
lagrangian relaxation
upper and lower bounds