Path Accommodation Methods for Unidirectional Rings with Optical Compression TDM
Summary :
In this paper, we propose path accommodation methods for unidirectional rings based on an optical compression time-division multiplexing (OCTDM) technology. We first derive a theoretical lower bound on the numbers of slots and frames, in order to allocate all paths among nodes. Three path accommodation algorithms for the all-optical access are next proposed to achieve the lower bound as closely as possible. Path splitting is next considered to improve the traffic accommodation. Finally, we analyze the packet delay time for given numbers of slots/frames, which are decided by our proposed algorithms. Numerical examples are also shown to examine the effectiveness of our proposed algorithms including path accommodation and path splitting methods.
- Publication
- IEICE TRANSACTIONS on Communications Vol.E83-B No.10 pp.2294-2303
- Publication Date
- 2000/10/25
- Publicized
- Online ISSN
- DOI
- Type of Manuscript
- Special Section PAPER (Special Issue on Advanced Internetworking based on Photonic Network Technologies)
- Category
Authors
Keyword
Latest Issue
Copyrights notice of machine-translated contents
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Cite this
Copy
Kazuhiro GOKYU, Ken-ichi BABA, Masayuki MURATA, "Path Accommodation Methods for Unidirectional Rings with Optical Compression TDM" in IEICE TRANSACTIONS on Communications,
vol. E83-B, no. 10, pp. 2294-2303, October 2000, doi: .
Abstract: In this paper, we propose path accommodation methods for unidirectional rings based on an optical compression time-division multiplexing (OCTDM) technology. We first derive a theoretical lower bound on the numbers of slots and frames, in order to allocate all paths among nodes. Three path accommodation algorithms for the all-optical access are next proposed to achieve the lower bound as closely as possible. Path splitting is next considered to improve the traffic accommodation. Finally, we analyze the packet delay time for given numbers of slots/frames, which are decided by our proposed algorithms. Numerical examples are also shown to examine the effectiveness of our proposed algorithms including path accommodation and path splitting methods.
URL: https://global.ieice.org/en_transactions/communications/10.1587/e83-b_10_2294/_p
Copy
@ARTICLE{e83-b_10_2294,
author={Kazuhiro GOKYU, Ken-ichi BABA, Masayuki MURATA, },
journal={IEICE TRANSACTIONS on Communications},
title={Path Accommodation Methods for Unidirectional Rings with Optical Compression TDM},
year={2000},
volume={E83-B},
number={10},
pages={2294-2303},
abstract={In this paper, we propose path accommodation methods for unidirectional rings based on an optical compression time-division multiplexing (OCTDM) technology. We first derive a theoretical lower bound on the numbers of slots and frames, in order to allocate all paths among nodes. Three path accommodation algorithms for the all-optical access are next proposed to achieve the lower bound as closely as possible. Path splitting is next considered to improve the traffic accommodation. Finally, we analyze the packet delay time for given numbers of slots/frames, which are decided by our proposed algorithms. Numerical examples are also shown to examine the effectiveness of our proposed algorithms including path accommodation and path splitting methods.},
keywords={},
doi={},
ISSN={},
month={October},}
Copy
TY - JOUR
TI - Path Accommodation Methods for Unidirectional Rings with Optical Compression TDM
T2 - IEICE TRANSACTIONS on Communications
SP - 2294
EP - 2303
AU - Kazuhiro GOKYU
AU - Ken-ichi BABA
AU - Masayuki MURATA
PY - 2000
DO -
JO - IEICE TRANSACTIONS on Communications
SN -
VL - E83-B
IS - 10
JA - IEICE TRANSACTIONS on Communications
Y1 - October 2000
AB - In this paper, we propose path accommodation methods for unidirectional rings based on an optical compression time-division multiplexing (OCTDM) technology. We first derive a theoretical lower bound on the numbers of slots and frames, in order to allocate all paths among nodes. Three path accommodation algorithms for the all-optical access are next proposed to achieve the lower bound as closely as possible. Path splitting is next considered to improve the traffic accommodation. Finally, we analyze the packet delay time for given numbers of slots/frames, which are decided by our proposed algorithms. Numerical examples are also shown to examine the effectiveness of our proposed algorithms including path accommodation and path splitting methods.
ER -
English
