Hier finden Sie wissenschaftliche Publikationen aus den Fraunhofer-Instituten.

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

: Manderscheid, Martin; Langer, Falk; Eilers, Dirk

Preprint urn:nbn:de:0011-n-1834424 (127 KByte PDF)
MD5 Fingerprint: 700a2d7b7d6f2096359c72c36137e588
© 2011 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.
Erstellt am: 30.11.2011

Institute of Electrical and Electronics Engineers -IEEE-; University of Victoria, Department Electrical & Computer Engineering:
IEEE Pacific Rim Conference on Communications, Computers and Signal Processing, PacRim 2011. Proceedings : Victoria, BC, Canada, 23 - 26 August 2011
Piscataway, NJ: IEEE, 2011
ISBN: 978-1-4577-0252-5
ISBN: 978-1-4577-0251-8
ISBN: 978-1-4577-0253-2
Pacific Rim Conference on Communications, Computers and Signal Processing (PacRim) <13, 2011, Victoria>
Konferenzbeitrag, Elektronische Publikation
Fraunhofer ESK ()
quality of service; in-vehicle communication; network states; ethernet/IP

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.