Delayed and Network Queues (eBook)

Aliakbar Montazer Haghighi, Dimitar P. Mishev (Autoren)

eBook Download: EPUB

2016
John Wiley & Sons (Verlag)
978-1-119-02215-2 (ISBN)

Infos

Presents an introduction to differential equations, probability, and stochastic processes with real-world applications of queues with delay and delayed network queues

Featuring recent advances in queueing theory and modeling, Delayed and Network Queues provides the most up-to-date theories in queueing model applications. Balancing both theoretical and practical applications of queueing theory, the book introduces queueing network models as tools to assist in the answering of questions on cost and performance that arise throughout the life of a computer system and signal processing. Written by well-known researchers in the field, the book presents key information for understanding the essential aspects of queues with delay and networks of queues with unreliable nodes and vacationing servers.

• Beginning with simple analytical fundamentals, the book contains a selection of realistic and advanced queueing models that address current deficiencies. In addition, the book presents the treatment of queues with delay and networks of queues, including possible breakdowns and disruptions that may cause delay. Delayed and Network Queues also features:

• Numerous examples and exercises with applications in various fields of study such as mathematical sciences, biomathematics, engineering, physics, business, health industry, and economics

• A wide array of practical applications of network queues and queueing systems, all of which are related to the appropriate stochastic processes

• Up-to-date topical coverage such as single- and multiserver queues with and without delays, along with the necessary fundamental coverage of probability and difference equations

• Discussions on queueing models such as single- and multiserver Markovian queues with balking, reneging, delay, feedback, splitting, and blocking, as well as their role in the treatment of networks of queues with and without delay and network reliability

Delayed and Network Queues is an excellent textbook for upper-undergraduate and graduate-level courses in applied mathematics, queueing theory, queueing systems, probability, and stochastic processes. The book is also an ideal reference for academics and practitioners in mathematical sciences, biomathematics, operations research, management, engineering, physics, business, economics, health industry, and industrial engineering.

Aliakbar Montazer Haghighi, PhD, is Professor and Head of the Department of Mathematics at Prairie View A&M University, USA, as well as founding Editor-in-Chief of Applications and Applied Mathematics: An International Journal (AAM). His research interests include probability, statistics, stochastic processes, and queueing theory. Among his research publications and books, Dr. Haghighi is the coauthor of Difference and Differential Equations with Applications in Queueing Theory (Wiley, 2013).

Dimitar P. Mishev, PhD, is Professor in the Department of Mathematics at Prairie View A&M University, USA. His research interests include differential and difference equations and queueing theory. The author of numerous research papers and three books, Dr. Mishev is the coauthor of Difference and Differential Equations with Applications in Queueing Theory (Wiley, 2013).

Aliakbar Montazer Haghighi, PhD, is Professor and Head of the Department of Mathematics at Prairie View A&M University, USA, as well as founding Editor-in-Chief of Applications and Applied Mathematics: An International Journal (AAM). His research interests include probability, statistics, stochastic processes, and queueing theory. Among his research publications and books, Dr. Haghighi is the coauthor of Difference and Differential Equations with Applications in Queueing Theory (Wiley, 2013).

Dimitar P. Mishev, PhD, is Professor in the Department of Mathematics at Prairie View A&M University, USA. His research interests include differential and difference equations and queueing theory. The author of numerous research papers and three books, Dr. Mishev is the coauthor of Difference and Differential Equations with Applications in Queueing Theory (Wiley, 2013).

Rezensionen

"The references are in their majority very recent and well balanced"...."I find the (perhaps tangential) remarks on history, applications, and implementation a welcome addition to the text that should/will interest new researchers in the field" Maria Vlasiou on behalf of Mathematical Reviews, October 2017

Textauszug

Chapter 1
Preliminaries

1.1 Basics of Probability

1.1.1 Introduction

In this chapter, we introduce some basics of probability that will be needed in the later chapters. We also take the liberty in stating some theorems without presenting proofs and emphasize that the contents of this chapter, by no means, represent all topics of probability that deserve a detailed discussion.

A chance or random experiment is an experiment whose outcomes or results of its performance are uncertain. A set of outcomes is called an event. The set of all possible outcomes is referred to as the sample space, denoted by . Thus, an event is a subset of the sample space and an element of the sample space is a sample point.

Two events and are referred to as mutually exclusive if their intersection is empty. A set is called a partition of if the events are mutually exclusive, such that .

Probability of an event E, denoted by , indicates a number between 0 and 1 (inclusive), describing the likelihood of occurrence of the event E. There are two particular events: an event with probability 1 (referred to as almost sure event) and another with probability 0 (referred to as null or impossible event).

For a finite sample space with n elements, if all outcomes have the same chance to occur, each member is assigned a probability of 1/n and the sample space is called equiprobable. In case of an infinite sample space, elements are with uniform measure.

If a chance experiment is repeated, the chance of occurrence of an outcome is the ratio of the number of occurrences of the outcome to the total number of repetitions. Hence, for a sample space with n equiprobable points, the probability of an event with k points is k/n, referred to as relative frequency, and it is an approximation of the probability of the event. In other words, for a sample space with equiprobable sample points, if E is an event with k points, the probability of the event E is given by

1.1

The number of elements of the event E is referred to as the “size” of E. Thus, probability of the event E may be defined as

1.2

The triplet is called the probability space associated with the random experiment, where

