Recent Research in Queuing Theory and Stochastic Models, 2nd Edition

A special issue of Mathematics (ISSN 2227-7390). This special issue belongs to the section "Mathematics and Computer Science".

Deadline for manuscript submissions: 31 December 2024 | Viewed by 145

Special Issue Editors


E-Mail Website
Guest Editor
Department of Applied Mathematics, University of Malaga, 29071 Málaga, Spain
Interests: applied mathematics; operations research; queueing systems; performance analysis; home automation systems
Special Issues, Collections and Topics in MDPI journals

E-Mail Website
Guest Editor
Departamento de Matemática Aplicada, Escuela de Ingenierías Industriales, University of Málaga, 29071 Málaga, Spain
Interests: mathematics education; modeling and simulation; mathematical programming; applications of computer algebra systems (CAS); applied mathematics
Special Issues, Collections and Topics in MDPI journals

Special Issue Information

Dear Colleagues,

The purpose of this Special Issue is to contribute novel papers to the study of queueing theory and stochastic models. Queueing models are among the best-known theories of stochastic modeling, and their progress and development have been increasing exponentially since A.K. Erlang (1917) and T.O. Engset (1918) first studied communications networks and their congestion problems. A server, waiting line and arriving flow of customers constitute the basis of any queueing model. The way in which these items are considered and the various disciplines to which they are attached open a wide range of possibilities in terms of handling situations that arise in real-life problems.

In contemporary research, concepts such as sojourn times and busy periods have become quite relevant due to their importance in traffic engineering, telecommunications, and computer systems.

As for the temporal concept in queueing systems, it should be noted that these systems have been traditionally considered in a context of continuous time, but that the last two decades has seen an increasing interest in the study of discrete-time queueing systems since they are more suitable than their continuous counterpart for computer modeling and telecommunication systems.

Any relevant papers related to the queueing systems and stochastic models are welcome.

Dr. Ivan Atencia
Dr. José Luis Galán-García
Guest Editors

Manuscript Submission Information

Manuscripts should be submitted online at www.mdpi.com by registering and logging in to this website. Once you are registered, click here to go to the submission form. Manuscripts can be submitted until the deadline. All submissions that pass pre-check are peer-reviewed. Accepted papers will be published continuously in the journal (as soon as accepted) and will be listed together on the special issue website. Research articles, review articles as well as short communications are invited. For planned papers, a title and short abstract (about 100 words) can be sent to the Editorial Office for announcement on this website.

Submitted manuscripts should not have been published previously, nor be under consideration for publication elsewhere (except conference proceedings papers). All manuscripts are thoroughly refereed through a single-blind peer-review process. A guide for authors and other relevant information for submission of manuscripts is available on the Instructions for Authors page. Mathematics is an international peer-reviewed open access semimonthly journal published by MDPI.

Please visit the Instructions for Authors page before submitting a manuscript. The Article Processing Charge (APC) for publication in this open access journal is 2600 CHF (Swiss Francs). Submitted papers should be well formatted and use good English. Authors may use MDPI's English editing service prior to publication or during author revisions.

Keywords

  • Markov chains
  • stochastic process
  • sojourn times
  • busy periods
  • heavy traffic regime
  • multichannel stochastic network

Related Special Issue

Published Papers

This special issue is now open for submission.
Back to TopTop