Allocating Bandwidth for Bursty Connections

DOI10.1137/S0097539797329142zbMATH Open0979.05098OpenAlexW2044081853MaRDI QIDQ4507345FDOQ4507345

Authors: Yuval Rabani, Éva Tardos, Jon M. Kleinberg 

Publication date: 18 October 2000

Published in: SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/s0097539797329142

Recommendations

• scientific article; zbMATH DE number 1559582
• On-line routing of virtual circuits with applications to load balancing and machine scheduling
• Bandwidth packing
• Resource Allocation in Bounded Degree Trees
• scientific article; zbMATH DE number 932427

zbMATH Keywords

combinatorial optimizationapproximation algorithmsstochastic knapsackstatistical multiplexingeffective bandwidthstochastic load balancingstochastic bin-packing

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10)

Cited In (38)

• Stochastic models for budget optimization in search-based advertising
• The multi-Handler knapsack problem under uncertainty
• Lifting of probabilistic cover inequalities
• Stochastic makespan minimization in structured set systems (extended abstract)
• Maximum box problem on stochastic points
• An improved mechanism for selfish bin packing
• The structure and complexity of Nash equilibria for a selfish routing game
• Stochastic load balancing on unrelated machines
• Title not available (Why is that?)
• Worst-Case Expected Shortfall with Univariate and Bivariate Marginals
• Stochastic makespan minimization in structured set systems
• Range-max queries on uncertain data
• Bandwidth packing
• Approximation algorithms for stochastic combinatorial optimization problems
• Robust optimization approach for a chance-constrained binary knapsack problem
• Adaptive Bin Packing with Overflow
• Extremal probability bounds in combinatorial optimization
• A column and constraint generation algorithm for the dynamic knapsack problem with stochastic item sizes
• The static stochastic knapsack problem with normally distributed item sizes
• An introduction to stochastic bin packing-based server consolidation with conflicts
• Robustness to dependency in portfolio optimization using overlapping marginals
• Approximation algorithms for multiprocessor scheduling under uncertainty
• Static and dynamic evaluation of QoS properties
• Configuration balancing for stochastic requests
• Title not available (Why is that?)
• Lexicographically optimal smoothing for broadband traffic multiplexing
• Mathematical models and approximate solution approaches for the stochastic bin packing problem
• Column generation strategies and decomposition approaches for the two-stage stochastic multiple knapsack problem
• Hedging uncertainty: approximation algorithms for stochastic optimization problems
• Computation of Exact Bootstrap Confidence Intervals: Complexity and Deterministic Algorithms
• Robust optimization-based heuristic algorithm for the chance-constrained knapsack problem using submodularity
• Chance-Constrained Multiple Bin Packing Problem with an Application to Operating Room Planning
• Improvements and generalizations of stochastic knapsack and Markovian bandits approximation algorithms
• Tight bounds for bandwidth allocation on two links
• Semi-infinite relaxations for the dynamic knapsack problem with stochastic item sizes
• Relaxation analysis for the dynamic knapsack problem with stochastic item sizes
• Maximizing expected utility for stochastic combinatorial optimization problems
• Title not available (Why is that?)

This page was built for publication: Allocating Bandwidth for Bursty Connections

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4507345)