Dynamic routing and spectrum assignment based on multilayer virtual topology and ant colony optimization in elastic software-defined optical networks

Fu Wang, Bo Liu*, Lijia Zhang, Qi Zhang, Qinghua Tian, Feng Tian, Lan Rao, Xiangjun Xin

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

12 Citations (Scopus)

Abstract

Elastic software-defined optical networks greatly improve the flexibility of the optical switching network while it has brought challenges to the routing and spectrum assignment (RSA). A multilayer virtual topology model is proposed to solve RSA problems. Two RSA algorithms based on the virtual topology are proposed, which are the ant colony optimization (ACO) algorithm of minimum consecutiveness loss and the ACO algorithm of maximum spectrum consecutiveness. Due to the computing power of the control layer in the software-defined network, the routing algorithm avoids the frequent link-state information between routers. Based on the effect of the spectrum consecutiveness loss on the pheromone in the ACO, the path and spectrum of the minimal impact on the network are selected for the service request. The proposed algorithms have been compared with other algorithms. The results show that the proposed algorithms can reduce the blocking rate by at least 5% and perform better in spectrum efficiency. Moreover, the proposed algorithms can effectively decrease spectrum fragmentation and enhance available spectrum consecutiveness.

Original languageEnglish
Article number076111
JournalOptical Engineering
Volume56
Issue number7
DOIs
Publication statusPublished - 1 Jul 2017
Externally publishedYes

Keywords

  • Virtual topology
  • ant colony optimization
  • dynamic routing and spectrum assignment
  • spectrum consecutiveness

Fingerprint

Dive into the research topics of 'Dynamic routing and spectrum assignment based on multilayer virtual topology and ant colony optimization in elastic software-defined optical networks'. Together they form a unique fingerprint.

Cite this