Improved approximation algorithms for shop scheduling problems
SODA '91 Proceedings of the second annual ACM-SIAM symposium on Discrete algorithms
Universal O(congestion + dilation + log1+&egr;N) local control packet switching algorithms
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Journal of the ACM (JACM)
The price of anarchy of finite congestion games
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Multicommodity flows over time: Efficient algorithms and complexity
Theoretical Computer Science
STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science
Coordination mechanisms for selfish scheduling
WINE'05 Proceedings of the First international conference on Internet and Network Economics
| Hi-index | 0.00 |
We consider the packet routing problem in store-and-forward networks whose topologies are either paths, trees, or rings. We are interested by the quality of the solution produced, with respect to a global optimal solution, if each link uses a (fixed) local policy to schedule the packets which go through it. The quality of the derived solutions is measured using the worst case analysis for two global optimality criteria, namely the maximum arrival date of a packet at its destination (or makespan) and the average arrival date of the packets at their destinations.We consider the setting where n packets, each one having a size (or length) and a destination, are released from the same source. In the case of rings, there exist two paths between the source and a destination. Each packet is owned by a user which chooses a path to its destination. We assume that users are rational: knowing the local policy used by the links and the state of the network, a user chooses the path which minimizes the arrival date of its packet at its destination. We are then interested by the quality of the Nash equilibria obtained.