Bitte benutzen Sie diese Kennung, um auf die Ressource zu verweisen: http://dx.doi.org/10.18419/opus-14632
Langanzeige der Metadaten
DC ElementWertSprache
dc.contributor.authorWitt, Arthur-
dc.contributor.authorKim, Jangho-
dc.contributor.authorKörber, Christopher-
dc.contributor.authorLuu, Thomas-
dc.date.accessioned2024-07-12T07:47:09Z-
dc.date.available2024-07-12T07:47:09Z-
dc.date.issued2024de
dc.identifier.issn2624-9898-
dc.identifier.other1895453895-
dc.identifier.urihttp://nbn-resolving.de/urn:nbn:de:bsz:93-opus-ds-146511de
dc.identifier.urihttp://elib.uni-stuttgart.de/handle/11682/14651-
dc.identifier.urihttp://dx.doi.org/10.18419/opus-14632-
dc.description.abstractResource allocation of wide-area internet networks is inherently a combinatorial optimization problem that if solved quickly, could provide near real-time adaptive control of internet-protocol traffic ensuring increased network efficacy and robustness, while minimizing energy requirements coming from power-hungry transceivers. In recent works we demonstrated how such a problem could be cast as a quadratic unconstrained binary optimization (QUBO) problem that can be embedded onto the D-Wave Advantage™ quantum annealer system, demonstrating proof of principle. Our initial studies left open the possibility for improvement of D-Wave solutions via judicious choices of system run parameters. Here we report on our investigations for optimizing these system parameters, and how we incorporate machine learning (ML) techniques to further improve on the quality of solutions. In particular, we use the Hamming distance to investigate correlations between various system-run parameters and solution vectors. We then apply a decision tree neural network (NN) to learn these correlations, with the goal of using the neural network to provide further guesses to solution vectors. We successfully implement this NN in a simple integer linear programming (ILP) example, demonstrating how the NN can fully map out the solution space that was not captured by D-Wave. We find, however, for the 3-node network problem the NN is not able to enhance the quality of space of solutions.en
dc.description.sponsorshipGerman Federal Ministry of Education and Researchde
dc.description.sponsorshipDeutsche Forschungsgemeinschaftde
dc.description.sponsorshipJülich Supercomputing Centrede
dc.language.isoende
dc.relation.uridoi:10.3389/fcomp.2024.1356983de
dc.rightsinfo:eu-repo/semantics/openAccessde
dc.rights.urihttps://creativecommons.org/licenses/by/4.0/de
dc.subject.ddc004de
dc.titleILP-based resource optimization realized by quantum annealing for optical wide-area communication networks : a framework for solving combinatorial problems of a real-world application by quantum annealingen
dc.typearticlede
dc.date.updated2024-06-24T06:10:50Z-
ubs.fakultaetInformatik, Elektrotechnik und Informationstechnikde
ubs.fakultaetFakultätsübergreifend / Sonstige Einrichtungde
ubs.institutInstitut für Kommunikationsnetze und Rechnersystemede
ubs.institutFakultätsübergreifend / Sonstige Einrichtungde
ubs.publikation.seiten14de
ubs.publikation.sourceFrontiers in computer science 6 (2024), No. 1356983de
ubs.publikation.typZeitschriftenartikelde
Enthalten in den Sammlungen:05 Fakultät Informatik, Elektrotechnik und Informationstechnik

Dateien zu dieser Ressource:
Datei Beschreibung GrößeFormat 
Data_Sheet_1.PDFSupplement1,07 MBAdobe PDFÖffnen/Anzeigen
fcomp-06-1356983.pdfArtikel3,06 MBAdobe PDFÖffnen/Anzeigen


Diese Ressource wurde unter folgender Copyright-Bestimmung veröffentlicht: Lizenz von Creative Commons Creative Commons