Call blocking probabilities in a traffic-groomed tandem optical network

Conference Paper

In this paper, we consider an optical network consisting of N nodes arranged in tandem. We assume traffic grooming, which permits multiple sub-rate traffic streams to be carried on the same wavelength. This optical network is modeled by a tandem queueing network of multi-rate Erlang loss nodes with simultaneous resource possession, with a view to calculating call blocking probabilities. The queueing network is analyzed by decomposition using a modified version of Courtois' algorithm. Numerical comparisons of the decomposition algorithm against simulation show that the algorithm has good accuracy. Also, it is shown that the proposed algorithm is an improvement over the well-known single-node decomposition algorithm based on the link-independence assumption. © 2004 Elsevier B.V. All rights reserved.

Full Text

Duke Authors

Cited Authors

  • Washington, AN; Perros, H

Published Date

  • June 21, 2004

Published In

Volume / Issue

  • 45 / 3

Start / End Page

  • 281 - 294

International Standard Serial Number (ISSN)

  • 1389-1286

Digital Object Identifier (DOI)

  • 10.1016/j.comnet.2004.03.008

Citation Source

  • Scopus