2016
DOI: 10.1007/s10462-016-9517-3
|View full text |Cite
|
Sign up to set email alerts
|

Topologies and performance of intelligent algorithms: a comprehensive review

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
28
0

Year Published

2017
2017
2023
2023

Publication Types

Select...
6
2

Relationship

1
7

Authors

Journals

citations
Cited by 60 publications
(29 citation statements)
references
References 98 publications
0
28
0
Order By: Relevance
“…The proposed approach is a hybridization of a type‐2 fuzzy system and cuckoo optimization algorithm. The performance of the proposed T2FS‐COA approach is evaluated in comparison with the following algorithms: The proposed approach using the enhanced version of COA introduced in this paper and with type‐1 fuzzy system instead of the type‐2 fuzzy system. Ant Colony Optimization (ACO)‐based approach by Parsaie et al 7,48 which is introduced in the Related Works Section. The proposed approach using the basic COA instead of the enhanced version introduced in this paper and without fuzzy system. The OSPF which is a well‐known routing protocol for investigating the shortest possible path between source and destination nodes working based on the Dijkstra algorithm. The cost of each link is calculated based on the bandwidth of the link just like the one using Equation . Uuv=GitalicuvitalicBWitalicuv0.75em where G uv is the available bandwidth of link (u, v) , BW uv is its total bandwidth, and U uv is considered as the cost of (u, v).…”
Section: Performance Evaluationmentioning
confidence: 99%
“…The proposed approach is a hybridization of a type‐2 fuzzy system and cuckoo optimization algorithm. The performance of the proposed T2FS‐COA approach is evaluated in comparison with the following algorithms: The proposed approach using the enhanced version of COA introduced in this paper and with type‐1 fuzzy system instead of the type‐2 fuzzy system. Ant Colony Optimization (ACO)‐based approach by Parsaie et al 7,48 which is introduced in the Related Works Section. The proposed approach using the basic COA instead of the enhanced version introduced in this paper and without fuzzy system. The OSPF which is a well‐known routing protocol for investigating the shortest possible path between source and destination nodes working based on the Dijkstra algorithm. The cost of each link is calculated based on the bandwidth of the link just like the one using Equation . Uuv=GitalicuvitalicBWitalicuv0.75em where G uv is the available bandwidth of link (u, v) , BW uv is its total bandwidth, and U uv is considered as the cost of (u, v).…”
Section: Performance Evaluationmentioning
confidence: 99%
“…For instance, for prediction model, we have probability (m1)⟵ 1 − 2 10 It goes without saying that the summation of all the probabilities should be 1 as the above example showed it. After calculating the probability of all constituent prediction models, we can easily choose one of them by Rolette wheel algorithm 29 and return the prediction value of the chosen prediction model as the output of this function (see lines 19 and 20).…”
Section: The Proposed Prediction-based Allocation Algorithmmentioning
confidence: 99%
“…This framework named OpenQoS causes video traffic flows optimally in the network and is received by destination with more quality. The controller created two paths between source and destination: one for common traffic (based on OSPF algorithm) and another for multimedia traffic (based on CSP model [23] and Optimization [24][25][26][27][28]). Simulation results showed that for both actual scenario and simulation one using this model decreased PSNR parameter of receiving video in the destination.…”
Section: Related Workmentioning
confidence: 99%