DOCSLIB.ORG

Controlled Queueing Systems with Heterogeneous Servers

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Controlled Queueing Systems with Heterogeneous Servers Controlled Queueing Systems with Heterogeneous Servers Dmitri Efrosinin University of Trier, Germany 2004 Contents 1 Introduction 1 1.1 Queues and dynamic control . 1 1.2 Queueing system with heterogeneous servers. 6 1.3 Monotonicity properties of optimal solutions . 7 1.4 Numerical methods . 15 1.5 Outline of the thesis . 16 2 Controlled M=M=K=B − K queue 21 2.1 Literature overview and chapter organization . 21 2.2 Model description . 23 2.3 Problem formulation . 24 2.4 Number of jobs minimization (NJM–problem) . 27 2.4.1 Quantity functional . 27 2.4.2 Optimality equation . 28 2.4.3 Transformation of Optimality Equation . 30 2.4.4 Monotonicity properties of optimal policies . 32 2.4.5 Assignment to the fastest available server . 34 2.4.6 Submodularity of the value function . 36 2.4.7 Threshold phenomenon of optimal policy. Threshold func- tion for NJM–problem . 40 2.5 Processing cost minimization (PCM–problem) . 46 2.5.1 Quantity functional . 46 2.5.2 Optimality equation . 46 2.5.3 Monotonicity properties of optimal policies. Two types of optimal policy structure for PCM–problem . 47 2.5.4 Assignment to the server with the lowest mean usage cost 48 2.5.5 Submodularity of the value function . 49 2.5.6 Threshold function for PCM–problem . 50 i ii CONTENTS 2.5.7 Optimality of threshold function . 53 2.5.8 Two-level threshold function for PCM–problem . 61 2.6 Algorithm . 65 2.6.1 Policy-iteration algorithm description . 66 2.6.2 Value-iteration algorithm description . 68 2.6.3 Routine . 70 2.7 Numerical analysis . 71 2.7.1 Dependence of thresholds on the state of slow servers . 71 2.7.2 Numerical examples. NJM–problem. Threshold function . 74 2.7.3 Numerical examples. PCM–problem. Threshold function . 76 2.7.4 Numerical examples. PCM–problem. Two-level function . 83 2.8 Conclusions . 89 2.9 Appendices . 90 2.9.1 Threshold functions for NJM–problem. 90 2.9.2 3–dimensional diagrams of threshold function for PCM– problem. 92 2.9.3 2–dimensional diagrams of threshold function for PCM– problem. 94 2.9.4 Two-level threshold function for PCM–problem. 97 3 Arrivals with modulating phases 101 3.1 Introduction. 101 3.2 Problem description . 103 3.3 Controlled E=M=K=B − K queue . 104 3.3.1 Optimality equation . 105 3.3.2 Monotonicity properties. Dependence on modulating phases107 3.3.3 Algorithm . 110 3.3.4 Numerical analysis . 111 3.4 Controlled P H=M=K=B − K queue . 116 3.4.1 Optimality equation . 117 3.4.2 Monotonicity properties. Dependence on modulating phases119 3.4.3 Algorithm . 120 3.4.4 Numerical analysis . 121 3.5 Controlled MAP=M=K=B − K queue . 126 3.5.1 Optimality equation . 128 3.5.2 Monotonicity properties. Dependence on modulating phases129 3.5.3 Algorithm . 131 3.5.4 Numerical analysis . 131 CONTENTS iii 3.6 Conclusions . 136 3.7 Appendices . 138 3.7.1 Em=M=K=B − K . 138 3.7.2 P H=M=K=B − K . 140 3.7.3 MMP P=M=K=B − K . 142 3.7.4 MAP=M=K=B − K . 144 4 Service with phases 147 4.1 Introduction. 147 4.2 Problem description . 148 4.3 Controlled M=E=K=B − K queue . 150 4.3.1 Optimality equation . 152 4.3.2 Monotonicity properties. Dependence on service phases . 153 4.3.3 Algorithm . 160 4.3.4 Numerical analysis . 162 4.4 Controlled M=P H=K=B − K queue . 167 4.4.1 Optimality equation . 169 4.4.2 Monotonicity properties. Dependence on service phases . 171 4.4.3 Algorithm . 182 4.4.4 Numerical analysis . 183 4.5 Conclusions . 188 4.6 Appendices . 190 4.6.1 M=Emk =K=B − K . 190 4.6.2 M=P Hhet=K=B − K . 192 5 Controlled MAP=P H=K=B − K queue 193 5.1 Introduction. 193 5.2 Problem description . 194 5.3 Optimality equation . 196 5.4 Monotonicity properties . 198 5.5 Algorithm . 200 5.6 Numerical analysis. 201 5.6.1 Em0 =Emk =K=B − K queue. 202 5.6.2 MAP=Emk =K=B − K queue. 203 5.6.3 P H=P Hhet=K=B − K queue. 204 5.6.4 MAP=P Hhet=K=B − K queue. 205 5.7 Conclusions . 206 5.8 Appendices . 207 iv CONTENTS 5.8.1 Em0 =Emk =K=B − K . 207 5.8.2 MAP=Emk =K=B − K . 209 5.8.3 P H=P Hhet=K=B − K . 211 5.8.4 MAP=P Hhet=K=B − K . 212 Bibliography 213 CONTENTS v Chapter 1 Introduction 1.1 Queues and dynamic control Many real-life phenomena, such as computer systems, communication networks, manufacturing systems, supermarket checkout lines as well as structural military systems can be represented by means of queueing models. Queueing systems take their origin in the study of design problems for automatic telephone exchange, and were first analyzed by A.K. Erlang in the early 1900s. At that time, in designing telephone systems one main problem with respect to performance criteria was to determine how many lines had to be supplied in order to guarantee a certain grade of service. Similar questions arise in many other cases, e.g. when asking for the maximum number of terminals in a computer system that tolerates keeping the message loss probability below a prespecified level, or when looking at the im- pact of service speed on waiting lines, and so on. In order to satisfy the people's demands for quality of service (QoS) it is impossible, due to economic aspects, to simply increase resources without limits. In essence, the question that queueing theory faces in practice is how to find a balance between improvement of (QoS) and acceptance economic overhead, i.e. to find the right trade-off between a gain in quality, that is achievable by supplying more resources, and the corresponding economic loss. By studying mathematical models that reveal the probabilistic nature of real sys- tems, queueing theory has succeeded to obtain many analytical and numerical results for the key-quantities which characterize the performance behavior of sys- tems. Such key quantities are, for example, queue length and waiting time distri- butions, loss probabilities, mean values of sojourn times and throughput, etc. 1 2 CHAPTER 1. INTRODUCTION In classical queueing theory, the corresponding models do not incorporate facil- ities (controllers) that allow to pursue different strategies, possibly based upon state depending decisions. This is in spite of the fact that man made real systems usually have to be dynamically controlled during operation. Looking at queue- ing models, a controller may considerably improve the system's performance by reducing queue lengths, or increasing the throughput, or diminishing the over- head, whereas in the absence of a controller the system behavior may get quite erratic, exhibiting periods of high load and long queues followed by periods, dur- ing which the servers remain idle. Control is performed by adequate actions that can be described in mathematical terms and can be subjected to the determination of optimal control strategies. Thus, by incorporating such aspects into queueing theory, its field is broadened and may be classified as a branch of optimization theory. As such it forms the area of interest and the subject of the present thesis. The theoretical foundations of controlled queueing systems are led in the theory of Markov, semi-Markov and semi-regenerative decision processes [31, 39, 49, 57, 58, 61, 64, 70]. Figure 1.1 Bellman, in the early 1950s, was one of the first who investigated decision processes and developed computational methods for analyzing sequential deci- sion processes with finite planning horizon. His ideas have been generalized by Howard (1960), who used elements from Markov chain theory and dynamic pro- gramming to develop a policy-iteration algorithm that provides the solution of 1.1. QUEUES AND DYNAMIC CONTROL 3 sequential probabilistic decision processes with infinite planning horizon. A typical sequential decision making model can symbolically be represented in Figure 1.1. At a specified point of time, which we refer to as present decision epoch, a decision maker or controller observes the state of a system. Based on this state, the controller chooses a control (performs a decision). The control choice produces two results: the controller losses an immediate cost, and the system, ac- cording to a probability distribution determined by the chosen control, evolves to a new state at the subsequent point of time, termed the next decision epoch. At the next decision epoch, the controller faces a similar situation. Different states, in general, determine different sets of possible controls. As such a process evolves in time, the controller incurs a sequence of costs or, as in sometimes said, a sequence of negative rewards. The key components of such a sequential decision model are the following • A set of decision epochs • A set E of system states • A set A of available controls • A set of state and control dependent immediate costs • A set of state and control dependent transition probabilities All these sets are assumed to be known to the controller at any decision epoch. Definition 1.2 A strategy is a prescription telling the controller out of which (state depending) set of controls a choice has to be made at any future time epoch. Definition 1.3 A policy specifies the control to be chosen at a particular point in time. A policy may depend on the present state alone, or on that state and all previ- ous states and controls.
Load more

