DE102012214500B4 - State-based planning, protection and management of resources of a data network structure - Google Patents

Abstract

A method for resource planning, the method being performed by a device for controlling components for distributing resources of a data network structure, the device comprising a first unit, a second unit, a third unit and a control device, the method comprising the steps of:
Determining a plurality of data network functions by the first entity, each of the plurality of data network functions designating an application adapted to utilize resources of a data network structure,
Expanding the description of the data network functions by the second unit, wherein the step of expanding the description of the data network functions comprises determining one or more one-way dependencies and / or determining one or more mutual exclusions between each two of the data network functions by the second unit,
Computing and providing data network states by the third entity, wherein the step of computing the data network states comprises computing by the third entity all possible combinations of the data network functions allowed to communicate simultaneously; and
Mapping of a calculated or measured data network state to control signals for controlling the components of the data network structure by the controller so that the components adjust resource usage or access resources or access resources depending on the control signal, the device mapping the calculated or measured Data network state performs on control signals based on calculated data network states.

Description

The application relates to methods for securing and scheduling resources of a data network structure, in particular a data network structure based on data network states, in particular data network states and planned and optimized data network structures and an automatic real-time resource access control based on the results of the applied methods.

The safeguarding of a packet-based communication architecture, for example an Ethernet / Internet Protocol (IP) -based vehicle data-bank network architecture, is currently being realized with the aid of simulation and measurements on the prototype. Planning can be carried out manually on the basis of vehicle electrical systems databases. It should be noted that in a packet-based networking communication paths of different applications can be used simultaneously. This means that in the resource design of the data-port network architecture it has to be considered which functions / applications are communicating at the same time, as otherwise the communication resources would be understaffed. With a variety of functions, which is common in today's premium vehicles, this will in the future lead to an unmanageable complexity.

Out US 2011/0188379 A1 For example, there is known a method and apparatus for determining a path to support a mobile session that identifies the underlying transport elements that support the path.

Presentation of the invention

Method according to claims 1, 14 and 15, devices according to claims 16, 17 and 18, a data network structure according to claim 19 and a computer program according to claim 20 are provided.

In the data network considered below, in particular on-board network having a data network structure or data network structure which can assume different data network states or data network states, it is generally preferably a digital network for data exchange between a plurality of components, at least two components. Such a digital network can serve in particular for data communication between electrical components of a vehicle, an aircraft, a water and / or underwater vehicle, but also an industrial plant and / or a building. It will be appreciated by those skilled in the art that this is a non-exhaustive overpayment of potential sites for a digital communications network or other data processing resources.

In particular, resources include electrical energy, time, bandwidth, computational resources, memory, generic / specialized hardware components, e.g. for error correction, data compression, etc. understood. Also in this listing, the skilled person is aware that it is a non-exhaustive list.

Extension of the description of the data network functions means the definition of the relationships between data network functions, for example that the data network function A depends on the data network function B, that the use of the data network function A precludes the use of the data network function B and / or comparable relationships.

Control device is understood to be a programmable electronic circuit for processing program code that is designed to map input states to output states. It is known to the person skilled in the art that a control device can preferably also be embodied as a hard-wired electronic circuit for mapping input states to initial states, the term also deriving the word as being synonymous with mapping.

The method according to the invention provides for the securing and / or planning of the resources of a data network structure and in particular of an on-board network structure based on data-board network states. That in a state, in particular an on-board network state, it is preferable to consider the communication of the functions which can be active simultaneously in this state.

The inventive method has essentially the following steps. In a first step, the vehicle electrical system functions are recorded and the description of the vehicle electrical system functions is expanded. Preferably, a consistency check of the detected vehicle electrical system functions and the description of the extended vehicle electrical system functions is performed. In a next step, specific electrical system states are calculated. In In a further step, the calculated states are validated. Preferably by mapping to a topology that is tested by simulation, analysis and / or testing. In a next step, a state machine with state transitions and the calculated states is generated.

Using the state of the machine, simulation, execution or the like enables the protection of the resources of the data structure. Preferably, the generated state machine can be transferred to a runtime state machine, which provides the information on the current data network state to a resource manager. On the basis of the current data network state, the latter can inform, block, release, set, etc. the resources consuming components in order, for example, to achieve a desired resource distribution.

Without limiting the general inventive idea, the invention will be explained in more detail with reference to embodiments and figures.

• 1a-c zeigen drei Bordnetzbeschreibungen. Die Bordnetzbeschreibung der 1c ist ungültig. Die Bordnetzbeschreibungen der 1b und 1a sind gültig.
• 2a-c zeigen drei Bordnetzbeschreibungen. Die Bordnetzbeschreibung der 2c ist ungültig. Die anderen zwei Bordnetzbeschreibungen der 2b und 2a sind gültig.
• 3 zeigt eine Berechnung der Wurzelmengen gemäß einer Ausführungsform.
• 4 zeigt ein Auflösen der Abhängigkeiten der Funktionen in den jeweiligen Wurzelmengen gemäß einer Ausführungsform.
• 5 zeigt eine Berechnung von konkreten Netzwerkzuständen gemäß einer Ausführungsform.
• 6 zeigt ein Verfahren zur Ressourcenplanung gemäß einer Ausführungsform.
• 7 zeigt eine Tabelle, die nach einer Ausführungsform des Verfahrens zur Ressourcenplanung berechneten Datennetzzustände anwendet.
• 8 stellt ein Ausführungsbeispiel dar, bei dem berechnete Datennetzzustände auf Signale zur Steuerung der Komponenten der Datennetzstruktur abgebildet werden.
• 9 zeigt ein Ausführungsbeispiel, bei dem zwischen unterschiedlichen Mengen des Ressourcenverbrauchs einer Anwendung unterschieden wird.

The drawings show:

• 1a-c show three electrical system descriptions. The electrical system description of the 1c is invalid. The electrical system descriptions of the 1b and 1a are valid.
• 2a-c show three electrical system descriptions. The electrical system description of the 2c is invalid. The other two electrical system descriptions of the 2 B and 2a are valid.
• 3 FIG. 10 shows a calculation of the root sets according to one embodiment. FIG.
• 4 Figure 15 shows a resolution of the dependencies of the functions in the respective root sets according to one embodiment.
• 5 FIG. 10 shows a calculation of concrete network states according to an embodiment. FIG.
• 6 shows a method for resource planning according to an embodiment.
• 7 FIG. 12 shows a table applying computed data network states in accordance with an embodiment of the resource planning method. FIG.
• 8th FIG. 10 illustrates an embodiment in which computed data network states are mapped to signals for controlling the components of the data network structure.
• 9 shows an embodiment in which a distinction is made between different amounts of resource consumption of an application.

