
Please use this identifier to cite or link to this item:
http://dspace.bits-pilani.ac.in:8080/jspui/handle/123456789/19485
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Kulshrestha, Rakhee | - |
dc.date.accessioned | 2025-09-20T06:35:24Z | - |
dc.date.available | 2025-09-20T06:35:24Z | - |
dc.date.issued | 2024-03 | - |
dc.identifier.uri | https://link.springer.com/article/10.1007/s12597-024-00742-8 | - |
dc.identifier.uri | http://dspace.bits-pilani.ac.in:8080/jspui/handle/123456789/19485 | - |
dc.description.abstract | This work describes the economic feasibility of a single server discrete-time queueing model, (Geo/G/1) where interarrival times have a geometric distribution, and service times have a general distribution. This work is motivated by the case of discrete-time queueing models under priority scheme for solving many congestion issues of the telecommunication system wherein few calls are treated as prioritized calls and system manager may handle it properly. Herein a state-dependent arrival policy is used. It is assumed that the clients arrive in groups of varying sizes, and incorporates only one server queueing system with unlimited capacity. Under a discrete-time system with Markovian service practice, clients are serviced one at a time. If a client is dissatisfied with his service, he will most likely be directed back to the front of the queue. This concept is commonly referred to as Bernoulli feedback (BF) in queueing scenario. Just after every service, it is presumed that the server either starts to identify the next client to be serviced with some probability, or the server starts a solo vacation procedure with its complementary probability and this process is referred as Bernoulli vacation (BV). In addition, preferred and impatient clients are examined too. We investigate the Markov chain that underpins the queueing system in question, and its normalizing condition. The average number of consumers in the queue and the system are found using a generating function method. The numeral expositions are ascertained to delve the impact of different parameters on various performance metrics which can give information to system management in order to monitor the system's functioning condition and decrease congestion. We then used direct search method (DSM) and Particle Swarm Optimization (PSO) approaches to present a comparative study to assist system administrators or decision-makers by economically regulating the system. Furthermore, the results of the provided model are contrasted to those of a soft computing approach termed as ANFIS (Adaptive Neuro-Fuzzy Inference System). | en_US |
dc.language.iso | en | en_US |
dc.publisher | Springer | en_US |
dc.subject | Mathematics | en_US |
dc.subject | Discrete-time Geo/Geo/1 G-queue | en_US |
dc.subject | Bernoulli feedback | en_US |
dc.subject | Direct search method (DSM) | en_US |
dc.subject | Particle swarm optimization (PSO) | en_US |
dc.title | Cost scrutiny of discrete-time priority queue with cluster arrival and Bernoulli feedback | en_US |
dc.type | Animation | en_US |
Appears in Collections: | Department of Mathematics |
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.