Handoff multiple queue model in microcellular networks

2007 ◽  
Vol 30 (2) ◽  
pp. 396-403 ◽  
Author(s):  
S. Louvros ◽  
J. Pylarinos ◽  
S. Kotsopoulos
Keyword(s):  
Queue Model ◽  
Microcellular Networks

scholarly journals Steady-State Analysis of the Join-the-Shortest-Queue Model in the Halfin–Whitt Regime

2020 ◽  
Vol 45 (3) ◽  
pp. 1069-1103
Author(s):  
Anton Braverman
Keyword(s):  
Steady State ◽  
Diffusion Limit ◽  
Fluid Limit ◽  
Time Intervals ◽  
Dimensional Diffusion ◽  
Queue Model ◽  
Join The Shortest Queue ◽  
Shortest Queue ◽  
Process Level ◽  
General Tool

This paper studies the steady-state properties of the join-the-shortest-queue model in the Halfin–Whitt regime. We focus on the process tracking the number of idle servers and the number of servers with nonempty buffers. Recently, Eschenfeldt and Gamarnik proved that a scaled version of this process converges, over finite time intervals, to a two-dimensional diffusion limit as the number of servers goes to infinity. In this paper, we prove that the diffusion limit is exponentially ergodic and that the diffusion scaled sequence of the steady-state number of idle servers and nonempty buffers is tight. Combined with the process-level convergence proved by Eschenfeldt and Gamarnik, our results imply convergence of steady-state distributions. The methodology used is the generator expansion framework based on Stein’s method, also referred to as the drift-based fluid limit Lyapunov function approach in Stolyar. One technical contribution to the framework is to show how it can be used as a general tool to establish exponential ergodicity.

scholarly journals Relationship between Age and Value of Information for a Noisy Ornstein–Uhlenbeck Process

Entropy ◽  
2021 ◽  
Vol 23 (8) ◽  
pp. 940
Author(s):  
Zijing Wang ◽  
Mihai-Alin Badiu ◽  
Justin P. Coon
Keyword(s):  
Value Of Information ◽  
Markov Models ◽  
Upper Bounds ◽  
Distribution Functions ◽  
Lower And Upper Bounds ◽  
Uhlenbeck Process ◽  
Source Data ◽  
Non Linear ◽  
Queue Model ◽  
Selection Of

The age of information (AoI) has been widely used to quantify the information freshness in real-time status update systems. As the AoI is independent of the inherent property of the source data and the context, we introduce a mutual information-based value of information (VoI) framework for hidden Markov models. In this paper, we investigate the VoI and its relationship to the AoI for a noisy Ornstein–Uhlenbeck (OU) process. We explore the effects of correlation and noise on their relationship, and find logarithmic, exponential and linear dependencies between the two in three different regimes. This gives the formal justification for the selection of non-linear AoI functions previously reported in other works. Moreover, we study the statistical properties of the VoI in the example of a queue model, deriving its distribution functions and moments. The lower and upper bounds of the average VoI are also analysed, which can be used for the design and optimisation of freshness-aware networks. Numerical results are presented and further show that, compared with the traditional linear age and some basic non-linear age functions, the proposed VoI framework is more general and suitable for various contexts.

scholarly journals Denumerable state continuous time Markov decision processes with unbounded cost and transition rates under average criterion

2002 ◽  
Vol 43 (4) ◽  
pp. 541-557 ◽  
Author(s):  
Xianping Guo ◽  
Weiping Zhu
Keyword(s):  
Markov Decision Processes ◽  
Continuous Time ◽  
Decision Processes ◽  
Transition Rates ◽  
Birth And Death Processes ◽  
Optimality Equation ◽  
Average Criterion ◽  
Markov Decision ◽  
Unbounded Cost ◽  
Queue Model

AbstractIn this paper, we consider denumerable state continuous time Markov decision processes with (possibly unbounded) transition and cost rates under average criterion. We present a set of conditions and prove the existence of both average cost optimal stationary policies and a solution of the average optimality equation under the conditions. The results in this paper are applied to an admission control queue model and controlled birth and death processes.

An M/M/c queue model for vehicle routing problem in multi-door cross-docking environments

2021 ◽  
pp. 105513
Author(s):  
Asefeh Hasani Goodarzi ◽  
Eleen Diabat ◽  
Armin Jabbarzadeh ◽  
Marc Paquet
Keyword(s):  
Vehicle Routing ◽  
Vehicle Routing Problem ◽  
Routing Problem ◽  
Cross Docking ◽  
Queue Model

scholarly journals The Morning Commute Problem with Ridesharing When Meet Stochastic Bottleneck

2021 ◽  
Vol 13 (11) ◽  
pp. 6040
Author(s):  
Zipeng Zhang ◽  
Ning Zhang
Keyword(s):  
Cost Analysis ◽  
Dynamic Property ◽  
Travel Behavior ◽  
Traffic Congestion ◽  
Related Research ◽  
Work Pattern ◽  
Schedule Coordination ◽  
Queue Model ◽  
Morning Commute ◽  
Analysis Models

This paper extends Vickrey’s point-queue model to study ridesharing behavior during a morning commute with uncertain bottleneck location. Unlike other ridesharing cost analysis models, there are two congestion cases and four dynamic departure patterns in our model: pre-pickup congestion case and post-pickup congestion case; both early pattern, both late pattern, late for pickup but early for work pattern, and early for pickup but late for work pattern. Analytical results indicate that the dynamic property of the mixed commuters equilibrium varies with the endogenous penetration rates associated with ridesharing commutes, as well as the schedule difference between pickup and work. This work is expected to promote the development of ridesharing to mitigate the traffic congestion and motivate related research of schedule coordination for regulating the ridesharing travel behavior in terms of the morning commute problem.

Sign in / Sign up

Export Citation Format

Share Document