Asymptotic buffer overflow probabilities in multiclass multiplexers: an optimal control approach

DOI10.1109/9.661587zbMath0949.93078OpenAlexW2168965212MaRDI 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

zbMATH Keywords

optimal controlschedulinglarge deviationscongestionbuffer overflow probabilitiesgeneralized longest queue first policygeneralized processor sharing policymulticlass multiplexertraffic management of high-speed networks

Mathematics Subject Classification ID

Communication networks in operations research (90B18) Queues and service in operations research (90B22) Optimal stochastic control (93E20)

Related Items

Subdiffusive Load Balancing in Time-Varying Queueing Systems ⋮ Control of end-to-end delay tails in a multiclass network: LWDF discipline optimality ⋮ Geometric tail of queue length of low-priority customers in a nonpreemptive priority MAP/PH/1 queue ⋮ The Effective Bandwidth Problem Revisited ⋮ Large deviations of queues sharing a randomly time-varying server ⋮ Takács' asymptotic theorem and its applications: a survey ⋮ 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 ⋮ Tail Probability of Low-Priority Queue Length in a Discrete-Time Priority BMAP/PH/1 Queue ⋮ Class-specific quality of service guarantees in multimedia communication networks ⋮ A large deviation principle with queueing applications

This page was built for publication: Asymptotic buffer overflow probabilities in multiclass multiplexers: an optimal control approach