scispace - formally typeset
Search or ask a question
Author

Antonio Gómez-Corral

Bio: Antonio Gómez-Corral is an academic researcher from Complutense University of Madrid. The author has contributed to research in topics: Queueing theory & M/G/1 queue. The author has an hindex of 22, co-authored 67 publications receiving 2184 citations. Previous affiliations of Antonio Gómez-Corral include Spanish National Research Council.


Papers
More filters
BookDOI
01 Jan 2008

450 citations

Book
07 May 2008
TL;DR: This book is intended for an audience ranging from advanced undergraduates to researchers interested in queueing theory, but also in applied probability, stochastic models of the operations research, and engineering.
Abstract: The application of auto-repeat facilities in telephone systems, as well as the use of random access protocols in computer networks, have led to growing interest in retrial queueing models. Since much of the theory of retrial queues is complex from an analytical viewpoint, with this book the authors give a comprehensive and updated text focusing on approximate techniques and algorithmic methods for solving the analytically intractable models. Retrial Queueing Systems: A Computational Approach also * Presents motivating examples in telephone and computer networks. * Establishes a comparative analysis of the retrial queues versus standard queues with waiting lines and queues with losses. * Integrates a wide range of techniques applied to the main M/G/1 and M/M/c retrial queues, and variants with general retrial times, finite population and the discrete-time case. * Surveys basic results of the matrix-analytic formalism and emphasizes the related tools employed in retrial queues. * Discusses a few selected retrial queues with QBD, GI/M/1 and M/G/1 structures. * Features an abundance of numerical examples, and updates the existing literature. The book is intended for an audience ranging from advanced undergraduates to researchers interested not only in queueing theory, but also in applied probability, stochastic models of the operations research, and engineering. The prerequisite is a graduate course in stochastic processes, and a positive attitude to the algorithmic probability.

419 citations

Journal ArticleDOI
TL;DR: A bibliographical guide to researchers who are interested in the analysis of retrial queues through matrix analytic methods and includes an author index and a subject index of research papers written in English and published in journals or collective publications.
Abstract: This paper provides a bibliographical guide to researchers who are interested in the analysis of retrial queues through matrix analytic methods. It includes an author index and a subject index of research papers written in English and published in journals or collective publications, as well as some papers accepted for a forthcoming publication.

127 citations

Journal ArticleDOI
TL;DR: This paper carries out an extensive analysis of the queue, including a necessary and sufficient condition for the system to be stable, the steady state distribution of the server state and the orbit length, the waiting time distribution, the busy period, and other related quantities.
Abstract: Retrial queueing systems are widely used in teletraffic theory and computer and communication networks. Although there has been a rapid growth in the literature on retrial queueing systems, the research on retrial queues with nonexponential retrial times is very limited. This paper is concerned with the analytical treatment of an M/G/1 retrial queue with general retrial times. Our queueing model is different from most single server retrial queueing models in several respectives. First, customers who find the server busy are queued in the orbit in accordance with an FCFS (first-come-first-served) discipline and only the customer at the head of the queue is allowed for access to the server. Besides, a retrial time begins (if applicable) only when the server completes a service rather upon a sen ice attempt failure. We carry out an extensive analysis of the queue, including a necessary and sufficient condition for the system to be stable, the steady state distribution of the server state and the orbit length, the waiting time distribution, the busy period, and other related quantities. Finally, we study the joint distribution of the server state and the orbit length in non-stationary regime.

117 citations

Journal ArticleDOI
TL;DR: In this article, the M/G/1 queue with repeated requests is studied and the performance characteristics can be expressed in terms of hypergeometric functions, where the service time distribution is exponential.
Abstract: Queueing systems with repeated requests have many useful applications in communications and computer systems modeling. In the majority of previous work the repeat requests are made individually by each unsatisfied customer. However, there is in the literature another type of queueing situation, in which the time between two successive repeated attempts is independent of the number of customers applying for service. This paper deals with the M/G/1 queue with repeated orders in its most general setting, allowing the simultaneous presence of both types of repeat requests. We first study the steady state distribution and the partial generating functions. When the service time distribution is exponential we show that the performance characteristics can be expressed in terms of hypergeometric functions.

88 citations


Cited by
More filters
Journal ArticleDOI
01 May 1975
TL;DR: The Fundamentals of Queueing Theory, Fourth Edition as discussed by the authors provides a comprehensive overview of simple and more advanced queuing models, with a self-contained presentation of key concepts and formulae.
Abstract: Praise for the Third Edition: "This is one of the best books available. Its excellent organizational structure allows quick reference to specific models and its clear presentation . . . solidifies the understanding of the concepts being presented."IIE Transactions on Operations EngineeringThoroughly revised and expanded to reflect the latest developments in the field, Fundamentals of Queueing Theory, Fourth Edition continues to present the basic statistical principles that are necessary to analyze the probabilistic nature of queues. Rather than presenting a narrow focus on the subject, this update illustrates the wide-reaching, fundamental concepts in queueing theory and its applications to diverse areas such as computer science, engineering, business, and operations research.This update takes a numerical approach to understanding and making probable estimations relating to queues, with a comprehensive outline of simple and more advanced queueing models. Newly featured topics of the Fourth Edition include:Retrial queuesApproximations for queueing networksNumerical inversion of transformsDetermining the appropriate number of servers to balance quality and cost of serviceEach chapter provides a self-contained presentation of key concepts and formulae, allowing readers to work with each section independently, while a summary table at the end of the book outlines the types of queues that have been discussed and their results. In addition, two new appendices have been added, discussing transforms and generating functions as well as the fundamentals of differential and difference equations. New examples are now included along with problems that incorporate QtsPlus software, which is freely available via the book's related Web site.With its accessible style and wealth of real-world examples, Fundamentals of Queueing Theory, Fourth Edition is an ideal book for courses on queueing theory at the upper-undergraduate and graduate levels. It is also a valuable resource for researchers and practitioners who analyze congestion in the fields of telecommunications, transportation, aviation, and management science.

2,562 citations

Journal ArticleDOI
TL;DR: The literature is surveyed to identify potential research directions in disaster operations, discuss relevant issues, and provide a starting point for interested researchers.

1,431 citations

Journal ArticleDOI

793 citations

Book
07 May 2008
TL;DR: This book is intended for an audience ranging from advanced undergraduates to researchers interested in queueing theory, but also in applied probability, stochastic models of the operations research, and engineering.
Abstract: The application of auto-repeat facilities in telephone systems, as well as the use of random access protocols in computer networks, have led to growing interest in retrial queueing models. Since much of the theory of retrial queues is complex from an analytical viewpoint, with this book the authors give a comprehensive and updated text focusing on approximate techniques and algorithmic methods for solving the analytically intractable models. Retrial Queueing Systems: A Computational Approach also * Presents motivating examples in telephone and computer networks. * Establishes a comparative analysis of the retrial queues versus standard queues with waiting lines and queues with losses. * Integrates a wide range of techniques applied to the main M/G/1 and M/M/c retrial queues, and variants with general retrial times, finite population and the discrete-time case. * Surveys basic results of the matrix-analytic formalism and emphasizes the related tools employed in retrial queues. * Discusses a few selected retrial queues with QBD, GI/M/1 and M/G/1 structures. * Features an abundance of numerical examples, and updates the existing literature. The book is intended for an audience ranging from advanced undergraduates to researchers interested not only in queueing theory, but also in applied probability, stochastic models of the operations research, and engineering. The prerequisite is a graduate course in stochastic processes, and a positive attitude to the algorithmic probability.

419 citations