On-line routing of virtual circuits with applications to load balancing and machine scheduling
From MaRDI portal
Publication:4376979
DOI10.1145/258128.258201zbMATH Open0890.68014OpenAlexW2156867662MaRDI QIDQ4376979FDOQ4376979
Authors: James Aspnes, Orli Waarts, Yossi Azar, Amos Fiat, Serge Plotkin 
Publication date: 17 February 1998
Published in: Journal of the ACM (Search for Journal in Brave)
Full work available at URL: http://www.acm.org/pubs/contents/journals/jacm/1997-44/
Recommendations
Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Network design and communication in computer systems (68M10)
Cited In (97)
- Deterministic monotone algorithms for scheduling on related machines
- Competitive and deterministic embeddings of virtual networks
- On-line resource management with applications to routing and scheduling
- Fair online load balancing
- Lower bounds for online makespan minimization on a small number of related machines
- Smoothed performance guarantees for local search
- How to allocate goods in an online market?
- On designing truthful mechanisms for online scheduling
- Priority algorithms for the subset-sum problem
- Online unit clustering: Variations on a theme
- Decentralized utilitarian mechanisms for scheduling games
- Online scheduling of jobs with favorite machines
- Competitive routing of virtual circuits with unknown duration
- Improved price of anarchy for machine scheduling games with coordination mechanisms
- A preemptive algorithm for maximizing disjoint paths on trees
- Combining fairness with throughput: Online routing with multiple objectives
- Optimal coordination mechanisms for unrelated machine scheduling
- Allocating Bandwidth for Bursty Connections
- Online scheduling with general machine cost functions
- Fast approximation of minimum multicast congestion – Implementation VERSUS Theory
- A two-phase algorithm for bin stretching with stretching factor 1.5
- A survey on makespan minimization in semi-online environments
- Online bin stretching with three bins
- Worst-case Nash equilibria in restricted routing
- Efficient coordination mechanisms for unrelated machine scheduling
- New algorithms for related machines with temporary jobs.
- Tight bounds for online vector scheduling
- Coordination mechanisms with hybrid local policies
- Strategic scheduling games: equilibria and efficiency
- Scheduling of online compute-intensive synchronized jobs on high performance virtual clusters
- On-line resource management with application to routing and scheduling
- A lower bound for on-line scheduling on uniformly related machines
- A lower bound on deterministic online algorithms for scheduling on related machines without preemption
- Approximation and online algorithms for multidimensional bin packing: a survey
- Better Algorithms for Online Bin Stretching
- On-line service scheduling
- Worst-case analysis for on-line service policies
- Coordination mechanisms for selfish scheduling
- Online algorithms for scheduling with machine activation cost on two uniform machines
- Preemptive scheduling on a small number of hierarchical machines
- The hierarchical model for load balancing on two machines
- Optimal oblivious routing in polynomial time
- Robust algorithms for preemptive scheduling
- Parallel load balancing on constrained client-server topologies
- Distributed admission control, scheduling, and routing with stale information
- Multicast Routing and Design of Sparse Connectors
- Randomized on-line scheduling on two uniform machines
- Online and semi-online hierarchical scheduling for load balancing on uniform machines
- Randomized algorithms for online bounded bidding
- Price of anarchy in parallel processing
- Coordination mechanisms for parallel machine scheduling
- Optimal and online preemptive scheduling on uniformly related machines
- Scheduling MapReduce jobs on identical and unrelated processors
- Online scheduling of moldable parallel tasks
- Performance guarantees for scheduling algorithms under perturbed machine speeds
- Online scheduling with rejection and withdrawal
- Distributed and on-line routing on tori
- Optimal on-line algorithms to minimize makespan on two machines with resource augmentation
- Approximating the optimal algorithm for online scheduling problems via dynamic programming
- A coordination mechanism for a scheduling game with parallel-batching machines
- Non-clairvoyant scheduling games
- Performance of service policies in a specialized service system with parallel servers
- Tight bounds for bandwidth allocation on two links
- Online scheduling of mixed CPU-GPU jobs
- Parallel solutions for preemptive makespan scheduling on two identical machines
- Variable sized online interval coloring with bandwidth
- On-line load balancing of temporary tasks revisited
- R2: boosting liquidity in payment channel networks with online admission control
- Approximate strong equilibria in job scheduling games with two uniformly related machines
- Weighted packet selection for rechargeable links in cryptocurrency networks: complexity and approximation
- A nonmonotone analysis with the primal-dual approach: online routing of virtual circuits with unknown durations
- Balanced routing of random calls
- Hallucination helps: energy efficient virtual circuit routing
- Well-behaved online load balancing against strategic jobs
- Online Makespan Scheduling with Job Migration on Uniform Machines
- Minimizing maximum flow time on related machines via dynamic posted pricing
- Inefficiency of Nash equilibria with parallel processing policy
- An \(O(\log n)\)-competitive posted-price algorithm for online matching on the line
- A coordination mechanism for a scheduling game with uniform-batching machines
- Title not available (Why is that?)
- A poly-log competitive posted-price algorithm for online metrical matching on a spider
- Exponential penalty function control of loss networks
- A Preemptive Algorithm for Maximizing Disjoint Paths on Trees
- The shortest first coordination mechanism for a scheduling game with parallel-batching machines
- Online load balancing with general reassignment cost
- Weighted packet selection for rechargeable links in cryptocurrency networks: complexity and approximation
- Greedy is optimal for online restricted assignment and smart grid scheduling for unit size jobs
- Configuration balancing for stochastic requests
- iGreen: green scheduling for peak demand minimization
- Online makespan scheduling with job migration on uniform machines
- Online unrelated-machine load balancing and generalized flow with recourse
- A nonmonotone analysis with the primal-dual approach: online routing of virtual circuits with unknown durations
- Rejecting jobs to minimize load and maximum flow-time
- Online Scheduling on a CPU-GPU Cluster
- On-line path computation and function placement in SDNs
- Minimum congestion mapping in a cloud
- Combining fairness with throughput: online routing with multiple objectives
This page was built for publication: On-line routing of virtual circuits with applications to load balancing and machine scheduling
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4376979)
