Related papers: Queueing Analysis for Preemptive Transmission in U…
In this paper, we present a queueing model for quantum communication networks, a rapidly growing field of research inspired by its technological promise and recent experimental successes. The model consists of a primary queue and a service…
This paper presents a second-order heavy traffic analysis of a single server queue that processes customers having deadlines using the earliest-deadline-first scheduling policy. For such systems, referred to as real-time queueing systems,…
The paper aims to design cross-layer optimal scheduling algorithms for cooperative multi-hop Cognitive Radio Networks (CRNs), where secondary users (SUs) assist primary user (PU)'s multi-hop transmissions and in return gain authorization to…
We consider a service system with an infinite number of exponential servers sharing a finite service capacity. The servers are ordered according to their speed, and arriving customers join the fastest idle server. A capacity allocation is…
Two models of a queue are proposed: a human queue and two lines of vehicles before a narrowing. In both models, a queuer tries to evaluate his waiting time, taking into account the delay caused by intruders who jump to the queue front. As…
Age of Information (AoI) and Peak AoI (PAoI) and their analytical models have recently drawn substantial amount of attention in information theory and wireless communications disciplines, in the context of qualitative assessment of…
Low-latency communication has recently attracted considerable attention owing to its potential of enabling delay-sensitive services in next-generation industrial cyber-physical systems. To achieve target average or maximum delay given…
It has been well established that wireless network coding can significantly improve the efficiency of multi-hop wireless networks. However, in a stochastic environment some of the packets might not have coding pairs, which limits the number…
We consider a horizontal traffic queue (HTQ) on a periodic road segment, where vehicles arrive according to a spatio-temporal Poisson process, and depart after traveling a distance that is sampled independently and identically from a…
Cognitive radio (CR) technology addresses the problem of spectrum under-utilization. In underlay CR mode, the secondary users are allowed to communicate provided that their transmission is not detrimental to primary user communication.…
We study synchronization in the context of network traffic on a $2-d$ communication network with local clustering and geographic separations. The network consists of nodes and randomly distributed hubs where the top five hubs ranked…
Minimizing waiting time for tasks waiting in the queue for execution is one of the important scheduling cri-teria which took a wide area in scheduling preemptive tasks. In this paper we present Changeable Time Quan-tum (CTQ) approach…
We consider a single large language model (LLM) server that serves a heterogeneous stream of queries belonging to $N$ distinct task types. Queries arrive according to a Poisson process, and each type occurs with a known prior probability.…
Characterization of the delay profile of systems employing random linear network coding is important for the reliable provision of broadcast services. Previous studies focused on network coding over large finite fields or developed Markov…
The growth of Machine-Type Communication (MTC) increases the relevance of queuing scenarios with deterministic service times. In this letter, we present a model for queues without waiting lines and with degenerate service time distributions…
Consider a lossy communication channel for unicast with zero-delay feedback. For this communication scenario, a simple retransmission scheme is optimum with respect to delay. An alternative approach is to use random linear coding in…
In this paper queue stability in a single-hop wireless multicast networks over erasure channels is analyzed. First, a queuing model consisting of several sub-queues is introduced. Under the queueing stability constraint, we adopt Lyapunov…
Completeness of a dynamic priority scheduling scheme is of fundamental importance for the optimal control of queues in areas as diverse as computer communications, communication networks, supply chains and manufacturing systems. Our first…
We consider a source that collects a multiplicity of streams of updates and sends them through a network to a monitor. However, only a single update can be in the system at a time. Therefore, the transmitter always preempts the packet being…
With the rapid advance of information technology, network systems have become increasingly complex and hence the underlying system dynamics are often unknown or difficult to characterize. Finding a good network control policy is of…