The use of service limits for efficient operation of multistation single-medium communication systems

Sem C. Borst · Onno Boxma · Hanoch Levy C

27 citations0/0 files storedIEEE/ACM Transactions on Networking

No readable copy stored yet — this record is metadata only.

No open-access location is known for this record yet.

Literature note Cite in a project Citation map

Advanced Queuing Theory Analysis Network Traffic and Congestion Control Wireless Networks and Protocols

Abstract

Time limits are the major mechanisms used for controlling a large variety of multistation single-medium computer-communication systems like the FDDI network and the IEEE 802.4 Token Bus. The proper use of these mechanisms is still not understood and rules for efficient system operation are not available. The authors' objective is the derivation of such rules. They use a cyclic polling model with different service limits (k-limited service) at the different queues, thus emulating time limits. They are interested in determining these k-limit values so as to minimize the mean waiting cost of messages in the system. A simple approximative approach is proposed for two major problems: one in which a limit is set on the token rotation time and one in which no limits are imposed. The approach is tested for a variety of cases and is shown to be very effective.>

Paper brief

Loading…

Cite this work

Citation unavailable for this work.

BibTeX RIS CSL-JSON

No public copy is stored for this record, so only the metadata is cited.

Citations in this library

Citation map →

Stored only when both papers are in the corpus — 27 citations exist upstream.

References

1987Pseudo-conservation laws in cyclic-service systems 1989Workloads and waiting times in single-server systems with multiple customer classes 1994Monotonicity and stability of periodic polling models 1984Performance Evaluation of Cyclic Service Strategies - A Survey 1990Dominance relations in polling systems 1979Two Queues with Alternating Service 1987Waiting-time approximations for cyclic-service systems with switchover times 1988Analysis of cyclic service systems with limited service: Bounds and approximations

Cited by

1999Distribution of the delay in polling systems in heavy traffic 2008Ordinal Optimization of G/G/1/K Polling Systems with k-Limited Service Discipline 1997Polling systems in heavy traffic: Exhaustiveness of service policies 2009Queueing models for appointment-driven systems 1997An exact analysis of an asymmetric polling system with mixed service discipline and general service order 2014

Explore the map →

Papers that cite the same references — the relational fallback while embeddings are still backfilling.

Imported from OpenAlex (CC0) — nothing here is generated.