Bandwidth packing
From MaRDI portal
Publication:1840503
zbMATH Open0967.68167MaRDI QIDQ1840503FDOQ1840503
Authors: E. G. jun. Coffman, Alexander L. Stolyar 
Publication date: 11 February 2001
Published in: Algorithmica (Search for Journal in Brave)
Recommendations
Queues and service in operations research (90B22) Queueing theory (aspects of probability theory) (60K25) Nonnumerical algorithms (68W05)
Cited In (18)
- Study of the maximal throughput of multiclass queueing systems
- Allocating Bandwidth for Bursty Connections
- Instability in stochastic and fluid queueing networks
- Interior-point-based online stochastic bin packing
- Stability conditions for a discrete-time decentralised medium access algorithm
- Study of the queueing model of storage and transmission bandwidth allocation
- A service system with packing constraints: greedy randomized algorithm achieving sublinear in scale optimality gap
- Online bandwidth packing with symmetric distribution
- Fast approximation methods for online scheduling of outpatient procedure centers
- Stability conditions for a decentralised medium access algorithm: single- and multi-hop networks
- An infinite server system with general packing constraints
- ON THE STABILITY OF A BANDWIDTH PACKING ALGORITHM
- Allocation schemes of resources with downgrading
- COMPUTING CALL ADMISSION CAPACITIES IN LINEAR NETWORKS
- Maximum Bandwidth Under Edge Addition
- Bin Packing with Queues
- Packet Bundling
- Title not available (Why is that?)
This page was built for publication: Bandwidth packing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1840503)
