A Spectrum Assignment Algorithm in Elastic Optical Network With Minimum Sum of Weighted Resource Reductions in all Associated Paths

Elastic optical network (EON) is a promising technology for the next generation of optical transport network. Routing, modulation and spectrum assignment is one of the key issues in EON. In the problem, the constraints of spectrum continuity and contiguity must be satisfied. In this paper, we propos...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:Journal of lightwave technology Ročník 37; číslo 21; s. 5583 - 5592
Hlavní autori: Yuan, Junling, Zhu, Ruijie, Zhao, Yongli, Zhang, Qikun, Li, Xuhong, Zhang, Di, Samuel, Aretor
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: New York IEEE 01.11.2019
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Predmet:
Algorithms
Blocking
Blocking probability
Computer simulation
elastic optical network (EON)
Idling
Optical communication
Optical fiber networks
Optical modulation
Partitioning algorithms
resource reduction
Route planning
Routing
routing modulation and spectrum assignment (RMSA)
Simulation
Topology
Wavelength division multiplexing
ISSN:0733-8724, 1558-2213
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí:Elastic optical network (EON) is a promising technology for the next generation of optical transport network. Routing, modulation and spectrum assignment is one of the key issues in EON. In the problem, the constraints of spectrum continuity and contiguity must be satisfied. In this paper, we propose a spectrum assignment policy named minimizing sum of weighted resource reductions (min ΣwΔR) algorithm. The algorithm includes three contributions:1) The concept of resource reduction (ΔR) is defined to measure variation of idle resources in a path when a spectrum block is assigned to a connection request, which is combination of changes of continuity and contiguity in the path. 2) When a spectrum block in a path is used, resource reductions in all associated paths rather than only the current path are taken into account. 3) A function of path's hop is used as a weight to adjust the path's impact. Simulations were carried out based on the national science foundation network (NSF-Net) and the pan-European Cost239 network (Cost239) to investigate the performance of the algorithm, by comparing with three well-performed benchmarks. Simulation results show that, when the parameters of the metric are set to appropriate values, the proposed algorithm can significantly decrease blocking probability in both two topologies.
Bibliografia:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:0733-8724
1558-2213
DOI:10.1109/JLT.2019.2935506