Detailed description of the preferred embodiment of the invention

For describing the on-board network functions, the amount of on-board network functions is formally defined. In the next step, the description of the vehicle electrical system functions is extended with the relations "depends on" and "excludes each other". In the next step, the description of the on-board network functions is checked for consistency using defined rules. In case of maladministration will be corrected by rules.

When calculating the vehicle electrical system states, the various vehicle electrical system states are calculated on the basis of the previously defined quantities and relations. For this purpose, preferably two different methods are used. The first method describes a path that calculates all combinations. However, many invalid states are also calculated. The second method was chosen by the procedure so that many invalid solutions are omitted directly.

• 1. formale Erfassung aller Bordnetzfunktionen f_i in F. $$F=\left\{{\mathrm{<figure-callout\; id="0"\; label="f"\; filenames="DE102012214500B4\_0055.png"\; state="\{\{state\}\}">f</figure-callout>}}_0,\dots ,f_{n-1}\right\}$$
  
• 2. Erweiterung der Beschreibung der Bordnetzfunktionen mit einer Zusatzinformation, die die einseitige Abhängigkeit beschreibt (Funktion A hängt von Funktion B ab). Diese Zusatzinformation wird im Folgenden „Hängt ab von“ genannt. $$R_{dep}\subseteq F\times F$$
  
  $$\begin{array}{c}\forall f\in F:\left(f,f\right)\notin R_{dep}\\ \forall f_a,f_b,f_c\in F:\\ \left(f_a,f_b\right)\in R_{dep}\wedge \left(f_b,f_c\right)\in R_{dep}\Rightarrow \left(f_a,f_c\right)\in R_{dep}\end{array}$$
  
  $$\forall f,f\text{'}\in F,\left(f,f\text{'}\right)\in R_{dep}:\left(f\text{'},f\right)\notin R_{dep}$$
  
• 3. Erweiterung der Beschreibung der Bordnetzfunktionen mit einer Zusatzinformation, die die direkte einseitige Abhängigkeit beschreibt (Funktion A hängt direkt von Funktion B ab). Diese Zusatzinformation wird im Folgenden „hängt direkt ab von“ genannt $$R_{ddep}\subseteq R_{dep}$$
  
  $$\begin{array}{c}\forall f_a,f_b\in F,\left(f_a,f_b\right)\in R_{ddep}:\\ \exists f\text{'}\in F,\left(f\text{'},f_b\right)\Rightarrow \left(f_a,f\text{'}\right)\notin R_{dep}\end{array}$$
  
  4. Erweiterung der Beschreibung der Bordnetzfunktionen um eine Information, die den gegenseitigen Ausschluss von Bordnetzfunktionen modelliert (Funktion a schließt Funktion b aus). Diese Zusatzinformation wird im Folgenden „schließt sich gegenseitig aus“ genannt. $$R_{mex}\subseteq F\times F$$
  
  $$\forall f\in F:\left(f,f\right)\notin R_{mex}$$
  
  $$\forall f_a,f_b\in F:\left(f_a,f_b\right)\in R_{mex}\Rightarrow \left(f_b,f_a\right)\in R_{mex}$$
  
• 5. Bei der Erweiterung der Bordnetzdatenbank sind zwei Regeln einzuhalten, um eine korrekte Berechnung von Bordnetzzuständen zu gewährleisten.
  • a. Asymmetrie: Für die Beziehung zwischen den Zusatzinformationen „Hängt ab von“ und „schließt sich gegenseitig aus“ gilt Asymmetrie. D.h., wenn eine Funktionen f_a als „Hängt ab von“ f_b markiert wird, dann dürfen f_a und f_b nicht als „schließt sich gegenseitig Aus“ markiert werden und umgekehrt $$\forall \left(f_x,f_y\right)\in R_{dep}\Rightarrow \left(f_x,f_y\right)\notin R_{mex}$$
    
    $$\forall \left(f_x,f_y\right)\in R_{mex}\Rightarrow \left(f_x,f_y\right)\notin R_{dep}$$
    
  • b. Impliziertes „schließt sich gegenseitig Aus“: Eine gültige „schließt sich gegenseitig Aus“ Beziehung darf nur zwischen zwei Funktionen mit entweder gleicher Elternfunktion (die Elternfunktion hängt direkt von den betroffenen Funktionen ab) existieren. Ausnahmen bilden Funktionen, denen die „schließt sich gegenseitig Aus“ Beziehung „vererbt“ wurde. Das heißt Funktionen, die von Wurzelfunktionen benötigt werden, die sich gegenseitig ausschließen, siehe 2a, oder Funktionen, die von Funktionen benötigt werden, die sich gegenseitig ausschließen, siehe 1a. Alle anderen „schließt sich gegenseitig Aus“ Beziehungen sind ungültig.
• 6. Durchführen einer Konsistenzprüfung der Bordnetzdatenbank vor. Dies kann zum Beispiel unter Anwendung der in 5. beschriebenen Regeln vorgenommen werden.
  • a. Wenn Regel 4.a zutrifft, muss eine der beiden Zusatzinformationen aufgehoben werden
  • b. Wenn Regel 4.b ergibt, dass eine „schließt sich gegenseitig Aus“ Beziehung ungültig ist, dann stellt dies einen Fehler dar. Dieser Fehler kann durch Manipulation der Annotationen im formalen Sinne behoben werden. D.h. zur Behebung des Fehlers, muss entweder die „schließt sich gegenseitig Aus“ Beziehung gelöscht werden oder aber ein Elternpaar ausfindig gemacht werden, das eine gültige „schließt sich gegenseitig Aus“ Beziehung zulässt und die Zusatzinformation „schließt sich gegenseitig Aus“ auf diese übertragen/ergänzt werden, zum Beispiel 1c und 2c ungültig; 1a,b und 2a,b gültig. $$\begin{array}{ll}\exists \hfill & f_x,f_y\in F,f_x\ne f_y:I\wedge \left(II\vee III\right)\hfill \\ \hfill & \Rightarrow \left(f_x,f_y\right)\in R_{mex}\hfill \end{array}$$
    
    $$\begin{array}{ll}\left(\text{I}\right):\hfill & \exists f_x^{\text{'}}{f}_y^{\text{'}}\in F:\left(f_x^{\text{'}},f_y^{\text{'}}\right)\in R_{mex}\wedge \hfill \\ \hfill & \left(f_x,f_x^{\text{'}}\right),\left(f_y,f_y^{\text{'}}\right)\in R_{dep}\hfill \end{array}$$
    
    $$\begin{array}{cc}\left(\text{II}\right):& \exists f\in F:\left(f,f_x\right),\left(f,f_y\right)\in R_{ddep}\end{array}$$
    
    $$\begin{array}{cc}\left(\text{III}\right):& f_x\in F_{root}\wedge f_y\in F_{root}\end{array}$$
    

Detailed description of the preferred embodiment of the invention, description of the electrical system functions:

• 1. formal recording of all on-board network functions f _i in F. $$F=\left\{{\mathrm{<figure-callout\; id="0"\; label="f"\; filenames="DE102012214500B4\_0055.png"\; state="\{\{state\}\}">f</figure-callout>}}_0.....f_{n-1}\right\}$$
  
• 2. Extension of the description of the vehicle electrical system functions with additional information describing the one-sided dependency (function A depends on function B). This additional information is hereinafter referred to as "Depends on". $$R_{dep}\subseteq F\times F$$
  
  $$\begin{array}{c}\forall f\in F:\left(f.f\right)\notin R_{dep}\\ \forall f_a.f_b.f_c\in F:\\ \left(f_a.f_b\right)\in R_{dep}\wedge \left(f_b.f_c\right)\in R_{dep}\Rightarrow \left(f_a.f_c\right)\in R_{dep}\end{array}$$
  
  $$\forall f.f\text{'}\in F.\left(f.f\text{'}\right)\in R_{dep}:\left(f\text{'}.f\right)\notin R_{dep}$$
  
• 3. Extension of the description of the on-board network functions with additional information describing the direct one-sided dependency (function A depends directly on function B). This additional information is hereinafter referred to as "depends directly on" $$R_{ddep}\subseteq R_{dep}$$
  
  $$\begin{array}{c}\forall f_a.f_b\in F.\left(f_a.f_b\right)\in R_{ddep}:\\ \exists f\text{'}\in F.\left(f\text{'}.f_b\right)\Rightarrow \left(f_a.f\text{'}\right)\notin R_{dep}\end{array}$$
  
  4. Extension of the description of the vehicle electrical system functions by an information that models the mutual exclusion of vehicle electrical system functions (function a excludes function b). This additional information is hereinafter referred to as "excludes each other". $$R_{mex}\subseteq F\times F$$
  
  $$\forall f\in F:\left(f.f\right)\notin R_{mex}$$
  
  $$\forall f_a.f_b\in F:\left(f_a.f_b\right)\in R_{mex}\Rightarrow \left(f_b.f_a\right)\in R_{mex}$$
  
• 5. When expanding the vehicle electrical system database, two rules must be adhered to in order to ensure a correct calculation of the vehicle electrical system states.
  • a. Asymmetry: For the relationship between the additional information "Depends on" and "excludes each other," asymmetry applies. That is, if a function f _{a is marked} as "Depends on" f _b then f _a and f _{b must} not be marked as "exclude each other out" and vice versa $$\forall \left(f_x.f_y\right)\in R_{dep}\Rightarrow \left(f_x.f_y\right)\notin R_{mex}$$
    
    $$\forall \left(f_x.f_y\right)\in R_{mex}\Rightarrow \left(f_x.f_y\right)\notin R_{dep}$$
    
  • b. Implicit "mutually exclusive": A valid "mutually exclusive" relationship may only exist between two functions with either the same parent function (the parent function depends directly on the functions concerned). Exceptions are functions that are inherited from the "mutually exclusive" relationship. That is, functions needed by root functions that are mutually exclusive, see 2a , or functions required by functions that are mutually exclusive, see 1a , All other "mutually exclusive" relationships are invalid.
• 6. Performing a consistency check of the on-board network database. This can be done, for example, using the rules described in 5.
  • a. If rule 4.a applies, one of the two additional pieces of information must be
  • b. If rule 4.b results in a "mutually exclusive" relationship being invalid, then this constitutes an error. This error can be remedied by manipulating the annotations in the formal sense. That is, to correct the error, either the "excludes mutually exclusive" relationship must be deleted or a parent pair must be located that allows a valid "mutually exclusive" relationship and the additional information "exclude each other" is transferred to them / be supplemented, for example 1c and 2c invalid; 1a ,Federation 2a , b valid. $$\begin{array}{ll}\exists \hfill & f_x.f_y\in F.f_x\ne f_y:I\wedge \left(II\vee III\right)\hfill \\ \hfill & \Rightarrow \left(f_x.f_y\right)\in R_{mex}\hfill \end{array}$$
    
    $$\begin{array}{ll}\left(\text{I}\right):\hfill & \exists f_x^{\text{'}}{f}_y^{\text{'}}\in F:\left(f_x^{\text{'}}.f_y^{\text{'}}\right)\in R_{mex}\wedge \hfill \\ \hfill & \left(f_x.f_x^{\text{'}}\right).\left(f_y.f_y^{\text{'}}\right)\in R_{dep}\hfill \end{array}$$
    
    $$\begin{array}{cc}\left(\text{II}\right):& \exists f\in F:\left(f.f_x\right).\left(f.f_y\right)\in R_{ddep}\end{array}$$
    
    $$\begin{array}{cc}\left(\text{III}\right):& f_x\in F_{rOOt}\wedge f_y\in F_{rOOt}\end{array}$$
    

Detailed description of the preferred embodiment of the invention, calculation of the electrical system states

• 7. On the basis of the information annotated in 1., 2., 3. and 4. the on-board network conditions are calculated. This means that all possible combinations of simultaneously active vehicle electrical system functions are calculated.
  • a. Find all functions for which there is another function that applies: "excludes each other" $$\mathrm{\Phi \; =}\left\{f:f\in F\wedge \exists f\text{'}\in F.\left(f.f\text{'}\right)\in R_{mex}\right\}$$
    
  • b. Partition all functions in Φ into disjoint subsets Φ _k , so that for every function within a certain set Φ _k , there is at least one function in Φ _k that excludes them. $${\mathrm{\Phi }}_k\mathrm{=}\left\{f:f\in \mathrm{\Phi }\wedge \exists f\text{'}\in {\mathrm{\Phi }}_{\text{k}}.\left(f.f\text{'}\right)\in R_{mex}\right\}$$
    
  • c. Determine the permutations P _k = {P _{k 0} , ..., P _{k n-1} } for every Φ _k , where P _{k i} stands for a concrete permutation. A permutation consists of the set of functions that are not mutually exclusive. $$\forall f.f\text{'}\in P_{k_i}\Rightarrow \left(f.f\text{'}\right)\notin R_{mex}$$
    
  • d. A concrete state permutation p _j results from the combination of the permutations P _k . That is, an element is selected from each permutation P _k . Thus, n P _{k, S are} each a P _{k l} select. From the combination of the respective P _{k l} the state permutation arises. $$p_j=\left\{{\mathrm{<figure-callout\; id="0"\; label="p\; j"\; filenames="DE102012214500B4\_0055.png"\; state="\{\{state\}\}">p\; </figure-callout>}}_{j_{}}.....p_{j_{n-1}}\right\}.p_{j_k}=P_{k_l}.P_{k_l}\in P_k$$
    
    $$l=\{\begin{array}{rr}\hfill j\text{mod}\left|{\mathrm{<figure-callout\; id="0"\; label="P"\; filenames="DE102012214500B4\_0055.png"\; state="\{\{state\}\}">P</figure-callout>}}_0\right|.& \hfill k=0\\ \hfill \lfloor \frac{j\text{mod}\left({\displaystyle {\Pi }_{i=0}^k\left|P_i\right|}\right)}{{\displaystyle {\Pi }_{i=0}^{k-1}\left|P_i\right|}}\rfloor .& \hfill 0<k\le n-1\end{array}$$
    
  • e. Due to the state permutations p _j , the concrete network state F _{α ij} determine. Here, the dependencies are resolved so that later only these functions in the state F _{α ij} are either part of p _j or are needed by functions from p _j and are not derived from Φ. Furthermore, it must hold that for every function a a function b in F _{α ij} must be present, which depends directly on function a, except functions that are generally required by any other function. That is, there is no function b in F that depends on function a.
• 8. Optimized calculation of the individual state permutations.
  • a. Calculation of root sets F _{α i root} :
    • i. All functions f _root ∈ F _{root are} selected. F _root contains the set of functions that are not needed by any other function. $$F_{rOOt}\mathrm{=}\left\{f:f\in F.\left(\forall f\text{'}\in F:\left(f\text{'}.f\right)\notin R_{dep}\right)\right\},$$
      
    • ii. Using the mutual exclusion information, the calculation of root sets F _{α i performed root} . This will be in 3 clarified. That is, the single root set F _{α i root} contains only functions that are (i) contained in F _root and (ii) are not mutually exclusive. $$\begin{array}{c}\exists f_{rOOt}\in F_{rOOt}:\left(\forall f{\text{'}}_{rOOt}\in F_{{\alpha }_{i}rOOt}:\left(f{\text{'}}_{rOOt}.f_{rOOt}\right)\notin R_{mex}\right)\Rightarrow f_{rOOt}\\ \in F_{{\alpha }_{i}rOOt}\end{array}$$
      
  • b. Based on the root sets F _{α i} the F _root now by dissolving the dependencies of the functions in the respective root quantities _{α i} calculated. This is through 4 clarified. That is, for each function f in the respective F _{α i root} the functions are chosen from F and in F _{α i} added, which are needed by f. $$F_{sub}=\left\{f:f\in F.\left(\exists f\text{'}\in F:\left(f\text{'}.f\right)\in R_{dep}\right)\right\}$$
    
    $$F_{{\alpha }_i}=F_{{\alpha }_{i}rOOt}\cup \left\{f_{sub}:f_{sub}\in F_{sub}\wedge \exists f_{rOOt}\in F_{{\alpha }_{i}rOOt}.\left(f_{rOOt}.f_{sub}\right)\in R_{dep}\right\}$$
    
  • c. Based on the previously calculated F _{α i} Now the concrete state permutations are calculated.
    • i. Find all functions for which there is another function that is "mutually exclusive". Save all relevant functions in $$\mathrm{\Phi }=\left\{{\mathrm{\Phi }}_0.....{\mathrm{\Phi }}_{\text{n}-1}\right\},$$
      
      • • Start with an arbitrary function f _sub ∈ F _sub for which the condition ∃f ' _sub ∈ F _{α i} : (f _sub , f ' _sub ) ∈ R _mex holds and store them in ^Φ k.
      • • Find all f ' _sub and save them in Φ _k . $$\begin{array}{l}\exists f_{sub}\in {\mathrm{\Phi }}_{\text{k}}.\exists f{\text{'}}_{sub}\in F_{{\alpha }_i}:f_{sub}.f{\text{'}}_{sub}\in F_{sub}\wedge \left(f_{sub}.f{\text{'}}_{sub}\right)\in R_{mex}\\ \Rightarrow f{\text{'}}_{sub}\in {\mathrm{\Phi }}_{\text{k}}\end{array}$$
        
      • • If there are no f ' _subs , start again with step one and search for a new f _sub .
      • • Repeat the above steps until no more Φ _k can be formed.
    • ii. Use Φ = {Φ ₀ , ..., Φ _n-1 } to calculate the individual permutation quantities P _{k i} to calculate. In which $$P_k=\left(P_{k_0}.....P_{k_{m-1}}\right)\text{and}P=\left\{P_0.....P_{n-1}\right\},$$
      
      $$\forall f_{sub}.f{\text{'}}_{sub}\in P_{k_i}:f_{sub}.f{\text{'}}_{sub}\in {\mathrm{\Phi }}_{\text{k}}\wedge \left({\text{f}}_{\text{sub}}.\text{f}{\text{'}}_{\text{sub}}\right)\notin {\text{R}}_{\text{mex}}$$
      
    • iii. Compute the concrete network states F _{α ij} illustrated in 5 based on $$F_{{\alpha }_{ij}}=\left(F_{{\alpha }_i}\text{}{\mathrm{\Phi }}_{dep}\right)\cup p_{j_{clean}}$$
      
      $$\begin{array}{l}{\mathrm{\Phi }}_{dep}=\mathrm{\Phi }\cup \\ \left\{f:f\in F_{{\alpha }_i}\wedge \exists f\text{'}\in \mathrm{\Phi }:\left(f\text{'}.f\right)\in R_{dep}\right\}\end{array}$$
      
      $$\begin{array}{l}{p}_{j_{clean}}=p_{j_{dep}}\text{}\\ \left\{f:f\in F_{{\alpha }_i}\wedge \exists f\text{'}\in \mathrm{\Phi }:\left(f\text{'}.f\right)\in R_{dep}.f\text{'}\notin p_j\right\}\end{array}$$
      
      $$\begin{array}{l}{p}_{j_{dep}}=p_j\cup \\ \left\{f:f\in \left(F_{{\alpha }_i}\text{}\mathrm{\Phi }\right)\wedge \exists f\text{'}\in p_j:\left(f\text{'}.f\right)\in R_{dep}\right\}\end{array}$$
      
      $$p_j=\left\{{\mathrm{<figure-callout\; id="0"\; label="p\; j"\; filenames="DE102012214500B4\_0055.png"\; state="\{\{state\}\}">p\; </figure-callout>}}_{j_{}}.....p_{j_{n-1}}\right\}$$
      
      $$p_{j_k}=P_{k_l}.P_{k_l}\in P_k$$
      
      $$l=\{\begin{array}{ll}j\text{mod}\left|{\mathrm{<figure-callout\; id="0"\; label="P"\; filenames="DE102012214500B4\_0055.png"\; state="\{\{state\}\}">P</figure-callout>}}_0\right|\hfill & k=0\hfill \\ \lfloor \frac{j\text{mod}\left({\displaystyle {\Pi }_{i=0}^k\left|P_i\right|}\right)}{{\displaystyle {\Pi }_{i=0}^{k-1}\left|P_i\right|}}\rfloor \hfill & 0<k\le n-1.\hfill \end{array}$$
      
    • iv. Check the calculated states for redundancy. Otherwise states can occur twice.

Detailed description of the preferred embodiment of the invention, application of the results

Selecting those states from a set of states that need the most resources. This information is used to design the resources for the network. This can also be differentiated for the respective subsections in the network.

Map the network states (in the sense of a set of functions that can be active at the same time) to a network topology. The network states are validated by appropriate methods (e.g., analysis, simulation, or test).

Generate a table from a set of network states (in the sense of a set of functions that are allowed to be active at the same time).

Calculation of the state information of the individual functions from a table representing a set of network states. This is done by a column projection on the column of the function.

• d. Diese Variante sieht eine zentrale Instanz des Ressourcenmanagers vor. D.h. der Ressourcenmanager wird in einer einzelnen Komponente realisiert. Es wird vorgeschlagen, dass der Ressourcenmanager die Zustandsinformationen an die Funktionen weitergibt und diese anhand einer Tabelle und des Zustands entscheiden, ob sie senden dürfen oder aber nicht.
• e. Diese Variante sieht vor, dass die Funktion des Ressourcenmanagers verteilt auf den Komponenten realisiert sind. D.h. die Funktionen sind selbst für die Detektion des aktuellen Zustandes zuständig. Hier ist eine Synchronisation der Ressourcenbelegung notwendig.

Creating a resource manager in the form of computer executable program code or digital circuit realization. This manages the current state using a finite state machine. The events that stimulate the resource manager to transition to a state may come either from the user, the on-board network itself or from vehicle infrastructure.

• d. This variant provides a central instance of the resource manager. That is, the resource manager is realized in a single component. It is suggested that the resource manager pass the state information to the functions and that they decide on the basis of a table and the state whether they are allowed to send or not.
• e. This variant provides that the function of the resource manager is implemented distributed on the components. That is, the functions themselves are responsible for the detection of the current state. Here a synchronization of the resource allocation is necessary.

Based on the information from the calculation of the state information of the individual functions from a table that represents a set of network states, or the part of which is relevant to them, the on-board network functions match their transmission behavior. If they are marked as active in the current vehicle electrical system state, then they may send. If not, not.

• In Schritt 610 des Verfahrens erfolgt die Ermittlung aller Datennetzfunktionen.
• In Schritt 620 erfolgt die Erweiterung der Beschreibung der Datennetzfunktionen.
• In Schritt 630 erfolgt die Berechnung der Datennetzzustände.
• In Schritt 640 werden die berechneten Datennetzzustände bereitgestellt.

6 shows a method for resource planning according to an embodiment. The method comprises a number of steps:

• In step 610 the method is the determination of all data network functions.
• In step 620 the extension of the description of the data network functions takes place.
• In step 630 the calculation of the data network states takes place.
• In step 640 the calculated data network states are provided.

7 shows a table, by means of which an application of the method for resource planning is to be explained by way of example by an exemplary embodiment.

In the left area of the 7 are given a number of data network functions relating to a motor vehicle, such as a car. The data network functions listed there are, for example, "control data", "rear-view camera", "front-view camera" or "BluRay video". The data network functions communicate, for example, via a common communication unit, for example a switch, for example an Ethernet switch.

In the columns numbered "1" to "6" 7 are the permissible states of 7 as provided by a resource scheduling method according to the embodiments described above.

The resource planning method in this embodiment provides the computed data network states by determining all data network functions, expanding the description of the data network functions, calculating the data network states, and then providing the computed data network states.

In the embodiment of 7 Six different data network states were identified. In the first data network state 1 Both the control data and the rear-view camera can simultaneously use a communication path. In another data network state 3 For example, the control data, the side-view camera on the left, and the side camera on the right can simultaneously use the communication path.

Due to the calculated data network states, in the example of 7 these are the data network states 1 to 6 , it is now possible to say which data network functions are allowed to communicate simultaneously, namely only those for which there is a determined data network state. Conversely, on the basis of the determined data network states, it is also possible to make a statement about which data network functions must not communicate at the same time, namely those for which there is no corresponding calculated data network state. In the embodiment of 7 For example, the BluRay video application must not communicate with the front-view cameras at the same time, because there is no state under the data network states 1 to 6 where the BluRay video application and one of the front-view cameras would communicate simultaneously.

In one embodiment, a method of organizing access to resources by components of a data network structure is realized. In such an embodiment, for example, first the set of all (permissible) data network states is calculated. This indicates, for example, which data network functions are active at the same time, eg which data network functions are allowed to communicate at the same time. In 7 For example, it is shown that control data, side-view camera on the left and side-view camera on the right can be active / allowed to communicate simultaneously.

The method of organizing accesses to resources by components of a data network structure may now be adapted to derive signals for controlling the components of the data network structure from a current data network state. Thus, for example, a resource manager may be provided which, for example, manages the current data network state or has knowledge of the current data network state. The resource manager is thus aware of which data network functions, e.g. So what applications, just communicate.

In the example of 7 For example, a current data network state may be one in which the control data, the side-view camera on the left and the side-view camera on the right communicate. If now also the BluRay Player application is to communicate, it can be determined by the procedure for the organization of resources that a condition with the functions (control data, side view camera left, side view camera right, BluRay player) none of the calculated states is (and therefore inadmissible). Thus, this condition must not be taken.

A signal can then be output to control the BluRay Player application, which prohibits the BluRay Player application from using the data network infrastructure. Such a signal can be used to control the activity of the BluRay Player application.

Alternatively, however, a signal for control to the side-view camera left and the side-view camera can be output right. This signal can be a signal for controlling the side-view camera on the left and the side-view camera on the right, instructing them to adjust their communication activity. Such a signal can be used to control the activity of the side view camera on the left and the side view camera on the right. In addition, the BluRay Player application can be sent a signal that allows the use of the communication infrastructure.

For example, which control command is sent may depend on which priority has which data network function. For example, in 7 the priority 2 the "Page view camera left" indicate that the side view camera left has priority over the BluRay Player application, if the BluRay player application is a lower priority ( 1 ) Has. The BluRay Player application would be able to prohibit communication in such a case by a control command.

Computed data network states are thus mapped to signals for controlling the components of the data network structure.

8th illustrates such an embodiment graphically. A central resource manager 810 holds information about (all) data network states previously calculated. The resource manager 810 then, for example, receives from the various applications in a car, for example, a left side view camera 820, a right side view camera 830, a BluRay player application 840 etc. Information as to whether they are currently active (activity information 845 ). Based on this, the resource manager then determines the current data network state.

Optionally, the resource manager 810 Now check whether the communication infrastructure is used in a permissible way. If the communication infrastructure is not used in a permissible manner, then the resource manager 810 commands 855 to any of the applications that instruct them to discontinue their activity or stop using the communication infrastructure.

Alternatively, the resource manager 810 also instruct all applications by control commands to cease their activity to regain a calculated data network state.

Represents the resource manager 810 on the other hand, knowing that the communication infrastructure is being used in a legitimate manner, it can wait for requests from applications that want to communicate. For example, the previously not active BluRay Player application 840 the resource manager 810 by a request 865 indicate that she wants to use the communication infrastructure. The resource manager 810 now checks whether by recording the activity of the BluRay Player application 840 a calculated data network state is taken. To perform this check, the resource manager 810 use a finite automaton, which indicates by its state transitions, whether the subsequent state, which at the admission of the activity of the further application, in the example of the 8th BluRay Player application, is taken, allowed or not.

Represents the resource manager 810 notes that even when recording the activity of the BluRay Player application 840 there is a computed data network state (eg, the resource manager 810 determines that then one of the calculated data network states is present), then the resource Manager 810 the BluRay player application 840 by a control command 875 allow the recording of the activity.

Represents the resource manager 810 notes that when recording the activity of the BluRay Player application 840 there would be no computed data network state (eg, the resource manager 810 determines that then none of the computed data network states would be present), then the resource manager 810 the BluRay player application 840 by the control command 875 refuse to take up the activity.

In one embodiment, a device for controlling components for distributing resources of a data network structure may include a control device which maps a calculated or measured data network state to control signals for controlling the components of the data network structure such that the components adapt or set up resource consumption in dependence on the control signal Access resources or not access resources.

In an exemplary application, a distinction can here be made between different amounts of the resource consumption of an application. For example, an application may operate either in a mode that requires high data communication or in a mode that requires low data communication. For example, concurrent operation of the BluRay Player application with the rear view camera could be declared admissible if the BluRay Player application is operated in a mode that requires low data communication, while this may be precluded when using the BluRay Player application in a mode requiring high data communication.

In 9 such an embodiment is shown. Ask the back-view camera 930 for example, at the controller 910 by a request 915 The control device can determine whether it is allowed to be active 910 the BluRay Player application by a control command 925 instruct you to move to a low communication mode. Then the control device 910 the rear-view camera 930 by a control command 935 allow their activity to be taken if this results in a calculated data network state.

In one embodiment, the resource manager is implemented to be a central instance. The resource manager can receive information from the individual components as to whether these components are currently active or not. The resource manager then determines the current data network state based on the information obtained and transmits the current data network state to one or more of the individual components.

The individual components thus receive the current data network state and can decide on the basis of the obtained current data network state, whether the individual components may be active or not. For example, you can calculate this decision from a table that stores the calculated data network states. Such a table may have been calculated by a method according to one of the embodiments described above.

Another application of the calculated data network states may be, for example, the check as to whether a communication infrastructure, eg data lines and switches of a communication network, are optimally designed. Reference is made to this 7 taken. 7 has two more columns, namely the column "estimate so far" and the column "estimate current". The columns provide an estimate of the maximum possible delay (the maximum possible delay) that the particular data network function experiences when performing a communication activity. If several data network functions are active at the same time, data transmission is delayed at (time) bottlenecks in the communication network (eg at a switch). However, the individual functions often have certain delay requirements, eg real-time requirements, which must not be exceeded. These are in the "Request" column of the 7 listed by way of example.

It is now important to assess whether the communication infrastructure is designed to meet the requirements of each function. If one knows the functions that use the data network at the same time, then one can calculate how great is the delay in the communication experienced by the individual functions.

After a state-of-the-art approach, you have to be the worst. Case, assume that all data network functions are active at the same time. Based on this assumption, the delay times given in the "estimate so far" column.

If, on the other hand, one calculates the data network states according to one of the embodiments described above, this results in substantial advantages. It is no longer necessary to assume that all data network functions are active at the same time. Rather, only the calculated data network states are considered, in the example of 7 , the six data network states.

From the data network states of 7 it follows that in the example of the 7 never all data network functions are active at the same time. Rather, a maximum of a few of the data network functions are active there simultaneously. So is in 7 the side view camera left active maximally simultaneously with the control data and the side view camera right. From this knowledge, the maximum delay experienced by the left side view camera when communicating over the communications network can be estimated (7.7364 ms) which is well below the maximum delay estimate assumed assuming that all functions are active at the same time (27.1195 ms, see estimate so far).

In one embodiment, a resource scheduling method is provided that is used to resource design a communications infrastructure (e.g., resource planning of a communications infrastructure). For example, in the resource design of the communication infrastructure, depending on the needs identified, e.g. Depending on how many data network functions are allowed to be active at most simultaneously (and accordingly how much bandwidth is needed at most), a switch with higher or lower link speed for the communication infrastructure, a switch with a larger or smaller data buffer can be used, a shielded electronic Wiring (eg for higher data rates) or unshielded electronic wiring (eg for lower data rates) can be used, or a faster network controller (eg 10 GBit / s, 1 GBit / s) or a slower network controller (eg 100 MBit / s, 10 MBit / s) are used.

Although some aspects have been described in the context of a device, it will be understood that these aspects also constitute a description of the corresponding method, so that a block or a component of a device is also to be understood as a corresponding method step or as a feature of a method step. Similarly, aspects described in connection with or as a method step also represent a description of a corresponding block or detail or feature of a corresponding device. Some or all of the method steps may be performed by a hardware device (or using a hardware device). Apparatus), such as a microprocessor, a programmable computer or an electronic circuit. In some embodiments, some or more of the most important method steps may be performed by such an apparatus.

Depending on particular implementation requirements, embodiments of the invention may be implemented in hardware or in software. The implementation may be performed using a digital storage medium such as a floppy disk, a DVD, a BluRay disc, a CD, a ROM, a PROM, an EPROM, an EEPROM or FLASH memory, a hard disk, or other magnetic or optical Memory are stored on the electronically readable control signals are stored, which can cooperate with a programmable computer system or cooperate such that the respective method is performed. Therefore, the digital storage medium can be computer readable.

Thus, some embodiments according to the invention include a data carrier having electronically readable control signals capable of interacting with a programmable computer system such that one of the methods described herein is performed.

In general, embodiments of the present invention may be implemented as a computer program product having a program code, wherein the program code is operable to perform one of the methods when the computer program product runs on a computer.

The program code can also be stored, for example, on a machine-readable carrier.

Other embodiments include the computer program for performing any of the methods described herein, wherein the computer program is stored on a machine-readable medium. In other words, an embodiment of the method according to the invention is thus a computer program which has a program code for performing one of the methods described herein when the computer program runs on a computer.

A further embodiment of the inventive method is thus a data carrier (or a digital storage medium or a computer-readable medium) on which the computer program is recorded for carrying out one of the methods described herein.

A further embodiment of the method according to the invention is thus a data stream or a sequence of signals, which represent the computer program for performing one of the methods described herein. The data stream or the sequence of signals may be configured, for example, to be transferred via a data communication connection, for example via the Internet.

Another embodiment includes a processing device, such as a computer or a programmable logic device, that is configured or adapted to perform one of the methods described herein.

Another embodiment includes a computer on which the computer program is installed to perform one of the methods described herein.

Another embodiment according to the invention comprises a device or system adapted to transmit a computer program for performing at least one of the methods described herein to a receiver. The transmission can be done for example electronically or optically. The receiver may be, for example, a computer, a mobile device, a storage device or a similar device. For example, the device or system may include a file server for transmitting the computer program to the recipient.

In some embodiments, a programmable logic device (eg, a field programmable gate array, an FPGA) may be used to perform some or all of the functionality of the methods described herein. In some embodiments, a field programmable gate array may cooperate with a microprocessor to perform one of the methods described herein. In general, in some embodiments, the methods are performed by any hardware device. This may be a universal hardware such as a computer processor (CPU) or hardware specific to the process, such as an ASIC.

The embodiments described above are merely illustrative of the principles of the present invention. It will be understood that modifications and variations of the arrangements and details described herein will be apparent to others of ordinary skill in the art. Therefore, it is intended that the invention be limited only by the scope of the appended claims and not by the specific details presented in the description and explanation of the embodiments herein.

Claims (20)

A method for resource planning, the method being performed by a device for controlling components for distributing resources of a data network structure, the device comprising a first unit, a second unit, a third unit and a control device, the method comprising the steps of: Determining a plurality of data network functions by the first entity, each of the plurality of data network functions designating an application adapted to utilize resources of a data network structure, Expanding the description of the data network functions by the second unit, wherein the step of expanding the description of the data network functions comprises determining one or more one-way dependencies and / or determining one or more mutual exclusions between each two of the data network functions by the second unit, Computing and providing data network states by the third entity, wherein the step of computing the data network states comprises computing by the third entity all possible combinations of the data network functions allowed to communicate simultaneously; and Mapping a calculated or measured data network state to control signals for controlling the components of the data network structure by the controller such that the components adjust or access resources or access resources in response to the control signal, the device mapping the calculated or measured data network state Performs control signals based on computed data network states. Method according to Claim 1 wherein the step of expanding the description of the data network functions comprises determining that a first one of the data network functions depends on a second one of the data network functions. Method according to Claim 1 or 2 wherein the step of expanding the description of the data network _functions comprises determining an amount R _dep such that $$R_{dep}\subseteq F\times F$$

$$\begin{array}{c}\forall f\in F:\left(f.f\right)\notin R_{dep}\\ \forall f_a.f_b.f_c\in F:\\ \left(f_a.f_b\right)\in R_{dep}\wedge \left(f_b.f_c\right)\in R_{dep}\Rightarrow \left(f_a.f_c\right)\in R_{dep}\end{array}$$

$$\forall f.f\text{'}\in F.\left(f.f\text{'}\right)\in R_{dep}:\left(f\text{'}.f\right)\notin R_{dep}$$

wherein F comprises the data network functions, wherein f _a , f _b , f _{c are} at least some of the data network functions, and wherein each element of the set R _dep respectively indicates a third of the data network functions and a fourth of the data network functions, the third one of the data network functions of the fourth one of the data network functions Data network functions depends. The method of any preceding claim wherein the step of expanding the description of the data network functions comprises determining that a fifth of the data network functions and a sixth of the data network functions are mutually exclusive. Method according to one of the preceding claims, wherein the step of expanding the description of the data network functions comprises determining a set R _mex , such that the following applies: $$R_{mex}\subseteq F\times F$$

$$\forall f\in F:\left(f.f\right)\notin R_{mex}$$

$$\forall f_a.f_b\in F:\left(f_a.f_b\right)\in R_{mex}\Rightarrow \left(f_b.f_a\right)\in R_{mex}$$

where F comprises the data network functions, where f _a , f _{b are} at least some of the data network functions, and wherein each element of the set R _mam indicates each of two of the data network functions that are mutually exclusive. The method of any one of the preceding claims, wherein the step of computing the data network states comprises the step of determining a set of functions Φ so that there is another data network function of the data network functions for each data network function of the set of functions that the respective function mutually excludes, and so applies: $$\mathrm{\Phi }=\left\{f:f\in F\wedge \exists f\text{'}\in F.\left(f.f\text{'}\right)\in R_{mex}\right\}.$$

where F comprises the data network functions, and wherein each element of the set R _mex indicates two each of the data network functions that are mutually exclusive. Method according to Claim 6 wherein the step of computing the data network states comprises the step of partitioning all data network functions in Φ into disjoint subsets Φ _k such that for each data network function within one of the subsets Φ _k , there is at least one data network function in Φ _k for that data network function, which excludes itself with it, so that applies: $${\mathrm{\Phi }}_k=\left\{f:f\in \mathrm{\Phi }\wedge \exists f\text{'}\in {\mathrm{\Phi }}_{\text{k}}.\left(f.f\text{'}\right)\in R_{mex}\right\},$$

Method according to Claim 7 wherein the step of computing the data network states comprises the step of permutations P _k = {P _{k 0} , ..., P _{k n-1} } for each of the disjoint subsets Φ _k , where P _{k i} one of the permutations, and wherein each of the permutations comprises a set of one or more of the data network functions that are not mutually exclusive, and where: $$\forall f.f\text{'}\in P_{k_l}\Rightarrow \left(f.f\text{'}\right)\notin R_{mex},$$

Method according to one of Claims 1 to 5 wherein the step of computing the data network states comprises the step of selecting all data network functions f _root ∈ F _root , where F _root contains all data network functions not needed by any other function, and where: $$F_{rOOt}=\left\{f:f\in F.\left(\forall f\text{'}\in F:\left(f\text{'}.f\right)\notin R_{dep}\right)\right\}.$$

where F comprises the data network functions, and wherein each element of the set R _dep indicates two of the data network functions, respectively, so that each one of the two of the data network functions depends on the other of the two of the data network functions. Method according to Claim 9 wherein the step of calculating the data network states comprises the step of calculating root sets f _i perform _root , so that each of the root sets F _{α i root} contains only data network functions that are contained in F _root and that do not exclude each other, where $$\begin{array}{c}\exists f_{rOOt}\in F_{rOOt}:\left(\forall f{\text{'}}_{rOOt}\in F_{{\alpha }_{i}rOOt}:\left(f{\text{'}}_{rOOt}.f_{rOOt}\right)\notin R_{mex}\right)\Rightarrow f_{rOOt}\\ \in F_{{\alpha }_{i}rOOt}.\end{array}$$

