Scribd Logo
Upload

Welcome to Scribd!

  • 45 views

    Kendall Lee Notation

    Uploaded by

    Luis Iván Morett
    Kendall-Lee notation is a system used to describe queuing systems using 6 characteristics: 1) the arrival process, 2) the service process, 3) number of servers, 4) service order, 5) maximum number of customers allowed, and 6) population size. An example notation of M/M/1/FCFS/∞/∞ describes an queue with exponential inter-arrival and service times ("M/M"), 1 server ("1"), first-come first-served ordering ("FCFS"), unlimited queue size and population.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content

    You might also like

    Kendall Lee Notation

    Uploaded by

    Luis Iván Morett
    45 views1 page
    Kendall-Lee notation is a system used to describe queuing systems using 6 characteristics: 1) the arrival process, 2) the service process, 3) number of servers, 4) service order, 5) maximum number of customers allowed, and 6) population size. An example notation of M/M/1/FCFS/∞/∞ describes an queue with exponential inter-arrival and service times ("M/M"), 1 server ("1"), first-come first-served ordering ("FCFS"), unlimited queue size and population.

    Original Description:

    Original Title

    Kendall lee notation

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    Kendall-Lee notation is a system used to describe queuing systems using 6 characteristics: 1) the arrival process, 2) the service process, 3) number of servers, 4) service order, 5) maximum number of customers allowed, and 6) population size. An example notation of M/M/1/FCFS/∞/∞ describes an queue with exponential inter-arrival and service times ("M/M"), 1 server ("1"), first-come first-served ordering ("FCFS"), unlimited queue size and population.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    Download as pdf or txt
    45 views1 page

    Kendall Lee Notation

    Uploaded by

    Luis Iván Morett
    Kendall-Lee notation is a system used to describe queuing systems using 6 characteristics: 1) the arrival process, 2) the service process, 3) number of servers, 4) service order, 5) maximum number of customers allowed, and 6) population size. An example notation of M/M/1/FCFS/∞/∞ describes an queue with exponential inter-arrival and service times ("M/M"), 1 server ("1"), first-come first-served ordering ("FCFS"), unlimited queue size and population.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    Download as pdf or txt
    of 1

    Kendall-Lee Notation

    • Kendall (1951) defined the following notation to describe a


    queuing system.
    • There are 6 characteristics 1/2/3/4/5/6
    • The first specifies the arrivals process
    – M = inter-arrivals are i.i.d exponential.
    – D = inter-arrivals are i.i.d and deterministic.
    – Ek = inter-arrivals are i.i.d Erlang(k).
    – GI = inter-arrivals are i.i.d and have some general distri-
    bution.
    • The second specifies the service process
    The notation is the same as for arrivals, except using G instead
    of GI for general distribution of service time.
    • The third specifies the number of servers.
    • The fourth specifies the service order
    – FCFS = First Come First Served
    – LCFS = Last Come First Served
    – SIRO = Service in Random Order
    – GD = General Queuing Discipline
    • The fifth specifies the maximum allowable number of customers
    in the system.
    • The sixth specifies the size of the population from which ar-
    rivals are drawn.
    The first queue we will examine is the M/M/1/FCFS/∞/∞.
    What does this mean?

    You might also like