Asymptotic buffer overflow probabilities in multiclass multiplexers: an optimal control approach
From MaRDI portal
Publication:4396063
DOI10.1109/9.661587zbMath0949.93078MaRDI QIDQ4396063
Ioannis Ch. Paschalidis, John N. Tsitsiklis, Dimitris J. Bertsimas
Publication date: 23 August 1998
Published in: IEEE Transactions on Automatic Control (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/1b2653d8b6010813d1922a663aedab0fc1fbcaba
optimal control; scheduling; large deviations; congestion; buffer overflow probabilities; generalized longest queue first policy; generalized processor sharing policy; multiclass multiplexer; traffic management of high-speed networks
90B18: Communication networks in operations research
90B22: Queues and service in operations research
93E20: Optimal stochastic control
Related Items
Tail Probability of Low-Priority Queue Length in a Discrete-Time Priority BMAP/PH/1 Queue, Geometric tail of queue length of low-priority customers in a nonpreemptive priority MAP/PH/1 queue, Large deviations of queues sharing a randomly time-varying server, Takács' asymptotic theorem and its applications: a survey, Control of end-to-end delay tails in a multiclass network: LWDF discipline optimality, Class-specific quality of service guarantees in multimedia communication networks, Queueing systems with leadtime constraints: a fluid-model approach for admission and sequencing control, Wireless scheduling with partial channel state information: large deviations and optimality, A large deviation principle with queueing applications, The Effective Bandwidth Problem Revisited
