Development of a Queuing System with Dynamic Priorities

X.N. Apachidi; Yu.Ya. Katsman

doi:10.4028/www.scientific.net/KEM.685.934

Paper Titles

Simulation of Discrete-Continuous Process via E-Network
p.912

Real-Time Recovery of Functions and their Derivatives by Variation Splines
p.920

Uniform Model of Representation Heterogeneous Data Hydrometeorological Observations
p.925

Formalized Approach in Relational Database Design
p.930

Development of a Queuing System with Dynamic Priorities
p.934

Discrete-Event Approach to Simulation of Queueing Networks
p.939

Using Parallel Computing in Queueing Network Simulation
p.943

Development of Graphical Interface for Determination of Optimal Cutting Parameters in Turning Operations
p.948

Allocation of Clusters of Objects on Topological Graphs of High Cardinality
p.952

HomeKey Engineering MaterialsKey Engineering Materials Vol. 685Development of a Queuing System with Dynamic...

Development of a Queuing System with Dynamic Priorities

Abstract:

The article discusses the development of a queuing system with the use of various queuing disciplines. The authors have developed a model of the queuing system and conducted the experiments on system overload, which helped to distinguish its weaknesses and improve it using dynamic priorities. The priority is increased on a one-off basis for an entity with low priority under specified conditions. Consequent testing of the system has confirmed its robustness.

You might also be interested in these eBooks

High Technology: Research and Applications 2015

View Preview

Info:

Periodical:

Key Engineering Materials (Volume 685)

Pages:

934-938

DOI:

https://doi.org/10.4028/www.scientific.net/KEM.685.934

Citation:

Cite this paper

Online since:

February 2016

Authors:

X.N. Apachidi*, Yu.Ya. Katsman

Keywords:

Absolute Priority, Dynamic Priority, FIFO, Model, Queue, Queueing System, Relative Priority, Unprioritized Queuing Discipline

Export:

RIS, BibTeX

Price:

Permissions:

Request Permissions

* - Corresponding Author

References

[1] Simulation modeling. Information on http: /www. anylogic. ru/use-of-simulation.

Google Scholar

[2] Blocks in SimEvents, Documentation Center. Information on http: /www. mathworks. com/help/simevents/blocklist. html.

Google Scholar

[3] X.N. Apachidi. Simulation of queuing systems with priority service discipline, Prospects for the development of information technology: The Proceedings of the Russian Youth Scientific and Practical Conference. (2014) 5-6.

Google Scholar

[4] X.N. Apachidi. Analysis of queuing systems with priority disciplines and service expectations, Information systems and technologies in education, science and business. The works of the Russian Youth Scientific and Practical School. (2014) 109-110.

Google Scholar

[5] J.J. Katsman, X.N. Apachidi. Algorithm Simulation of Resource Allocation of the Queueing Systems, Based on the Priorities, International Conference on Mechanical Engineering, Automation and Control Systems (MEACS). (2014) 1-6.

DOI: 10.1109/meacs.2014.6986896

Google Scholar

[6] X.N. Apachidi. Comparison of characteristics of queuing systems with priority allocation of resources, Youth and Modern Information Technology. Proceedings of the VII International scientific and practical conference of students, graduate students and young scientists Youth and Modern Information Technology,. (2014).

Google Scholar

[7] Choi, B. D., B. Kim, and J. Chung. M/M/1 queue with impatient customers of higher priority, Queueing Systems. 38 (2001) 49–66.

Google Scholar

[8] Brandt, A. and M. Brandt. 2004. On the two-class M/M/1 system under preemptive resume and impatience of the prioritized customers, Queueing Systems. 47 (2004) 147–168.

DOI: 10.1023/b:ques.0000032805.73991.8e

Google Scholar

[9] Iravani, F. and B. Balcioglu. On priority queues with impatient customers, Queueing Systems. 58 (2008) 239–260.

DOI: 10.1007/s11134-008-9069-6

Google Scholar

[10] Che Soong Kim, A. Z. Melikov, and B. G. Ismailov, Optimal Assignment of Dynamic Priorities in Queuing Systems with Two Types of Customers, Automatic Control and Computer Sciences. 42 (2008) 320-326.

DOI: 10.3103/s0146411608060072

Google Scholar