Results 31 to 40 of about 953,819 (335)
Correct Approximation of Stationary Distributions
, 2023 AbstractA classical problem for Markov chains is determining their stationary (or steady-state) distribution. This problem has an equally classical solution based on eigenvectors and linear equation systems. However, this approach does not scale to large instances, and iterative solutions are desirable.
openaire +2 more sources
New Approach for Finding Basic Performance Measures of Single Server Queue
Journal of Probability and Statistics, 2014 Consider the single server queue in which the system capacity is infinite and the customers are served on a first come, first served basis. Suppose the probability density function f(t) and the cumulative distribution function F(t) of the interarrival ...
Siew Khew Koh, Ah Hin Pooi, Yi Fei Tan
doaj +1 more source
Analytical Model and Feedback Predictor Optimization for Combined Early-HARQ and HARQ
Mathematics, 2021 In order to fulfill the stringent Ultra-Reliable Low Latency Communication (URLLC) requirements towards Fifth Generation (5G) mobile networks, early-Hybrid Automatic Repeat reQuest (e-HARQ) schemes have been introduced, aimed at providing faster feedback
Tatiana Rykova +4 more
doaj +1 more source
Multi-server queueing system with reserve servers
Журнал Белорусского государственного университета: Математика, информатика, 2019 In this paper, we investigate a multi-server queueing system with an unlimited buffer, which can be used in the design of energy consumption schemes and as a mathematical model of unreliable real stochastic systems.
Valentina I. Klimenok
doaj +1 more source
Graph Planning with Expected Finite Horizon
, 2018 Graph planning gives rise to fundamental algorithmic questions such as shortest path, traveling salesman problem, etc. A classical problem in discrete planning is to consider a weighted graph and construct a path that maximizes the sum of weights for a ...
Chatterjee, Krishnendu, Doyen, Laurent
core +1 more source
Closed Gordon – Newell network with single-line poles and exponentially limited request waiting time
Informatika, 2023 Objectives. An exponential queuing network with single-line poles is considered, which differs from the Gordon – Newell network only that the waiting time for service requests at the poles of the network is a random variable with conditional distribution
Yu. V. Malinkovsky, V. A. Nemilostivaya
doaj +1 more source
Decentralized trade, random utility and the evolution of social welfare [PDF]
, 2004 We study decentralized trade processes in general exchange economies and house allocation problems with and without money. The processes are subject to persistent random shocks stemming from agents' maximization of random utility.
Kandori, Michihiro +2 more
core +3 more sources
Transient Dynamics in the Random Growth and Reset Model
Entropy, 2021 A mean-field type model with random growth and reset terms is considered. The stationary distributions resulting from the corresponding master equation are relatively easy to obtain; however, for practical applications one also needs to know the ...
Tamás S. Biró +2 more
doaj +1 more source
Restricted Mobility Improves Delay-Throughput Trade-offs in Mobile Ad-Hoc Networks [PDF]
, 2007 In this paper we revisit two classes of mobility models which are widely used to repre-sent users ’ mobility in wireless networks: Random Waypoint (RWP) and Random Direction (RD).
Garetto, M., Leonardi, Emilio
core +3 more sources
, 2019 A result of Ward and Glynn (2005) asserts that the sequence of scaled offered waiting time processes of the $GI/GI/1+GI$ queue converges weakly to a reflected Ornstein-Uhlenbeck process (ROU) in the positive real line, as the traffic intensity approaches
Lee, Chihoon +2 more
core +1 more source