Exact Results for Nonsymmetric Token Ring Systems
- 1 March 1985
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Communications
- Vol. 33 (3), 223-231
- https://doi.org/10.1109/tcom.1985.1096285
Abstract
This paper derives exact results for a token ring system with exhaustive or gated service. There areNnodes on the ring and control is passed sequentially from one to the next. Messages with random lengths arrive at each node and are placed on the ring when the control arrives at that node. Exhaustive service means that the queue at a node is empty before the token is released and gated means that only those messages in the queue at the arrival of the token are served at that cycle. Generating function recursions for the terminal service time (the total sojourn time of a token at a node) and, from this, joint cycle and intervisit times are derived. Using known results relating the marginal generating functions of the waiting time and the cycle and intervisit time, it is shown that theNmean waiting times at the nodes require the solution ofN(N - 1)and N2equations for the exhaustive and gated cases, respectively. The arrival processes are assumed to be Poisson with different rates and the service processes are general and different at each node. In addition the token overhead is allowed to have an arbitrary but independent distribution at each node. Explicit, simply programmed equations are given. It is shown, arguing from the form of the equations, that there is a conservation law in effect in this system. If the nodal mean waiting times are weighted by the relative intensity, defined here as the intensity weighted mean, then the sum takes on a particularly simple form and is independent of the placement of the nodes on the ring. When the service means at each node are equal, this quantity is just the system mean waiting time.This publication has 11 references indexed in Scilit:
- Message Delay Analysis for Polling and Token Multiple-Access Schemes for Local Communication NetworksIEEE Journal on Selected Areas in Communications, 1983
- Local-Area Subnetworks: A Performance ComparisonIEEE Transactions on Communications, 1981
- Survey of computer communications loop networks: Part 1Computer Communications, 1979
- A Simplified Analysis of Scan Times in an Asymmetrical Newhall Loop with Exhaustive ServiceIEEE Transactions on Communications, 1977
- Waiting Lines and Times in a System with PollingJournal of the ACM, 1974
- A Study of Data Multiplexing Techniques and Delay PerformanceBell System Technical Journal, 1972
- Queues with Periodic Service and Changeover TimeOperations Research, 1972
- Polling in a multidrop communication systemPublished by Association for Computing Machinery (ACM) ,1971
- A Note on Some Fundamental Parameters of Multiqueue Systems [Letter to the Editor]IBM Journal of Research and Development, 1962
- An Approximate Method for Treating a Class of Multiqueue ProblemsIBM Journal of Research and Development, 1961