Saved in:
Bibliographic Details
Main Authors: Davies, Ethan, Banfield, Darren, Carare, Vlad, Weaver, Ben, White, Catherine, Walker, Nigel
Format: Preprint
Published: 2024
Subjects:
Online Access:https://arxiv.org/abs/2402.07600
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866910326690152448
author Davies, Ethan
Banfield, Darren
Carare, Vlad
Weaver, Ben
White, Catherine
Walker, Nigel
author_facet Davies, Ethan
Banfield, Darren
Carare, Vlad
Weaver, Ben
White, Catherine
Walker, Nigel
contents A challenge for scalability of demand-responsive, elastic optical Dense Wavelength Division Multiplexing (DWDM) and Flexgrid networks is the computational complexity of allocating many optical routes on large networks. We demonstrate that demand satisfaction problems in communication networks can be formulated as quadratic unconstrained binary optimisation (QUBO) problems, and solved using a hybrid quantum annealer. Efficient encodings are developed which solve both unicast and multicast multicommodity-flow problems, while also adhering to individual requirements for maximum latency and resilience for each route. We present several QUBO formulations and analyse the qubit scaling. We demonstrate solutions using a hybrid solver, D-Wave Quantum Advantage QPU. Progress in generating optimal solutions with efficient use of computational resources will be beneficial to telecoms operators, enabling them to run dynamic optical network infrastructures which use resources efficiently, are resilient to local faults and cyber-attacks, and can be elastically responsive to demands.
format Preprint
id arxiv_https___arxiv_org_abs_2402_07600
institution arXiv
publishDate 2024
record_format arxiv
spellingShingle Optical Routing with Binary Optimisation and Quantum Annealing
Davies, Ethan
Banfield, Darren
Carare, Vlad
Weaver, Ben
White, Catherine
Walker, Nigel
Networking and Internet Architecture
F.2.m
A challenge for scalability of demand-responsive, elastic optical Dense Wavelength Division Multiplexing (DWDM) and Flexgrid networks is the computational complexity of allocating many optical routes on large networks. We demonstrate that demand satisfaction problems in communication networks can be formulated as quadratic unconstrained binary optimisation (QUBO) problems, and solved using a hybrid quantum annealer. Efficient encodings are developed which solve both unicast and multicast multicommodity-flow problems, while also adhering to individual requirements for maximum latency and resilience for each route. We present several QUBO formulations and analyse the qubit scaling. We demonstrate solutions using a hybrid solver, D-Wave Quantum Advantage QPU. Progress in generating optimal solutions with efficient use of computational resources will be beneficial to telecoms operators, enabling them to run dynamic optical network infrastructures which use resources efficiently, are resilient to local faults and cyber-attacks, and can be elastically responsive to demands.
title Optical Routing with Binary Optimisation and Quantum Annealing
topic Networking and Internet Architecture
F.2.m
url https://arxiv.org/abs/2402.07600