Tootfinder

Finite-Time Information-Theoretic Bounds in Queueing Control
Yujie Liu, Vincent Y. F. Tan, Yunbei Xu
https://arxiv.org/abs/2506.18278 https://

Finite-Time Information-Theoretic Bounds in Queueing Control
We establish the first finite-time information-theoretic lower bounds-and derive new policies that achieve them-for the total queue length in scheduling problems over stochastic processing networks with both adversarial and stochastic arrivals. Prior analyses of MaxWeight guarantee only stability and asymptotic optimality in heavy traffic; we prove that, at finite horizons, MaxWeight can incur strictly larger backlog by problem-dependent factors which we identify. Our main innovations are 1) a …

Trilobite tridents: hydrodynamic lift and stability mechanisms for queue formation
Hugh A. Trenchard, Carlton E. Brett, Matjaz Perc
https://arxiv.org/abs/2506.15922

Trilobite tridents: hydrodynamic lift and stability mechanisms for queue formation
The bizarre trident-like cephalic projections of Walliserops trifurcatus have previously been interpreted as sexually selected weapons for intraspecific combat. We propose an alternative hypothesis grounded in biomechanics and collective behavior, that tridents evolved as adaptations for hydrodynamic lift and queue stability, conferring energetic advantages during group locomotion. Under this hypothesis, lift could offset gravitational forces, enabling greater locomotor efficiency, while mechan…

A Stochastic Differential Equation Framework for Modeling Queue Length Dynamics Inspired by Self-Similarity
Shakib Mustavee, Shaurya Agarwal, Arvind Singh
https://arxiv.org/abs/2506.14059

A Stochastic Differential Equation Framework for Modeling Queue Length Dynamics Inspired by Self-Similarity
This article develops a stochastic differential equation (SDE) for modeling the temporal evolution of queue length dynamics at signalized intersections. Inspired by the observed quasiperiodic and self-similar characteristics of the queue length dynamics, the proposed model incorporates three properties into the SDE: (i) mean reversion with periodic mean, (ii) multiplicative noise, and (iii) fractional Brownian motion. It replicates key statistical features observed in real data, including the p…

Multi-dimensional queue-reactive model and signal-driven models: a unified framework
Emmanouil Sfendourakis
https://arxiv.org/abs/2506.11843 https://

Multi-dimensional queue-reactive model and signal-driven models: a unified framework
We present a Markovian market model driven by a hidden Brownian efficient price. In particular, we extend the queue-reactive model, making its dynamics dependent on the efficient price. Our study focuses on two sub-models: a signal-driven price model where the mid-price jump rates depend on the efficient price and an observable signal, and the usual queue-reactive model dependent on the efficient price via the intensities of the order arrivals. This way, we are able to correlate the evolution o…

First real test of the new cluster: encoding AV1 video. I created three Sisyphus encoding workers and decided to run some Blurays across all the servers. Wrote some Ansible to build the encoding workers because it's a pain in the ass, but right now I'm working through the first 3 videos in a queue of 12. Also, these are so much more efficient...
#homelab

The Peculiarities of Extending Queue Layouts
Thomas Depian, Simon D. Fink, Robert Ganian, Martin N\"ollenburg
https://arxiv.org/abs/2506.05156 https:/…

The Peculiarities of Extending Queue Layouts
We consider the problem of computing $\ell$-page queue layouts, which are linear arrangements of vertices accompanied with an assignment of the edges to pages from one to $\ell$ that avoid the nesting of edges on any of the pages. Inspired by previous work in the extension of stack layouts, here we consider the setting of extending a partial $\ell$-page queue layout into a complete one and primarily analyze the problem through the refined lens of parameterized complexity. We obtain novel algori…

Sorting by pile shuffles on queue-like and stack-like piles can be hard
Kyle B. Treleaven
https://arxiv.org/abs/2506.05518 https://ar…

Sorting by pile shuffles on queue-like and stack-like piles can be hard
Inspired by a common technique for shuffling a deck of cards on a table without riffling, we continue the study of a prequel paper on the pile shuffle and its capabilities as a sorting device. We study two sort feasibility problems of general interest concerning pile shuffle, first introduced in the prequel. These problems are characterized by: (1) bounds on the number of sequential rounds of shuffle, and piles created in each round; (2) the use of a heterogeneous mixture of queue-like and stac…

Yep. A lot of very wet, very dedicated car people here today. I'm already completely soaked to the skin, but hoping it clears up later.

