Queueing Systems Q2 Unclaimed
Queueing Systems: Theory and Applications (QUESTA) is a well-established journal focusing on queueing theory. The models considered concern resource sharing in a wide sense, particularly within a network context, with probability theory being the main analytic tool.QUESTA welcomes papers directly contained in the above scope as well as papers at the interface between queueing and adjacent areas. Specific topics covered by the journal are: Probabilistic modelling of queues, and their relation to Markov chains and processes, stationary processes, and point processes. Queueing network models inspired by operations management, operations research and engineering. The analysis of networks in which users compete for scarce resources, and the connection with game theory. The analysis of extreme events, and the connection with e.g. the actuarial sciences and risk theory. Models in which the network infrastructure is dynamic and randomly evolving, and the connection with stochastic geometry and random graph models. Advances in simulation methodology, e.g. in relation to rare event estimation and variance reduction, and the development of queueing-related computational techniques in general. The connection between data and queues, covering the use of data to optimally control queues, the estimation of input parameters from workload observations, machine learning aspects of queueing, etc. The prospective areas of application include, but are not restricted to, production, storage and logistics, traffic and transportation systems, and computer and communication systems. Apart from regular research papers, the journal also solicits short communications, surveys, and papers on future research directions. Officially cited as: Queueing Syst Publishes research on theoretical problems in resource sharing dynamics (in a broad sense), with particular interests in probability and statisticsPublishes rigorous applied probability research, with a broad range of applications, to computer and communication systems, traffic and transportation, and production, storage and logistics, among othersOffers timely and topical surveys on novel problems in queueing systems and stochastic networks arising from cutting edge applications It has an SJR impact factor of 0,762.
Type: Journal
Type of Copyright:
Languages: English
Open Access Policy: Open Choice
Type of publications:
Publication frecuency: -
2190 €
Inmediate OANPD
Embargoed OA0 €
Non OAMetrics
0,762
SJR Impact factor58
H Index36
Total Docs (Last Year)227
Total Docs (3 years)1082
Total Refs187
Total Cites (3 years)110
Citable Docs (3 years)0.65
Cites/Doc (2 years)30.06
Ref/DocOther journals with similar parameters
Journal of Automated Reasoning Q2
International Journal of Fuzzy Systems Q2
Digital Signal Processing: A Review Journal Q2
Expert Systems Q2
IEEE Pervasive Computing Q2
Compare this journals
Aims and Scope
Best articles by citations
Explicit solutions for the steady state distributions in M/PH/1 queues with workload dependent balking
View moreTransient and busy period analysis of theGI/G/1 queue: The method of stages
View moreApproximations for waiting time in GI/G/1 systems
View moreDiscrete-time GI/Geo/1 queue with multiple working vacations
View moreThe Cumulative Idle Time in an ND/D/1 Queue
View moreMany Sources Asymptotics for Networks with Small Buffers
View moreAnalysis of the M/G/1 queue with exponentially working vacations - a matrix analytic approach
View moreMonitoring the packet gap of real-time packet traffic
View moreBoundary value problems in queueing theory
View moreVacation Models in Discrete Time
View moreBalancing Queues by Mean Field Interaction
View moreIntroduction Non-conventional Queueing Models: Heavy Tails, Long-Range Dependence, and Rare Events
View moreReduced-Load Equivalence for Queues with Gaussian Input
View moreProperties of serial kanban systems
View moreService stage Petri net models with product form solution
View moreTail Asymptotics for the Supremum of a Random Walk when the Mean Is not Finite
View moreSteady State Analysis of Finite Fluid Flow Models Using Finite QBDs
View moreMarkov-modulated queueing systems
View moreConditional and unconditional distributions forM/G/1 type queues with server vacations
View moreQueues as Harris recurrent Markov chains
View moreIndex Heuristics for Multiclass M/G/1 Systems with Nonpreemptive Service and Convex Holding Costs
View moreA Note on Veraverbeke's Theorem
View moreOn the Counting Process for a Class of Markovian Arrival Processes with an Application to a Queueing System
View moreMean Buffer Contents in Discrete-Time Single-Server Queues with Heterogeneous Sources
View more
Comments