A distributed clustering method for hierarchical routing in large-scaled wavelength routed networks

Yukinobu Fukushima, Hiroaki Harai, Shin'ichi Arakawa, Masayuki Murata

Research output: Contribution to journalArticle

7 Citations (Scopus)

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. copyright

Original languageEnglish
Pages (from-to)3904-3912
Number of pages9
JournalIEICE Transactions on Communications
VolumeE88-B
Issue number10
DOIs
Publication statusPublished - Oct 2005
Externally publishedYes

Fingerprint

Blocking probability
Wavelength
Routing protocols
Scalability
Experiments

Keywords

  • Distributed clustering copyright
  • Hierarchical routing
  • Lightpath network
  • Path-vector routing
  • WDM

ASJC Scopus subject areas

  • Electrical and Electronic Engineering
  • Computer Networks and Communications

Cite this

A distributed clustering method for hierarchical routing in large-scaled wavelength routed networks. / Fukushima, Yukinobu; Harai, Hiroaki; Arakawa, Shin'ichi; Murata, Masayuki.

In: IEICE Transactions on Communications, Vol. E88-B, No. 10, 10.2005, p. 3904-3912.

Research output: Contribution to journalArticle

Fukushima, Yukinobu ; Harai, Hiroaki ; Arakawa, Shin'ichi ; Murata, Masayuki. / A distributed clustering method for hierarchical routing in large-scaled wavelength routed networks. In: IEICE Transactions on Communications. 2005 ; Vol. E88-B, No. 10. pp. 3904-3912.
@article{f8f04032950b49f5be588005a4a59e60,
title = "A distributed clustering method for hierarchical routing in large-scaled wavelength routed networks",
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. copyright",
keywords = "Distributed clustering copyright, Hierarchical routing, Lightpath network, Path-vector routing, WDM",
author = "Yukinobu Fukushima and Hiroaki Harai and Shin'ichi Arakawa and Masayuki Murata",
year = "2005",
month = "10",
doi = "10.1093/ietcom/e88-b.10.3904",
language = "English",
volume = "E88-B",
pages = "3904--3912",
journal = "IEICE Transactions on Communications",
issn = "0916-8516",
publisher = "Maruzen Co., Ltd/Maruzen Kabushikikaisha",
number = "10",

}

TY - JOUR

T1 - A distributed clustering method for hierarchical routing in large-scaled wavelength routed networks

AU - Fukushima, Yukinobu

AU - Harai, Hiroaki

AU - Arakawa, Shin'ichi

AU - Murata, Masayuki

PY - 2005/10

Y1 - 2005/10

N2 - 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. copyright

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. copyright

KW - Distributed clustering copyright

KW - Hierarchical routing

KW - Lightpath network

KW - Path-vector routing

KW - WDM

UR - http://www.scopus.com/inward/record.url?scp=29144491511&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=29144491511&partnerID=8YFLogxK

U2 - 10.1093/ietcom/e88-b.10.3904

DO - 10.1093/ietcom/e88-b.10.3904

M3 - Article

VL - E88-B

SP - 3904

EP - 3912

JO - IEICE Transactions on Communications

JF - IEICE Transactions on Communications

SN - 0916-8516

IS - 10

ER -