A Small-World Optimization Algorithm Based and ABC Supported QoS Unicast Routing Scheme

Wang, Xingwei; Cai, Shuxiang; Huang, Min

doi:10.1007/978-3-540-74784-0_25

Cited by 4 publications

(2 citation statements)

References 18 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…SWOA believes that the search process is a basic of information transmission process in search space networks that both operators provided. SWOA was applied in few areas to address optimizations that include network routing problem [244], automobile sequencing problem [245], neural network problem [246]. At the present time of this writing, SWOA is not adopted to any t-way testing strategy.…”

Section: Physic-based Techniquementioning

confidence: 99%

Review of Nature Inspired Metaheuristic Algorithm Selection for Combinatorial t-Way Testing

2022

View full text Add to dashboard Cite

Metaheuristic algorithm is a very important area of research that continuously improve in solving optimization problems. Nature-inspired is one of the classifications of metaheuristic algorithm that are becoming more popular among researchers for the last decades. Nature-inspired metaheuristic algorithms contributes significantly to tackling many standing complex problems (such as combinatorial tway testing problem) and achieving optimal results. One challenge in this area is combinatorial explosion problem which always intended to find the most optimal final test suite that will cover all combinations of a given interaction strength. As such, test case generation is selected as the most active research area in combinatorial t-way testing as Non-deterministic Polynomial-time hardness (NP-hard). However, not all metaheuristics are effectively adopted in combinatorial t-way testing, some proved to be effective and thus have been popular tools selected for optimization whilst others are not adopted. This research paper outlines hundred and ten (110) outstanding nature-inspired metaheuristic algorithms for the last decades (2001 and 2021) such as Coronavirus Optimization Algorithm, Ebola Optimization Algorithm, Harmony Search, Tiki-Taka Algorithm, and so on. The purpose of this review is to revisit and carry out up-to-date review on these distinguished algorithms with their respective current state of use. This is to inspire future research in the field of combinatorial t-way testing for better optimization. Thus, we found that all metaheuristics has a simple structure to be adopted in different areas for becoming a more efficient in optimization. Finally, we suggested some future paths of investigation for researchers who are interested in the combinatorial t-way testing field to employ more of these algorithms by tuning their parameters setting to achieve an optimal solution.

show abstract

Section: Physic-based Techniquementioning

confidence: 99%

Review of Nature Inspired Metaheuristic Algorithm Selection for Combinatorial t-Way Testing

2022

View full text Add to dashboard Cite

show abstract

“…Nie [8] proposed a QoS routing algorithm based on the pulsecoupled neural network model. In order to describe the user QoS requirements and network link parameters, Wang [9] introduces intervals to solve them and proposes organizational evolution-based ABC supported unicast routing scheme. Du [10] proposed a novel ant-colony optimized QoS routing algorithm based on multiple transferring strategies.…”

Section: Introductionmentioning

confidence: 99%

Elitist Distance Based Pareto Genetic Unicast Routing Scheme with Always Best Connected Support

Yang¹,

Wang²,

Huang³

2013

AMM

View full text Add to dashboard Cite

In this paper, an ABC (Always Best Connected) supported QoS (Quality of Service) unicast routing scheme is proposed. In the proposed scheme, in order to overcome difficulties on accurately measuring network link parameter values and exactly expressing user QoS requirements, the knowledge of the fuzzy mathematics and probability theory is introduced, and the range is used to describe these parameters; both of the users utility and the network providers utility are computed, and gaming analysis is taken to deal with profits of both the user and the network provider; EDPGA (Elitist Distance-based Pareto Genetic Algorithm) is used to find the specific QoS unicast path with Pareto optimum under Nash Equilibrium among all parties utilities achieved or approached. While comparing with unicast routing scheme based on Dijkstra and the game theory based fuzzy unicast QoS routing scheme, simulation results show that this proposed scheme is both feasible and effective.

show abstract

Small-World Optimization Applied to Job Scheduling on Grid Environments from a Multi-Objective Perspective

Arsuaga-Ríos

Prieto‐Castrillo

Vega‐Rodríguez

2012

Applications of Evolutionary Computation

View full text Add to dashboard Cite

A Small-World Optimization Algorithm Based and ABC Supported QoS Unicast Routing Scheme

Cited by 4 publications

References 18 publications

Review of Nature Inspired Metaheuristic Algorithm Selection for Combinatorial t-Way Testing

Review of Nature Inspired Metaheuristic Algorithm Selection for Combinatorial t-Way Testing

Elitist Distance Based Pareto Genetic Unicast Routing Scheme with Always Best Connected Support

Small-World Optimization Applied to Job Scheduling on Grid Environments from a Multi-Objective Perspective

Contact Info

Product

Resources

About