Transient analysis of a queue with queue-length dependent map and its application to SS7 network (Q1566520)

Congestion control problem with double thresholds is considered for the transient queue MAP/M/1 with queue-length dependent Markovian arrival process (MAP). For limited buffer size \(B\), upper \((M)\) and low \((L)\) thresholds are introduced, \(L<M<B\). Arriving packets are classified as low priority ones until queue length reaches level \(M\) (from below) and after that it crosses level \(L\) from above. Otherwise, their packets have high priority. Conjection status of the buffer (and the matrix representation of MAP) depend on the mentioned queue length state. The main quality of service (QoS) parameters, loss probability and mean delay for the \(n\)th packet, are derived for the emmbedded Markov chain at the arrival epochs. Applications to (intertnational) congestion control in SS7 network (signaling system No. 7 network) and some numerical examples are considered. Matrix representation is widely applied.