2017 25th Telecommunication Forum (TELFOR) 2017
DOI: 10.1109/telfor.2017.8249295
|View full text |Cite
|
Sign up to set email alerts
|

Proposing bat inspired heuristic algorithm for the optimization of GMPLS networks

Abstract: -Introduction of modern and diverse applications in telecommunication field has raised challenges in networking area regarding efficient use of network resources and with optimizing performance. Therefore MPLS/GMPLS (Generalized multiprotocol label switching) networks were introduced to provide a better quality of service to meet users' requirements as well as to optimize network resources. GMPLS networks use traffic engineering techniques for more efficient communication within the network and help to optimiz… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
2
0
2

Year Published

2018
2018
2021
2021

Publication Types

Select...
4
1

Relationship

3
2

Authors

Journals

citations
Cited by 5 publications
(6 citation statements)
references
References 10 publications
0
2
0
2
Order By: Relevance
“…The first evaluation appears in the outcomes of solving the MCOP optimization problem in MPLS/ GMPLS networks by using the Pareto Front graphs. The second investigation is a comparative study analysis; where the offered algorithm performance is compared against numerous metaheuristic algorithms such as particle swarm optimization (PSO), adaptive PSO [33], [34], Bat algorithm [35] and Dolphin algorithm [36]. Both researches focus on an algorithm convergence ratio (particularly the trapping in local/global optima) to test how successfully the proposed algorithm fixed the exploration problem when compared to the other optimization algorithms.…”
Section: Empirical Assessmentsmentioning
confidence: 99%
“…The first evaluation appears in the outcomes of solving the MCOP optimization problem in MPLS/ GMPLS networks by using the Pareto Front graphs. The second investigation is a comparative study analysis; where the offered algorithm performance is compared against numerous metaheuristic algorithms such as particle swarm optimization (PSO), adaptive PSO [33], [34], Bat algorithm [35] and Dolphin algorithm [36]. Both researches focus on an algorithm convergence ratio (particularly the trapping in local/global optima) to test how successfully the proposed algorithm fixed the exploration problem when compared to the other optimization algorithms.…”
Section: Empirical Assessmentsmentioning
confidence: 99%
“…The path cost is denoted as and thus equal to the sum of its link costs. is an associated bandwidth which is routed on the path [5]. The total routing cost mathematically can be expressed as…”
Section: (B) Routing Costmentioning
confidence: 99%
“…Population-based techniques, such as simulated annealing, random generation, and metaheuristic algorithms, are examples of randomised algorithms. [5][6][7][8][9] Machine learning methods on the other hand are seen to solve the feature selection problem but with a great cost in computation, high complexities and premature convergence. In order to contain these drawbacks, metaheuristic algorithms were proposed, as they are good at dealing with these type of conditions.…”
Section: Introductionmentioning
confidence: 99%