Stability of earliest-due-date, first-served queueing networks (Q5948168): Difference between revisions

An open multiclass queueing network with general distributions of service and interarrival times is considered. Each customer is assigned a `due date' (for example the arrival time) upon arrival, and customers at a station in the network are served in order of their due dates. It is shown that it is sufficient for stability (Harris regodicity) that the traffic intensity satisfies \(\rho_j< 1\) at each station \(j\). This is a relatively rare property for queueing networks and fails in particular for first-in-first-out.