1. a. is the sample space, that is, the set of all outcomes of the random experiment.
2. b. is the set function containing all possible events drawn from , which has the structure of the field. This means that satisfies the following conditions:
   1. i. the empty set is in ,
   2. ii. if , then the complement of E is also in , and
   3. iii. if , then .
3. c. P is the probability (measure) of an event. In fact, P is a function that associates a number for each element E of with the following properties (called axioms of probability):
   1. Axiom 1 , for each event E is .
   2. Axiom 2 .
   3. Axiom 3 For any sequence of mutually exclusive events (disjoint sets, that is, if ) in ,

1.1.2 Conditional Probability

For the probability space , let B be an event (that is, ) and P(B) > 0. Then, given the probability of an event A, the conditional probability of B, denoted by , defined on , is given by

1.3

If , then is not defined.

It should be noted that conditional probability exhibits properties similar to ordinary probability, but restricted to a smaller space.

One of the concepts often needed is the “independence” of events. We offer the definition for two events that can be easily expanded. Hence, we have the following:

Two events A and B are independent if and only if

1.4

In other words, occurrence of one does not affect the chance of occurrence of the other. Relation (1.4) can be expanded for an arbitrary number of events. Hence, the arbitrary family of events , where is the set of natural numbers, is independent if

1.5

for every finite subset of indices .

As a consequence of Equation (1.4), it can be easily proved that if two events A and B are independent and then

1.6

and conversely, if and Equation (1.6) holds to be true, then A and B are independent.

As another application of independence, the following is called the multiplicative law. Although we offer the definition for only two events, it can be expanded for any finite number of events. Thus, for any two events A and B with conditional probability or and as long as or is nonnegative, we have

1.7

Another property of conditional probability that can be easily verified called the law of total probability or total probability theorem is that if is a partition of the sample space , that is, n mutually exclusive events whose sum is unity, then for any given arbitrary event E, we have

1.8

Using Equation (1.8) and the conditional probability, a very important theorem called the Bayes' theorem can be proved. It can be stated as follows: If E is an event and a partition of the sample space , then

1.9

Relation (1.9) is referred to as Bayes' formula. The conditional probability is called the posterior probability. The original probability of is called the prior probability of .

1.2 Discrete Random Variables and Distributions

Although sample points are numerical in many practical problems, there are nonnumerical in many others. For practical purposes, a numerical sample space is more desirable. The tool to quantify a sample space to a numerical one is the random variable.

Before defining a random variable, we define a countable set. A set is called countable if it has the same number of elements (cardinality) as some subset of the set of natural numbers . In case of a finite subset of , the set is sometimes referred to as finitely countable or at most countable. For the case of the same cardinality as , it is sometimes referred to as countably infinite. A set that is not countable is called uncountable or denumerable. Throughout the book, we may use any of the terms as may be appropriate. Thus for us, the set of natural numbers , the set of natural numbers including zero , the set of integers , and the set of rational numbers (reactions) are all countable or infinitely countable sets. However, is at most countable or finitely countable. We note that all infinitely countable sets are of the same size, infinite. However, the set of real numbers and an interval are not countable. The latter was first proved by George Cantor using the diagonal argument method.

Thus, a random variable is defined as a function (mapping) that assigns a numerical value (or a set of values) to a sample point. Hence, If X is a random variable, it assigns a value to each outcome in . If the function X is on an at most countable sample space into the set of real numbers, , the random variable X is called a discrete random variable. Thus, a random variable is discrete if it takes at most countably many values. In other words, if there is a finitely countable set of real numbers, say A, such that .

For the sake of convenience, we may, allow a discrete random variable to assume positive infinity, as one of its values such as waiting time for an event to occur for the first time. This is because the event may never occur.

We leave it as an exercise for the reader to prove the following properties of discrete random variables. If X and Y are two discrete random variables, then , , and are also random variables, for the last one, provided Y is nonzero.

Probability distribution of a discrete random variable indicates the assignment of probabilities over the entire values of a random variable.

It is important to note that probabilities are nonnegative real numbers and total assignment of probabilities must be 1. Hence, these two simple properties establish two conditions for a function to be a probability distribution function.

Let the discrete random variable X be defined on a sample space with a typical element x. Then, the probability mass function (pmf) of X, denoted by , is defined as . If no specific value is given, we denote it by .The pmf is sometimes described by a table or matrix. For instance, if X is a random variable with the general vale x and specific values , that are assigned probabilities , then the pmf can be written as in Table 1.1.

Table 1.1...

Produkt-Details

• Erscheint lt. Verlag: 8.9.2016
• Sprache: englisch
• Themenwelt: Mathematik / Informatik ► Mathematik ► Angewandte Mathematik
• Themenwelt: Mathematik / Informatik ► Mathematik ► Statistik
• Themenwelt: Mathematik / Informatik ► Mathematik ► Wahrscheinlichkeit / Kombinatorik
• Themenwelt: Technik
• Schlagworte: and stochastic processes • Betriebswirtschaft • Betriebswirtschaft u. Operationsforschung • Business & Management • <p>differential equations • Management Science/Operational Research • network queues • Probability • Production Operations Management • Produktionssteuerung • queueing theory </p> • queuing theory • single- and multi-server queues • Statistics • Statistik • Warteschlange • Warteschlangentheorie • Wirtschaft u. Management
• ISBN-10: 1-119-02215-0 / 1119022150
• ISBN-13: 978-1-119-02215-2 / 9781119022152