Optimal WDM schedules for optical star networks

Abel Dasylva, R. Srikant

Research output: Contribution to journalArticlepeer-review

Abstract

We consider single-hop wavelength-division multiplexed networks in which the transmitters take a nonzero amount of time, called tuning latency, to tune from one wavelength to another. For such networks, we show that, under certain conditions on the traffic matrix, there exist polynomial-time algorithms that produce the optimal schedule. Further, the tuning latency is masked in the length of the optimal schedule. Using Chernoff-Hoeffding bounds, we show that the condition on the traffic matrix is satisfied with high probability when the wavelength reuse factor is large, i.e., the number of nodes is large compared to the number of wavelengths. Simulation results show the dramatic improvement in the performance of the network using our algorithm as compared with other heuristics.

Original languageEnglish (US)
Pages (from-to)446-456
Number of pages11
JournalIEEE/ACM Transactions on Networking
Volume7
Issue number3
DOIs
StatePublished - 1999

ASJC Scopus subject areas

  • Software
  • Computer Science Applications
  • Computer Networks and Communications
  • Electrical and Electronic Engineering

Fingerprint

Dive into the research topics of 'Optimal WDM schedules for optical star networks'. Together they form a unique fingerprint.

Cite this