Quantum inspired genetic algorithm and optimization of queuing delay
Queuing delay is the waiting time for the packets in the queue before processing. It significantly impacts the network compared to processing, and transmission delays. The delay occurs when a packet suddenly arrives faster than the processing of packets at different time. Minimum queuing delay is required to have better network control and high efficiency. In this paper, we proposed the quantum inspired genetic algorithm to obtain the minimum queuing delay and maximum arrival rate in a network. A quantum inspired crossover and mutation technique is designed. It provides an optimal point between maximum average arrival rate with minimum average queuing delay. The performance and convergence of the proposed algorithm are evaluated. The inspired algorithm can help to solve other optimization problems as well.
Authors
- Joseph L. Pachuau
- Nongmeikapam Brajabidhu Singh (ORCID: https://orcid.org/0000-0002-4454-1568)
- Anish Kumar Saha (ORCID: https://orcid.org/0000-0002-3736-9632)
- Arnab Roy (ORCID: https://orcid.org/0000-0002-3284-7076)
Institutions
- National Institute Of Technology Silchar (IN)
Publication Details
- Published
- 2024-12-01
- DOI
- https://doi.org/10.1109/tencon61640.2024.10902749
- Citations
- 1
- Primary Topic
- Cloud Computing and Resource Management
- Type
- article
- Field-Weighted Citation Impact
- 0.78