Details

Autor(en) / Beteiligte

• Manderscheid, M.
• Langer, F.
• Eilers, D.

Titel

A formal approach enabling the computation of network state permutations using binary relations

Ist Teil von

• Proceedings of 2011 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing, 2011, p.736-741

Ort / Verlag

IEEE

Erscheinungsjahr

2011

Link zum Volltext

• IEEE_Xplore

Quelle

IEEE Xplore

Beschreibungen/Notizen

• The automotive industry is currently searching for new networking technologies to meet their requirement of high bandwidth demand at low chip cost. Profiting from the research on Quality of Service and high pervasiveness in the consumer market the way to an Ethernet/IP based car in-vehicle network might not be far. Unfortunately, the research community focused on scenarios not applicable for automotive embedded networks. This paper presents a basic toolset for a novel Quality of Service assuring process for IP/Ethernet based in-vehicle car networks which is believed to meet the requirements of the automotive industry. This toolset is designed to be the basis for a development process enabling an automotive in-vehicle network to react in an adaptive way on different situations distinguishing between different network states and thus making effective use of the network resources. We formulate all formal assumptions necessary to compute different network states. Based on these assumptions we further present an algorithm enabling the computation of all possible network states.