Tootfinder

Strategic Customer Behavior in an M/M/1 Feedback Queue with General Payoffs
Peter Taylor, Jiesen Wang
https://arxiv.org/abs/2507.11263 https://

Strategic Customer Behavior in an M/M/1 Feedback Queue with General Payoffs
We consider an M/M/1 feedback queue in which service attempts may fail, requiring the customer to rejoin the queue. Arriving customers act strategically, deciding whether to join the queue based on a threshold strategy that depends on the number of customers present. Their decisions balance the expected service reward against the costs associated with waiting, while accounting for the behavior of others. This model was first analyzed by Fackrell, Taylor and Wang (2021), who assumed that waiti…

Design of a Timer Queue Supporting Dynamic Update Operations
Zekun Wang, Binghao Yue, Weitao Pan, Jiangyi Shi, Yue Hao
https://arxiv.org/abs/2508.10283 https://

Design of a Timer Queue Supporting Dynamic Update Operations
Large-scale timers are ubiquitous in network processing, including flow table entry expiration control in software defined network (SDN) switches, MAC address aging in Ethernet bridges, and retransmission timeout management in TCP/IP protocols. Conventional implementations suffer from critical limitations: low timing accuracy due to large-scale timer traversal and high computational overhead for new timer insertion. This paper presents a hybrid-architecture hardware priority queue based on syst…

Stripe's stablecoin arm, Bridge, applied for a US national trust bank charter, joining Circle, Paxos, Ripple, and Coinbase in seeking federal oversight (Vince Dioquino/Decrypt)
https://decrypt.co/344333/stablecoin-issuers-race-bank-charters-stripes-br…

Stablecoin Issuers Race for US Bank Charters as Stripe's Bridge Joins the Queue
Bridge, Stripe’s stablecoin arm, has applied to the OCC for a national trust bank, joining four others vying for federal approval.

In case you didn't noticed it, there is a temperature sensor in the first photo of the previous post. With the information from that one, and the one outside, I can decide based on temperature if I want any queue workers to pause untill things cooldown or not. So preparing the get those out of #HomeAssistant into

Queue Replacement Approach to Dynamic User Equilibrium Assignment with Route and Departure Time Choice
Takara Sakai, Takashi Akamatsu, Koki Satsukawa
https://arxiv.org/abs/2508.07159

Queue Replacement Approach to Dynamic User Equilibrium Assignment with Route and Departure Time Choice
This study develops a hybrid analytical and numerical approach for the dynamic user equilibrium (DUE) assignment with route and departure time choice (RDTC) for homogeneous users. The core concept of the proposed approach is the generalized queue replacement principle (GQRP). The GQRP is an equivalence between the equilibrium queueing delay pattern and the solution to a linear programming (LP) problem obtained by relaxing certain conditions in the original DUE-RDTC problem. We present a systema…

A new $1/(1-\rho)$-scaling bound for multiserver queues via a leave-one-out technique
Yige Hong
https://arxiv.org/abs/2510.11015 https://arxiv.org/pdf/2510…

A new $1/(1-ρ)$-scaling bound for multiserver queues via a leave-one-out technique
Bounding the queue length in a multiserver queue is a central challenge in queueing theory. Even for the classic $GI/GI/n$ queue with homogeneous servers, it is highly non-trivial to derive a simple and accurate bound for the steady-state queue length that holds across all scaling regimes. A recent breakthrough by Li and Goldberg (2025) establishes bounds that scale as $1/(1-ρ)$ for any load $ρ< 1$ and number of servers $n$, which is the correct scaling in many well-known scaling regimes, inc…

A Dynamic Service Offloading Algorithm Based on Lyapunov Optimization in Edge Computing
Peiyan Yuan, Ming Li, Chenyang Wang, Ledong An, Xiaoyan Zhao, Junna Zhang, Xiangyang Li, Huadong Ma
https://arxiv.org/abs/2509.10475

A Dynamic Service Offloading Algorithm Based on Lyapunov Optimization in Edge Computing
This study investigates the trade-off between system stability and offloading cost in collaborative edge computing. While collaborative offloading among multiple edge servers enhances resource utilization, existing methods often overlook the role of queue stability in overall system performance. To address this, a multi-hop data transmission model is developed, along with a cost model that captures both energy consumption and delay. A time-varying queue model is then introduced to maintain syst…