wherein each element of the set R _mex indicates two each of the data network functions that are mutually exclusive. Method according to Claim 10 wherein the step of computing the data network states comprises the step based on the root sets F _{α i root} network function sets F _{α i} for each function f in each F _{α i root selects} the functions from F and the network function set F _{α i} to be added, which are needed by this function f. Method according to Claim 11 wherein the step of computing the data network states comprises the step based on the network function sets F _{α i} to calculate the state permutations. The method of any preceding claim, wherein the step of expanding the description of the data network function comprises determining one or more one-way dependencies between each two of the data network functions. A method performed by a device comprising a first unit, a second unit, a third unit, and a resource manager, comprising the steps of: Determining a plurality of data network functions by the first unit, each of the plurality of data network functions designating an application configured to utilize resources of a data network structure, Expanding the description of the data network functions by the second unit, wherein the description of the data network functions is extended by determining one or more one-way dependencies and / or by determining one or more mutual exclusions between any two of the data network functions by the second unit, Computing and providing the data network states by the third entity, wherein the data network states are calculated by calculating all possible combinations of the data network functions allowed to communicate simultaneously by the third entity, and Checking, based on the current data network state and the computed data network states by the resource manager, whether a communication infrastructure is being used properly and if the communication infrastructure is not being used in a legitimate manner, issuing control commands to one or more applications suspending use of the communication infrastructure Instruct the communication infrastructure through the resource manager. A method for adapting a transmission behavior for a plurality of on-board network functions, which is carried out by a device comprising a first unit, a second unit, a third unit and a resource manager, comprising the following steps: determining the plurality of on-board network functions by the first unit, wherein each of the plurality of on-board network functions designates an application configured to utilize data network structure resources, expanding the description of the on-board network functions by the second unit, wherein the step of expanding the description of onboard network functions comprises determining one or more one-way dependencies and / or determining by the second unit one or more mutual exclusions between in each case two of the on-board network functions, calculation and provision of vehicle electrical system states by the third unit, wherein the step of calculating the vehicle electrical system states comprises calculating all he possible combinations of the on-board network functions, which may communicate at the same time, by the third unit comprises, and adaptation of the transmission behavior of the electrical system functions by the resource manager in dependence on the calculated on-board network conditions. Apparatus for controlling components for distributing resources of a data network structure, the apparatus comprising: a first unit for determining a plurality of data network functions, each of the plurality of data network functions designating an application adapted to utilize resources of a data network structure, a second unit for expanding the description of the data network functions, the second unit being adapted to extend the description of the data network functions by determining one or more one-way dependencies and / or determining one or more mutual exclusions between each two of the data network functions, a third unit for computing and providing data network states, wherein the third unit is configured to calculate the data network states by calculating all possible combinations of the data network functions that are allowed to communicate at the same time, and a controller configured to map a calculated or measured data network state to control signals for controlling the components of the data network structure such that the components adjust resource consumption or access resources or access resources in response to the control signal, the device being configured to display the map of the calculated or measured data network state to perform control signals based on computed data network states. An apparatus comprising: a first unit for determining a plurality of data network functions, wherein each of the plurality of data network functions designates an application adapted to utilize resources of a data network structure, a second unit for expanding the description of the data network functions, the second unit being formed is the description of the data network functions by determining one or more one-sided Dependencies and / or determining one or more mutual exclusions between any two of the data network functions, a third unit for computing and providing the data network states, the third unit being configured to compute all data network states by computing all possible combinations of the data network functions allowed to communicate simultaneously , and a resource manager configured to check, based on the current data network state and the computed data network states, whether a communication infrastructure is being used properly and if the communication infrastructure is not being used in a legitimate manner, issuing control commands to one or more applications instructing them to cease use of the communication infrastructure. Device for adapting a transmission behavior for a plurality of vehicle electrical system functions, the device comprising: a first unit for determining a plurality of vehicle electrical system functions, wherein each of the plurality of vehicle electrical system functions designates an application that is set up to use resources of a data network structure, a second unit for expanding the description of the on-board network functions, the second unit being designed to expand the description of the on-board network functions by determining one or more one-sided dependencies and / or determining one or more mutual exclusions between in each case two of the vehicle electrical system functions, a third unit for calculating and providing vehicle electrical system states, wherein the third unit is configured to calculate the vehicle electrical system states by calculating all possible combinations of the vehicle electrical system functions that are allowed to communicate at the same time, and a resource manager for adapting the transmission behavior of the vehicle electrical system functions as a function of the calculated vehicle electrical system states. Data network structure comprising: a first unit for determining a plurality of data network functions, each of the plurality of data network functions designating an application adapted to utilize resources of a data network structure, a second unit for expanding the description of the data network functions, the second unit being adapted to extend the description of the data network functions by determining one or more one-way dependencies and / or determining one or more mutual exclusions between each two of the data network functions, a third unit for calculating and providing the data network states, wherein the third unit is configured to calculate the data network states by calculating all possible combinations of the data network functions that are allowed to communicate at the same time, and a plurality of components, wherein the data network structure is configured to control the components of the data network structure based on the computed data network states. Computer program with a program code for carrying out the method according to one of Claims 1 to 15 ,

Images