Modeling I/O systems with dynamic path selection, and general transmission networks

Authors:
Yonathan Bard
Affiliations:
IBM Cambridge Scientific Center, Cambridge, MA
Venue:
SIGMETRICS '82 Proceedings of the 1982 ACM SIGMETRICS conference on Measurement and modeling of computer systems
Year:
1982

Citing 2
Cited 3

A model of shared DASD and multipathing

Communications of the ACM
The Design and Analysis of Computer Algorithms

The Design and Analysis of Computer Algorithms

A unified operational treatment of RPS reconnect delays

SIGMETRICS '87 Proceedings of the 1987 ACM SIGMETRICS conference on Measurement and modeling of computer systems
Nonexponential networks of queues: a maximum entropy analysis

SIGMETRICS '85 Proceedings of the 1985 ACM SIGMETRICS conference on Measurement and modeling of computer systems
A study of dynamic reconnection

SIGMETRICS '83 Proceedings of the 1983 ACM SIGMETRICS conference on Measurement and modeling of computer systems

Quantified Score

Hi-index	0.00

Visualization

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.