Controllability of computer performance tradeoffs obtained using controlled-share queue schedulers
IEEE Transactions on Software Engineering
Analysis of polling systems
Empirical model-building and response surface
Empirical model-building and response surface
Nonstationary models of learning automata routing in data communication networks
IEEE Transactions on Systems, Man and Cybernetics
Parallel and distributed computation: numerical methods
Parallel and distributed computation: numerical methods
Waiting Lines and Times in a System with Polling
Journal of the ACM (JACM)
Learning Algorithms Theory and Applications
Learning Algorithms Theory and Applications
Backbone Networks Using Rotation Counters
IEEE Transactions on Parallel and Distributed Systems
Building Survivable Services Using Redundancy and Adaptation
IEEE Transactions on Computers
A distributed adaptive protocol providing real-time services on WDM-based LANs
INFOCOM'96 Proceedings of the Fifteenth annual joint conference of the IEEE computer and communications societies conference on The conference on computer communications - Volume 3
| Hi-index | 14.98 |
A distributed and adaptive token-passing algorithm that can be used to maintain the values of a designated performance parameter (e.g. mean waiting time) at the hosts of a token-ring network at a prescribed ratio is presented. The algorithm is simple to implement. The authors demonstrate its application in keeping the mean waiting times at the various hosts in a prespecified ratio, in maintaining a designated throughput differential between different classes of customer, and in integrating voice and two classes of data on a token ring.