On-line competitive algorithms for call admission in optical networks

DOI10.1007/S00453-001-0039-1zbMath0980.68009OpenAlexW2008126942MaRDI QIDQ5946121

No author found.

Publication date: 14 October 2001

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00453-001-0039-1

zbMATH Keywords

admission problem in optical networks

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10)

Related Items (8)

Randomized on-line algorithms and lower bounds for computing large independent sets in disk graphs ⋮ Online time-constrained scheduling in linear and ring networks ⋮ Competitive algorithms and lower bounds for online randomized call control in cellular networks ⋮ Scheduling to maximize participation ⋮ An experimental study of maximum profit wavelength assignment in WDM rings ⋮ Deterministic on-line call control in cellular networks ⋮ Scheduling to Maximize Participation ⋮ Nash equilibria in all-optical networks

This page was built for publication: On-line competitive algorithms for call admission in optical networks