Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Scribd Logo
Upload

Welcome to Scribd!

  • 59 views

    6.5 M/D/1, M/M/1, & M/M/N Queuing

    Uploaded by

    Marky Zoldyck
    The document discusses three queuing models: M/D/1, M/M/1, and M/M/N. M/D/1 assumes Poisson arrivals and deterministic service times with one server. M/M/1 assumes Poisson arrivals and exponential service times with one server. M/M/N extends M/M/1 to allow for multiple servers. Equations for key metrics like traffic intensity, probability of an empty system, average queue length and wait times are provided. Examples applying the models to movie ticket lines and highway toll booths are worked through.

    Copyright:

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

    6.5 M/D/1, M/M/1, & M/M/N Queuing

    Uploaded by

    Marky Zoldyck
    59 views8 pages
    The document discusses three queuing models: M/D/1, M/M/1, and M/M/N. M/D/1 assumes Poisson arrivals and deterministic service times with one server. M/M/1 assumes Poisson arrivals and exponential service times with one server. M/M/N extends M/M/1 to allow for multiple servers. Equations for key metrics like traffic intensity, probability of an empty system, average queue length and wait times are provided. Examples applying the models to movie ticket lines and highway toll booths are worked through.

    Original Title

    TRANSPOENG_6.5-MD1MM1-MMN-QUEUING

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    The document discusses three queuing models: M/D/1, M/M/1, and M/M/N. M/D/1 assumes Poisson arrivals and deterministic service times with one server. M/M/1 assumes Poisson arrivals and exponential service times with one server. M/M/N extends M/M/1 to allow for multiple servers. Equations for key metrics like traffic intensity, probability of an empty system, average queue length and wait times are provided. Examples applying the models to movie ticket lines and highway toll booths are worked through.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    59 views8 pages

    6.5 M/D/1, M/M/1, & M/M/N Queuing

    Uploaded by

    Marky Zoldyck
    The document discusses three queuing models: M/D/1, M/M/1, and M/M/N. M/D/1 assumes Poisson arrivals and deterministic service times with one server. M/M/1 assumes Poisson arrivals and exponential service times with one server. M/M/N extends M/M/1 to allow for multiple servers. Equations for key metrics like traffic intensity, probability of an empty system, average queue length and wait times are provided. Examples applying the models to movie ticket lines and highway toll booths are worked through.

    Copyright:

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

    6.

    5 M/D/1, M/M/1, & M/M/N Queuing


    M/D/1 Queuing
    Assumes exponentially distributed arrival times, deterministic departures, with one
    departure channel.
    It also assumes that the arrival times of successive units in a queue are exponentially
    distributed (i.e. Poisson arrivals)

    Equations:

    Traffic Intensity:

    Probability of no units in the system:

    Mean number in the waiting line (queue length):

    Mean number in the system:

    Mean Waiting time (in the queue):

    Mean waiting time in the system:

    Example:
    Customers arrive at the ticket counter of a local movie theater at a rate of 165 customers
    per hour until the movie starts, while the service rate is 3.25 persons per minute.
    Compute the characteristics of this system.
    Given:

    Solution:
    First, we have to solve for the traffic intensity (ρ),

    Probability of no units in the system:

    Mean number in the waiting line (queue length):

    Mean number in the system:

    Mean Waiting time (in the queue):

    Mean waiting time in the system:

    M/M/1 Queuing
    Assumes both exponentially distributed arrivals and departure times, with one departure
    channel.

    Equations:

    Mean number of units in the system:


    Mean number of units in the queue:

    Mean time in the system (for each unit):

    Mean waiting time:

    Percentage server’s idle time:

    Example:
    A movie theater ticket booth has a mean arrival rate of 3 persons/minute, and the service
    rate is 4 persons/minute. Calculate the characteristics of this queuing system applying the
    M/M/1 model.

    Given:

    Solution:
    First, we have to solve for the traffic intensity (ρ),

    Mean number of units in the system:


    Mean number of units in the queue:

    Mean time in the system (for each unit):

    Mean waiting time:

    Percentage server’s idle time:

    M/M/N Queuing
    Assumes the same characteristics as M/M/1 except that it has multiple (N) departure
    channels.
    Also, it still assumes Poisson arrivals and exponential service times.
    The mean service rate is determined by N(µ), where N is the number of services.

    Equations:

    Probability of having no units in the system:

    where: nc = departure channel number

    Probability of having n vehicles in the system:


    Average length of queue (in units):

    Mean time in the system (for each unit):

    Average waiting time in the queue:

    Probability of waiting in the queue:


    The probability that the number of units in the system, n, is greater than the number of
    departure channels, N):

    Examples:
    An entrance to a tollway has four tollbooths. Vehicles arrive at an average of 1800 veh/hr
    and take 6.67 seconds to pay their tolls. Both arrivals and departures can be assumed to
    be exponentially distributed. Compute the average queue length, the time in the system,
    and the probability of waiting in the queue.

    Given:

    Solution:
    First, we have to solve for the traffic intensity (ρ),
    Probability of having no units in the system:

    Average length of queue (in units):

    Mean time in the system (for each unit):

    Average waiting time in the queue:

    Probability of waiting in the queue:

    2. In the previous example, if the tollway administration now feels that the delays to
    vehicles are excessive and that a fifth booth should be opened, compute:

    a. P0

    b. L

    c. W

    d. Pn>N

    Given:
    Solution:
    First, we have to solve for the traffic intensity (ρ),

    Probability of having no units in the system:

    Average length of queue (in units):

    Mean time in the system (for each unit):

    Average waiting time in the queue:

    Probability of waiting in the queue:


    Discussion: Did the additional tollbooth significantly reduce the delay of the vehicles
    on the highway? Explain how and why.

    You might also like