1 / 3

KENDALL

Notation for Queueing Models

tbutomo
Download Presentation

KENDALL

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Notation for Queueing Models (Kendall) kendall.ppt S-38.145 – Introduction to Teletraffic Theory – Spring 2005 1

  2. Notation for Queueing Models (Kendall) A/B/n/p/k A refers to the arrival process. Assumption: IID interarrival times. Interarrival time distribution: k = size of customer population • • • Default values (usually omitted): p = ∞, k = ∞ – – M = exponential (memoryless) • Examples: – D = deterministic M/M/1 – – G = general IID = independently and identically distributed M/D/1 – B refers to service times. Assumption: IID service times. Service time distribution: • M/G/1 – G/G/1 – M/M/n – – M = exponential (memoryless) M/M/n/n+m – – D = deterministic M/M/∞ (Poisson model) – – G = general M/M/n/n (Erlang model) – n = nr of (parallel) servers • M/M/k/k/k (Binomial model) – p = nr of system places = nr of servers + waiting places • M/M/n/n/k (Engset model, n < k) – 2

  3. Notation for Queueing Models (Kendall) THE END 3

More Related