Tight bounds for bandwidth allocation on two links

DOI10.1016/J.DAM.2005.02.002MaRDI QIDQ2486751zbMATH OpenOpenAlexFDO

Authors Leah Epstein

Publication date 17 August 2005

Published in Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.dam.2005.02.002

zbMATH Keywords

SchedulingOn-line algorithmsBandwidth allocationRelated machines

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Graph theory (including graph drawing) in computer science (68R10) Deterministic network models in operations research (90B10) Deterministic scheduling theory in operations research (90B35) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10)

Recommendations

• Combining fairness with throughput: online routing with multiple objectives
• Combining fairness with throughput: Online routing with multiple objectives
• Allocating Bandwidth for Bursty Connections
• On-line routing of virtual circuits with applications to load balancing and machine scheduling
• scientific article; zbMATH DE number 1263238

Cites work

• A polynomial-time approximation scheme for maximizing the minimum machine completion time
• On-line machine covering
• Scheduling to Maximize the Minimum Processor Finish Time in a Multiprocessor System
• The exact LPT-bound for maximizing the minimum completion time

Cited in

(18)

• Inefficiency of equilibria for the machine covering game on uniform machines
• A note on hierarchical scheduling on two uniform machines
• Semi-online machine covering for two uniform machines
• Online bounded analysis
• Bandwidth allocation algorithms for weighted maximum rate constrained link sharing policy
• Semi-online machine covering on two uniform machines with known total size
• scientific article; zbMATH DE number 1778090 (Why is no real title available?)
• Online-bounded analysis
• Online scheduling with rejection and reordering: exact algorithms for unit size jobs
• Online scheduling with rejection and withdrawal
• Machine covering with combined partial information
• On-line machine covering on two machines with local migration
• A better semi-online algorithm for \(\mathrm Q3/s_{1} = s_{2}\leq s_{3}/C_{\mathrm{min}}\) with the known largest size
• The hierarchical model for load balancing on two machines
• Semi-online scheduling: a survey
• Two models of two-dimensional bandwidth problems
• Semi-online scheduling with ``end of sequence information
• Parallel machine covering with limited number of preemptions

This page was built for publication: Tight bounds for bandwidth allocation on two links

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