A Queuing Model Flashcards
are commonly found in most systems where there exist one or more shared resources
Queues
is the mathematical study of the congestion and delays of waiting in line.
Queuing theory
pertains to any system that involves customers requesting for a particular service having a finite-capacity resource
Queuing system
are usually constructed by scientists, engineers, and developers to analyze the performance of a dynamic system where waiting can occur
Queuing models
This pertains to anything that arrives at a facility and requires service
Customer
This refers to any resource that provides a requested service
Server
is a system of notation according to which various characteristics of a queuing model are concisely identified
Kendall’s notation
It refers to the population of potential customers, which can be assumed to be finite or infinite
Calling population
It pertains to the limit on the number of customers that may wait inline or in the system
System Capacity
This is in terms of the interarrival time of consecutive customers. It involves two arrival types which are the random arrival and the scheduled arrival.
For infinite population models
This model is characterized by tagging if the customer is pending or not and by the runtime of a customer departure of the customer from the queuing system.
For finite population models
It refers to the actions of the customers while in a queue, waiting for the service to begin
Queue behavior
It pertains to the logical order of customers in a queue that determines which customer is chosen for service when a server becomes free
Queue discipline
This can either be constant or random. It is usually characterized as a sequence of independent and identically distributed random variables, such as exponential and gamma distribution
Service time
This involves the number of service centers and interconnected queues on the system
Service mechanism
