| Title |
Prioritetinių paraiškų srautų aptarnavimo M/M/1/n sistemos analizė / |
| Another Title |
Analysis of priority queueing system M/M/1/n. |
| Authors |
Gvergždys, J ; Mikšys, A ; Rindzevičius, R ; Šimkevičius, S |
| Full Text |
|
| Is Part of |
Elektronika ir elektrotechnika.. Kaunas : Technologija. 2004, Nr. 2, p. 52-55.. ISSN 1392-1215. eISSN 2029-5731 |
| Abstract [eng] |
There are applications of the priority queueing system M/M/1/n used in the data transmission networks. We assume that an arriving data packets belongs to a priority class i (i=1,2 ). The smaller the priority class number, the higher the priority. We consider the case where a data packet already in service is not pre-empted by an arriving data packet with higher priority class. In this model the data packets of each priority class arrive according to a Poisson process with rate λi and are transmitted by the same channel with a exponentially distributed transmission time of mean Ti . Within each priority class data packets are transmitted on their order of arrival. Using the Markov chains exact analytical model was created for M/M/1/n system and there are presented formulas for evaluation all parameters for two priority classes of data packets transmission. The Markov chains state transition diagram is taken. The various system performance measures important to priority class data packet transmission are computed. Some calculated system performance measures are presented. |
| Published |
Kaunas : Technologija |
| Type |
Journal article |
| Language |
Lithuanian |
| Publication date |
2004 |
| CC license |
|
