
For FullText PDF, please login, if you are a member of IEICE,
or go to Pay Per View on menu list, if you are a nonmember of IEICE.

Regulated Transport Network Design Using Geographical Resolution
Shohei KAMAMURA Aki FUKUDA Rie HAYASHI Yoshihiko UEMATSU
Publication
IEICE TRANSACTIONS on Communications
Vol.E101B
No.3
pp.805815 Publication Date: 2018/03/01 Publicized: 2017/08/28 Online ISSN: 17451345
DOI: 10.1587/transcom.2017EBP3239 Type of Manuscript: PAPER Category: Network Keyword: graph mining, IP over DWDM, optical transport network, optimization, RWA problem, subgraph isomorphism problem,
Full Text: PDF(2.3MB)>>
Summary:
This paper proposes a regulated transport network design algorithm for IP over a dense wavelength division multiplex (DWDM) network. When designing an IP over DWDM network, the network operator should consider not only costeffectiveness and physical constraints such as wavelength colors and chromatic dispersion but also operational policies such as resilience, quality, stability, and operability. For considering the above polices, we propose to separate the network design algorithm based on a geographical resolution; the policybased regulated intraarea is designed based on this resolution, and the costoptimal interarea is then designed separately, and finally merged. This approach does not necessarily yield a strict optimal solution, but it covers network design work done by humans, which takes a vast amount of time and requires a high skill level. For efficient geographical resolution, we also present fast graph mining algorithm, which can solve NPhard subgraph isomorphism problem within the practical time. We prove the sufficiency of the resulting network design for the above polices by visualizing the topology, and also prove that the penalty of applying the approach is trivial.

