Results 101 to 110 of about 22,359 (313)
Time-dependent analysis of virtual waiting time behaviour in discrete time queues [PDF]
, 2005 Discrete time queueing models have been shown previously to be of practical use for modelling the approximate time-dependent behaviour of queue length in systems of the form M(t)/G/c.
Wall, A, Worthington, D J
core
Queueing and Markov chain decomposition method to analyze Markov-modulated Markov chains
, 2021 We present a Queueing and Markov chain decomposition method based on the total expectation theorem. Our decomposition method requires partial flow to be conserved, which we call a termination scheme.
Sasanuma, Katsunobu
core
Technical wildness: Modernity, romanticism, and the technocratic turn in Scottish rewilding
People and Nature, EarlyView.Abstract Technical wildness is a new and increasingly influential culture of nature. This paper marks its emergence in Scotland in the early 2020s. Focusing on Scotland's rapidly evolving land management sector, the paper traces how private rewilding companies position science‐led land management and natural capital markets as the most effective ...
Theo Stanley
wiley +1 more source
On Exponential Ergodicity of Multiclass Queueing Networks
, 2009 One of the key performance measures in queueing systems is the exponential decay rate of the steady-state tail probabilities of the queue lengths. It is known that if a corresponding fluid model is stable and the stochastic primitives have finite ...
Gamarnik, David, Meyn, Sean P.
core +1 more source
Living Well With Type 1 Diabetes in Middle School: A Student‐Centered Perspective
Psychology in the Schools, EarlyView.ABSTRACT Type 1 diabetes (T1D) is among the most common chronic illnesses affecting children and adolescents, meaning that all schools regularly include students with T1D. Supporting their well‐being requires understanding how they experience middle school to address their specific needs.
Isabelle Joing +4 more
wiley +1 more source
Path‐Based Deep Reinforcement Learning for On‐Board Routing in Satellite Constellation Networks
International Journal of Satellite Communications and Networking, EarlyView.ABSTRACT Efficient usage of available network resources is a crucial factor for broadband services in interconnected satellite constellations. To meet required quality of service standards under heavy network loads, it is essential to optimize traffic distribution among the intersatellite links. To address this challenge, we propose an adaptive traffic
Manuel M. H. Roth +4 more
wiley +1 more source
From Exhaustive Vacation Queues to Preemptive Priority Queues with General Interarrival Times
International Journal of Applied Mathematics and Computer Science, 2018 We consider the discrete-time G/GI/1 queueing system with multiple exhaustive vacations. By a transform approach, we obtain an expression for the probability generating function of the waiting time of customers in such a system.
Fiems Dieter, De Vuyst Stijn
doaj +1 more source
A tight bound on the throughput of queueing networks with blocking [PDF]
In this paper, we present a bounding methodology that allows to compute a tight lower bound on the cycle time of fork--join queueing networks with blocking and with general service time distributions. The methodology relies on two ideas.
SEMAL, Pierre +2 more
core
International Journal of Satellite Communications and Networking, EarlyView.ABSTRACT Low Earth Orbit (LEO) satellite communication systems have evolved into a critical component of global broadband networks, enabling wide‐area connectivity, IoT services, and intelligent multilayer satellite–terrestrial integration. Despite rapid advancements in constellation deployment, routing mechanisms, resource management, and LEO–5G/6G ...
Wei‐Hao Su +2 more
wiley +1 more source
Gordon and Newell queueing networks and copulas
In this paper we have found an analytical formula for a copula that connects the numbers Ni of customers in the nodes of a Gordon and Newell queueing network.
Ciuiu, Daniel
core