Dependency-based analytical model for computing connection blocking rates and its application in the sparse placement of optical converters
In this paper, we present a new analytical model that captures link dependencies in all-optical wavelength-division multiplexing (WDM) networks under uniform traffic and enables the estimation of connection-blocking probabilities more accurately than previously possible. The basic formula of the dep...
Saved in:
Published in: | IEEE transactions on communications Vol. 54; no. 1; pp. 159 - 168 |
---|---|
Main Authors: | , |
Format: | Journal Article |
Language: | English |
Published: |
New York, NY
IEEE
01-01-2006
Institute of Electrical and Electronics Engineers The Institute of Electrical and Electronics Engineers, Inc. (IEEE) |
Subjects: | |
Online Access: | Get full text |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Summary: | In this paper, we present a new analytical model that captures link dependencies in all-optical wavelength-division multiplexing (WDM) networks under uniform traffic and enables the estimation of connection-blocking probabilities more accurately than previously possible. The basic formula of the dependency between two links in this model reflects their degree of adjacency, the degree of connectivity of the nodes composing them, and their carried traffic. Our validation tests have shown that the analytical dependency model gives accurate results and successfully captures the main dependency characteristics observed in the simulation measurements. The usefulness of the model is illustrated by showing how to use it in enhancing a simulation-based algorithm that we recently proposed for the sparse placement of full wavelength converters in WDM networks. To analytically handle the presence of wavelength converters, a lightpath containing converters is divided into smaller subpaths, such that each subpath is a wavelength-continuous path, and the nodes shared between these subpaths are full wavelength-conversion-capable. The blocking probability of the entire path is obtained by computing the probabilities in the individual subpaths. We validate the analytically-based sparse placement algorithm by comparing it with its simulation-based counterpart using a number of network topologies. |
---|---|
Bibliography: | ObjectType-Article-2 SourceType-Scholarly Journals-1 ObjectType-Feature-1 content type line 23 |
ISSN: | 0090-6778 1558-0857 |
DOI: | 10.1109/TCOMM.2005.861649 |