Library Subscription: Guest
Journal of Automation and Information Sciences

Published 12 issues per year

ISSN Print: 1064-2315

ISSN Online: 2163-9337

SJR: 0.173 SNIP: 0.588 CiteScore™:: 2

Indexed in

Algorithmic Approach to Analysis of Queuing System with Finite Queues and Jump-like Priorities

Volume 44, Issue 12, 2012, pp. 43-54
DOI: 10.1615/JAutomatInfScien.v44.i12.60
Get accessGet access

ABSTRACT

An algorithmic approach to studying the queuing models with finite queues and jump-like properties is developed. It is assumed that upon a low priority call arriving, one call of such kind with certain probability can be transferred to the end of the queue of high priority calls. Transfer probability depends on the state of the queue of heterogeneous calls. The algorithms for calculating the quality of service metrics of such queuing models are proposed.

CITED BY
  1. Melikov Agassi, Ponomarenko Leonid, Priority Schemes in Packet Switching Networks, in Multidimensional Queueing Models in Telecommunication Networks, 2014. Crossref

Begell Digital Portal Begell Digital Library eBooks Journals References & Proceedings Research Collections Prices and Subscription Policies Begell House Contact Us Language English 中文 Русский Português German French Spain