Recommended publications
  • A Variety of Queueing Models for Mobile Communication Systems
    A VARIETY OF QUEUEING MODELS FOR MOBILE COMMUNICATION SYSTEMS William Wing Pong Kwok A thesis submitted in conforrnity with the requirements for the degree of Master of Applied Science Department of Mechanical and Industrial Engineering University of Toronto O Copyright by William Wing Pong Kwok (1999) 1 National Library Bibliotheque nationale du Canada Acquisitions and Acquisitions et Bibiiographic Services services bibliographiques 395 Weilingtm Street 395. n# Wdiington Ottawa ON KIA ON4 OaawaON K1AW Canada canada The author has granted a non- L'auteur a accordé une licence non exclusive licence ailowing the exclusive permettant à la National Library of Canada to Bibliothèque nationale du Canada de reproduce, loan, distniute or seil reproduire, @ter, distribuer ou copies of this thesis in microfom., vendre des copies de cette thèse sous paper or electronic formats. la forme de microfiche/film, de reproduction sur papier ou sur format électronique. The author retains ownership of the L'auteur conserve la propriété du copyright in this thesis. Neither the droit d'auteur qui protège cette thèse. thesis nor substantial extracts fiom it Ni la thèse ni des extraits substantiels may be printed or othewise de celle-ci ne doivent être imprimés reproduced without the author's ou autrement reproduits sans son permission. autorisation. A VARiETY OF QUEUEING MODELS FOR MOBILE COMMUNICATION SYSTEMS William Wlng Pong Kwok Degree of Master of Applied Science, 1999 Department of Mechanical & Industrial Engineering University of Toronto ABSTRACT The impact of customer behavior plays an important dein the planning of multi-media cellular mobile communication networks. In fact, the quality of service (QoS), such as waiting time and accessibility, that is experienced by each individual customer is the main factor in the evaluation of system performance.
    [Show full text]
  • A Survey of Parameter and State Estimation in Queues
    A Survey of Parameter and State Estimation in Queues Azam Asanjarani,∗ Yoni Nazarathy,† Peter Taylor ‡. Abstract We present a broad literature survey of parameter and state estimation for queueing systems. Our approach is based on various inference activities, queueing models, observations schemes, and statistical methods. We categorize these into branches of research that we call estimation paradigms. These include: the classical sampling approach, inverse problems, inference for non- interacting systems, inference with discrete sampling, inference with queueing fundamentals, queue inference engine problems, Bayesian approaches, online prediction, implicit models, and control, design, and uncertainty quantification. For each of these estimation paradigms, we outline the principles and ideas, while surveying key references. We also present various simple numerical experiments. In addition to some key references mentioned here, a periodically-updated compre- hensive list of references dealing with parameter and state estimation of queues will be kept in an accompanying annotated bibliography. 1 Introduction Queues occur in retail, health-care, telecommunications, manufacturing, road traffic, social justice systems, call centres and many other environments. To aid in understanding such systems, mathemati- cal queueing models have been studied and employed for over a century. Such models allow researchers and practitioners to predict congestion and delay behaviour based on assumptions about the underlying stochastic processes. The field has grown together with the field of applied probability and constitutes a significant part of the world of stochastic operations research. Indeed, queueing phenomena are both fascinating and important to understand from a practical perspective. The basic building block of most queueing analysis research involves a queueing model. As an exam- ple, consider a model called the M/D/1 queue.
    [Show full text]
  • Informs 2007 Proceedings
    informs14th ® Applied Probability Conference July 9–11, 2007 Program Monday July 9, 2007 Track 1 Track 2 Track 3 Track 4 Track 5 Track 6 Track 7 Track 8 Track 9 Room CZ 4 CZ 5 CZ 10 CZ 11 CZ 12 CZ 13 CZ 14 CZ 15 CZ 16 9:00am - 9:15am Opening (Room: Blauwe Zaal) 9:15am - 10:15am Plenary - Peter Glynn (Room: Blauwe Zaal) MA Financial Random Fields Rare Event Asymptotic Scheduling Call Centers 1 MDP 1 Retrial Inventory 1 10:45am - 12:15pm Engineering 1 Simulation 1 Analysis 1 Queues Kou Kaj Dupuis Bassamboo / Borst / Koole Feinberg Artalejo Van Houtum Randhawa Wierman Keppo Scheffler Blanchet Lin Gupta Taylor Bispo Machihara Buyukkaramikli DeGuest Ruiz-Medina Glasserman Tezcan Ayesta Jongbloed Van der Laan Nobel Qiu Peng Kaj Juneja Gurvich Wierman Henderson Haijema Shin Timmer Weber Mahmoodi Dupuis Randhawa Winands Koole Feinberg Artalejo Van Houtum 12:45pm - 1.45pm Tutorial Philippe Robert MB Financial Percolation and Simulation 1 Stability of Stoch. Communication Many-server Games 1 Fluid Queues Search 2:00pm - 3:30pm Engineering 2 Related Topics Networks Systems 1 Models 1 Models Schoutens / Van den Berg Henderson Ramanan Choi Armony Economou Adan Klafter Valdivieso Werker Newman Chick Gamarnik Bae Tezcan Economou Dieker Benichou Koch Newman Haas Reiman Kim Jennings Amir Nazarathy Oshanin Scherer Meester Blanchet Williams Park Ward Dube Margolius Eliazar Valdivieso Kurtz Henderson Zachary Roubos Armony Economou Adan Metzler MC Exit Times Interacting Stoch. Prog. Stoch. Netw. & Flow-Level Markov Control Queueing Inventory 2 4:00pm - 5:30pm
    [Show full text]
  • Performance Analysis of Two-Way Communication Retrial Queueing Systems with Non-Reliable Server and Impatient Customers in the Orbit∗
    Performance Analysis of Two-Way Communication Retrial Queueing Systems With Non-Reliable Server and Impatient Customers in the Orbit∗ Ádám Tóth, János Sztrik Faculty of Informatics, University of Debrecen, Debrecen, Hungary [email protected] [email protected] Proceedings of the 1st Conference on Information Technology and Data Science Debrecen, Hungary, November 6–8, 2020 published at http://ceur-ws.org Abstract Many models of two-way communication queueing systems have been studied in recent years, they can be utilized in many fields of life like in [7, 28, 30]. Customers have always been characterized by the phenomena of impatience due to the long waiting time for service [4, 14, 15, 27]. In this pa- per, we consider two-way communication systems with a non-reliable server where primary customers may decide to leave the system after spending a considerable amount of time in the system before getting its proper service. The service unit can break down during its operation or in an idle state, too. Whenever the server becomes idle it may generate requests towards the customers’ residing in an infinite source. These requests, the so-called sec- ondary customers, can enter the system after a random time if the service unit is available and functional upon their arrivals. Otherwise, they return to the source without coming into the system. Every primary customer has a property of impatience meaning that an arbitrary request has the ability to Copyright © 2021 for this paper by its authors. Use permitted under Creative Commons License Attribution 4.0 International (CC BY 4.0).
    [Show full text]
  • SORT Volume 29 (1), January-June 2005 Formerly Questii¨ O´
    SORT Volume 29 (1), January-June 2005 Formerly Questii¨ o´ Contents Articles Graphical display in outlier diagnostics; adequacy and robustness.......................... 1 Nethal K. Jajo Positivity theorem for a general manifold ............................................. 11 Remi´ Leandre´ Correspondence analysis and 2-way clustering ......................................... 27 Antonio Ciampi and Ana Gonzalez Marcos Information matrices for some elliptically symmetric distributions ......................... 43 Saralees Nadarajah and Samuel Kotz Automatic error localisation for categorical, continuous and integer data .................... 57 Ton de Waal Estimation of spectral density of a homogeneous random stable discrete time field ............ 101 Nikolay N. Demesh and S. L. Chekhmenok The M/G/1 retrial queue: An information theoretic approach.............................. 119 Jesus´ R. Artalejo and M. Jesus´ Lopez-Herrero Book reviews Information for authors and subscribers Statistics & Statistics & Operations Research Transactions Operations Research SORT 29 (1) January-June 2005, 1-10 c Institut d’Estad´ıstica deTransactions Catalunya ISSN: 1696-2281 [email protected] www.idescat.net/sort Graphical display in outlier diagnostics; adequacy and robustness Nethal K. Jajo∗ University of Western Sydney Abstract Outlier robust diagnostics (graphically) using Robustly Studentized Robust Residuals (RSRR) and Partial Robustly Studentized Robust Residuals (PRSRR) are established. One problem with some robust residual plots is that the residuals
    [Show full text]
  • XXXII International Seminar on Stability Problems for Stochastic
    Norwegian University of Institute of Informatics Faculty of Computational Science and Technology, Problems, Mathematics and Cybernetics, Trondheim Russian Academy of Sciences Moscow State University (NTNU) (IPI RAN) (CMC MSU) XXXII International Seminar on Stability Problems for Stochastic Models and VIII International Workshop \Applied Problems in Theory of Probabilities and Mathematical Statistics related to modeling of information systems" 16 { 21 June Trondheim, Norway Book of Abstracts Edited by Prof. Victor Yu. Korolev and Prof. Sergey Ya. Shorgin Moscow Institute of Informatics Problems, Russian Academy of Sciences 2014 The Organizing Committee of the XXXII International Seminar on Stability Problems for Stochastic Models V. Zolotarev (Russia) – Honorary Chairman, V. Korolev (Russia) – Chairman, N. Ushakov (Norway) – Deputy Chairman, I. Shevtsova (Russia) – General Secretary, Yu. Khokhlov (Russia), S. Shorgin (Russia), S. Baran (Hungary), V. Bening (Russia), A. Bulinski (Russia), J. Misiewich (Poland), E. Omey (Belgium), G. Pap (Hungary), A. Zeifman (Russia), Yu. Nefedova (Russia) – Secretary. The Organizing Committee of the VIII International Workshop “Applied Problems in Theory of Probabilities and Mathematical Statistics related to modeling of information systems” I. Atencia (Spain), A. Grusho (Russia), K. Samouylov (Russia), S. Shorgin (Russia), S. Frenkel (Russia), R. Manzo (Italy), A. Pechinkin (Russia), N. Ushakov (Norway), E.Timonina (Russia) et al. XXXII International Seminar on Stability Problems for Stochastic Models
    [Show full text]
  • Bulk Queues: an Overview
    J. Sci. & Tech. Res. ISSN No. 2278-3350 Vol. 4, No. 1, June 2014 (14-22) Bulk Queues: An Overview Rachna Vashishtha Pandey1 * and PiyushTripathi2 1Research Scholar at Bhagwant University, Ajmer, Rajasthan 2Amity University Uttar Pradesh, Malhour Campus, Lucknow (MS received May 09, 2014; revised June12, 2014) Abstract In this article we present an overview on the contributions of the researchers in the area of bulk queues with their applications in several realistic queueing situations such as in communication networks, transportation systems, computer systems, manufacturing and production systems and so forth. The concept of bulk queues has gained a tremendous significance in recent time; mainly due to congestion problem faced in communication / computer networks, industrial/ manufacturing system and even in handling of air, land and water transportation. A number of models have been developed in the area of queueing theory incorporating bulk queueing models to resolve the congestion problems. Through this survey, an attempt has been made to review the work done on bulk queues under different context such as unreliable server, control policy, vacation, etc. The methodological aspects have been described. We provide a brief survey and related bibliography of some notable contributions done in the area of bulk queueing systems. Keywords: Bulk Arrival, Bulk Service, Markovian and Non-Markovian Queues. *Corresponding author: [email protected] 1. Introduction telecommunication systems, call centers, flexible manufacturing systems and service Queue is an unavoidable aspect of modern life systems etc. that we encounter at every step in our daily activities whether it happens at the checkout In theory of queues, a bulk queue (sometimes counter in the super market or in accessing the called batch queue) is a generalized queueing internet.
    [Show full text]
  • Antonis Economou – Curriculum Vitae A. General Information. Name
    Antonis Economou – Curriculum Vitae A. General Information. Name : Antonis Economou Address 1 (office) : University of Athens Department of Mathematics Section of Statistics and OR Panepistemiopolis Athens 15784 Greece Address 2 (home) : 6 Rodon st. Zografou Athens 15772 Greece Telephone : 0030-210-7276351 e-mail : [email protected] Website : http://users.uoa.gr/~aeconom/ Fax : 0030-210-7276381 B. Studies. • B.Sc. in Mathematics (1989-1993). University of Athens, Department of Mathematics, July 1993. Grade: Excellent, 9.33/10. • M.A. in Mathematics (1993-1994). University of California, Los Angeles (UCLA), Department of Mathematics, Pure program, June 1994. Grade (GPA): 3.975/4. Qualifying exams: Real Analysis, Algebra. • M.Sc. in Statistics and Operations Research (1994-1997). University of Athens, Department of Mathematics, June 1997. Grade: Excellent, 9.56/10. Master thesis: Stochastic Orders and Applications. • Ph.D. in Mathematics (1994-1998). University of Athens, Department of Mathematics, July 1998. Grade: Excellent. PhD dissertation: Study of Product-form Queueing Systems . C. Research Interests. Stochastic Models in Operations Research (OR) – Stochastic Models in Mathematical Biology – Applied Probability • Markov Chains, Renewal Processes, Semi-Markov Processes and Markov renewal processes with applications to OR and Mathematical Biology • Generating Function Methods in Stochastic Models • Matrix-Analytic Methods in Stochastic Models • Stochastic Orders • Markov Decision Processes • Equilibrium Theory and Pricing Problems in Stochastic Models • Queueing Theory • Stochastic Networks • Stochastic Population Models • Stochastic Epidemiology D. Academic positions. 1999 - 2000 : Visiting Lecturer at the Department of Applied Mathematics, University of Crete. 2000 - 2001 : Visiting Assistant Professor at the Department of Applied Mathematics, University of Crete. 2001 - 2005 : Lecturer at the Department of Mathematics, University of Athens.
    [Show full text]
  • EUROPEAN CONFERENCE on QUEUEING THEORY 2016 Urtzi Ayesta, Marko Boon, Balakrishna Prabhu, Rhonda Righter, Maaike Verloop
    EUROPEAN CONFERENCE ON QUEUEING THEORY 2016 Urtzi Ayesta, Marko Boon, Balakrishna Prabhu, Rhonda Righter, Maaike Verloop To cite this version: Urtzi Ayesta, Marko Boon, Balakrishna Prabhu, Rhonda Righter, Maaike Verloop. EUROPEAN CONFERENCE ON QUEUEING THEORY 2016. Jul 2016, Toulouse, France. 72p, 2016. hal- 01368218 HAL Id: hal-01368218 https://hal.archives-ouvertes.fr/hal-01368218 Submitted on 19 Sep 2016 HAL is a multi-disciplinary open access L’archive ouverte pluridisciplinaire HAL, est archive for the deposit and dissemination of sci- destinée au dépôt et à la diffusion de documents entific research documents, whether they are pub- scientifiques de niveau recherche, publiés ou non, lished or not. The documents may come from émanant des établissements d’enseignement et de teaching and research institutions in France or recherche français ou étrangers, des laboratoires abroad, or from public or private research centers. publics ou privés. EUROPEAN CONFERENCE ON QUEUEING THEORY 2016 Toulouse July 18 – 20, 2016 Booklet edited by Urtzi Ayesta LAAS-CNRS, France Marko Boon Eindhoven University of Technology, The Netherlands‘ Balakrishna Prabhu LAAS-CNRS, France Rhonda Righter UC Berkeley, USA Maaike Verloop IRIT-CNRS, France 2 Contents 1 Welcome Address 4 2 Organization 5 3 Sponsors 7 4 Program at a Glance 8 5 Plenaries 11 6 Takács Award 13 7 Social Events 15 8 Sessions 16 9 Abstracts 24 10 Author Index 71 3 1 Welcome Address Dear Participant, It is our pleasure to welcome you to the second edition of the European Conference on Queueing Theory (ECQT) to be held from the 18th to the 20th of July 2016 at the engineering school ENSEEIHT in Toulouse.
    [Show full text]
  • A Lévy-Driven Stochastic Queueing System with Server Breakdowns and Vacations
    mathematics Article A Lévy-Driven Stochastic Queueing System with Server Breakdowns and Vacations Yi Peng 1 and Jinbiao Wu 2,* 1 School of Mathematical Science, Changsha Normal University, Changsha 410100, China; mailto:[email protected] 2 School of Mathematics and Statistics, Central South University, Changsha 410083, China * Correspondence: [email protected] Received: 24 June 2020; Accepted: 28 July 2020; Published: 29 July 2020 Abstract: Motivated by modelling the data transmission in computer communication networks, we study a Lévy-driven stochastic fluid queueing system where the server may subject to breakdowns and repairs. In addition, the server will leave for a vacation each time when the system is empty. We cast the workload process as a Lévy process modified to have random jumps at two classes of stopping times. By using the properties of Lévy processes and Kella–Whitt martingale method, we derive the limiting distribution of the workload process. Moreover, we investigate the busy period and the correlation structure. Finally, we prove that the stochastic decomposition properties also hold for fluid queues with Lévy input. Keywords: fluid queueing systems; Lévy processes; martingales; queues with Lévy input; server breakdowns and vacations; stochastic decomposition 1. Introduction Lévy processes are very important stochastic processes with stationary and independent increments. They are one of the most important families of stochastic processes arising in many areas of probability theory and stochastic operations research. They cover a number of very important and well-studied stochastic processes as special cases, such as Brownian motion, compound Poisson processes, stable processes and subordinators. Lévy processes are widely used as models in the study of stochastic service systems, insurance risks, stochastic inventory systems, reliability engineering, computer communication systems, stochastic finance systems and so on.
    [Show full text]
  • STANDARD and RETRIAL QUEUEING SYSTEMS: a COMPARATIVE ANALYSIS Jesús ARTALEJO and Gennadi FALIN 1 Introduction
    REVISTA MATEMATICA´ COMPLUTENSE ISSN 1139-1138 (2002) vol. XV, num. 1, 101-129 http://dx.doi.org/10.5209/rev_REMA.2002.v15.n1.16950 STANDARD AND RETRIAL QUEUEING SYSTEMS: A COMPARATIVE ANALYSIS Jes´us ARTALEJO and Gennadi FALIN Abstract We describe main models and results of a new branch of the queueing theory, theory of retrial queues, which is characterized by the following basic assumption: a customer who cannot get service (due to finite capacity of the system, balking, impatience, etc.) leaves the service area, but after some random delay returns to the system again. Emphasis is done on comparison with standard queues with waiting line and queues with losses. We give a survey of main results for both single server M/G/1 type and multiserver M/M/c type retrial queues and discuss similarities and differences between the retrial queues and their standard counterparts. We demonstrate that although retrial queues are closely connected with these standard queueing models they, however, possess unique distinguished features. We also mention some open problems. 1 Introduction 1.1 Motivating examples In classical queueing theory it is usually assumed that a customer who cannot get service immediately after arrival either joins the waiting line (and then is served according to some queueing discipline) or leaves the system forever. Sometimes impatient customers leave the queue, but it is also assumed that they are leaving the system forever. However as a matter of fact the assumption about loss of customers which elected to leave the system is just a first order approximation to a real situation.
    [Show full text]
  • Approximate Analysis of an Unreliable M/M/2 Retrial Queue
    Air Force Institute of Technology AFIT Scholar Theses and Dissertations Student Graduate Works 3-2007 Approximate Analysis of an Unreliable M/M/2 Retrial Queue Brian P. Crawford Follow this and additional works at: https://scholar.afit.edu/etd Part of the Operational Research Commons, and the Social and Behavioral Sciences Commons Recommended Citation Crawford, Brian P., "Approximate Analysis of an Unreliable M/M/2 Retrial Queue" (2007). Theses and Dissertations. 3078. https://scholar.afit.edu/etd/3078 This Thesis is brought to you for free and open access by the Student Graduate Works at AFIT Scholar. It has been accepted for inclusion in Theses and Dissertations by an authorized administrator of AFIT Scholar. For more information, please contact [email protected]. APPROXIMATE ANALYSIS OF AN UNRELIABLE M/M/2 RETRIAL QUEUE THESIS Brian P. Crawford, 1 Lt, USAF AFIT/GOR/ENS/07-05 DEPARTMENT OF THE AIR FORCE AIR UNIVERSITY AIR FORCE INSTITUTE OF TECHNOLOGY Wright-Patterson Air Force Base, Ohio APPROVED FOR PUBLIC RELEASE; DISTRIBUTION UNLIMITED. The views expressed in this thesis are those of the author and do not reflect the o±cial policy or position of the United States Air Force, Department of Defense or the United States Government. AFIT/GOR/ENS/07-05 APPROXIMATE ANALYSIS OF AN UNRELIABLE M/M/2 RETRIAL QUEUE THESIS Presented to the Faculty Department of Operational Sciences Graduate School of Engineering and Management Air Force Institute of Technology Air University Air Education and Training Command in Partial Ful¯llment of the Requirements for the Degree of Master of Science in Operations Research Brian P.
    [Show full text]