Design and evaluation of real-time communication for FieldBus based manufacturing systems

Shin, Kang G.; Chou, Chih-Che

doi:10.1109/lcn.1992.228153

Cited by 2 publications

(1 citation statement)

References 11 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The channel establishment procedure can be divided into two distinct phases: off-line channel establishment and online packet scheduling. Though various channel establishment schemes have been proposed in literature [15,[31][32][33], very few of them explicitly address the issue of selecting a route from the source to the destination of a channel and satisfy end-to-end guarantees. This paper contends that latency of packets travelling through a point-to-point link can be made more predictable using message scheduling and network flow control.…”

Section: Past and Related Effortsmentioning

confidence: 99%

On utility accrual real-time channel establishment in multi-hop networks

Channakeshava

Ravindran

Seventh IEEE International Symposium onObject-Oriented Real-Time Distributed Computing, 2004. Proceedings.

View full text Add to dashboard Cite

Real-time channels are established between a source and a destination to guarantee intime delivery of real-time messages in multi-hop networks. In this thesis, we propose two schemes to establish real-time channels for soft real-time applications whose timeliness properties are characterized using Jensen's Time Utility Functions (TUFs) that are nonincreasing. The two algorithms are (1) Localized Decision for Utility accrual Channel Establishment (LocDUCE) and (2) Global Decision for Utility accrual Channel Establishment (GloDUCE). Since finding a feasible path optimizing multiple constraints is an NP-Complete problem, these schemes heuristically attempt to maximize the system-wide accrued utility. The channel establishment algorithms assume the existence of a utilityaware packet scheduling algorithm at the interfaces. The route selection is based on delay estimation performed at the source, destination, and all routers in the path, from source to destination.We simulate the algorithms, measure and compare their performance with open shortest path first (OSPF). Our simulation experiments show that for most of the cases considered LocDUCE and GloDUCE perform better than OSPF. We also implement the schemes in a proof-of-concept style routing module and measure the performance of the schemes and compare them to OSPF. Our experiments on the implementation follow the same trend as the simulation study and show that LocDUCE and GloDUCE have a distinct advantage over OSPF and accrue higher system-wide utility. These schemes also react better to variation in the loading of the links. Among the two proposed approaches, we observe that GloDUCE performs better than LocDUCE under conditions of increased downstream link loads.

show abstract

Section: Past and Related Effortsmentioning

confidence: 99%