Switch Placement Algorithms in Optical WDM Heterogeneous Networks
碩士 === 國立臺灣大學 === 資訊管理學研究所 === 93 === With the rapid development of Wavelength Division Multiplexing (WDM), a fiber can carry more and more wavelengths, but the complexity and the cost of Optical Cross-connects (OXCs) also increase. To deal with the problem, General Multi-Protocol Labeling Switchin...
Main Authors: | , |
---|---|
Other Authors: | |
Format: | Others |
Language: | en_US |
Published: |
2005
|
Online Access: | http://ndltd.ncl.edu.tw/handle/21201778259612593231 |
id |
ndltd-TW-093NTU05396036 |
---|---|
record_format |
oai_dc |
spelling |
ndltd-TW-093NTU053960362015-12-21T04:04:15Z http://ndltd.ncl.edu.tw/handle/21201778259612593231 Switch Placement Algorithms in Optical WDM Heterogeneous Networks 異質性光波長多工光網路之交換器配置演算法 Hsiao-Tse Chang 張孝澤 碩士 國立臺灣大學 資訊管理學研究所 93 With the rapid development of Wavelength Division Multiplexing (WDM), a fiber can carry more and more wavelengths, but the complexity and the cost of Optical Cross-connects (OXCs) also increase. To deal with the problem, General Multi-Protocol Labeling Switching (GMPLS) defines three kind of switching methods: fiber switch capable, waveband switch capable, and lambda switch capable. In a heterogeneous optical network, we allow each node to have one of the switching capabilities. OXCs contribute most to the planning cost of optical networks, and the cost of OXCs is in proportion to the number of ports. Therefore, while a fiber can carry hundreds of wavelengths, the cost of OXCs increases proportionally. Furthermore, there is still a shortage of ports in the OXC design. In this thesis, we allocate the switch nodes properly based on the lowest cost, and satisfy all the static traffic demand in a heterogeneous network. We model this problem as an integer programming problem with an objective function and several constraints, which is very complicated. Since the routing and wavelength assignment problem (RWA) is a well known NP-hard problem, and our problem contains the RWA problem, our problem is also NP-hard. As we cannot solve it in polynomial time by well known algorithms, we adopt Lagrangean relaxation as the solution approach. In addition, we propose a simple heuristic algorithm modified from an RWA problem, and conduct several experiments on different network topologies. We find that the experiment results of Lagrangean Relaxation are better then those of the simple heuristic algorithm. Yeong-Sung Lin 林永松 2005 學位論文 ; thesis 69 en_US |
collection |
NDLTD |
language |
en_US |
format |
Others
|
sources |
NDLTD |
description |
碩士 === 國立臺灣大學 === 資訊管理學研究所 === 93 === With the rapid development of Wavelength Division Multiplexing (WDM), a fiber can carry more and more wavelengths, but the complexity and the cost of Optical Cross-connects (OXCs) also increase. To deal with the problem, General Multi-Protocol Labeling Switching (GMPLS) defines three kind of switching methods: fiber switch capable, waveband switch capable, and lambda switch capable. In a heterogeneous optical network, we allow each node to have one of the switching capabilities. OXCs contribute most to the planning cost of optical networks, and the cost of OXCs is in proportion to the number of ports. Therefore, while a fiber can carry hundreds of wavelengths, the cost of OXCs increases proportionally. Furthermore, there is still a shortage of ports in the OXC design.
In this thesis, we allocate the switch nodes properly based on the lowest cost, and satisfy all the static traffic demand in a heterogeneous network. We model this problem as an integer programming problem with an objective function and several constraints, which is very complicated. Since the routing and wavelength assignment problem (RWA) is a well known NP-hard problem, and our problem contains the RWA problem, our problem is also NP-hard. As we cannot solve it in polynomial time by well known algorithms, we adopt Lagrangean relaxation as the solution approach.
In addition, we propose a simple heuristic algorithm modified from an RWA problem, and conduct several experiments on different network topologies. We find that the experiment results of Lagrangean Relaxation are better then those of the simple heuristic algorithm.
|
author2 |
Yeong-Sung Lin |
author_facet |
Yeong-Sung Lin Hsiao-Tse Chang 張孝澤 |
author |
Hsiao-Tse Chang 張孝澤 |
spellingShingle |
Hsiao-Tse Chang 張孝澤 Switch Placement Algorithms in Optical WDM Heterogeneous Networks |
author_sort |
Hsiao-Tse Chang |
title |
Switch Placement Algorithms in Optical WDM Heterogeneous Networks |
title_short |
Switch Placement Algorithms in Optical WDM Heterogeneous Networks |
title_full |
Switch Placement Algorithms in Optical WDM Heterogeneous Networks |
title_fullStr |
Switch Placement Algorithms in Optical WDM Heterogeneous Networks |
title_full_unstemmed |
Switch Placement Algorithms in Optical WDM Heterogeneous Networks |
title_sort |
switch placement algorithms in optical wdm heterogeneous networks |
publishDate |
2005 |
url |
http://ndltd.ncl.edu.tw/handle/21201778259612593231 |
work_keys_str_mv |
AT hsiaotsechang switchplacementalgorithmsinopticalwdmheterogeneousnetworks AT zhāngxiàozé switchplacementalgorithmsinopticalwdmheterogeneousnetworks AT hsiaotsechang yìzhìxìngguāngbōzhǎngduōgōngguāngwǎnglùzhījiāohuànqìpèizhìyǎnsuànfǎ AT zhāngxiàozé yìzhìxìngguāngbōzhǎngduōgōngguāngwǎnglùzhījiāohuànqìpèizhìyǎnsuànfǎ |
_version_ |
1718154572218761216 |