Abstract
In wavelength division multiplexing (WDM) technology, high-speed large-capacity communication is realized by transmitting multiple optical signals with different wavelengths in parallel on an optical fiber. In WDM technology, the logical topology of the network can generally be modified by changing the wavelength assignment to the transmitters and receivers. Thus it is important to develop an algorithm that derives the wavelength assignment that maximizes the transmission efficiency of the network. This paper considers a bidirectional Manhattan street network which has a regular topology, and proposes a hierarchical two-stage heuristic algorithm. In the first stage, the initial solution is derived by hierarchical region division and node assignment to the regions. In the second stage, the solution is improved by simulated annealing (SA). The proposed algorithm is evaluated by simulations of random instances and instances for which optimal solutions are already known. The effectiveness of the proposed algorithm is demonstrated through comparisons to the existing one.
| Original language | English |
|---|---|
| Pages (from-to) | 74-83 |
| Number of pages | 10 |
| Journal | Systems and Computers in Japan |
| Volume | 38 |
| Issue number | 4 |
| DOIs | |
| Publication status | Published - Apr 2007 |
Fingerprint
Keywords
- Heuristic algorithm
- Hierarchical structure
- Manhattan street network
- Node assignment
- Wavelength division multiplexing
ASJC Scopus subject areas
- Hardware and Architecture
- Information Systems
- Theoretical Computer Science
- Computational Theory and Mathematics
Cite this
Proposal of a hierarchical heuristic algorithm for node assignment in bidirectional manhattan street networks. / Yonezu, Masataka; Funabiki, Nobuo; Kitani, Tomoya; Yokohira, Tokumi; Nakanishi, Toru; Higashino, Teruo.
In: Systems and Computers in Japan, Vol. 38, No. 4, 04.2007, p. 74-83.Research output: Contribution to journal › Article
}
TY - JOUR
T1 - Proposal of a hierarchical heuristic algorithm for node assignment in bidirectional manhattan street networks
AU - Yonezu, Masataka
AU - Funabiki, Nobuo
AU - Kitani, Tomoya
AU - Yokohira, Tokumi
AU - Nakanishi, Toru
AU - Higashino, Teruo
PY - 2007/4
Y1 - 2007/4
N2 - In wavelength division multiplexing (WDM) technology, high-speed large-capacity communication is realized by transmitting multiple optical signals with different wavelengths in parallel on an optical fiber. In WDM technology, the logical topology of the network can generally be modified by changing the wavelength assignment to the transmitters and receivers. Thus it is important to develop an algorithm that derives the wavelength assignment that maximizes the transmission efficiency of the network. This paper considers a bidirectional Manhattan street network which has a regular topology, and proposes a hierarchical two-stage heuristic algorithm. In the first stage, the initial solution is derived by hierarchical region division and node assignment to the regions. In the second stage, the solution is improved by simulated annealing (SA). The proposed algorithm is evaluated by simulations of random instances and instances for which optimal solutions are already known. The effectiveness of the proposed algorithm is demonstrated through comparisons to the existing one.
AB - In wavelength division multiplexing (WDM) technology, high-speed large-capacity communication is realized by transmitting multiple optical signals with different wavelengths in parallel on an optical fiber. In WDM technology, the logical topology of the network can generally be modified by changing the wavelength assignment to the transmitters and receivers. Thus it is important to develop an algorithm that derives the wavelength assignment that maximizes the transmission efficiency of the network. This paper considers a bidirectional Manhattan street network which has a regular topology, and proposes a hierarchical two-stage heuristic algorithm. In the first stage, the initial solution is derived by hierarchical region division and node assignment to the regions. In the second stage, the solution is improved by simulated annealing (SA). The proposed algorithm is evaluated by simulations of random instances and instances for which optimal solutions are already known. The effectiveness of the proposed algorithm is demonstrated through comparisons to the existing one.
KW - Heuristic algorithm
KW - Hierarchical structure
KW - Manhattan street network
KW - Node assignment
KW - Wavelength division multiplexing
UR - http://www.scopus.com/inward/record.url?scp=34247373912&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=34247373912&partnerID=8YFLogxK
U2 - 10.1002/scj.10534
DO - 10.1002/scj.10534
M3 - Article
AN - SCOPUS:34247373912
VL - 38
SP - 74
EP - 83
JO - Systems and Computers in Japan
JF - Systems and Computers in Japan
SN - 0882-1666
IS - 4
ER -