2011 Proceedings IEEE INFOCOM 2011
DOI: 10.1109/infcom.2011.5935170
|View full text |Cite
|
Sign up to set email alerts
|

A real-time multicast routing scheme for multi-hop switched fieldbuses

Abstract: Abstract-The rapid scaling up of Networked Control Systems (NCS) is forcing traditional single-hop shared medium industrial fieldbuses (a.k.a. fieldbuses) to evolve toward multi-hop switched fieldbuses. Such evolution faces many challenges. The first is the re-design of switch architecture. To meet the real-time nature of NCS traffic, and to lay a smooth evolution path for switch manufacturers, it is widely agreed that a (if not the) promising switch architecture is an input queueing crossbar architecture runn… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
6
0

Year Published

2011
2011
2020
2020

Publication Types

Select...
3
3

Relationship

1
5

Authors

Journals

citations
Cited by 6 publications
(6 citation statements)
references
References 24 publications
0
6
0
Order By: Relevance
“…Later in this section, we will show due to insufficient flow isolation, this approach makes the analysis of each flow's [8], note C 2 and C 3 may be fetched/outputted in different cell-times, but this does not matter). schedulability (i.e., how much resources must be allocated to guarantee the existence of an E2E delay bound?)…”
Section: Naive Approach: Per-aggregate Queueingmentioning
confidence: 99%
See 3 more Smart Citations
“…Later in this section, we will show due to insufficient flow isolation, this approach makes the analysis of each flow's [8], note C 2 and C 3 may be fetched/outputted in different cell-times, but this does not matter). schedulability (i.e., how much resources must be allocated to guarantee the existence of an E2E delay bound?)…”
Section: Naive Approach: Per-aggregate Queueingmentioning
confidence: 99%
“…(8). Proof: Please see Appendix C. Note the preconditions in Theorem 2 and 3 define the constraint on all clock drifts between switches: τ max −τ min < τ min /M .…”
Section: Real-time Delay Boundsmentioning
confidence: 99%
See 2 more Smart Citations
“…[14]): in this example, the switch has N = 4 inputs and outputs, frame size is M = 5 slots (note in reality, M is in the order of 10 3 ∼ 10 5 ); each row of the "schedule matrix" is a conflict free schedule for its corresponding output, which means at any time slot (i.e., any column of the "schedule matrix"), no two outputs contend for the same input (for different input queues).…”
Section: Introductionmentioning
confidence: 99%