Results 71 to 80 of about 796 (198)

On the M/G/1 retrial queue subjected to breakdowns

open access: yes, 2002
Retrial queueing systems are characterized by the requirement that customers finding the service area busy must join the retrial group and reapply for service at random intervals. This paper deals with the M/G/1 retrial queue subjected to breakdowns.
Djellab, Natalia V., Natalia V. Djellab
core   +1 more source

On The Mx/G/1 Retrial Queue With Impatient Customers [PDF]

open access: yes, 2011
In this work, we carry out a stochastic analysis of the M/G/1 retrial queue with batch arrivals and impatient customers. Our study includes: steady state joint distribution of the server state and the number of customers in retrial group, embedded Markov
Baillon, J. B.   +2 more
core   +1 more source

Analysis of retrial queue with heterogeneous servers and Markovian arrival process

open access: yesInformatika, 2020
Multi-server retrial queueing system with heterogeneous servers is analyzed. Requests arrive to the system according to the Markovian arrival process. Arriving primary requests and requests retrying from orbit occupy an available server with the highest ...
Mei Liu
doaj   +1 more source

Supporting Smart Manufacturing in the Space Industry: A Case Study

open access: yesEngineering Reports, Volume 7, Issue 1, January 2025.
ABSTRACT In the era of Industry 4.0, the New Space Economy, often called Space 4.0, has taken center stage in the satellite industry. The advent of mega‐constellations, which entails mass satellite production, necessitates state‐of‐the‐art manufacturing methods.
Ala Arman   +3 more
wiley   +1 more source

(R2060) An M/G/1 Retrial Queue with Recurrent Customers, General Retrial Times and Working Vacation

open access: yes, 2023
In this article, we analyze an M/G/1 retrial queue with recurrent customers, general retrial times and working vacation. In this model, we use two types of customers.
Pauline Veronica, A. Jeba   +1 more
core  

Stochastic analysis of a single server unreliable queue with balking and general retrial time

open access: yesDiscrete and Continuous Models and Applied Computational Science, 2020
In this investigation, we consider an M/G/1 queue with general retrial times allowing balking and server subject to breakdowns and repairs. In addition, the customer whose service is interrupted can stay at the server waiting for repair or leave and ...
Mohamed Boualem
doaj   +1 more source

A Next‐Generation Approach to Airline Reservations: Integrating Cloud Microservices With AI and Blockchain for Enhanced Operational Performance

open access: yesIET Blockchain, Volume 5, Issue 1, January/December 2025.
This research presents a next‐generation airline reservation system that integrates cloud microservices, distributed Artificial intelligence (AI) modules, and blockchain technology to improve system efficiency, security, and customer satisfaction. The proposed architecture enhances scalability, transaction speed, and fraud prevention, while increasing ...
Biman Barua, M. Shamim Kaiser
wiley   +1 more source

Multiserver Retrial Queue with Two-Way Communication and Synchronous Working Vacation

open access: yesMathematics
This work investigates a two-way communication retrial queue with synchronous working vacation and a constant retrial policy. During the idle time, a server makes an outgoing call after a random length.
Tzu-Hsin Liu   +3 more
doaj   +1 more source

Modelling a Reliable Multimedia Transmission Approach for Medical Wireless Sensor Networks

open access: yesIET Cyber-Physical Systems: Theory &Applications, Volume 10, Issue 1, January/December 2025.
The process of secret key sharing utilises the sender's public secret key and the receiver's private secret key to generate a shared secret key between the two devices. This same secret key generation method applies to communication between a sensor and a base station, whether in single‐hop or multi‐hop scenarios. Once the secret key is generated, data
R. Nidhya   +7 more
wiley   +1 more source

Adaptive Routing Strategies for Optimisation in MANETs Through Integration of Expanding Ring Search and Random Early Detection Using Machine Learning

open access: yesIET Networks, Volume 14, Issue 1, January/December 2025.
Mobile ad hoc networks (MANETs) rely heavily on routing protocols (RPs) to ensure optimal network performance and quality of service (QoS). This study integrates an adaptive expanding ring search (AERS) mechanism with machine learning classifiers (AdaBoost, KNN, and DT) to optimise routing and control congestion. Validation through network simulator 3 (
Durre Nayab   +2 more
wiley   +1 more source

Home - About - Disclaimer - Privacy