Daughter just completed a course at school in Britain in the 70s. Don’t say you don’t learn anything in a humanities degree. That’s just what you would want to study to understand the conditions in the US as it’s empire falls into terminal decline and economy fails. Queue the coal strikes.

My morning so far:
- Essential system is not working, opened support ticket.
- Two hours later still no change.
- Called service desk: "Yes we assigned the ticket to the 2nd level"
- Checked ticket queue: "Priority 4: Low"
- Called service desk "Tell the 2nd level guys if they don't make this work before lunch we're coming over and confiscate every Switch 2 we find!"

I'm afraid this is true. I already struggle to raise enough money to keep the very talented young scientists I have working with me (from many different countries already), finding funding for more will be difficult, and why should US scientists essentially queue jump just because of their nationality ? I know that sounds harsh, I have very good US colleagues, but I have to be fair to all, regardless of where they come from. OTOH, if you are a US scientist and you are interested in exploring possibilities in Denmark, give me a shout and we'll see what we can do.
https://mastodon.world/@davidho/114620044303457868
davidho@mastodon.world - Unless you’re a Nobel laureate, the brain drain will be away from science and not to other countries.
https://www.nytimes.com/2025/06/03/us/trump-federal-spending-grants-scientists-leaving.html?unlocked_article_code=1.ME8.sh9q.qy7jX0S1ZrBa&smid=url-share

This https://arxiv.org/abs/2503.11463 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_mat…

Sorting permutations with pile shuffle on queue-like and stack-like piles
Inspired by a common technique for shuffling a deck of cards on a table without riffling, we formalize the pile shuffle and investigate its capabilities as a sorting device. Our study is novel in that we consider pile shuffle in three variations: (1) using queue-like piles, (2) using stack-like piles, and (3) using a heterogeneous mixture of those two pile types, either given or decided during the shuffle by the dealer herself. We first characterize the sortable permutations of one or more sequ…

Nintendo launches the Switch 2 globally, with long queues outside stores and midnight openings; analysts expect Nintendo to sell 15M to 20M Switch 2 units (David Keohane/Financial Times)
https://www.ft.com/content/f63cfbcc-9d0e-440e-ad9a-02d01d328f93

Nintendo sells out Switch 2 console at global launch
Mario fans queue at midnight store openings after games company apologises for failing to meet pre-order demand

This https://arxiv.org/abs/2501.08775 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_csDS_…

Adaptive Approximation Schemes for Matching Queues
We study a continuous-time, infinite-horizon dynamic bipartite matching problem. Suppliers arrive according to a Poisson process; while waiting, they may abandon the queue at a uniform rate. Customers on the other hand must be matched upon arrival. The objective is to minimize the expected long-term average cost subject to a throughput constraint on the total match rate. Previous literature on dynamic matching focuses on "static" policies, where the matching decisions do not depend explicitly…

Age of Information in Unreliable Tandem Queues
Muthukrishnan Senthilkumar, Aresh Dadlani, Hina Tabassum
https://arxiv.org/abs/2506.09245 https://

Age of Information in Unreliable Tandem Queues
Stringent demands for timely information delivery, driven by the widespread adoption of real-time applications and the Internet of Things, have established the age of information (AoI) as a critical metric for quantifying data freshness. Existing AoI models often assume multi-hop communication networks with fully reliable nodes, which may not accurately capture scenarios involving node transmission failures. This paper presents an analytical framework for two configurations of tandem queue syst…

This https://arxiv.org/abs/2305.13054 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_mat…

Fluid limits for interacting queues in sparse dynamic graphs
Consider a network of $n$ single-server queues where tasks arrive independently at each server at rate $λ_n$. The servers are connected by a graph that is resampled at rate $μ_n$ in a way that is symmetric with respect to the servers, and each task is dispatched to the shortest queue in the graph neighborhood where it appears. We aim to gain insight in the impact of the dynamic network structure on the load balancing dynamics in terms of the occupancy process which describes the empirical dis…

This https://arxiv.org/abs/2505.06780 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_csOS_…

Work-in-Progress: Multi-Deadline DAG Scheduling Model for Autonomous Driving Systems
Autoware is an autonomous driving system implemented on Robot Operation System (ROS) 2, where an end-to-end timing guarantee is crucial to ensure safety. However, existing ROS 2 cause-effect chain models for analyzing end-to-end latency struggle to accurately represent the complexities of Autoware, particularly regarding sync callbacks, queue consumption patterns, and feedback loops. To address these problems, we propose a new scheduling model that decomposes the end-to-end timing constraints o…

