๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Overload control in finite-buffer multiclass message systems

โœ Scribed by Oliver C. Ibe; Julian Keilson

Book ID
105465409
Publisher
Springer US
Year
1993
Tongue
English
Weight
685 KB
Volume
2
Category
Article
ISSN
1018-4864

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Optimal overload control of systems with
Optimal overload control of systems with access buffers โ€” a difficult problem
โœ Tobias Rydรฉn ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 118 KB

Overload control of for example a telephone switch is often implemented using an access buffer, which is a buffer where new calls are stored before they are given service by the switch. In this paper various approaches to how one could find good load control policies for such systems are discussed,

Dynamic scheduling in single-server mult
Dynamic scheduling in single-server multiclass service systems with unit buffers
โœ Sid Browne; Uri Yechiali ๐Ÿ“‚ Article ๐Ÿ“… 1991 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 621 KB

The problem of optimal dynamic sequencing for a single-server multiclass service system with only unit storage (buffer) space at each queue is considered. The model is applicable to many computer operating and telecommunicating systems (e.g., polling systems). Index policies to minimize costs for th

Finite-State Self-Stabilizing Protocols
Finite-State Self-Stabilizing Protocols in Message-Passing Systems
โœ Rodney R. Howell; Mikhail Nesterenko; Masaaki Mizuno ๐Ÿ“‚ Article ๐Ÿ“… 2002 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 285 KB

We define a finite-state message-passing model using guarded commands. This model is particularly appropriate for defining and reasoning about selfstabilizing protocols, due to the well-known result that self-stabilizing protocols on unbounded-channel models must have infinitely many legitimate stat