91Ó°ÊÓ

A Poisson process is a mathematical model used to describe how random events occur over time. It is particularly useful for modeling arrival processes in queues or systems where events happen independently of each other. The most defining feature of a Poisson process is its constant average rate, denoted by \( \lambda \), which represents the average number of events (e.g., customer arrivals) occurring in a given time interval. This makes it ideal for scenarios where you're dealing with random arrivals, such as customers entering a line.

The Poisson process is characterized by the following:

• Independence: Each event happens independently; the occurrence of one event does not affect another.
• Uniform Rate: Events occur at a constant average rate \( \lambda \).
• Exponential Intervals: The time between consecutive events follows an exponential distribution.

Understanding these properties helps in predicting how queues build up over time and in making assumptions about service systems.

The exponential distribution is closely linked to the Poisson process, as it describes the time between consecutive events in a Poisson stream. The exponential distribution is often used to model service times in queues, representing the amount of time until the next event occurs.

• Memoryless Property: One of the unique features of the exponential distribution is that it is memoryless, meaning the probability of a certain length of time remaining is independent of how much time has already passed.
• Rate Parameter: The distribution is characterized by a rate parameter \( \mu \), which dictates how quickly events tend to occur. This is crucial for determining the speed of service within a queue.

The probability density function (PDF) for the exponential distribution is given by:

\[ f(t|mu)=\mu e^{-mu t}\]

where \( t \) is the time between events. This equation highlights the decreasing probability of larger time gaps between events, emphasizing quick turnovers typical in many service systems.

In the context of queues, the negative binomial distribution helps us model the number of arrivals during a customer's service time. This distribution counts the number of failures ('arrivals' in our case) before a specified number of successes ('departures'). This is particularly part of queueing theory where we are interested in predicting the number of people in the system.

Key features of the negative binomial distribution:

• Number of Successes (\( r \)): The required number of successes, analogous to the number of customer departures.
• Probability of a Failure (\( p \)): Probability of an arrival during the service time, calculated as \( \frac{\lambda}{\lambda + \mu} \).

The Probability Mass Function (PMF) for the negative binomial distribution is:

\[P(X=k) = \binom{k+r-1}{k}(1-p)^{r}p^{k}\]

where \( k \) is the number of arrivals during the customer's service time. This formula allows us to calculate the probabilities of various numbers of arrivals, aiding in detailed queue management.

The probability mass function (PMF) is a way to describe the likelihood of outcomes in a discrete random variable. For our queueing problem, the PMF helps calculate the probability of \( X \), the number of customers in the system when a specific customer leaves.

• Discrete Values: PMF gives probabilities for specific discrete outcomes, such as the number of customers arriving or served.
• Sum to One: Total probability across all possible outcomes equals 1, covering all scenarios.

In the context of a negative binomial distribution used in queuing, the PMF is applied as follows:

\[P(X=k) = \binom{k+n-1}{k}\left(\frac{\mu}{\lambda + \mu}\right)^{n}\left(\frac{\lambda}{\lambda + \mu}\right)^{k}\]

This uses the parameters \( n \) for the number of successes, and \( p \) for the probability of an arrival. By calculating this PMF, we can assess how likely different numbers of customers are present at a given departure, providing vital insights for managing the queue efficiently.