Fairness in routing and load balancing
From MaRDI portal
(Redirected from Publication:5952449)
Fairness in routing and load balancing (scientific article; zbMATH DE number 1688975)
Fairness in routing and load balancing (scientific article; zbMATH DE number 1688975)
Recommendations
- Fair allocation on a network
- Fair and efficient router congestion control
- Fair online load balancing
- Fair Dynamic Routing in Large-Scale Heterogeneous-Server Systems
- scientific article; zbMATH DE number 5370302
- Efficiency and fairness of system-optimal routing with user constraints
- Combining fairness with throughput: Online routing with multiple objectives
Cites work
- College Admissions and the Stability of Marriage
- scientific article; zbMATH DE number 1256723 (Why is no real title available?)
- scientific article; zbMATH DE number 1305396 (Why is no real title available?)
- On the Computational Complexity of Combinatorial Problems
- Optimal flows in networks with multiple sources and sinks
Cited in
(41)- Fair welfare maximization
- Network QoS games: stability vs optimality tradeoff
- An approximation to max min fairness in multi commodity networks
- Simultaneous approximation ratios for parallel machine scheduling problems
- Fair optimization and networks: a survey
- On-line preemptive machine scheduling with \(\ell _p\) norm on two uniform machines
- Max-min fair rate allocation and routing in energy harvesting networks: algorithmic analysis
- Max-min fairness in multi-commodity flows
- Traffic distribution over equal-cost-multi-paths
- Efficient and fair routing for mesh networks
- Fair and efficient allocation with few agent types, few item types, or small value levels
- Approximate majorization and fair online load balancing
- Fairness in academic course timetabling
- A fairness index for communication networks
- Fair Dynamic Routing in Large-Scale Heterogeneous-Server Systems
- Upward max-min fairness
- Combining fairness with throughput: online routing with multiple objectives
- Maximum throughput network routing subject to fair flow allocation
- Balancing Traffic Load Using One-Turn Rectilinear Routing
- Equitable bandwidth allocation in content distribution networks
- Fair online load balancing
- Fair resource allocation for different scenarios of demands
- Simultaneously load balancing for every p-norm, with reassignments
- scientific article; zbMATH DE number 1898349 (Why is no real title available?)
- scientific article; zbMATH DE number 2119661 (Why is no real title available?)
- Simultaneous approximation of multi-criteria submodular function maximization
- Maximizing throughput in minimum rounds in an application-level relay service
- Price-based protocols for fair resource allocation, convergence time analysis and extension to Leontief utilities
- scientific article; zbMATH DE number 7053293 (Why is no real title available?)
- Combining fairness with throughput: Online routing with multiple objectives
- Fairness in maximal covering location problems
- Fair Integral Network Flows
- Why locally-fair maximal flows in client-server networks perform well
- The price of fairness and stability in resource buying games
- The efficiency of fair division
- Stabilization of max-min fair networks without per-flow state
- Transport-independent fairness
- Fair cost-sharing methods for the minimum spanning tree game
- Minimum edge ranking spanning trees of split graphs
- Pricing for fairness: distributed resource allocation for multiple objectives
- A general branch-and-bound algorithm for fair division problems
This page was built for publication: Fairness in routing and load balancing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5952449)
