Blocking Models of All-Optical WDM Networks under Distributed Wavelength Assignment Policies

Ssang-Soo LEE; Chang-Hyung LEE; Seung-Woo SEO

Blocking Models of All-Optical WDM Networks under Distributed Wavelength Assignment Policies

Ssang-Soo LEE, Chang-Hyung LEE, Seung-Woo SEO

Full Text Views

0

Cite this

Summary :

In this paper, we investigate the blocking characteristics of all-optical WDM (Wavelength-Division Multiplexing) networks under distributed wavelength assignment policies. For assigning wavelengths in a distributed manner, we consider two algorithms: random and locally-most-used algorithm. For a random wavelength assignment policy, we develop new blocking models of unidirectional/bidirectional ring networks based on the M/M/c/c queueing models under uniform/nonuniform traffic conditions. These models are shown to be more accurate than the previous blocking models since our approach considers the large traffic correlation among links in ring networks. We also analyze the blocking performance of the locally-most-used algorithm by comparing with that of the globally-most-used algorithm in fixed routing networks. We show that our analysis models match well with the simulation results in ring and mesh networks. Through the comparison with the previous centralized/distributed algorithms, it is demonstrated that the distributed locally-most-used algorithm is computationally efficient with good blocking performance.

Publication: IEICE TRANSACTIONS on Communications Vol.E84-B No.1 pp.17-25

Publication Date: 2001/01/01

Publicized

Online ISSN

DOI

Type of Manuscript: PAPER

Category: Fiber-Optic Transmission

Cite this

Copy

Ssang-Soo LEE, Chang-Hyung LEE, Seung-Woo SEO, "Blocking Models of All-Optical WDM Networks under Distributed Wavelength Assignment Policies" in IEICE TRANSACTIONS on Communications, vol. E84-B, no. 1, pp. 17-25, January 2001, doi: .
Abstract: In this paper, we investigate the blocking characteristics of all-optical WDM (Wavelength-Division Multiplexing) networks under distributed wavelength assignment policies. For assigning wavelengths in a distributed manner, we consider two algorithms: random and locally-most-used algorithm. For a random wavelength assignment policy, we develop new blocking models of unidirectional/bidirectional ring networks based on the M/M/c/c queueing models under uniform/nonuniform traffic conditions. These models are shown to be more accurate than the previous blocking models since our approach considers the large traffic correlation among links in ring networks. We also analyze the blocking performance of the locally-most-used algorithm by comparing with that of the globally-most-used algorithm in fixed routing networks. We show that our analysis models match well with the simulation results in ring and mesh networks. Through the comparison with the previous centralized/distributed algorithms, it is demonstrated that the distributed locally-most-used algorithm is computationally efficient with good blocking performance.
URL: https://global.ieice.org/en_transactions/communications/10.1587/e84-b_1_17/_p

Copy

@ARTICLE{e84-b_1_17,
author={Ssang-Soo LEE, Chang-Hyung LEE, Seung-Woo SEO, },
journal={IEICE TRANSACTIONS on Communications},
title={Blocking Models of All-Optical WDM Networks under Distributed Wavelength Assignment Policies},
year={2001},
volume={E84-B},
number={1},
pages={17-25},
abstract={In this paper, we investigate the blocking characteristics of all-optical WDM (Wavelength-Division Multiplexing) networks under distributed wavelength assignment policies. For assigning wavelengths in a distributed manner, we consider two algorithms: random and locally-most-used algorithm. For a random wavelength assignment policy, we develop new blocking models of unidirectional/bidirectional ring networks based on the M/M/c/c queueing models under uniform/nonuniform traffic conditions. These models are shown to be more accurate than the previous blocking models since our approach considers the large traffic correlation among links in ring networks. We also analyze the blocking performance of the locally-most-used algorithm by comparing with that of the globally-most-used algorithm in fixed routing networks. We show that our analysis models match well with the simulation results in ring and mesh networks. Through the comparison with the previous centralized/distributed algorithms, it is demonstrated that the distributed locally-most-used algorithm is computationally efficient with good blocking performance.},
keywords={},
doi={},
ISSN={},
month={January},}

Copy

TY - JOUR
TI - Blocking Models of All-Optical WDM Networks under Distributed Wavelength Assignment Policies
T2 - IEICE TRANSACTIONS on Communications
SP - 17
EP - 25
AU - Ssang-Soo LEE
AU - Chang-Hyung LEE
AU - Seung-Woo SEO
PY - 2001
DO -
JO - IEICE TRANSACTIONS on Communications
SN -
VL - E84-B
IS - 1
JA - IEICE TRANSACTIONS on Communications
Y1 - January 2001
AB - In this paper, we investigate the blocking characteristics of all-optical WDM (Wavelength-Division Multiplexing) networks under distributed wavelength assignment policies. For assigning wavelengths in a distributed manner, we consider two algorithms: random and locally-most-used algorithm. For a random wavelength assignment policy, we develop new blocking models of unidirectional/bidirectional ring networks based on the M/M/c/c queueing models under uniform/nonuniform traffic conditions. These models are shown to be more accurate than the previous blocking models since our approach considers the large traffic correlation among links in ring networks. We also analyze the blocking performance of the locally-most-used algorithm by comparing with that of the globally-most-used algorithm in fixed routing networks. We show that our analysis models match well with the simulation results in ring and mesh networks. Through the comparison with the previous centralized/distributed algorithms, it is demonstrated that the distributed locally-most-used algorithm is computationally efficient with good blocking performance.
ER -