Analysis of a finite queue under arbitrary service discipline with Markovian input flow depending on the system state
An one-line queueing system with the limited accumulator and Markovian applications input flow is considered. Matrix parameters determining Markovian flow is assumed to depend on the application number in the system. Application service durations are distributed by arbitrary law. A matrix algorithm is obtained for calculation of stationary probabilities of the system states and relationships are derived for some its capacity indices. Queue models of such the type occur in parameter analysis of the loading control procedure in a data transmission channel of the signalling system N7 being a base control element in the modern telecommunication means.