Heuristic and genetic algorithms for solving the virtual topology design problem on elastic optical networks

Research output: Contribution to journalArticle

Abstract

Elastic optical networks (EONs) are considered as very promising architectures for future optical transport networks, since they efficiently use the spectrum resources and provide high bandwidth scalability and granularity. In this paper, the virtual topology design (VTD) problem on EON is considered. Given the physical network and the traffic demand matrix, the goal of VTD is to find the routing paths and the allocated frequency slots of the demand so that the objective cost can be minimized. In this paper, multiple-path routing is allowed and delay-variation between lightpaths for same demand is considered. In this paper, an integer linear programming (ILP) model is used to define the VTD problem on EONs. Moreover, a genetic algorithm (GA) and two heuristic algorithms are proposed to solve this problem. Simulations show that the proposed algorithms can achieve good results.

Original languageEnglish
Pages (from-to)305-327
Number of pages23
JournalJournal of Information Science and Engineering
Volume33
Issue number2
DOIs
Publication statusPublished - 2017 Mar 1

Fingerprint

Heuristic algorithms
Fiber optic networks
heuristics
Genetic algorithms
Topology
demand
Linear programming
transport network
Scalability
Bandwidth
programming
traffic
simulation
Costs
costs
resources

All Science Journal Classification (ASJC) codes

  • Software
  • Human-Computer Interaction
  • Hardware and Architecture
  • Library and Information Sciences
  • Computational Theory and Mathematics

Cite this

@article{cf0d2e5113c4444ea38b87c01e2dd8c0,
title = "Heuristic and genetic algorithms for solving the virtual topology design problem on elastic optical networks",
abstract = "Elastic optical networks (EONs) are considered as very promising architectures for future optical transport networks, since they efficiently use the spectrum resources and provide high bandwidth scalability and granularity. In this paper, the virtual topology design (VTD) problem on EON is considered. Given the physical network and the traffic demand matrix, the goal of VTD is to find the routing paths and the allocated frequency slots of the demand so that the objective cost can be minimized. In this paper, multiple-path routing is allowed and delay-variation between lightpaths for same demand is considered. In this paper, an integer linear programming (ILP) model is used to define the VTD problem on EONs. Moreover, a genetic algorithm (GA) and two heuristic algorithms are proposed to solve this problem. Simulations show that the proposed algorithms can achieve good results.",
author = "Der-Rong Din",
year = "2017",
month = "3",
day = "1",
doi = "10.1688/JISE.2017.33.2.3",
language = "English",
volume = "33",
pages = "305--327",
journal = "Journal of Information Science and Engineering",
issn = "1016-2364",
publisher = "Institute of Information Science",
number = "2",

}

TY - JOUR

T1 - Heuristic and genetic algorithms for solving the virtual topology design problem on elastic optical networks

AU - Din, Der-Rong

PY - 2017/3/1

Y1 - 2017/3/1

N2 - Elastic optical networks (EONs) are considered as very promising architectures for future optical transport networks, since they efficiently use the spectrum resources and provide high bandwidth scalability and granularity. In this paper, the virtual topology design (VTD) problem on EON is considered. Given the physical network and the traffic demand matrix, the goal of VTD is to find the routing paths and the allocated frequency slots of the demand so that the objective cost can be minimized. In this paper, multiple-path routing is allowed and delay-variation between lightpaths for same demand is considered. In this paper, an integer linear programming (ILP) model is used to define the VTD problem on EONs. Moreover, a genetic algorithm (GA) and two heuristic algorithms are proposed to solve this problem. Simulations show that the proposed algorithms can achieve good results.

AB - Elastic optical networks (EONs) are considered as very promising architectures for future optical transport networks, since they efficiently use the spectrum resources and provide high bandwidth scalability and granularity. In this paper, the virtual topology design (VTD) problem on EON is considered. Given the physical network and the traffic demand matrix, the goal of VTD is to find the routing paths and the allocated frequency slots of the demand so that the objective cost can be minimized. In this paper, multiple-path routing is allowed and delay-variation between lightpaths for same demand is considered. In this paper, an integer linear programming (ILP) model is used to define the VTD problem on EONs. Moreover, a genetic algorithm (GA) and two heuristic algorithms are proposed to solve this problem. Simulations show that the proposed algorithms can achieve good results.

UR - http://www.scopus.com/inward/record.url?scp=85052761609&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85052761609&partnerID=8YFLogxK

U2 - 10.1688/JISE.2017.33.2.3

DO - 10.1688/JISE.2017.33.2.3

M3 - Article

VL - 33

SP - 305

EP - 327

JO - Journal of Information Science and Engineering

JF - Journal of Information Science and Engineering

SN - 1016-2364

IS - 2

ER -