Queueing analysis of finite buffer token networks

Authors:
A. Ganz;I. Chlamtac
Affiliations:
Univ. of Massachusetts, Amherst, MA;Univ. of Massachusetts, Amherst, MA
Venue:
SIGMETRICS '88 Proceedings of the 1988 ACM SIGMETRICS conference on Measurement and modeling of computer systems
Year:
1988

Citing 5
Cited 2

On the analysis of a symmetric polling system with single-message buffers

Performance Evaluation
Modeling and Analysis of Computer Communications Networks

Modeling and Analysis of Computer Communications Networks
Local Networks: Motivation, Technology and Performance

Local Networks: Motivation, Technology and Performance
Finite Buffer Queueing Model for P-Persistent CSMA/CD Protocol

Performance '87 Proceedings of the 12th IFIP WG 7.3 International Symposium on Computer Performance Modelling, Measurement and Evaluation
Bidirectional token flow system

SIGCOMM '81 Proceedings of the seventh symposium on Data communications

Finite buffers for fast multicast

SIGMETRICS '89 Proceedings of the 1989 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Performance evaluation of a single-stage two-product manufacturing system operating under pull-type control

Computers and Operations Research

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper introduces analytic models for evaluating demand assignment protocols in realistic finite buffer/finite station network configurations. We present a solution for implicit and explicit token passing systems enabling us to model local area networks, such as Token Bus. We provide, for the first time, a tractable approximate solution by using an approach based on restricted occupancy urn models. The presented approximation involves the solving of linear equations whose number is linear and equal only to the number of buffers in the system. It is demonstrated that in addition to its simplicity, the presented approximation is also highly accurate.