A Queue in Overall Telecommunication System with Quality of Service Guarantees

Andonov, Velin; Poryazov, Stoyan; Otsetova, Anna; Saranova, Emiliya

doi:10.1007/978-3-030-23976-3_22

Cited by 8 publications

(7 citation statements)

References 3 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The construction of a GN model of a queueing system with tokens duration of life is an important step towards the development of a conceptual model of overall telecommunication network with queueing system in the switching stage. It is interesting to compare such model to the one proposed in [2].…”

Section: Resultsmentioning

confidence: 99%

Generalized net models of queueing disciplines in finite buffer queueing systems with intuitionistic fuzzy evaluations of the tasks

Tomov¹,

Krawczak²,

Andonov³

et al. 2019

NIFS

Self Cite

View full text Add to dashboard Cite

Generalized net models of different queueing disciplines in queueing systems are proposed in [11]. In the present paper, we propose modifications of these models including Intuitionistic Fuzzy Pairs (IFP) and Interval-Valued Intuitionistic Fuzzy Pairs (IVIFP) which determine the way in which the requests are serviced. In each of the models, the buffer has finite capacity and is represented by two Generalized net transitions. The buffer cells are represented by places of the net. The two simple queueing disciplines considered are FIFO and LIFO. A more general model with IFP (or IVIFP) in which the requests can change their parameters and position within the buffer is also proposed.

show abstract

Section: Resultsmentioning

confidence: 99%

Generalized net models of queueing disciplines in finite buffer queueing systems with intuitionistic fuzzy evaluations of the tasks

Tomov¹,

Krawczak²,

Andonov³

et al. 2019

NIFS

Self Cite

View full text Add to dashboard Cite

show abstract

“…As a direct implication of the inequality M > M in (5), it is easy to see that f M (M, λ) > 0 when M is the root of the characteristic equation satisfying the stability condition. Moreover, taking into account (3), f M (M, λ) can be rewritten in a more compact form, i.e.,…”

Section: A Deeper Insight Into the Roots Of The Characteristic Equationmentioning

confidence: 99%

“…Queues and queuing networks are often used as powerful mathematical models of many real systems, in which a given service is shared by multiple customers. Starting from the pioneering works by Erlang [1], queuing theory has emerged as a powerful analysis tool in a wide range of cargo and passenger transport systems (including river ports, seaports, airports, and multimodal transport hubs) [2], in healthcare [3], in IoT-Fog-Cloud cooperation systems [4], and, in general, in telecommunication systems with Quality of Service guarantees [5], just to mention a few recent works.…”

Section: Introductionmentioning

confidence: 99%

On the Optimal Input Rate in Queues with Batch Service

Pagano

Tananko

Stankevich

2023

Axioms

View full text Add to dashboard Cite

In recent years, queuing systems with batch service are emerging as powerful and flexible mathematical models in different frameworks. In this paper, we consider a single server queuing system with Poissonian arrivals, infinite buffers, and a constant batch size b. This paper addresses a little-studied optimization problem, namely the existence of an optimal arrival rate that minimizes the average sojourn time. Unlike the classical M/M/1 queue, for any batch size b, the problem admits a non-trivial solution that can be found by solving a polynomial equation of degree b+1. Since, in general, only numerical solutions are available, a simple first-order approximation is also derived and the corresponding deviations (in terms of input rate and sojourn time) are calculated. In more detail, it is shown that the approximation improves as the batch size increases and, in any case, the relative error for the average sojourn time is less than 0.34%. Finally, the paper provides new theoretical results about the asymptotic service rate in the equivalent birth–death process, highlighting how it depends on all queue parameters.

show abstract

“…The times assigned to traffic signals are constant and do not adjust to changing traffic conditions in real time. This results in suboptimal performance, as traffic signals may be assigning unnecessarily long or short green times, which interferes with efficient traffic flow [4][5][6].…”

Section: Introductionmentioning

confidence: 99%

Minimizing Intersection Waiting Time: Proposal of a Queue Network Model Using Kendall’s Notation in Panama City

Rovetto,

Cruz,

Nuñez

et al. 2023

Applied Sciences

View full text Add to dashboard Cite

The paper presents a proposed queuing model based on Kendall’s notation for the intersection of two streets in Panama City (53 East and 56 East). The proposed model is based on a set of traffic lights that controls the flow of vehicles at the intersection according to a predetermined schedule. The model analyzes the stability of the system and simulations are performed to evaluate its performance. The main objective of the paper is to optimize the vehicle flow by minimizing the waiting time for passage. In the study, it was observed that the current traffic light system on Calle 50 (50th Street) is unstable and oversaturated during weekdays, which generates large vehicle queues with no estimated exit times. It was proposed to increase the system capacity to 1300 vehicles per hour to achieve reasonable stability and provide a solution to improve traffic signal timing on 50th Street. The need to increase the system capacity has been demonstrated and an optimal value has been suggested. The evaluation of other models and the use of AI can further strengthen the system and improve the prediction accuracy in different traffic scenarios.

show abstract

A Queue in Overall Telecommunication System with Quality of Service Guarantees

Cited by 8 publications

References 3 publications

Generalized net models of queueing disciplines in finite buffer queueing systems with intuitionistic fuzzy evaluations of the tasks

Generalized net models of queueing disciplines in finite buffer queueing systems with intuitionistic fuzzy evaluations of the tasks

On the Optimal Input Rate in Queues with Batch Service

Minimizing Intersection Waiting Time: Proposal of a Queue Network Model Using Kendall’s Notation in Panama City

Contact Info

Product

Resources

About