This https://arxiv.org/abs/2503.02982 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_csPF_…

Heavy-traffic Optimality of Skip-the-Longest-Queues in Heterogeneous Service Systems
We consider a discrete-time parallel service system consisting of $n$ heterogeneous single server queues with infinite capacity. Jobs arrive to the system as an i.i.d. process with rate proportional to $n$, and must be immediately dispatched in the time slot that they arrive. The dispatcher is assumed to be able to exchange messages with the servers to obtain their queue lengths and make dispatching decisions, introducing an undesirable communication overhead. In this setting, we propose a ultr…

I'm very busy at the moment with work and life stuff, so if I am taking a while to reply, you are in my reply queue.
Have an awesome day!

Backpressure-based Mean-field Type Game for Scheduling in Multi-Hop Wireless Sensor Networks
Salah Eddine Choutri, Boualem Djehiche, Prajwal Chauhan, Saif Eddin Jabari
https://arxiv.org/abs/2506.03059

Backpressure-based Mean-field Type Game for Scheduling in Multi-Hop Wireless Sensor Networks
We propose a Mean-Field Type Game (MFTG) framework for effective scheduling in multi-hop wireless sensor networks (WSNs) using backpressure as a performance criterion. Traditional backpressure algorithms leverage queue differentials to regulate data flow and maintain network stability. In this work, we extend the backpressure framework by incorporating a mean-field term into the cost functional, capturing the global behavior of the system alongside local dynamics. The resulting model utilizes t…

Work-in-Progress: Multi-Deadline DAG Scheduling Model for Autonomous Driving Systems
Atsushi Yano, Takuya Azumi
https://arxiv.org/abs/2505.06780 https://…

Work-in-Progress: Multi-Deadline DAG Scheduling Model for Autonomous Driving Systems
Autoware is an autonomous driving system implemented on Robot Operation System (ROS) 2, where an end-to-end timing guarantee is crucial to ensure safety. However, existing ROS 2 cause-effect chain models for analyzing end-to-end latency struggle to accurately represent the complexities of Autoware, particularly regarding sync callbacks, queue consumption patterns, and feedback loops. To address these problems, we propose a new scheduling model that decomposes the end-to-end timing constraints o…

People in #Finland will queue for anything. Even to take a quiz about the #EU!
#WorldVillageFestival #MaailmaKylässäFestivaali

This https://arxiv.org/abs/2504.02207 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_mat…

Finite-Time Behavior of Erlang-C Model: Mixing Time, Mean Queue Length and Tail Bounds
Service systems like data centers and ride-hailing are popularly modeled as queueing systems in the literature. Such systems are primarily studied in the steady state due to their analytical tractability. However, almost all applications in real life do not operate in a steady state, so there is a clear discrepancy in translating theoretical queueing results to practical applications. To this end, we provide a finite-time convergence for Erlang-C systems (also known as $M/M/n$ queues), providin…

This https://arxiv.org/abs/2505.22862 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_eco…

Optimal Auction Design for Dynamic Stochastic Environments: Myerson Meets Naor
Allocation of goods and services often involves both stochastic supply and stochastic demand. Motivated by applications such as cloud computing, gig platforms, and blockchain auctions, we study the design of optimal selling mechanisms in an environment where buyers with private valuations arrive stochastically and are assigned goods that also arrive stochastically, and either buyers or goods can be held in a queue at costs until allocation. The optimal mechanism dynamically leverages competitiv…

June 7: Describe some facet—hidden or overt—which can be found in each and every one of your works.
June 8: Talk about something you wrote and later removed, and why.
I have a tendency to hoard quotes, one-liners and other emotional shortcuts to use later as homages for the reader to catch.
While I very much like them, I also often feel them to be my "guilty pleasure", so they are also at the beginning of the queue when I need to cut — for example, for Mastodon it…

Optimal Auction Design for Dynamic Stochastic Environments: Myerson Meets Naor
Yeon-Koo Che, Andrew B. Choi
https://arxiv.org/abs/2505.22862 https://

Optimal Auction Design for Dynamic Stochastic Environments: Myerson Meets Naor
Allocation of goods and services often involves both stochastic supply and stochastic demand. Motivated by applications such as cloud computing, gig platforms, and blockchain auctions, we study the design of optimal selling mechanisms in an environment where buyers with private valuations arrive stochastically and are assigned goods that also arrive stochastically, and either buyers or goods can be held in a queue at costs until allocation. The optimal mechanism dynamically leverages competitiv…