Call for Papers

The Third International Workshop on Stochastic Modeling and Applied Research of Technology (SMARTY 2022) will be held in Petrozavodsk, Karelia, one of the beautiful places in the North-West Russia, on August 21-25, 2022.

SMARTY workshop aims to bring together researchers working on the theoretical, algorithmic and methodological aspects of queueing theory, stochastic modeling and applied probability, focusing on applications of such methods across a broad spectrum of technical systems with primary interest in high-performance and distributed computing systems.

Key focus:

SMARTY 2022 sets up a working environment to share recent results on

  • Stability and performance issues of stochastic models of high-performance and distributed computing systems, as well as other modern technologies;
  • Applications of queueing theory and applied probability to the analysis of high-performance and distributed computing systems.

A special accent in the program of SMARTY 2022 will be made on perspective computing systems, such as the quantum computing.

V. V. Kalashnikov Memorial Track:

The special track dedicated to the memory of Vladimir V. Kalashnikov and is composed of invited talks is to be held on August 24 as a satellite event of the SMARTY workshop.

Proceedings:

Post-proceedings of the workshop are to be published online, after passing a single-blind review procedure by two or more independent reviewers. However, for participation, it is enough to submit an abstract in uConfy using the template available there at submission time. The Abstracts are to appear at the workshop website together with the schedule.

The official language of SMARTY'22 is English. We expect that the accepted abstracts will be presented at the workshop and encourage the workshop speakers to participate in post-Proceedings volume. Abstract submissions are handled by our partner uConfy where all the necessary details are available. Details on post-proceedings paper submission process will be further updated in the Submission section.

Roadmap:

A preliminary schedule of the workshop and the publication process is as follows (all the times are AoE):

  • Registration starts – June 01, 2022
  • Workshop abstracts/papers submission deadline – August 1, 2022
  • Notification of acceptance – August 14, 2022
  • Camera ready workshop papers – August 21, 2022
  • SMARTY workshop – August 21-25, 2022

Youth School:

August 25th is dedicated to students and young researchers focusing on queueing theory, stochastic modeling, applied probability and computer science. We expect several invited lectures and tutorials to inspire young researchers in those fields.

Contacts:

Workshop Secretary: Alexander Rumyantsev, IAMR KRC RAS, Petrozavodsk, Russia

