Abstract
This paper examines general transmission networks, of which I/O subsystems are a special case. By using the maximum entropy principle, we answer questions such as what is the probability that a path to a given node is free when that node is ready to transmit. Systems with both dynamic and fixed path selection mechanisms are treated. Approximate methods for large networks are proposed, and numerical examples are given.
- AHO74 A. V. Aho, J. E. Hopcroft, and J. D. Ullman, 'The Design and Analysis of Computer Algorithms', Addison-Wesley, Reading, Mass (1974). Google ScholarDigital Library
- AGMO79 N. Agmon, Y. Alhassid, and R. D. Levine, An algorithm for determining the Lagrange parameters in the maximum entropy formalism, in R. D. Levine and M. Tribus, Eds., 'The Maximum Entropy Formalism', MIT Press, Cambridge, Mass (1979).Google Scholar
- BARD80a Y. Bard, A Model of shared DASD and multipathing, Comm. ACM 23, 564--572 (1980). Google ScholarDigital Library
- BARD80b Y. Bard, Estimation of state probabilities using the maximum entropy principle, IBM J. Res. Develop. 24, 563--569 (1980).Google ScholarDigital Library
- BARD81 Y. Bard, A simple approach to system modeling, Performance Evaluation 1, 225--248 (1981).Google ScholarCross Ref
- JAYN79 E. T. Jaynes, Where do we stand on maximum entropy?, in R. D. Levine and M. Tribus, Eds., 'The Maximum Entropy Formalism', MIT Press, Cambridge, Mass (1979).Google Scholar
Recommendations
Maximizing Transmission Opportunities in Wireless Multihop Networks
Being readily available in most of 802.11 radios, multirate capability appears to be useful as WiFi networks are getting more prevalent and crowded. More specifically, it would be helpful in high-density scenarios because internode distance is short ...
Modeling I/O systems with dynamic path selection, and general transmission networks
SIGMETRICS '82: Proceedings of the 1982 ACM SIGMETRICS conference on Measurement and modeling of computer systemsThis paper examines general transmission networks, of which I/O subsystems are a special case. By using the maximum entropy principle, we answer questions such as what is the probability that a path to a given node is free when that node is ready to ...
Comments