Further Investigations of the Priority Queuing System with Preemptive Priority and Randomized Push-Out Mechanism

Ilyashenko, Alexander; Zayats, Oleg; Muliukha, Vladimir; Laboshin, Leonid

doi:10.1007/978-3-319-10353-2_38

Cited by 19 publications

(8 citation statements)

References 7 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…3 it's getting only up to value close to 0,45. Such effect was introduced in [1] and it was called "closing" effect. For building such areas we have to find pairs of 1 2 ( , ) ρ ρ for which loss probability will be close to 1 when parameter α is equal to 1.…”

Section: Computational Resultsmentioning

confidence: 97%

“…First 2k equations can be built by substitution of j=k-1 into (5). To get 2k-2 more equations find cients of all powers of argument v for limit of G (1) and u for limit of G (2) in (5).…”

Section: Generating Function Methods Applicationmentioning

confidence: 99%

“…Using equation (5) and technique from [1] can express probabilities of all system states (6) through probabilities The last step to reduce size of linear equations system (3) is to build system of linear equations for four sets of unknown probabilities ( 1 ) (…”

Section: Generating Function Methods Applicationmentioning

confidence: 99%

“…Preemptive and relative priorities were studies in [1,2,3]. In this article will be studied model with alternating priority.…”

Section: Introductionmentioning

confidence: 97%

“…For avoiding such situations can be used randomized push-out mechanism, introduced in [2,3] and actively studied in [1,[5][6][7]. For such type of mechanism pushing out of the buffer does not occur every time when priority packets coming to the system, but only with a provided probability α .…”

Section: Introductionmentioning

confidence: 99%

See 4 more Smart Citations

Alternating Priorities Queueing System with Randomized Push-Out Mechanism

Ilyashenko

Zayats

Muliukha

et al. 2015

Lecture Notes in Computer Science

Self Cite

View full text Add to dashboard Cite

Abstract. This paper is written about a priority queueing models in combination with randomized push-out mechanism. Considered model has two incoming flows having different intensities, limited buffer size (k) and two types of priorities for each flow. Priority in this model is realized as alternating priority and it can be switched from one flow to another in moment when system will complete serving all packets from high priority flow and will have in buffer only low-priority packets. In this paper presented algorithm for computing characteristics of the model like loss probability for both types of packets. For getting solution is used generating functions method. This method allowed to reduce size of Kolmogorov's linear equations system from k(k+1) to (4k-2), where k is a model buffer size. Also authors obtained (using this method) areas of "closing" borders for non-priority packets and areas of "linear behavior" where can be used linear law depending on push-out probability α for approximating loss probabilities.

show abstract

Section: Computational Resultsmentioning

confidence: 97%

“…First 2k equations can be built by substitution of j=k-1 into (5). To get 2k-2 more equations find cients of all powers of argument v for limit of G (1) and u for limit of G (2) in (5).…”

Section: Generating Function Methods Applicationmentioning

confidence: 99%