Scribd Logo
Upload

Welcome to Scribd!

  • 89 views

    Queuing Model

    Uploaded by

    PRACHI RAUT
    The document discusses queuing models and their characteristics. It describes queuing models as mathematical representations of waiting lines in various real-world systems like checkouts, traffic flow, and computer processing. The key aspects covered are: 1. Characteristics like arrival patterns, service rates, number of servers, system capacity. 2. Common distributions used like Poisson for arrivals and exponential for service times. 3. Performance metrics such as utilization rate, average queue length and wait times. 4. Kendall's notation is used to define model types like M/M/1 for exponential arrivals and service at a single server.

    Copyright:

    © All Rights Reserved
    Download as PPTX, PDF, TXT or read online from Scribd

    Queuing Model

    Uploaded by

    PRACHI RAUT
    89 views19 pages
    The document discusses queuing models and their characteristics. It describes queuing models as mathematical representations of waiting lines in various real-world systems like checkouts, traffic flow, and computer processing. The key aspects covered are: 1. Characteristics like arrival patterns, service rates, number of servers, system capacity. 2. Common distributions used like Poisson for arrivals and exponential for service times. 3. Performance metrics such as utilization rate, average queue length and wait times. 4. Kendall's notation is used to define model types like M/M/1 for exponential arrivals and service at a single server.

    Copyright

    © © All Rights Reserved

    Available Formats

    PPTX, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    The document discusses queuing models and their characteristics. It describes queuing models as mathematical representations of waiting lines in various real-world systems like checkouts, traffic flow, and computer processing. The key aspects covered are: 1. Characteristics like arrival patterns, service rates, number of servers, system capacity. 2. Common distributions used like Poisson for arrivals and exponential for service times. 3. Performance metrics such as utilization rate, average queue length and wait times. 4. Kendall's notation is used to define model types like M/M/1 for exponential arrivals and service at a single server.

    Copyright:

    © All Rights Reserved
    Download as PPTX, PDF, TXT or read online from Scribd
    Download as pptx, pdf, or txt
    89 views19 pages

    Queuing Model

    Uploaded by

    PRACHI RAUT
    The document discusses queuing models and their characteristics. It describes queuing models as mathematical representations of waiting lines in various real-world systems like checkouts, traffic flow, and computer processing. The key aspects covered are: 1. Characteristics like arrival patterns, service rates, number of servers, system capacity. 2. Common distributions used like Poisson for arrivals and exponential for service times. 3. Performance metrics such as utilization rate, average queue length and wait times. 4. Kendall's notation is used to define model types like M/M/1 for exponential arrivals and service at a single server.

    Copyright:

    © All Rights Reserved
    Download as PPTX, PDF, TXT or read online from Scribd
    Download as pptx, pdf, or txt
    of 19

    Queuing Model

    Examples
    • Passage of customers through supermarket checkout
    • Flow of automobile traffic through a road network
    • Transfer of electronic messages
    • Banking transactions
    • Flow of computer programs through a computer
    system
    • Sale of movie tickets
    • Arrival of trucks to carry goods
    • Telephone calls at switchboard
    General Structure of Queuing system
    Characteristics of Queuing Systems

    1. Calling population
    2. System capacity
    3. Arrival process
    4. Queue behavior and Queue discipline
    5. Service process
    6. Service structure
    1. Calling population :
     The population of potential customers
     Finite or Infinite
     Infinite : Arrival rate does not depend on number of customers
    in queue or being served
     Finite : Arrival rate depends on number of customers in queue
    or being served

    2. System Capacity :
     Queue size
     Number of customers allowed to wait
     Finite or infinite
    3. Arrival process :
     For infinite population: Inter-arrival time
     IAT : Random or scheduled
     Random IAT characterized by probability distributions
    (mostly, Poisson distribution)
     Arrivals may be one at a time or in batches
     Examples of random arrivals : arrival of customers at
    restaurants, banks, arrival of telephone calls at telephone
    exchange etc.
     Examples of scheduled arrivals: Patients arriving at clinic,
    flight arrival at airports etc.
    4. Queue behavior and queue discipline :
     Queue behavior
     Customer actions while in a queue
     Balk, renege or jockey
     Logical ordering of customers

     Queue discipline
     Logical ordering of customers in a queue
     Determines which customer will be chosen for service when
    a server becomes free
     Examples: FIFO, LIFO, SIRO, PS
    5. Service time and Service structure :
     Service time :
     Constant or random
     Often used distributions for random ST – exponential,
    Weibull, gamma, log-normal, truncated normal
     Service distribution can be identical or non-identical for
    various customers
     Sometimes, service time depends on time of day or the
    length of waiting line

     Service mechanism:
     Single server
     Multiple server
     Multiple server in series
    Kendall’s notation for queuing system
    • Format : A/B/c/N/K
    • A represents the inter-arrival time distribution.
    • B represents the service time distribution.
    • Common symbols for A and B include:
    – M (exponential or Markov)
    – D (constant or deterministic)
    – Ek (Erlang of order k)
    – P H (Phase type)
    – H(Hyper-exponential)
    – G(Arbitrary or general)
    – GI (General independent)
    • c represents the number of parallel servers.
    • N represents the system capacity.
    • K represents the size of the calling population.
    • For example, M/M/1/∞/∞ indicates a single-
    server system that has unlimited queue
    capacity and an infinite population of potential
    services. The inter arrival times and service
    times are exponentially distributed. When N
    and K are infinite, they may be dropped from
    the notation i.e. M/M/1/∞/∞ can be shortened
    as M/M/1.
    Queueing Models Performance
    λ = Arrival rate μ = Service rate

    If λ > μ :
    • waiting line will be formed which will increase indefinitely
    • Server would always be busy
    • Service system will eventually fail

    If λ ≤ μ :
    • No waiting line
    • Proportion of time for which server would be idle is

    ρ is average utilisation, traffic intensity or clearing ratio


    Poisson Arrival Process
    • Probability that n customers will arrive in
    the system during a given interval T, is given
    by :

    • Where m = λT
    Exponential Service Process
    • The probability that no more than T periods
    would be required to serve a customer is
    given by :
    • P(no more than T time period needed to serve a
    customer) = 1 – e -μT
    Queuing Model : Probabilistic
    POISSON- EXPONENTIAL, SINGLE SERVER,
    INFINITE POPULATION QUEUE
    Performance Parameters
    • Average utilization (ρ)
    • Probability that server is idle = 1- ρ
    • Probability of having exactly n customers in
    system = ρn (1- ρ)
    Performance Parameters

    • Expected number of customers in the system:


    = or
    • Expected number of customers in the queue:
    = or
    Performance Parameters
    • Average length of queue which contains at
    least one customer :
    = or
    • Mean waiting time in queue = Wq =
    • Mean time in the system = Ws =
    Performance parameters
    • The probability that a customer spends
    more than t units of time in the system :
    Ws(t) = e-t/Ws

    • The probability that a customer spends


    more than t units of time in the queue :
    Wq(t) = 𝜌e-t/Ws
    Queuing Model Cost Analysis

    You might also like