In the Queue: Understanding How Reddit Moderators Use the Modqueue
Tanvi Bajpai, Eshwar Chandrasekharan
https://arxiv.org/abs/2509.07314 https://arxiv.org/…

In the Queue: Understanding How Reddit Moderators Use the Modqueue
On Reddit, the moderation queue (modqueue) is a primary interface for moderators to review reported content. Despite its central role in Reddit's community-reliant moderation model, little is known about how moderators actually use it in practice. To address this gap, we surveyed 110 moderators, who collectively oversee more than 400 unique subreddits, and asked them about their usage of the modqueue. Modqueue practices vary widely: some moderators approach it as a daily checklist, others as a …

Fifa kept the costs of 2026 World Cup tickets under wraps until the very moment of sale,
replacing the usual published table of price points with a digital lottery that decided who even got the chance to buy.
Millions spent hours staring at a queue screen as algorithms determined their place in line.
When access finally came for most, the lower-priced sections had already vanished,
many presumably hoovered up by bots and bulk-buyers (and that’s before Fifa quietly r…

Retroactive Monotonic Priority Queues via Range Searching
Lucas Castro, Rosiane de Freitas
https://arxiv.org/abs/2508.09892 https://arxiv.org/pdf/2508.0989…

Retroactive Monotonic Priority Queues via Range Searching
The best known fully retroactive priority queue costs $O(\log^2 m \log \log m)$ time per operation, where $m$ is the number of operations performed on the data structure. In contrast, standard (non-retroactive) and partially retroactive priority queues cost $O(\log m)$ time per operation. So far, it is unknown whether this $O(\log m)$ bound can be achieved for fully retroactive priority queues. In this work, we study a restricted variant of priority queues known as monotonic priority queues. …

Fair Kernel-Lock-Free Claim/Release Protocol for Shared Object Access in Cooperatively Scheduled Runtimes
Kevin Chalmers, Jan B{\ae}kgaard Pedersen
https://arxiv.org/abs/2510.10818

Fair Kernel-Lock-Free Claim/Release Protocol for Shared Object Access in Cooperatively Scheduled Runtimes
We present the first spin-free, kernel-lock-free mutex that cooperates with user-mode schedulers and is formally proven FIFO-fair and linearizable using CSP/FDR. Our fairness oracle and stability-based proof method are reusable across coroutine runtime designs. We designed the claim/release protocol for a process-oriented language -- ProcessJ -- to manage the race for claiming shared inter-process communication channels. Internally, we use a lock-free queue to park waiting processes for gaining…

Fixed Parameter Tractable Linearizability Monitoring for Stack, Queue and Anagram Agnostic Data Types
Lee Zheng Han, Umang Mathur
https://arxiv.org/abs/2509.05586 https://

Fixed Parameter Tractable Linearizability Monitoring for Stack, Queue and Anagram Agnostic Data Types
Verifying linearizability of concurrent data structures is NP-hard, even for simple types. We present fixed-parameter tractable algorithms for monitoring stacks, queues, and anagram-agnostic data types (AADTs), parameterized by the maximum concurrency. Our approach leverages frontier graphs and partition states to bound the search space. For AADTs, equivalence of linearizations enables monitoring in log-linear time. For stacks, we introduce a grammar-based method with a sub-cubic reduction to m…

Russian air strike kills 24 in pension queue, Ukraine says
https://www.bbc.com/news/articles/c1jz08j8313o

"I think the root of homelessness is greed... England has a population of 60 million people and about the same homeless population as San Francisco, which is a city of about 850,000 people."
Kevin's book is in my queue. May move it up. He's speaking at the Roxie on Sunday!

For longtime Chronicle homelessness reporter Kevin Fagan, the business was always personal
Learn about Kevin Fagan’s powerful stories of homelessness and recovery that come from connections made in a life-long reporting career.

And if you go watch that video, which isn’t bad, YouTube will queue you up some, um, surprising follow-ups.
https://cosocial.ca/@aeisenberg/115325492154916206

Wow, #Bandcamp changed their radio player and now I can't download the #Metal Show anymore.
I was using that to add it to my podcast queue...

Gearing up for tonight's decap run.
In the queue: 5x PIC12F683 for delayering, XC6SLX25, XC7S25, ATSAMA5D27, 25AA1024
I'm not bothering to label the sample beakers because I know what most of these chips will look like from having seen other parts in the family. The ATSAM is the main unknown.
Anybody know what foundry it was made at? What node? We'll find out soon I guess.

Absorbing Markov Chain-Based Analysis of Age of Information in Discrete-Time Dual-Queue Systems
Yifan Feng, Nail Akar, Zhengchuan Chen, Mehul Motani
https://arxiv.org/abs/2509.23360

Absorbing Markov Chain-Based Analysis of Age of Information in Discrete-Time Dual-Queue Systems
Status update systems require the timely collection of sensing information for which deploying multiple sensors/servers to obtain diversity gains is considered as a promising solution. In this work, we construct an absorbing Markov chain (AMC) to exactly model Age of Information (AoI) in a discretetime dual-queue (DTDQ) status update system with generate at will (GAW) status updates, discrete phase-type (DPH-type) distributed service times and transmission freezing. Specifically, transmission i…

Etliche „meiner“ Podcasts macht jetzt Sommerpause. Ich komme also endlich mal hinterher, die Queue weg zu hören. #podcast

Reinforcement Learning Based Traffic Signal Design to Minimize Queue Lengths
Anirud Nandakumar, Chayan Banerjee, Lelitha Devi Vanajakshi
https://arxiv.org/abs/2509.21745 https:/…

Reinforcement Learning Based Traffic Signal Design to Minimize Queue Lengths
Efficient traffic signal control (TSC) is crucial for reducing congestion, travel delays, pollution, and for ensuring road safety. Traditional approaches, such as fixed signal control and actuated control, often struggle to handle dynamic traffic patterns. In this study, we propose a novel adaptive TSC framework that leverages Reinforcement Learning (RL), using the Proximal Policy Optimization (PPO) algorithm, to minimize total queue lengths across all signal phases. The challenge of efficientl…

Checking Consistency of Event-driven Traces
Parosh Aziz Abdulla, Mohamed Faouzi Atig, R. Govind, Samuel Grahn, Ramanathan S. Thinniyam
https://arxiv.org/abs/2508.07855 https://

Checking Consistency of Event-driven Traces
Event-driven programming is a popular paradigm where the flow of execution is controlled by two features: (1) shared memory and (2) sending and receiving of messages between multiple handler threads (just called handler). Each handler has a mailbox (modelled as a queue) for receiving messages, with the constraint that the handler processes its messages sequentially. Executions of messages by different handlers may be interleaved. A central problem in this setting is checking whether a candidate…

Crosslisted article(s) found for cs.CC. https://arxiv.org/list/cs.CC/new
[1/1]:
- Fixed Parameter Tractable Linearizability Monitoring for Stack, Queue and Anagram Agnostic Data T...
Lee Zheng Han, Umang Mathur

So, what did I miss during id24?
/me opens GitHub notifications queue.
/me closes laptop lid.

i wonder if "Queue tea" was invented by the british.
even tho it supposed to be pronounced "cute".
you can also get "pie Queue tea" for the less fortunate.
#Qt

On Recurrence of the Infinite Server Queue
Sergey Foss, Peter Glynn
https://arxiv.org/abs/2509.06075 https://arxiv.org/pdf/2509.06075

On Recurrence of the Infinite Server Queue
This paper concerns the recurrence structure of the infinite server queue, as viewed through the prism of the maximum dater sequence, namely the time to drain the current work in the system as seen at arrival epochs. Despite the importance of this model in queueing theory, we are aware of no complete analysis of the stability behavior of this model, especially in settings in which either or both the inter arrival and service time distributions have infinite mean. In this paper, we fully develop…

Bin gut in #Slowenien auf dem 25. #Weltententreffen angekommen. Ca. 700km in ca. 15h Reisezeit von Zürich aus. Habe u.a. den #Flüelapass, den

Ok #Fedi, selfie verification time.
Please form an orderly queue and submit your selfie verifications one at a time.
You will be judged by a supercomputer (It's a Raspberry Pi 3 in a corner of a room)
I'll start

The cool things you sometimes find in the CRAN submission queue. #rstats

If a WordPress site tags a post as a year, eg a tag "2025", and it then publishes an activitystream for tags with "name: {hash}2025", Mastodon will reject it as an error.
Which is wrong, the WordPress ActivityPub plugin, or Mastodon's import?
Asking for a person with a Sidekiq queue full of these.

Worker Pool Design Pattern Explanation
https://coffeebytes.dev/en/software-architecture/worker-pool-design-pattern-explanation/

Oh man, so I'm looking to relax and put on some #StarTrek. Next up in the queue is #STNG S7E18, "Eye of the Beholder", and WHAM deep talk about #suicide . Listening to Data relate his exp…

Rewatching #HappyGilmore last night, so that we could watch the sequel reminded me of a scene from my youth:
In my family’s home town of Świnoujście there’s a river. Until very recently, the only way to get across was a municipal ferry service.
Back in the 90’s and early 2000’s, it would be quite common for men with windshield wipers to walk down the queue of cars an…

Did #MS365 just start doing greylisting? Suddenly today I have an outbound queue with everything showing “451 4.7.500 Server busy. Please try again later from [$OUTBOUNDIP]" from one of the bazillion mail.protection.outlook.com machines. Did I somehow offend the MS gods?
#Email

I went to my first karaoke ever today. It was in VR, but that didn't make it any less scary :neofox_nervous:
I was very hesitant to sing, but I eventually put a song in the queue. When it was my turn I was TERRIFIED, but I went and did it. I stumbled a lot with my words and froze a couple times, but even then people were really nice and even complimented me! I gave it a second go, and it was so much better :neofox_snug:
I have to repeat this next month, I feel like this is what…

PIPQ: Strict Insert-Optimized Concurrent Priority Queue
Olivia Grimes, Ahmed Hassan, Panagiota Fatourou, Roberto Palmieri
https://arxiv.org/abs/2508.16023 https://

PIPQ: Strict Insert-Optimized Concurrent Priority Queue
This paper presents PIPQ, a strict and linearizable concurrent priority queue whose design differs from existing solutions in literature because it focuses on enabling parallelism of insert operations as opposed to accelerating delete-min operations, as traditionally done. In a nutshell, PIPQ's structure includes two levels: the worker level and the leader level. The worker level provides per-thread data structures enabling fast and parallel insertions. The leader level contains the highest pri…

Large Deviation Asymptotics for the Supermarket Model with Growing Choices
Amarjit Budhiraja, Ruoyu Wu
https://arxiv.org/abs/2508.08586 https://arxiv.org/p…

Large Deviation Asymptotics for the Supermarket Model with Growing Choices
We consider the Markovian supermarket model with growing choices, where jobs arrive at rate $nλ_n$ and each of $n$ parallel servers processes jobs in its queue at rate $1$. Each incoming job joins the shortest among $d_n \in \{1,\dotsc,n\}$ randomly selected queues. Under the assumption $d_n \to \infty$ and $λ_n \to λ\in (0,\infty)$ as $n\to \infty$, a large deviation principle (LDP) for the occupancy process is established in a suitable infinite-dimensional path space, and it is shown that …

Mind Your Ps and Qs: Supporting Positive Reinforcement in Moderation Through a Positive Queue
Charlotte Lambert, Agam Goyal, Eunice Mok, Eshwar Chandrasekharan
https://arxiv.org/abs/2509.18437

<NarratorVoice> He didn't wait a few days, he couldn't resist doing it tonight. </NarratorVoice>
Sooo, I couldn't resist. Figured out the query, which is essentially $QUEUE_LENGTH / $CAN_SCALE were $CAN_SCALE is either 1 or 0. And since division by 0 gives you nothing, and division by 1 gives you $QUEUE_LENGTH it makes for the perfect scaler with a kill switch. Then, I launched the

Performance Evaluation and Threat Mitigation in Large-scale 5G Core Deployment
Rodrigo Moreira, Larissa F. Rodrigues Moreira, Fl\'avio de Oliveira Silva
https://arxiv.org/abs/2507.17850

Performance Evaluation and Threat Mitigation in Large-scale 5G Core Deployment
The deployment of large-scale software-based 5G core functions presents significant challenges due to their reliance on optimized and intelligent resource provisioning for their services. Many studies have focused on analyzing the impact of resource allocation for complex deployments using mathematical models, queue theories, or even Artificial Intelligence (AI). This paper elucidates the effects of chaotic workloads, generated by Distributed Denial of Service (DDoS) on different Network Functi…

DRR-MDPF: A Queue Management Strategy Based on Dynamic Resource Allocation and Markov Decision Process in Named Data Networking (NDN)
Fatemeh Roshanzadeh, Hamid Barati, Ali Barati
https://arxiv.org/abs/2508.20272

DRR-MDPF: A Queue Management Strategy Based on Dynamic Resource Allocation and Markov Decision Process in Named Data Networking (NDN)
Named Data Networking (NDN) represents a transformative shift in network architecture, prioritizing content names over host addresses to enhance data dissemination. Efficient queue and resource management are critical to NDN performance, especially under dynamic and high-traffic conditions. This paper introduces DRR-MDPF, a novel hybrid strategy that integrates the Markov Decision Process Forwarding (MDPF) model with the Deficit Round Robin (DRR) algorithm. MDPF enables routers to intelligently…

Network-Optimised Spiking Neural Network for Event-Driven Networking
Muhammad Bilal
https://arxiv.org/abs/2509.23516 https://arxiv.org/pdf/2509.23516

Network-Optimised Spiking Neural Network for Event-Driven Networking
Spiking neural networks offer event-driven computation suited to time-critical networking tasks such as anomaly detection, local routing control, and congestion management at the edge. Classical units, including Hodgkin-Huxley, Izhikevich, and the Random Neural Network, map poorly to these needs. We introduce Network-Optimised Spiking (NOS), a compact two-variable unit whose state encodes normalised queue occupancy and a recovery resource. The model uses a saturating nonlinearity to enforce fin…

Dispatching and Pricing in Two-Sided Spatial Queues
Ang Xu, Chiwei Yan
https://arxiv.org/abs/2507.17983 https://arxiv.org/pdf/2507.17983

Dispatching and Pricing in Two-Sided Spatial Queues
We study a dispatching and pricing problem in two-sided spatial queues with fixed supply, motivated by ride-hailing and robotaxi platforms. Idle drivers queue on one side, waiting to pick up riders, while riders queue on the other, waiting to be matched with available drivers. The platform seeks to maximize net profit, penalized by rider waiting penalties, by jointly optimizing state-dependent dispatching and pricing decisions. We formulate this problem as a Markov decision process with state-d…

BlockFIFO & MultiFIFO: Scalable Relaxed Queues
Stefan Koch, Peter Sanders, Marvin Williams
https://arxiv.org/abs/2507.22764 https://arxiv.org/pdf/2507.…

BlockFIFO & MultiFIFO: Scalable Relaxed Queues
FIFO queues are a fundamental data structure used in a wide range of applications. Concurrent FIFO queues allow multiple execution threads to access the queue simultaneously. Maintaining strict FIFO semantics in concurrent queues leads to low throughput due to high contention at the head and tail of the queue. By relaxing the FIFO semantics to allow some reordering of elements, it becomes possible to achieve much higher scalability. This work presents two orthogonal designs for relaxed concurre…

Same Data, Different Audiences: Using Personas to Scope a Supercomputing Job Queue Visualization
Connor Scully-Allison, Kevin Menear, Kristin Potter, Andrew McNutt, Katherine E. Isaacs, Dmitry Duplyakin
https://arxiv.org/abs/2507.17898

Same Data, Different Audiences: Using Personas to Scope a Supercomputing Job Queue Visualization
Domain-specific visualizations sometimes focus on narrow, albeit important, tasks for one group of users. This focus limits the utility of a visualization to other groups working with the same data. While tasks elicited from other groups can present a design pitfall if not disambiguated, they also present a design opportunity -- development of visualizations that support multiple groups. This development choice presents a trade off of broadening the scope but limiting support for the more narro…

Replaced article(s) found for cs.PF. https://arxiv.org/list/cs.PF/new
[1/1]:
- Finite-Time Behavior of Erlang-C Model: Mixing Time, Mean Queue Length and Tail Bounds
Hoang Huy Nguyen, Sushil Mahavir Varma, Siva Theja Maguluri

A Predictive and Synergistic Two-Layer Scheduling Framework for LLM Serving
Yue Zhang, Yuansheng Chen, Xuan Mo, Alex Xi, Jialun Li, WeiGang Wu
https://arxiv.org/abs/2509.23384 h…

A Predictive and Synergistic Two-Layer Scheduling Framework for LLM Serving
LLM inference serving typically scales out with a two-tier architecture: a cluster router distributes requests to multiple inference engines, each of which then in turn performs its own internal scheduling. However, this commonly used paradigm suffers from critical, systemic inefficiency caused by the information gaps across two layers. At the cluster-layer, the router mainly relies on lagging, coarse-grained metrics, such as average latency and queue length to make decisions, resulting in "dec…

Understanding BBRv3 Performance in AQM-Enabled WiFi Networks
Shyam Kumar Shrestha, Jonathan Kua, Shiva Raj Pokhrel
https://arxiv.org/abs/2509.06245 https://

Understanding BBRv3 Performance in AQM-Enabled WiFi Networks
We present a modular experimental testbed and lightweight visualization tool for evaluating TCP congestion control performance in wireless networks. We compare Google's latest Bottleneck Bandwidth and Round-trip time version 3 (BBRv3) algorithm with loss-based CUBIC under varying Active Queue Management (AQM) schemes, namely PFIFO, FQ-CoDel, and CAKE, on a Wi-Fi link using a commercial MikroTik router. Our real-time dashboard visualizes metrics such as throughput, latency, and fairness across c…

Fixed-Point-Oriented Programming: A Concise and Elegant Paradigm
Yong Qi Foo, Brian Sze-Kai Cheong, Michael D. Adams
https://arxiv.org/abs/2507.21439 https://

Fixed-Point-Oriented Programming: A Concise and Elegant Paradigm
Fixed-Point-Oriented Programming (FPOP) is an emerging paradigm designed to streamline the implementation of problems involving self-referential computations. These include graph algorithms, static analysis, parsing, and distributed computing-domains that traditionally require complex and tricky-to-implement work-queue algorithms. Existing programming paradigms lack direct support for these inherently fixed-point computations, leading to inefficient and error-prone implementations. This white…

Concurrent Double-Ended Priority Queues
Panagiota Fatourou (FORTH ICS, Greece, University of Crete, Greece), Eric Ruppert (York University, Canada), Ioannis Xiradakis (FORTH ICS, Greece, University of Crete, Greece)
https://arxiv.org/abs/2508.13399

Concurrent Double-Ended Priority Queues
This work provides the first concurrent implementation specifically designed for a double-ended priority queue (DEPQ). We do this by describing a general way to add an ExtractMax operation to any concurrent priority queue that already supports Insert and ExtractMin operations. The construction uses two linearizable single-consumer priority queues to build a linearizable dual-consumer DEPQ (only one process can perform Extract operations at each end). This construction preserves lock-freedom. We…

L4Span: Spanning Congestion Signaling over NextG Networks for Interactive Applications
Haoran Wan, Kyle Jamieson
https://arxiv.org/abs/2510.02682 https://a…

L4Span: Spanning Congestion Signaling over NextG Networks for Interactive Applications
Design for low latency networking is essential for tomorrow's interactive applications, but it is essential to deploy incrementally and universally at the network's last mile. While wired broadband ISPs are rolling out the leading queue occupancy signaling mechanisms, the cellular Radio Access Network (RAN), another important last mile to many users, lags behind these efforts. This paper proposes a new RAN design, L4Span, that abstracts the complexities of RAN queueing in a simple interface, th…

From 5G RAN Queue Dynamics to Playback: A Performance Analysis for QUIC Video Streaming
Jashanjot Singh Sidhu, Jorge Ignacio Sandoval, Abdelhak Bentaleb, Sandra Cespedes
https://arxiv.org/abs/2508.15087

From 5G RAN Queue Dynamics to Playback: A Performance Analysis for QUIC Video Streaming
The rapid adoption of QUIC as a transport protocol has transformed content delivery by reducing latency, enhancing congestion control (CC), and enabling more efficient multiplexing. With the advent of 5G networks, which support ultra-low latency and high bandwidth, streaming high-resolution video at 4K and beyond has become increasingly viable. However, optimizing Quality of Experience (QoE) in mobile networks remains challenging due to the complex interactions among Adaptive Bit Rate (ABR) sch…

Classification of Discrete-Time Queues
Muhammad El-Taha
https://arxiv.org/abs/2509.01696 https://arxiv.org/pdf/2509.01696

Classification of Discrete-Time Queues
In this article we classify discrete-time queues based on scheduling rules and observation epochs combinations. This classification leads to {\em coherent}, {\em sub-coherent}, and {\em super-coherent} systems when {\em observed} waiting times are, respectively equal to, less than, or larger than {actual} waiting times. We then explore the consequences of this classification. Specifically, we discuss invariant properties of {\em coherent} systems including queue-lengths, waiting times, servers'…

DSROQ: Dynamic Scheduling and Routing for QoE Management in LEO Satellite Networks
Dhiraj Bhattacharjee, Pablo G. Madoery, Abhishek Naik, Halim Yanikomeroglu, Gunes Karabulut Kurt, Stephane Martel, Khaled Ahmed
https://arxiv.org/abs/2508.21047

DSROQ: Dynamic Scheduling and Routing for QoE Management in LEO Satellite Networks
The modern Internet supports diverse applications with heterogeneous quality of service (QoS) requirements. Low Earth orbit (LEO) satellite constellations offer a promising solution to meet these needs, enhancing coverage in rural areas and complementing terrestrial networks in urban regions. Ensuring QoS in such networks requires joint optimization of routing, bandwidth allocation, and dynamic queue scheduling, as traffic handling is critical for maintaining service performance. This paper for…

Functional Limits of Generalized Jackson Networks in Multi-scale Heavy Traffic
Zhen-Qing Chen, J. G. Dai, Jin Guang
https://arxiv.org/abs/2508.17015 https://

Functional Limits of Generalized Jackson Networks in Multi-scale Heavy Traffic
We investigate the functional limits of generalized Jackson networks in a multi-scale heavy traffic regime where stations approach full utilization at distinct, separated rates. Our main result shows that the appropriately scaled queue length processes converge weakly to a limit process whose coordinates are mutually independent. This finding provides the fundamental dynamic mechanism that explains the asymptotic independence previously observed only in stationary distributions. The specific fo…

Large Language Model-Based Task Offloading and Resource Allocation for Digital Twin Edge Computing Networks
Qiong Wu, Yu Xie, Pingyi Fan, Dong Qin, Kezhi Wang, Nan Cheng, Khaled B. Letaief
https://arxiv.org/abs/2507.19050

Large Language Model-Based Task Offloading and Resource Allocation for Digital Twin Edge Computing Networks
In this paper, we propose a general digital twin edge computing network comprising multiple vehicles and a server. Each vehicle generates multiple computing tasks within a time slot, leading to queuing challenges when offloading tasks to the server. The study investigates task offloading strategies, queue stability, and resource allocation. Lyapunov optimization is employed to transform long-term constraints into tractable short-term decisions. To solve the resulting problem, an in-context lear…

On the overlap times in queues with dependence under a Farlie-Gumbel-Morgenstern copula
Ioannis Dimitriou
https://arxiv.org/abs/2509.14100 https://arxiv.or…

On the overlap times in queues with dependence under a Farlie-Gumbel-Morgenstern copula
In this work, we analyze the steady-state maximum overlap time distribution in a single-server queue by introducing a dependence structure between service and interarrival times under the Farlie-Gumber-Morgenstern copula. We provide explicit expressions by indicating the effect of dependence. We also focus on the steady-state distribution of the minimum overlap time of a customer with its two adjacent customers. A more general dependence structure is also investigated. A numerical example illus…

Heavy Traffic Diffusion Limit for a Closed Queueing Network with Single-Server and Infinite-Server Stations
Amir A. Alwan, Bar{\i}\c{s} Ata
https://arxiv.org/abs/2509.13748 http…

Heavy Traffic Diffusion Limit for a Closed Queueing Network with Single-Server and Infinite-Server Stations
This paper studies the limiting behavior of a closed queueing network with multiple single-server and infinite-server stations. Under a heavy traffic asymptotic regime -- where the number of jobs and single-server service rates grow large while infinite-server rates remain fixed -- we prove a weak convergence result for the queue length and idleness process vector, providing an approximation for the original system.