Identification
A queue supports FIFO operations. This provides two operations. Adding an element to the end, and removing the first element. You can only access the first and last element of a queue. There are different types:
- Circular queue’s connect the first and last nodes. One benefit of using this type of queue, is that once the queue becomes full, and there is space at the start of the queue, we can insert new values.
Queueing Network Model
A queue consists of a waiting line and a server which serves incoming requests. In Kendall notation: where:
- A is the inter-arrival time distribution
- S is the service time distribution
- m is the number of servers
- B is the number of buffers (Waiting spots)
- K is the population size (Number of things that can be serviced)
- SD is the service discipline The distributions for inter-arrival time and service times are generally…
- M Exponential
- E Erlang with parameter k
- H Hyper exponential with parameter k
- D Deterministic
- G General
