Efficient and fair routing for mesh networks

DOI10.1007/S10107-010-0356-8zbMATH Open1200.90041OpenAlexW2165892151MaRDI QIDQ2638366FDOQ2638366

N. E. Stier-Moses, Andrea Lodi, Enrico Malaguti

Publication date: 16 September 2010

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10107-010-0356-8

Recommendations

• scientific article; zbMATH DE number 2119661
• Max-min fair rate allocation and routing in energy harvesting networks: algorithmic analysis
• Fairness in routing and load balancing
• Approximation and Online Algorithms
• Threshold accepting heuristic for fair flow optimization in wireless mesh networks

zbMATH Keywords

fairnesswireless networkleast-energy routing protocol

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Communication networks in operations research (90B18) Network design and communication in computer systems (68M10)

Cites Work

• Algorithmic Game Theory
• Multicriteria optimization
• Title not available (Why is that?)
• Title not available (Why is that?)
• A Theory of Exit in Duopoly
• System-Optimal Routing of Traffic Flows with User Constraints in Networks with Congestion
• Title not available (Why is that?)
• Fast, Fair, and Efficient Flows in Networks
• Efficient and fair routing for mesh networks
• Emergency Connectivity in Ad-Hoc Networks with Selfish Nodes

Cited In (6)

• 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)