The impact of local policies on the quality of packet routing in paths, trees, and rings

DOI10.1007/s10951-008-0069-5zbMath1168.90416OpenAlexW2062114170MaRDI QIDQ835620

Fanny Pascual, Eric Angel, Evripidis Bampis

Publication date: 28 August 2009

Published in: Journal of Scheduling (Search for Journal in Brave)

Full work available at URL: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.163.6680

zbMATH Keywords

price of anarchyscheduling policiespacket routingapproximation with performance guarantee

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Coordination mechanisms for selfish scheduling
• Packet routing and job-shop scheduling in \(O\) (congestion + dilation) steps
• Fast algorithms for finding \(O\)(Congestion+Dilation) packet routing schedules
• Multicommodity flows over time: Efficient algorithms and complexity
• A class of games possessing pure-strategy Nash equilibria
• How bad is selfish routing?
• The price of anarchy of finite congestion games
• A packet routing protocol for arbitrary networks
• Automata, Languages and Programming
• Bounds on Multiprocessing Timing Anomalies

This page was built for publication: The impact of local policies on the quality of packet routing in paths, trees, and rings