Cited by 46Metaheuristic Optimization Algorithms ResearchAdvanced Multi-Objective Optimization AlgorithmsNetwork Traffic and Congestion Control

Quantum-Assisted Routing Optimization for Self-Organizing Networks

Open access
ALANIS, DIMITRIOS, BOTSINIS, PANAGIOTIS, NG, SOON XIN, HANZO, LAJOS·2014·IEEE Access

Abstract

Self-organizing networks act autonomously for the sake of achieving the best possible performance. The attainable routing depends on a delicate balance of diverse and often conflicting quality-of-service requirements. Finding the optimal solution typically becomes an nonolynomial-hard problem, as the network size increases in terms of the number of nodes. Moreover, the employment of user-defined utility functions for the aggregation of the different objective functions often leads to suboptimal solutions. On the other hand, Pareto optimality is capable of amalgamating the different design objectives by providing an element of elitism. Although there is a plethora of bioinspired algorithms that attempt to address this optimization problem, they often fail to generate all the points constituting the optimal Pareto front. As a remedy, we propose an optimal multiobjective quantum-assisted algorithm, namely the nondominated quantum optimization algorithm (NDQO), which evaluates the legitimate routes using the concept of Pareto optimality at a reduced complexity. We then compare the performance of the NDQO algorithm to the state-of-the-art evolutionary algorithms, demonstrating that the NDQO algorithm achieves a near-optimal performance. Furthermore, we analytically derive the upper and lower bounds of the NDQO algorithmic complexity, which is of the order of O(N) and O(N√(N)) in the best and worst case scenario, respectively. This corresponds to a substantial complexity reduction of the NDQO from the order of O(N2) imposed by the brute-force method.

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1109/access.2014.2327596

Cites

51 of 51 references verified0 citation errors · 0 not checkable

Statistics

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Cites

Part of this paper’s reference list could not be split into single entries.

Flagged first, then by citations

Research works printed but not linked: 1

  1. [40]40. R. Steele and L. Hanzo, Mobile Radio Communications: Second and Third Generation Cellular and WATM Systems. New York, NY, USA: Wiley, 1999.

Cited by

Sorted by citations

Authors
ALANIS, D., BOTSINIS, P., NG, S. X., & HANZO, L.
Affiliations
University of Southampton (GB)
Venue
IEEE Access
Published
2014
Volume
2
Pages
614-632
ISSN
2169-3536 (ISSN-L)
OpenAlex
W2065008622
Cited by
46
References
49
Citations by year
2025: 4 · 2024: 1 · 2023: 3 · 2022: 6 · 2021: 5 · 2020: 4 · 2019: 3 · 2018: 4 · 2017: 4 · 2016: 6 · 2015: 6
FWCI
5.27
Type
journal article
Language
en
Open access
Locations
  • IEEE Access (publishedVersion)
  • DOAJ (DOAJ: Directory of Open Access Journals) (submittedVersion, cc-by-sa)
  • ePrints Soton (University of Southampton) (submittedVersion)
Funders
  • Engineering and Physical Sciences Research Council (EP/L018659/1)
  • RC-UK under the India-UK Advanced Technology Centre
  • EU under the CONCERTO Project and that of the European Research Council
  • Royal Society’s Wolfson Research Merit
Topics
  • Physical Sciences › Computer Science › Artificial Intelligence › Metaheuristic Optimization Algorithms Research
  • Physical Sciences › Computer Science › Computational Theory and Mathematics › Advanced Multi-Objective Optimization Algorithms
  • Physical Sciences › Computer Science › Computer Networks and Communications › Network Traffic and Congestion Control
Keywords
self-organizing networks, quantum-assisted optimization, route optimization, Pareto optimality, multi-objective optimization, quality of service, evolutionary algorithm comparison

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review