Inscrição na biblioteca: Guest
Journal of Automation and Information Sciences

Publicou 12 edições por ano

ISSN Imprimir: 1064-2315

ISSN On-line: 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, Edição 12, 2012, pp. 43-54
DOI: 10.1615/JAutomatInfScien.v44.i12.60
Get accessGet access

RESUMO

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.

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

Portal Digital Begell Biblioteca digital da Begell eBooks Diários Referências e Anais Coleções de pesquisa Políticas de preços e assinaturas Begell House Contato Language English 中文 Русский Português German French Spain