Efficient and fair routing for mesh networks
From MaRDI portal
Publication:2638366
Recommendations
Cites work
- scientific article; zbMATH DE number 4215340 (Why is no real title available?)
- scientific article; zbMATH DE number 1232130 (Why is no real title available?)
- scientific article; zbMATH DE number 2119661 (Why is no real title available?)
- A Theory of Exit in Duopoly
- Algorithmic Game Theory
- Efficient and fair routing for mesh networks
- Emergency Connectivity in Ad-Hoc Networks with Selfish Nodes
- Fast, Fair, and Efficient Flows in Networks
- Multicriteria optimization
- System-Optimal Routing of Traffic Flows with User Constraints in Networks with Congestion
Cited in
(7)- Threshold accepting heuristic for fair flow optimization in wireless mesh networks
- The vertex coloring problem and its generalizations
- On the efficiency of equilibria in mean-field oscillator games
- Efficient load-balancing routing for wireless mesh networks
- Efficient and fair routing for mesh networks
- Robust algorithms for packet routing in a mesh
- Routing algorithms in honeycomb meshes
This page was built for publication: Efficient and fair routing for mesh networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2638366)