A Distributed Clustering Method for Hierarchical Routing in Large-Scaled Wavelength Routed Networks
Summary :
The scalability of routing protocol has been considered as a key issue in large-scaled wavelength routed networks. Hierarchical routing scales well by yielding enormous reductions in routing table length, but it also increases path length. This increased path length in wavelength-routed networks leads to increased blocking probability because longer paths tend to have less free wavelength channels. However, if the routes assigned to longer paths have greater wavelength resources, we can expect that the blocking probability will not increase. In this paper, we propose a distributed node-clustering method that maximizes the number of lightpaths between nodes. The key idea behind our method is to construct node-clusters that have much greater wavelength resources from the ingress border nodes to the egress border nodes, which increases the wavelength resources on the routes of lightpaths between nodes. We evaluate the blocking probability for lightpath requests and the maximum table length in simulation experiments. We find that the method we propose significantly reduces the table length, while the blocking probability is almost the same as that without clustering.
- Publication
- IEICE TRANSACTIONS on Communications Vol.E88-B No.10 pp.3904-3913
- Publication Date
- 2005/10/01
- Publicized
- Online ISSN
- DOI
- 10.1093/ietcom/e88-b.10.3904
- Type of Manuscript
- Special Section PAPER (Special Section on Next Generation 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
Yukinobu FUKUSHIMA, Hiroaki HARAI, Shin'ichi ARAKAWA, Masayuki MURATA, "A Distributed Clustering Method for Hierarchical Routing in Large-Scaled Wavelength Routed Networks" in IEICE TRANSACTIONS on Communications,
vol. E88-B, no. 10, pp. 3904-3913, October 2005, doi: 10.1093/ietcom/e88-b.10.3904.
Abstract: The scalability of routing protocol has been considered as a key issue in large-scaled wavelength routed networks. Hierarchical routing scales well by yielding enormous reductions in routing table length, but it also increases path length. This increased path length in wavelength-routed networks leads to increased blocking probability because longer paths tend to have less free wavelength channels. However, if the routes assigned to longer paths have greater wavelength resources, we can expect that the blocking probability will not increase. In this paper, we propose a distributed node-clustering method that maximizes the number of lightpaths between nodes. The key idea behind our method is to construct node-clusters that have much greater wavelength resources from the ingress border nodes to the egress border nodes, which increases the wavelength resources on the routes of lightpaths between nodes. We evaluate the blocking probability for lightpath requests and the maximum table length in simulation experiments. We find that the method we propose significantly reduces the table length, while the blocking probability is almost the same as that without clustering.
URL: https://global.ieice.org/en_transactions/communications/10.1093/ietcom/e88-b.10.3904/_p
Copy
@ARTICLE{e88-b_10_3904,
author={Yukinobu FUKUSHIMA, Hiroaki HARAI, Shin'ichi ARAKAWA, Masayuki MURATA, },
journal={IEICE TRANSACTIONS on Communications},
title={A Distributed Clustering Method for Hierarchical Routing in Large-Scaled Wavelength Routed Networks},
year={2005},
volume={E88-B},
number={10},
pages={3904-3913},
abstract={The scalability of routing protocol has been considered as a key issue in large-scaled wavelength routed networks. Hierarchical routing scales well by yielding enormous reductions in routing table length, but it also increases path length. This increased path length in wavelength-routed networks leads to increased blocking probability because longer paths tend to have less free wavelength channels. However, if the routes assigned to longer paths have greater wavelength resources, we can expect that the blocking probability will not increase. In this paper, we propose a distributed node-clustering method that maximizes the number of lightpaths between nodes. The key idea behind our method is to construct node-clusters that have much greater wavelength resources from the ingress border nodes to the egress border nodes, which increases the wavelength resources on the routes of lightpaths between nodes. We evaluate the blocking probability for lightpath requests and the maximum table length in simulation experiments. We find that the method we propose significantly reduces the table length, while the blocking probability is almost the same as that without clustering.},
keywords={},
doi={10.1093/ietcom/e88-b.10.3904},
ISSN={},
month={October},}
Copy
TY - JOUR
TI - A Distributed Clustering Method for Hierarchical Routing in Large-Scaled Wavelength Routed Networks
T2 - IEICE TRANSACTIONS on Communications
SP - 3904
EP - 3913
AU - Yukinobu FUKUSHIMA
AU - Hiroaki HARAI
AU - Shin'ichi ARAKAWA
AU - Masayuki MURATA
PY - 2005
DO - 10.1093/ietcom/e88-b.10.3904
JO - IEICE TRANSACTIONS on Communications
SN -
VL - E88-B
IS - 10
JA - IEICE TRANSACTIONS on Communications
Y1 - October 2005
AB - The scalability of routing protocol has been considered as a key issue in large-scaled wavelength routed networks. Hierarchical routing scales well by yielding enormous reductions in routing table length, but it also increases path length. This increased path length in wavelength-routed networks leads to increased blocking probability because longer paths tend to have less free wavelength channels. However, if the routes assigned to longer paths have greater wavelength resources, we can expect that the blocking probability will not increase. In this paper, we propose a distributed node-clustering method that maximizes the number of lightpaths between nodes. The key idea behind our method is to construct node-clusters that have much greater wavelength resources from the ingress border nodes to the egress border nodes, which increases the wavelength resources on the routes of lightpaths between nodes. We evaluate the blocking probability for lightpath requests and the maximum table length in simulation experiments. We find that the method we propose significantly reduces the table length, while the blocking probability is almost the same as that without clustering.
ER -
English
