The University of Southampton
University of Southampton Institutional Repository

Quantum-assisted routing optimization for self-organizing networks

Alanis, Dimitrios, Botsinis, Panagiotis, Ng, Soon Xin and Hanzo, Lajos (2014) Quantum-assisted routing optimization for self-organizing networks IEEE Access, 2, pp. 614-632. (doi:10.1109/ACCESS.2014.2327596).

Record type: Article

Abstract

Self-Organizing Networks (SONs) 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 (QoS) requirements. Finding the optimal solution typically becomes an NP-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 bio-inspired algorithms that attempt to address this optimization problem, they often fail to generate all the points constituting the Optimal Pareto Front (OPF). As a remedy, we propose an optimal multi-objective quantum-assisted algorithm, namely the Non-dominated 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\sqrt{N})$ in the best- and worst-case scenario, respectively. This corresponds to a substantial complexity reduction of the NDQO from the order of $O(N^2)$ imposed by the brute-force (BF) method.

PDF access-hanzo-2327596-proof.pdf - Accepted Manuscript
Restricted to Repository staff only
Download (9MB)
Other stamp.jsp_tp=&arnumber=6825798&tag=1 - Version of Record
Download (1kB)

More information

e-pub ahead of print date: 4 June 2014
Published date: 10 June 2014
Keywords: ACO, BBHT-QSA, grover's QSA, NDQO, NSGA-II, pareto optimality, SONs, complexity reduction, quantum computing
Organisations: Southampton Wireless Group

Identifiers

Local EPrints ID: 365399
URI: http://eprints.soton.ac.uk/id/eprint/365399
PURE UUID: 36f715fb-ffb6-40f8-9ed0-8adbdac9acd7

Catalogue record

Date deposited: 04 Jun 2014 11:00
Last modified: 18 Jul 2017 02:22

Export record

Altmetrics

Contributors

Author: Dimitrios Alanis
Author: Panagiotis Botsinis
Author: Soon Xin Ng
Author: Lajos Hanzo

University divisions

Download statistics

Downloads from ePrints over the past year. Other digital versions may also be available to download e.g. from the publisher's website.

View more statistics

Atom RSS 1.0 RSS 2.0

Contact ePrints Soton: eprints@soton.ac.uk

ePrints Soton supports OAI 2.0 with a base URL of http://eprints.soton.ac.uk/cgi/oai2

This repository has been built using EPrints software, developed at the University of Southampton, but available to everyone to use.

We use cookies to ensure that we give you the best experience on our website. If you continue without changing your settings, we will assume that you are happy to receive cookies on the University of Southampton website.

×