Share Email Print

Proceedings Paper

Capacity fairness of WDM networks with grooming capabilities
Author(s): Sashisekaran Thiagarajan; Arun K. Somani
Format Member Price Non-Member Price
PDF $17.00 $21.00

Paper Abstract

This paper addresses the issue of capacity fairness in WDM networks with traffic grooming capabilities, supporting lower- rate circuit-switched traffic streams. Traffic grooming in WDM networks, is defined as the act of multiplexing, demultiplexing and switching lower rate traffic streams onto higher capacity lightpaths. In such a network, in addition to add/drop and full wavelength switching features, some or all of the network nodes can be provided with the capability to switch lower-rate traffic streams from one wavelength on an input port to another wavelength on an output port. Call requests arrive randomly and can request a lower-rate traffic connection to be established between the node pair. The call requests that ask for capacity nearer to the full wavelength capacity are bound to experience higher blocking than those that ask for a smaller fraction. This difference in loss performance is more pronounced as the traffic switching capability of the network is increased. In this paper, we study the capacity fairness of existing dynamic wavelength assignment algorithms.

Paper Details

Date Published: 22 September 2000
PDF: 11 pages
Proc. SPIE 4233, OptiComm 2000: Optical Networking and Communications, (22 September 2000); doi: 10.1117/12.401818
Show Author Affiliations
Sashisekaran Thiagarajan, Iowa State Univ. (United States)
Arun K. Somani, Iowa State Univ. (United States)

Published in SPIE Proceedings Vol. 4233:
OptiComm 2000: Optical Networking and Communications
Imrich Chlamtac, Editor(s)

© SPIE. Terms of Use
Back to Top