A new quantum-inspired approach to reduce the blocking probability of demands in resource-constrained path computation scenarios
Abstract
This article presents a new approach related with end-to-end routing, which, owing to quantum-inspired mecha-nisms of prediction of availability of network resources, results in improved blocking probability of incoming requests to establish transmission paths. The proposed scheme has been analyzed for three network topologies and several scenarios of network load. Obtained results show a significant (even twofold) reduction of blocking probability in comparison to results characteristic to the reference solution.
Citations
-
0
CrossRef
-
0
Web of Science
-
0
Scopus
Authors (2)
Cite as
Full text
full text is not available in portal
Keywords
Details
- Category:
- Articles
- Type:
- artykuły w czasopismach recenzowanych i innych wydawnictwach ciągłych
- Published in:
-
Przegląd Telekomunikacyjny + Wiadomości Telekomunikacyjne
pages 728 - 734,
ISSN: 1230-3496 - Language:
- English
- Publication year:
- 2016
- Bibliographic description:
- Myslitski K., Rak J.: A new quantum-inspired approach to reduce the blocking probability of demands in resource-constrained path computation scenarios// Przegląd Telekomunikacyjny + Wiadomości Telekomunikacyjne. -., nr. 8-9 (2016), s.728-734
- DOI:
- Digital Object Identifier (open in new tab) 10.15199/59.2016.8-9.5
- Verified by:
- Gdańsk University of Technology
seen 93 times
Recommended for you
Dynamic Route Discovery Using Modified Grasshopper Optimization Algorithm in Wireless Ad-Hoc Visible Light Communication Network
- S. Vadivel,
- S. Konda,
- K. R. Balmuri
- + 2 authors
2021
Collision‐Aware Routing Using Multi‐Objective Seagull Optimization Algorithm for WSN‐Based IoT
- P. Jagannathan,
- S. Gurumoorthy,
- A. Stateczny
- + 2 authors
2021