An Asynchronous, Distributed Flow Control Algorithm for Rate Allocation in Computer Networks
IEEE Transactions on Computers
Rate controls in standard transport layer protocols
ACM SIGCOMM Computer Communication Review
Making greed work in networks: a game-theoretic analysis of switch service disciplines
SIGCOMM '94 Proceedings of the conference on Communications architectures, protocols and applications
Making greed work in networks: a game-theoretic analysis of switch service disciplines
IEEE/ACM Transactions on Networking (TON)
Sharing the cost of muliticast transmissions (preliminary version)
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Protection of Fairness for Multimedia Traffic Streams in a Non-cooperative Wireless LAN Setting
PROMS 2001 Proceedings of the 6th International Conference on Protocols for Multimedia Systems
Hardness results for multicast cost sharing
Theoretical Computer Science
A game-theoretic study of CSMA/CA under a backoff attack
IEEE/ACM Transactions on Networking (TON)
Manufacturing & Service Operations Management
| Hi-index | 14.98 |
The dynamic resource sharing that is a characteristic of store-and-forward computer/communication networks allows efficient use of the communication channel but may result in congestion and unfairness with high utilizations. A flow control algorithm is presented to prevent these effects by fairly allocating input rates to the users of the network. The allocation of rates is posed as an optimization problem where users derive a quantifiable benefit (unknown a priori and depending on network performance) from their use of the network. Total benefits are maximized using information reported by the users in a gradient hill climbing algorithm. The incentive problems that arise are examined, and an incentive-compatible pricing mechanism is introduced that prevents strategic manipulation of the algorithm.