2013
DOI: 10.1016/j.jnca.2013.02.008
|View full text |Cite
|
Sign up to set email alerts
|

A Pareto-based hybrid multiobjective evolutionary approach for constrained multipath traffic engineering optimization in MPLS/GMPLS networks

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
18
0
3

Year Published

2015
2015
2020
2020

Publication Types

Select...
3
2
2

Relationship

0
7

Authors

Journals

citations
Cited by 21 publications
(21 citation statements)
references
References 25 publications
0
18
0
3
Order By: Relevance
“…These optimization techniques belong to various classes of optimization such as swarm, artificial intelligence or evolutionary based methodologies [11]. We proposed heuristic algorithm known as Pareto Particle Swarm Optimization with Elitist Learning Strategy (PPSO_ELS) for optimizing the multipath selection in MPLS/ GMPLS networks.…”
Section: Proposed Methodologymentioning
confidence: 99%
See 2 more Smart Citations
“…These optimization techniques belong to various classes of optimization such as swarm, artificial intelligence or evolutionary based methodologies [11]. We proposed heuristic algorithm known as Pareto Particle Swarm Optimization with Elitist Learning Strategy (PPSO_ELS) for optimizing the multipath selection in MPLS/ GMPLS networks.…”
Section: Proposed Methodologymentioning
confidence: 99%
“…However, due to computation complexity exact method takes long time to solve it. Therefore, heuristic based approaches become an appealing for solving this problem [10], [11]. In modern telecommunication networks, many network service providers offer MPLS/ GMPLS based routers that can be used for packets, fibre, time and wavelength switching technologies In this paper, an MPLS/ GMPLS core network is represented as graphs, where links are edges and routers are vertices.…”
Section: Related Workmentioning
confidence: 99%
See 1 more Smart Citation
“…Each path is a summation of connected links within the GMPLS network domain. This can be explained by the given expression as [12]:…”
Section: B Routing Cost Fitness Function In Gmpls Networkmentioning
confidence: 99%
“…The objective function for the algorithm is to find the route/ path as an optimal solution that uses the 'minimal total routing costs'. The objective function of the total routing costs is represented as [12]:…”
Section: B Routing Cost Fitness Function In Gmpls Networkmentioning
confidence: 99%