Abstract
Protection is an important issue of resilience in elastic optical networks (EONs). Not only for working lightpaths, but also routing, modulation and spectrum assignment (RMSA) for backup paths is essential. In protection scheme, shared backup path protection (SBPP) is usually discussed now. SBPP allows backup lightpaths to share spectrum resource so that the amount of allocated frequency slots can be reduced. Spectrum usage critically affects blocking performance due to the limited resource in spectrum. For this reason, we aim at minimizing spectrum usage as our objective. For RMSA, many heuristic algorithms pursue the shortest path or minimum-hopped path and neglect the balance between number of required frequency slots and maximum transmission distance (MTD) of modulation levels. Therefore, we propose a RMSA algorithm, namely, lowest cost first and shortest path algorithm (LCF) to derive the RSA solutions for both working and backup lightpaths. However, among RSA solutions satisfying MTD constraint, the one with least vacant resource consumption might be neither the minimum-hopped path nor the shortest path. Hence we propose an enhanced RMSA algorithm called minimum usage algorithm (MU) to pre-calculate all paths satisfying MTD constraint and then find the one with minimum resource usage. Simulation results show that both LCF and MU can achieve great improvement on blocking performance.
| Original language | English |
|---|---|
| Title of host publication | 2019 International Conference on Computing, Networking and Communications, ICNC 2019 |
| Publisher | Institute of Electrical and Electronics Engineers Inc. |
| Pages | 602-606 |
| Number of pages | 5 |
| ISBN (Electronic) | 9781538692233 |
| DOIs | |
| Publication status | Published - 2019 Apr 8 |
| Event | 2019 International Conference on Computing, Networking and Communications, ICNC 2019 - Honolulu, United States Duration: 2019 Feb 18 → 2019 Feb 21 |
Publication series
| Name | 2019 International Conference on Computing, Networking and Communications, ICNC 2019 |
|---|
Conference
| Conference | 2019 International Conference on Computing, Networking and Communications, ICNC 2019 |
|---|---|
| Country | United States |
| City | Honolulu |
| Period | 19-02-18 → 19-02-21 |
Fingerprint
All Science Journal Classification (ASJC) codes
- Computer Networks and Communications
- Software
- Hardware and Architecture
Cite this
}
Spectrum Usage Minimization for Shared Backup Path Protection in Elastic Optical Networks. / Hsu, Ching-Fang; Hu, Hao Cheng; Fu, Hsuan Fang; Zheng, Jin Jun; Chen, Shi Xuan.
2019 International Conference on Computing, Networking and Communications, ICNC 2019. Institute of Electrical and Electronics Engineers Inc., 2019. p. 602-606 8685656 (2019 International Conference on Computing, Networking and Communications, ICNC 2019).Research output: Chapter in Book/Report/Conference proceeding › Conference contribution
TY - GEN
T1 - Spectrum Usage Minimization for Shared Backup Path Protection in Elastic Optical Networks
AU - Hsu, Ching-Fang
AU - Hu, Hao Cheng
AU - Fu, Hsuan Fang
AU - Zheng, Jin Jun
AU - Chen, Shi Xuan
PY - 2019/4/8
Y1 - 2019/4/8
N2 - Protection is an important issue of resilience in elastic optical networks (EONs). Not only for working lightpaths, but also routing, modulation and spectrum assignment (RMSA) for backup paths is essential. In protection scheme, shared backup path protection (SBPP) is usually discussed now. SBPP allows backup lightpaths to share spectrum resource so that the amount of allocated frequency slots can be reduced. Spectrum usage critically affects blocking performance due to the limited resource in spectrum. For this reason, we aim at minimizing spectrum usage as our objective. For RMSA, many heuristic algorithms pursue the shortest path or minimum-hopped path and neglect the balance between number of required frequency slots and maximum transmission distance (MTD) of modulation levels. Therefore, we propose a RMSA algorithm, namely, lowest cost first and shortest path algorithm (LCF) to derive the RSA solutions for both working and backup lightpaths. However, among RSA solutions satisfying MTD constraint, the one with least vacant resource consumption might be neither the minimum-hopped path nor the shortest path. Hence we propose an enhanced RMSA algorithm called minimum usage algorithm (MU) to pre-calculate all paths satisfying MTD constraint and then find the one with minimum resource usage. Simulation results show that both LCF and MU can achieve great improvement on blocking performance.
AB - Protection is an important issue of resilience in elastic optical networks (EONs). Not only for working lightpaths, but also routing, modulation and spectrum assignment (RMSA) for backup paths is essential. In protection scheme, shared backup path protection (SBPP) is usually discussed now. SBPP allows backup lightpaths to share spectrum resource so that the amount of allocated frequency slots can be reduced. Spectrum usage critically affects blocking performance due to the limited resource in spectrum. For this reason, we aim at minimizing spectrum usage as our objective. For RMSA, many heuristic algorithms pursue the shortest path or minimum-hopped path and neglect the balance between number of required frequency slots and maximum transmission distance (MTD) of modulation levels. Therefore, we propose a RMSA algorithm, namely, lowest cost first and shortest path algorithm (LCF) to derive the RSA solutions for both working and backup lightpaths. However, among RSA solutions satisfying MTD constraint, the one with least vacant resource consumption might be neither the minimum-hopped path nor the shortest path. Hence we propose an enhanced RMSA algorithm called minimum usage algorithm (MU) to pre-calculate all paths satisfying MTD constraint and then find the one with minimum resource usage. Simulation results show that both LCF and MU can achieve great improvement on blocking performance.
UR - http://www.scopus.com/inward/record.url?scp=85064985350&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85064985350&partnerID=8YFLogxK
U2 - 10.1109/ICCNC.2019.8685656
DO - 10.1109/ICCNC.2019.8685656
M3 - Conference contribution
AN - SCOPUS:85064985350
T3 - 2019 International Conference on Computing, Networking and Communications, ICNC 2019
SP - 602
EP - 606
BT - 2019 International Conference on Computing, Networking and Communications, ICNC 2019
PB - Institute of Electrical and Electronics Engineers Inc.
ER -