A randomized online algorithm for bandwidth utilization

DOI10.1023/B:JOSH.0000019680.51396.32MaRDI QIDQ2464418zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Bo Brinkman, Sanjeev Arora

Publication date 20 December 2007

Published in Journal of Scheduling (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1023/b:josh.0000019680.51396.32

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Recommendations

• scientific article; zbMATH DE number 2119708
• Combining fairness with throughput: online routing with multiple objectives
• Combining fairness with throughput: Online routing with multiple objectives
• scientific article; zbMATH DE number 1263238
• TCP is competitive with resource augmentation

Cited in

(2)

• scientific article; zbMATH DE number 2119708 (Why is no real title available?)
• The online graph bandwidth problem

This page was built for publication: A randomized online algorithm for bandwidth utilization

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