We study the on-line call admission problem in optical networks. We present
a general technique that allows us to reduce the problem of call admission
and wavelength selection to the call admission problem. We then give rando
mized algorithms with logarithmic competitive ratios for specific topologie
s in switchless and reconfigurable optical networks. We conclude by conside
ring full duplex communications.