scholarly journals Exact Time-Dependent Queue-Length Solution to a Discrete-Time Geo/D/1 Queue

Mathematics ◽  
2019 ◽  
Vol 7 (8) ◽  
pp. 717
Author(s):  
Jung Woo Baek ◽  
Yun Han Bae
Keyword(s):  
Closed Form ◽  
Discrete Time ◽  
Real World ◽  
Queue Length ◽  
Service Systems ◽  
Time Dependent ◽  
World Systems ◽  
Exact Time ◽  
Queuing Models

Time-dependent solutions to queuing models are beneficial for evaluating the performance of real-world systems such as communication, transportation, and service systems. However, restricted results have been reported due to mathematical complexity. In this study, we present a time-dependent queue-length formula for a discrete-time G e o / D / 1 queue starting with a positive number of initial customers. We derive the time-dependent formula in closed form.

Phenomenological Modelling

2018 ◽  
Author(s):  
Ray Huffaker ◽  
Marco Bittelli ◽  
Rodolfo Rosa
Keyword(s):  
Nonlinear Dynamics ◽  
Time Series ◽  
Real World ◽  
Biological Diversity ◽  
False Positives ◽  
World Systems ◽  
Economic Activities ◽  
Essential Services ◽  
Low Dimension ◽  
Convergent Cross Mapping

Detecting causal interactions among climatic, environmental, and human forces in complex biophysical systems is essential for understanding how these systems function and how public policies can be devised that protect the flow of essential services to biological diversity, agriculture, and other core economic activities. Convergent Cross Mapping (CCM) detects causal networks in real-world systems diagnosed with deterministic, low-dimension, and nonlinear dynamics. If CCM detects correspondence between phase spaces reconstructed from observed time series variables, then the variables are determined to causally interact in the same dynamic system. CCM can give false positives by misconstruing synchronized variables as causally interactive. Extended (delayed) CCM screens for false positives among synchronized variables.

scholarly journals Higher-order temporal network effects through triplet evolution

2021 ◽  
Vol 11 (1) ◽  
Author(s):  
Qing Yao ◽  
Bingsheng Chen ◽  
Tim S. Evans ◽  
Kim Christensen
Keyword(s):  
Real World ◽  
Link Prediction ◽  
Higher Order ◽  
Prediction Algorithm ◽  
Interaction Patterns ◽  
Temporal Networks ◽  
World Systems ◽  
Order Interaction ◽  
Space And Time ◽  
Pairwise Interactions

AbstractWe study the evolution of networks through ‘triplets’—three-node graphlets. We develop a method to compute a transition matrix to describe the evolution of triplets in temporal networks. To identify the importance of higher-order interactions in the evolution of networks, we compare both artificial and real-world data to a model based on pairwise interactions only. The significant differences between the computed matrix and the calculated matrix from the fitted parameters demonstrate that non-pairwise interactions exist for various real-world systems in space and time, such as our data sets. Furthermore, this also reveals that different patterns of higher-order interaction are involved in different real-world situations. To test our approach, we then use these transition matrices as the basis of a link prediction algorithm. We investigate our algorithm’s performance on four temporal networks, comparing our approach against ten other link prediction methods. Our results show that higher-order interactions in both space and time play a crucial role in the evolution of networks as we find our method, along with two other methods based on non-local interactions, give the best overall performance. The results also confirm the concept that the higher-order interaction patterns, i.e., triplet dynamics, can help us understand and predict the evolution of different real-world systems.

scholarly journals Combined Games with Randomly Delayed Beginnings

Mathematics ◽  
2021 ◽  
Vol 9 (5) ◽  
pp. 534
Author(s):  
F. Thomas Bruss
Keyword(s):  
Discrete Time ◽  
Real World ◽  
Optimal Stopping ◽  
Random Variables ◽  
Approximate Solutions ◽  
Real World Problems

This paper presents two-person games involving optimal stopping. As far as we are aware, the type of problems we study are new. We confine our interest to such games in discrete time. Two players are to chose, with randomised choice-priority, between two games G1 and G2. Each game consists of two parts with well-defined targets. Each part consists of a sequence of random variables which determines when the decisive part of the game will begin. In each game, the horizon is bounded, and if the two parts are not finished within the horizon, the game is lost by definition. Otherwise the decisive part begins, on which each player is entitled to apply their or her strategy to reach the second target. If only one player achieves the two targets, this player is the winner. If both win or both lose, the outcome is seen as “deuce”. We motivate the interest of such problems in the context of real-world problems. A few representative problems are solved in detail. The main objective of this article is to serve as a preliminary manual to guide through possible approaches and to discuss under which circumstances we can obtain solutions, or approximate solutions.

