Related papers: A recursive equations based representation for the…
We analyze an M/M/1 queue with a service discipline in which customers, upon arriving when the server is busy, search a sequence of stations for a vacant station at which to wait, and in which the server, upon becoming free when one or more…
The finite operators are derived for the recoil $m\alpha^6(m/M)$ order relativistic corrections (to spin-averaged energy levels) in hydrogen-like atoms and ions in the two- and three-body formalism beyond the adiabatic approximation.…
Service system dynamics occur at the interplay between customer behaviour and a service provider's response. This kind of dynamics can effectively be modeled within the framework of queuing theory where customers' arrivals are described by…
We introduce and study a class of optimization problems we coin replenishment problems with fixed turnover times: a very natural model that has received little attention in the literature. Nodes with capacity for storing a certain commodity…
The non-stationary Erlang-A queue is a fundamental queueing model that is used to describe the dynamic behavior of large scale multi-server service systems that may experience customer abandonments, such as call centers, hospitals, and…
We formulate and discuss two conjectures concerning recursive formulae for Branson's $Q$-curvatures. The proposed formulae describe all $Q$-curvatures on manifolds of all even dimensions in terms of respective lower order $Q$-curvatures and…
The multitime multiple recurrences are common in analysis of algorithms, computational biology, information theory, queueing theory, filters theory, statistical physics etc. The theoretical part about them is little or not known. That is…
In many cognitive radio applications, there are multiple types of message queues. Existing queueing analysis works in underlay CR networks failed to discuss packets heterogeneity. Therefore high priority packets with impatient waiting time…
Exact explicit results are derived for the distribution of the partial busy period of the M/M/c multi-server queue for a general number of servers. A rudimentary spectral method leads to a representation that is amenable to efficient…
We study a queueing network with a single shared server, that serves the queues in a cyclic order according to the gated service discipline. External customers arrive at the queues according to independent Poisson processes. After…
In this paper, we analyze the steady state maximum overlap time in the M/M/1 queue. We derive the maximum overlap time tail distribution, its moments and the moment generating function. We also analyze the steady state minimum overlap time…
Queues with setup time are extensively studied because they have application in performance evaluation of power-saving data centers. In a data center, there are a huge number of servers which consume a large amount of energy. In the current…
By some new recursive algorithms, in this paper, we will give some improvements on Waring's problem.
I discuss classical and quantum recurrence theorems in a unified manner, treating both as generalisations of the fact that a system with a finite state space only has so many places to go. Along the way I prove versions of the recurrence…
There are proposed models of contracts, technological equipment and gas networks and methods of their optimization. The flow in network undergoes restrictions of contracts and equipment to be operated. The values of sources and sinks are…
Many real life queueing networks have finite buffers with overflows. To understand the behavior of such networks, we consider traffic equations that generalize the traffic equations of classic open queueing networks where some nodes are…
We study the generalization of the G/G/1 queue obtained by relaxing the assumption of independence between inter-arrival times and service requirements. The analysis is carried out for the class of multivariate matrix exponential…
The transport of products between different suppliers or production units can be described similarly to driven many-particle and traffic systems. We introduce equations for the flow of goods in supply networks and the adaptation of…
An extensive number of numerical computations of energy 1/$N$ series using a recursive Taylor series method are presented in this paper. The series are computed to a high order of approximation and their behaviour on increasing the order of…
The performance analysis of peer-to-peer (P2P) networks calls for a new kind of queueing model, in which jobs and service stations arrive randomly. Except in some simple special cases, in general, the queueing model with varying service…