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

Schemes for scheduling control messages by hierarchical protocols

โœ Scribed by E Bortnikov; R Cohen


Publisher
Elsevier Science
Year
2001
Tongue
English
Weight
339 KB
Volume
24
Category
Article
ISSN
0140-3664

No coin nor oath required. For personal study only.

โœฆ Synopsis


The paper addresses the problem of designing efยฎcient scheduling policies for the transmission of control messages by hierarchical network protocols. Such protocols encounter a tradeoff between the desire to forward a control message across the tree as soon as it is received, and the desire to reduce control trafยฎc. Scheduling problems that arise in this context are deยฎned and discussed. The paper mainly concentrates on minimizing the average extra delay encountered by the control messages under an upper bound on the number of outgoing messages a node can send during a ยฎxed period of time. A polynomial-time algorithm is presented for the off-line version of the problem, and then several efยฎcient on-line heuristics are presented and compared.


๐Ÿ“œ SIMILAR VOLUMES


97/03051 Hierarchical control scheme for
๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› Elsevier Science โš– 202 KB

The IEA (International Energy Agency) model was improved by introducing over-bed feeding and improving the distribution of volatile matter throughout the comhustor. This formed the modelling of fluidized-bed combustion of Yugoslavian coals. Nearly 50 test runs were used that were conducted over the

A comment on the Chen-Chung scheme for h
โœ Sheng Zhong; Tianwen Lin ๐Ÿ“‚ Article ๐Ÿ“… 2003 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 102 KB

## Chen and Chung proposed an improved scheme of hierarchical access control based on the Chinese Remainder theorem and symmetric encryption [1]. In this paper, we point out that the part of their scheme for adding a new class is not correct. Furthermore, we discuss how to fix this problem.