scholarly journals Asymmetry underlies stability in power grids

2021 ◽  
Vol 12 (1) ◽  
Author(s):  
Ferenc Molnar ◽  
Takashi Nishikawa ◽  
Adilson E. Motter
Keyword(s):  
Symmetry Breaking ◽  
Real World ◽  
Power Grids ◽  
Stable Operation ◽  
World Systems ◽  
Symmetric State ◽  
Network Systems ◽  
Additional Improvement ◽  
The Stability ◽  
General Method

AbstractBehavioral homogeneity is often critical for the functioning of network systems of interacting entities. In power grids, whose stable operation requires generator frequencies to be synchronized—and thus homogeneous—across the network, previous work suggests that the stability of synchronous states can be improved by making the generators homogeneous. Here, we show that a substantial additional improvement is possible by instead making the generators suitably heterogeneous. We develop a general method for attributing this counterintuitive effect to converse symmetry breaking, a recently established phenomenon in which the system must be asymmetric to maintain a stable symmetric state. These findings constitute the first demonstration of converse symmetry breaking in real-world systems, and our method promises to enable identification of this phenomenon in other networks whose functions rely on behavioral homogeneity.

scholarly journals Elliptic Solutions of Dynamical Lucas Sequences

Entropy ◽  
2021 ◽  
Vol 23 (2) ◽  
pp. 183
Author(s):  
Michael J. Schlosser ◽  
Meesue Yoo
Keyword(s):  
Discrete Time ◽  
Time Dependent ◽  
Fibonacci Polynomials ◽  
Lucas Sequences ◽  
Elliptic Solutions

We study two types of dynamical extensions of Lucas sequences and give elliptic solutions for them. The first type concerns a level-dependent (or discrete time-dependent) version involving commuting variables. We show that a nice solution for this system is given by elliptic numbers. The second type involves a non-commutative version of Lucas sequences which defines the non-commutative (or abstract) Fibonacci polynomials introduced by Johann Cigler. If the non-commuting variables are specialized to be elliptic-commuting variables the abstract Fibonacci polynomials become non-commutative elliptic Fibonacci polynomials. Some properties we derive for these include their explicit expansion in terms of normalized monomials and a non-commutative elliptic Euler–Cassini identity.

Performance Approximation for Time-Dependent Queues with Generally Distributed Abandonments

2021 ◽  
Author(s):  
Gregor Selinka ◽  
Raik Stolletz ◽  
Thomas I. Maindl
Keyword(s):  
Performance Measures ◽  
Real World ◽  
Queueing System ◽  
Time Dependent ◽  
Interval Length ◽  
Arrival Process ◽  
Real World Data ◽  
World Data ◽  
Extant Literature ◽  
Approximation Quality

Many stochastic systems face a time-dependent demand. Especially in stochastic service systems, for example, in call centers, customers may leave the queue if their waiting time exceeds their personal patience. As discussed in the extant literature, it can be useful to use general distributions to model such customer patience. This paper analyzes the time-dependent performance of a multiserver queue with a nonhomogeneous Poisson arrival process with a time-dependent arrival rate, exponentially distributed processing times, and generally distributed time to abandon. Fast and accurate performance approximations are essential for decision support in such queueing systems, but the extant literature lacks appropriate methods for the setting we consider. To approximate time-dependent performance measures for small- and medium-sized systems, we develop a new stationary backlog-carryover (SBC) approach that allows for the analysis of underloaded and overloaded systems. Abandonments are considered in two steps of the algorithm: (i) in the approximation of the utilization as a reduced arrival stream and (ii) in the approximation of waiting-based performance measures with a stationary model for general abandonments. To improve the approximation quality, we discuss an adjustment to the interval lengths. We present a limit result that indicates convergence of the method for stationary parameters. The numerical study compares the approximation quality of different adjustments to the interval length. The new SBC approach is effective for instances with small numbers of time-dependent servers and gamma-distributed abandonment times with different coefficients of variation and for an empirical distribution of the abandonment times from real-world data obtained from a call center. A discrete-event simulation benchmark confirms that the SBC algorithm approximates the performance of the queueing system with abandonments very well for different parameter configurations. Summary of Contribution: The paper presents a fast and accurate numerical method to approximate the performance measures of a time‐dependent queueing system with generally distributed abandonments. The presented stationary backlog carryover approach with abandonment combines algorithmic ideas with stationary queueing models for generally distributed abandonment times. The reliability of the method is analyzed for transient systems and numerically studied with real‐world data.

Sign in / Sign up

Export Citation Format

Share Document