Computing approximate blocking probabilities for a class of all-optical networks

  • Authors:
  • A. Birman

  • Affiliations:
  • IBM Thomas J. Watson Res. Center, Yorktown Heights, NY

  • Venue:
  • IEEE Journal on Selected Areas in Communications
  • Year:
  • 1996

Quantified Score

Hi-index 0.07

Visualization

Abstract

We study a class of all-optical networks using wavelength-division multiplexing (WDM) and wavelength routing, in which a connection between a pair of nodes in the network is assigned a path and a wavelength on that path. Moreover, on the links of that path no other connection can share the assigned wavelength. Using a generalized reduced load approximation scheme we calculate the blocking probabilities for the optical network model for two routing schemes: fixed routing and least loaded routing