Keynote Speakers

  • Vassili N. Kolokoltsov

    Vassili N. Kolokoltsov

    Moscow State University, Moscow, Russia

    TBA Quantum Games

    Vassili Kolokoltsov received his degree in Mathematics at Moscow State University in 1981, PhD in Mathematics from Moscow State University, in 1985, and Doctor of Sciences in Mathematics and Physics from Steklov Mathematical Institute of the Russian Academy of Science in 1993. He published over 200 scientific papers, over 10 monographs and supervised over 10 PhD and DSc theses. Vassili N. Kolokoltsov is full-time Professor at Computational Mathematics and Cybernetics faculty of Lomonosov Moscow State University, Associate member in Federal Research Centre of Computer Science and Control of Russian Academy of Sciences, Higher School of Economics and St Petersburg University and Emeritus Professor at Warwick University, UK, twice Laureate (2011, 2021) of the St. Petersburg State University Prize for Scientific Works. His research interests are in probability and stochastic processes, mathematical physics, differential equations and analysis, optimization and games with applications to business, biology and finances.

  • Melikov Agassi Zarbali oglu

    Melikov Agassi Zarbali oglu

    Institute of Control Systems, Azerbaijan National Academy of Sciences

    TBA New Replenishment Policies in Double-Sources Queuing-Inventory Systems

    Agassi Melikov received his degree in Mathematics at Baku State University, Azerbaijan in 1977, PhD in Control Theory from Institute of Automatics, Kiev, in 1984, and Doctor of Sciences in Computer Science from Department of Applied Mathematics at Kiev National Technical University in 1992. He published over 250 scientific papers, 5 monographs including two of them in Springer and supervised over 15 PhD and DSc theses. Associate member of Azerbaijan National Academy of Sciences (ANAS), Agassi Melikov is the Head of Laboratory of Modeling of Queuing-Inventory Systems, Institute of Control Systems of ANAS and the Head of the Department of Computer Systems and Programming, National Aviation Academy of Azerbaijan. His research interests are in Queuing Theory, Queuing-Inventory Systems and Mathematical Teletraffic Theory.

  • Achyutha Krishnamoorthy

    Achyutha Krishnamoorthy

    CMS College Kottayam

    TBA Queues with Interdependence Between Primary Arrival, Service and Retrial of Orbital Customers – A New Approach

    In this paper we introduce the analysis of interdependent primary arrival of customers, service primary and retrial customers and retrial of orbital customers to access the service station. The orbit is of infinite capacity. If the server is busy at a primary arrival epoch, it goes to an orbit of infinite capacity and retries to access the server from there. Customers from orbit retry according to an FIFO policy—the head of the queue alone retires to access the server; if the retrial is a failure, then it returns to the orbit and immediately starts retrial (as head of the queue). The arrival, service and retrial are generated by three distinct finite state space Markov chains which are interdependent in their evolution. For this the product space of these Markov chains is considered. The sojourn time in any state (three-dimensional) (a,b,c), depends on this and the state to be visited next, which is governed by the Markov chain on the product space. The sojourn times are exponentially distributed with parameters having the above indicated dependence attribute. This system is analysed. Condition for stability is obtained. Performance measures of significance are computed.

    Achyutha Krishnamoorthy received his BSc degree in Mathematics at CMS College Kottayam in 1969, MSc from Jabalpur University in 1971, and PhD from Annamalai University, Tamil Nadu under the guidance of Professor G. Sankaranarayanan in 1978. Retired as Professor in Applied Mathematics from Cochin University of Science & Technology in 2009, he continued to serve the University as Professor Emeritus and Emeritus Scientist until 2016. In 2017, Achyutha Krishnamoorthy joined CMS College as Emeritus Fellow of the University Grants Commission, Government of India and continues as Hon. Director, Centre for Research in Mathematics. He also holds the position of Hon. Visiting Professor at Central University of Kerala Kasargod. He published more than 200 research papers and supervised more than 40 Doctoral Dissertations. His main research interests are in Stochastic Modeling and Analysis, Queueing-Inventory, Reliability, Interdependence among Processes, Semi Markov Approach, Matrix Analytic Method.

  • Abhijit Datta Banik

    Abhijit Datta Banik

    Indian Institute of Technology, Bhubaneswar

    TBA Stationary analysis of batch renewal/non-renewal input multi-server server queues and renewal input single server non-renewal batch service queues using roots

    Closed-form analytic expressions as well as a computational analysis of the stationary system length distribution for the renewal-input, bulk-arrival, and multi-server continuous-time queueing model will be presented in the talk. The queueing model may be denoted as GI^X/D/c queue. Using the steady-state equations, the system-length probability generating function is derived. Subsequently, by inverting this probability generating function the stationary system-length distribution is obtained using the roots of a characteristic equation. Next, a similar analysis for the corresponding multi-server queueing model with batch Markovian arrival process (BMAP) is also presented in this talk using the roots of a characteristic equation associated with the vector generating function of the system-length distribution. Next an infinite-buffer single-server queue with renewal input and Markovian service process where customers are served in batches according to a general bulk service rule is also presented in this talk. Queue-length distributions at epochs of pre-arrival, arbitrary and post-departure have been obtained along with some important performance measures such as mean queue lengths and mean waiting times in both the system as well as the queue. We also obtain the steady-state service batch size distributions as well as system-length distributions. The proposed analysis is based on roots of the associated characteristic equation of the vector-generating function of queue-length distribution at a pre-arrival epoch.

    Abhijit Datta Banik received his PhD in 2007 from Indian Institute of Technology, Kharagpur. He published more than 50 papers in international journals and international conference proceedings. He received honorable research awards. He is now an Assistant Professor at School of Basic Sciences, Indian Institute of Technology, Bhubaneswar, where he performs full time teaching jobs and supervises doctoral students. His research interests are Queueing Theory, Applied Probability Models, Stochastic Modelling and Simulation, Stochastic Models in Operations Research and their application in Communication systems, Transportation, Manufacturing, Production and Inventory Systems.

Committees

Organizing Committee

Location

Pushkinskaya Str., 11. Petrozavodsk, Karelia Republic

Partners

Thanks to