Reducing the maximum latency of selfish ring routing via pairwise cooperations

DOI10.1007/978-3-642-17461-2_3zbMATH Open1310.91037OpenAlexW1836969254MaRDI QIDQ3066441FDOQ3066441

Authors: Xiaodong Hu, Weidong Ma, Xujin Chen 

Publication date: 10 January 2011

Published in: Combinatorial Optimization and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-17461-2_3

Recommendations

• Pairwise cooperations in selfish ring routing for minimax linear latency
• Balancing Load via Small Coalitions in Selfish Ring Routing Games
• The price of atomic selfish ring routing
• Stability vs. optimality in selfish ring routing
• The price of selfish routing

zbMATH Keywords

price of anarchyselfish routing

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Games involving graphs (91A43)

Cited In (3)

• Pairwise cooperations in selfish ring routing for minimax linear latency
• The price of atomic selfish ring routing
• On the complexity of greedy routing in ring-based peer-to-peer networks

This page was built for publication: Reducing the maximum latency of selfish ring routing via pairwise cooperations

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