相关论文: The effective bandwidth problem revisited
Finite-capacity single-server queues with general service-time distributions form the backbone of numerous real-world systems, yet classical simulation of performance metrics such as blocking probabilities and delay becomes computationally…
In this paper we consider a real time queuing system with rewards and deadlines. We assume that packet processing time is known upon arrival, as is the case in communication networks. This assumption allows us to demonstrate that the well…
In this paper, we present an exact model for the analysis of the performance of Random Linear Network Coding (RLNC) in wired erasure networks with finite buffers. In such networks, packets are delayed due to either random link erasures or…
Throughput and energy efficiency in fading channels are studied in the presence of randomly arriving data and statistical queueing constraints. In particular, Markovian arrival models including discrete-time Markov, Markov fluid, and…
The bounded delay buffer management problem, which was proposed by Kesselman et~al.\ (STOC 2001 and SIAM Journal on Computing 33(3), 2004), is an online problem focusing on buffer management of a switch supporting Quality of Service (QoS).…
The concept of fog computing is centered around providing computation resources at the edge of network, thereby reducing the latency and improving the quality of service. However, it is still desirable to investigate how and where at the…
Denied boarding in congested transit systems induces queuing delays and departure-time shifts that can reshape passenger flows. Correctly modeling these responses in transit assignment hinges on the enforcement of two priority rules:…
We address a single server queue control problem (QCP) in heavy traffic originating from Lee and Weerasinghe (2011). The state process represents the offered waiting time, the customer arrival has a state-dependent intensity, and the…
We consider the problem of staffing large-scale service systems with multiple customer classes and multiple dedicated server pools under joint quality-of-service (QoS) constraints. We first analyze the case in which arrival rates are…
Bandwidth-sharing networks as introduced by Massouli\'e & Roberts (1998) model the dynamic interaction among an evolving population of elastic flows competing for several links. With policies based on optimization procedures, such models…
In this letter, we propose a new routing strategy with a single free parameter $\alpha$ only based on local information of network topology. In order to maximize the packets handling capacity of underlying structure that can be measured by…
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…
The weighted $k$-server problem is a generalization of the $k$-server problem in which the cost of moving a server of weight $\beta_i$ through a distance $d$ is $\beta_i\cdot d$. The weighted server problem on uniform spaces models caching…
Retailers use a variety of mechanisms to enable sales and delivery. A relatively new offering by companies is curbside pickup where customers purchase goods online, schedule a pickup time, and come to a pickup facility to receive their…
We study an optimal-control problem of polling systems with large switchover times, when a holding cost is incurred on the queues. In particular, we consider a stochastic network with a single server that switches between several buffers…
In all networking systems, queuing is important to ensure appropriate resource utilization in the presence of bursty traffic and varying traffic demands. The Starlink access network is additionally also dynamic in terms of the capacity it…
The response in data flows transmission in real time is analyzed, for access network scenarios, in which said flows converge on an outgoing link, competing to achieve a certain level of quality of service. The concurrence of these types of…
We consider the problem of distributed admission control without knowledge of the capacity region in single-hop wireless networks, for flows that require a pre-specified bandwidth from the network. We present an optimization framework that…
An increasing number of real-time applications with compute and/or communication deadlines are being supported on shared infrastructure. Such applications can often tolerate occasional deadline violations without substantially impacting…
Utilizing customers' service-time information, we study an easy-to-implement scheduling policy with two priority classes. By carefully designing the classes, the two-class priority rule achieves near-optimal performance. In particular, for…