CPL - Chalmers Publication Library
| Utbildning | Forskning | Styrkeområden | Om Chalmers | In English In English Ej inloggad.

RedCAN ™ : Simulations of two Fault Recovery Algorithms for CAN

Håkan Sivencrona ; Torbjörn Olsson ; Roger Johansson ; Jan Torin (Institutionen för datorteknik)
10th IEEE Pacific Rim International Symposium on Dependable Computing (PRDC 2004), Papeete, FR POLYNESIA. MAR 03-05, 2004 p. 302-311. (2004)
[Konferensbidrag, refereegranskat]

This paper presents the RedCAN concept to achieve fault tolerance against node and link failures in a CAN-bus system by means of configurable switches. The basic idea in RedCAN is. to isolate faulty nodes or bus segments by configuring switches. that will evade a faulty. node or segment and exclude it from bus access. We propose changes to the original centralized protocol, vulnerable to single point failures, and show that. with a new distributed algorithm considerable more efficiency can be achieved also when network size is growing. The distributed algorithm introduces redundancy and hereby increases robustness of the system. Furthermore the new algorithm has logarithmic complexity, as opposed to the centralized algorithms linear complexity, as the number of nodes increase. The results were gathered through a new simulator, the "RedCAN Simulation Manager", also presented in the paper. Simulations allow assessing the break-even point between centralized and distributed algorithms reconfiguration latencies as well as give ideas for further research.

Denna post skapades 2013-06-19.
CPL Pubid: 178880


Läs direkt!

Länk till annan sajt (kan kräva inloggning)

Institutioner (Chalmers)

Institutionen för datorteknik (2002-2004)


Data- och informationsvetenskap

Chalmers infrastruktur