An Efficient Void Filling Algorithm for WDM Optical Packet Switches Operating under Variable-Packet-Length Self-Similar Traffic

Chih-How CHANG; Meng-Guang TSAI; Shou-Kuo SHAO; Hen-Wai TSAO; Malla REDDY PERATI; Jingshown WU

doi:10.1093/ietcom/e88-b.12.4659

An Efficient Void Filling Algorithm for WDM Optical Packet Switches Operating under Variable-Packet-Length Self-Similar Traffic

Chih-How CHANG, Meng-Guang TSAI, Shou-Kuo SHAO, Hen-Wai TSAO, Malla REDDY PERATI, Jingshown WU

Full Text Views

0

Share
Cite this

Summary :

An efficient void filling (VF) algorithm is proposed for wavelength division multiplexing (WDM) optical packet switches (OPSes) handling variable-packet-length self-similar traffic. The computation complexity of the proposed algorithm is extremely low. We further compare the switching performance of the proposed algorithm with that of the conventional one. We demonstrate that the proposed algorithm offers significantly lower computation complexity with adequate performance.

Publication: IEICE TRANSACTIONS on Communications Vol.E88-B No.12 pp.4659-4663

Publication Date: 2005/12/01

Publicized

Online ISSN

DOI: 10.1093/ietcom/e88-b.12.4659

Type of Manuscript: LETTER

Category: Switching for Communications

Authors

Chih-How CHANG
Meng-Guang TSAI
Shou-Kuo SHAO
Hen-Wai TSAO
Malla REDDY PERATI
Jingshown WU

Keyword

Cite this

Copy

Chih-How CHANG, Meng-Guang TSAI, Shou-Kuo SHAO, Hen-Wai TSAO, Malla REDDY PERATI, Jingshown WU, "An Efficient Void Filling Algorithm for WDM Optical Packet Switches Operating under Variable-Packet-Length Self-Similar Traffic" in IEICE TRANSACTIONS on Communications, vol. E88-B, no. 12, pp. 4659-4663, December 2005, doi: 10.1093/ietcom/e88-b.12.4659.
Abstract: An efficient void filling (VF) algorithm is proposed for wavelength division multiplexing (WDM) optical packet switches (OPSes) handling variable-packet-length self-similar traffic. The computation complexity of the proposed algorithm is extremely low. We further compare the switching performance of the proposed algorithm with that of the conventional one. We demonstrate that the proposed algorithm offers significantly lower computation complexity with adequate performance.
URL: https://globals.ieice.org/en_transactions/communications/10.1093/ietcom/e88-b.12.4659/_p

Copy

@ARTICLE{e88-b_12_4659,
author={Chih-How CHANG, Meng-Guang TSAI, Shou-Kuo SHAO, Hen-Wai TSAO, Malla REDDY PERATI, Jingshown WU, },
journal={IEICE TRANSACTIONS on Communications},
title={An Efficient Void Filling Algorithm for WDM Optical Packet Switches Operating under Variable-Packet-Length Self-Similar Traffic},
year={2005},
volume={E88-B},
number={12},
pages={4659-4663},
abstract={An efficient void filling (VF) algorithm is proposed for wavelength division multiplexing (WDM) optical packet switches (OPSes) handling variable-packet-length self-similar traffic. The computation complexity of the proposed algorithm is extremely low. We further compare the switching performance of the proposed algorithm with that of the conventional one. We demonstrate that the proposed algorithm offers significantly lower computation complexity with adequate performance.},
keywords={},
doi={10.1093/ietcom/e88-b.12.4659},
ISSN={},
month={December},}

Copy

TY - JOUR
TI - An Efficient Void Filling Algorithm for WDM Optical Packet Switches Operating under Variable-Packet-Length Self-Similar Traffic
T2 - IEICE TRANSACTIONS on Communications
SP - 4659
EP - 4663
AU - Chih-How CHANG
AU - Meng-Guang TSAI
AU - Shou-Kuo SHAO
AU - Hen-Wai TSAO
AU - Malla REDDY PERATI
AU - Jingshown WU
PY - 2005
DO - 10.1093/ietcom/e88-b.12.4659
JO - IEICE TRANSACTIONS on Communications
SN -
VL - E88-B
IS - 12
JA - IEICE TRANSACTIONS on Communications
Y1 - December 2005
AB - An efficient void filling (VF) algorithm is proposed for wavelength division multiplexing (WDM) optical packet switches (OPSes) handling variable-packet-length self-similar traffic. The computation complexity of the proposed algorithm is extremely low. We further compare the switching performance of the proposed algorithm with that of the conventional one. We demonstrate that the proposed algorithm offers significantly lower computation complexity with adequate performance.
ER -