1993 CompEuro Proceedings Computers in Design, Manufacturing, and Production
DOI: 10.1109/cmpeur.1993.289840
|View full text |Cite
|
Sign up to set email alerts
|

Priority polling and dynamic time-window mechanisms in a multicycle Fieldbus

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Publication Types

Select...
5
1

Relationship

0
6

Authors

Journals

citations
Cited by 13 publications
(2 citation statements)
references
References 4 publications
0
2
0
Order By: Relevance
“…The network ensures that the variable is transferred from the producer to all consumers . This is done by th e master which polls each variable periodically [7,8] . A polling sequence is shown in Fig .…”
Section: Basic Assumptions About the Networ Kmentioning
confidence: 99%
“…The network ensures that the variable is transferred from the producer to all consumers . This is done by th e master which polls each variable periodically [7,8] . A polling sequence is shown in Fig .…”
Section: Basic Assumptions About the Networ Kmentioning
confidence: 99%
“…For example, Nilsson [1] supposed the network delay to meet the characteristics of the finite state Markov chain, under the condition where the network delay is less than the sampling period, and applied the stochastic control theory to the problem of stability and optimization design of NCSs. Raja [2] proposed the bandwidth allocation scheme based on priority cycle service and dynamic time windows to improve utilization of network bandwidth, without consideration of control system QoP. Walsh [3] presented the MEF-TOD algorithm, an algorithm of dynamic network resource allocation for the time-critical information, which enables the node of maximal weighing error to transmit in prior order; however, it has no consideration of control system QoP too.…”
Section: Introductionmentioning
confidence: 99%