DE102022204487A1 - System and method for controlling routing of information requests - Google Patents

Abstract

Method for routing at least one information request, preferably a plurality of information requests, in a system comprising a plurality of network participants (10, 20, 30, 40) which are connected via at least one data transmission system (11), the at least one information request from at least one first network participant (10) who has received a first message (200), and wherein the routing is determined depending on a payload (220) of the first message (200).

Description

The present invention relates to a method for routing at least one information request, and a computer program, a network participant and a network system.

State of the art

• - eine Verwendung der zweiten Zugangstechnologieebene in Abhängigkeit von einer Verwendung der ersten Zugangstechnologieebene zu koordinieren;
• - eine Verwendung der ersten Zugangstechnologieebene in Abhängigkeit von einer Verwendung der zweiten Zugangstechnologieebene zu koordinieren;
• - Daten mit mindestens einem zweiten straßenseitigen Netzwerkknoten über einen Sidelink-Funkkanal des zellgestützten Funkkommunikationsnetzes auszutauschen;
• - Daten mit mindestens einem dritten straßenseitigen Netzwerkknoten über einen Adhoc-Funkkanal des Adhoc-Funkkommunikationsnetzes austauschen, wobei eine erste Zugangstechnologieebene für den Datenaustausch mit mindestens dem zweiten straßenseitigen Netzwerkknoten verwendet wird, wobei eine zweite Zugangstechnologieebene für den Datenaustausch mit mindestens dem dritten straßenseitigen Netzwerkknoten verwendet wird, und wobei sowohl in dem zellgestützten Funkkommunikationsnetz als auch in dem Adhoc-Funkkommunikationsnetz Funksignale unter Verwendung desselben oder eines überlappenden nicht lizenzierten Frequenzbereichs (uFR) übertragen werden; wobei der Austausch von Daten umfasst:
• - die zu übertragenden Daten bereitzustellen;
• - lokal auf dem straßenseitigen Gateway-Knoten eine Übertragungsanweisung (TI) für die Daten zu bestimmen, wobei die Übertragungsanweisung (TI) eine Kanalauswahl (CS) umfasst, die a) eine Übertragung der Daten über einen Sidelink-Funkkanal des zellgestützten Funkkommunikationsnetzes, b) eine Übertragung der Daten über einen Adhoc-Funkkanal des Adhoc-Funkkommunikationsnetzes oder c) eine Übertragung der Daten über den Sidelink-Funkkanal und den Adhoc-Funkkanal angibt; und
• - eine Übertragung der Daten über den Sidelink-Funkkanal und/oder über den Adhoc-Funkkanal gemäß der Übertragungsanweisung (TI) einzuleiten.

From the EP 3 484 186 B1 is a road-side gateway network node for operating in a cellular-based radio communication network and for operating in an ad hoc radio communication network, wherein the road-side gateway network node has a processor, a memory, a first radio module for operating in the cellular-based radio communication network, a second radio module for operating in the ad hoc radio communication network and at least one antenna, the road-side gateway network node being designed to:

• - coordinate use of the second access technology level depending on use of the first access technology level;
• - coordinate use of the first access technology level depending on use of the second access technology level;
• - exchange data with at least a second roadside network node via a sidelink radio channel of the cellular-based radio communication network;
• - Exchange data with at least a third road-side network node via an ad hoc radio channel of the ad hoc radio communication network, wherein a first access technology level is used for data exchange with at least the second road-side network node, wherein a second access technology level is used for data exchange with at least the third road-side network node , and wherein in both the cellular radio communications network and the ad hoc radio communications network, radio signals are transmitted using the same or an overlapping unlicensed frequency range (uFR); whereby the exchange of data includes:
• - provide the data to be transferred;
• - to determine a transmission instruction (TI) for the data locally on the road-side gateway node, the transmission instruction (TI) comprising a channel selection (CS) which a) transmits the data via a sidelink radio channel of the cellular-based radio communication network, b) indicates a transmission of the data via an ad hoc radio channel of the ad hoc radio communication network or c) a transmission of the data via the sidelink radio channel and the ad hoc radio channel; and
• - initiate a transmission of the data via the sidelink radio channel and/or via the ad hoc radio channel in accordance with the transmission instruction (TI).

From the DE 10 2019 201 231 A1 a method for operating a software defined networking communication infrastructure via which at least one data stream can be transmitted in accordance with Time Sensitive Networking is known, wherein information is received (300) via the communication infrastructure (100), the communication infrastructure (100) using the received information from a Software Defined Networking control instance (120) is monitored (302), whereby if the Software Defined Networking control instance (120) detects an error in the communication infrastructure (100) depending on the information (303), the Software Defined Networking control instance (303) 120) at least one reaction is initiated (305), through which at least one parameter for software defined networking and / or time sensitive networking in at least one network component (101, 102, 103) of the communication infrastructure (100) for a transmission of the at least one data stream according to Time Sensitive Networking is defined.

Advantages of the invention

The method with the features of independent claim 1 has the advantage that the routing of information requests can be carried out particularly flexibly.

Further training with further advantages is the subject of the dependent claims.

Disclosure of the invention

In a first aspect, the invention relates to a particularly computer-implemented method for routing at least one information request, preferably a plurality of information requests, in a system comprising a plurality of network participants which are connected via at least one data transmission system, wherein the at least one information request from at least a first network participant, who has received a first message are generated, the routing, i.e. a target network participant of the information request, is determined depending on a payload of the first message. This means that routing can be characterized by a list of target network participants of the information request.

In a further development it can be provided that the routing is carried out depending on an identifier contained in the payload, in particular from a predeterminable set of possible identifiers. This makes the routing particularly flexible and adaptable to the first message.

Preferably, it can be provided that the identifier is determined based on a keyword, in particular immediately preceding the identifier in the payload. This makes the identifier particularly easy to identify.

In further aspects of the invention it can be provided that the identifier, in particular each identifier of the predeterminable set of possible identifiers, is assigned in particular to exactly one entity from a hierarchically arranged data structure comprising a plurality of entities. This makes it particularly easy to adapt routing to the semantic content of the identifier.

If the entities in the hierarchically arranged data structure are logically arranged in the form of a tree, the routing assignment is simplified even further.

It can advantageously be provided here that the relation between a subordinate entity and a superior entity is an “is a” relation. This allows routing to be particularly well adapted to hierarchically ordered identifiers.

A particularly easy-to-represent routing choice occurs when the routing that is assigned to the lower-level entity includes all network participants as routing destinations that are also assigned to the higher-level entity. This makes it particularly easy to assign a routing to all permitted identifiers.

For increased flexibility, it can be provided that additional network participants are inserted as routing destinations in the routing that is assigned to the lower-level entity compared to the routing that is assigned to the higher-level entity.

It can be provided here that the routing includes a predeterminable sequence (in particular with a predeterminable order) of information requests to network participants specified by the routing.

Furthermore, it can be provided that, depending on a payload of the information request, an answer to the information request is determined, transmitted back to the first network participant and received by the latter. Advantageously, the payload of the information request is determined here depending on the payload of the first message. This allows the information request to be particularly well adapted to the first message.

The process becomes particularly simple if the payload of the information request includes the payload of the first message.

To increase the flexibility of the routing, it can be provided that the routing includes a plurality of network participants, to whom a plurality of information requests are transmitted in parallel, in particular from the first network participant.

In particular, it can be provided that the routing includes a plurality of network participants to whom the same information request is transmitted consecutively and/or that the routing includes that this information request is transmitted to a first network participant of the plurality of network participants, who in particular receives this information request from him The determined information is enriched and transmitted to a second network participant of the plurality of network participants. This minimizes network traffic.

Advantageously, it can be provided that a last network participant of this plurality of network participants then transmits feedback dependent on the information determined by the network participants of the plurality of network participants back to the first network participant. This is a particularly important measure to minimize network traffic.

Further measures improving the invention are shown in more detail below together with the description of the preferred exemplary embodiments of the invention using figures.

Examples of embodiments

• 1 ein verteiltes Rechensystem;
• 2a eine Ausführungsform eines Aufbaus einer Nachricht;
• 2b eine beispielhafte Darstellung einer Datenstruktur;
• 3 ein verteiltes Rechensystem gemäß einem weiteren Aspekt der Erfindung;
• 4 in einem Flussdiagramm eine Ausführungsform eines Aspekts der Erfindung;
• 5 in einem Flussdiagramm eine Ausführungsform eines weiteren Aspekts der Erfindung;
• 6 in einem Flussdiagramm eine zweite Ausführungsform des weiteren Aspekts der Erfindung;
• 7 in einem Flussdiagramm eine dritte Ausführungsform des weiteren Aspekts der Erfindung;
• 8 in einem Flussdiagramm eine vierte Ausführungsform des weiteren Aspekts der Erfindung;

Show it:

• 1 a distributed computing system;
• 2a an embodiment of a structure of a message;
• 2 B an exemplary representation of a data structure;
• 3 a distributed computing system according to another aspect of the invention;
• 4 in a flowchart an embodiment of an aspect of the invention;
• 5 in a flowchart an embodiment of a further aspect of the invention;
• 6 in a flowchart a second embodiment of the further aspect of the invention;
• 7 in a flowchart a third embodiment of the further aspect of the invention;
• 8th in a flowchart a fourth embodiment of the further aspect of the invention;

Embodiments of the invention relate to a method for aggregating information in a distributed computing system. Such a distributed computing system is in 1 sketched. A first computing unit 10 communicates with distal further computing units 20, 30, 40. The first computing unit 10 receives a message 200 (see 2 ). To correctly process the message 200, the first computing unit 10 communicates with the further computing units 20, 30, 40, as described in connection with the other figures.

2a shows an exemplary structure of a message 200. In the exemplary embodiment, the message 200 consists of a header 210 and a message content (“payload”). In the exemplary embodiment, the message content 220 contains a keyword 221 followed by an identifier 222. The keyword 221 can be used to identify the identifier 222. Depending on the value of the identifier 222, the first computing unit 10 can decide which of the distal computing units 20, 30, 40 it communicates with.

In particular, it is possible that the identifier 222 is assigned to an entity 301...308 from a plurality of entities, which is arranged in a hierarchically arranged data structure 300 comprising entities 301...308. This data structure 300 is in 2 B illustrated as a tree. In the data structure, the relation between a child node 301, 302, 303 and an associated parent node 304 corresponds to an “is a” relation. Advantageously, based on the entity 301...308 assigned to the identifier 222, a sequence of the distal computing units 20, 30, 40 with which communication takes place is determined. Advantageously, a subordinate node takes over the assigned sequence of the node to which it is subordinate and, if necessary, adds one or more additional distal computing units 20, 30, 40. Alternatively or additionally, it is also possible for a query to a computing unit 20, 30, 40 to be replaced by a determination within the first computing unit 10.

3 shows an example of a further aspect of the invention. It is possible for one or more of the distal computing units 20, 30, 40 and/or the first computing unit 10 to determine values based on calculation rules that are based on (possibly time-varying) values of a calculation parameter ω. It can now be provided that this calculation parameter ω is stored on a further computing unit 50, which is advantageously arranged distally from the distal computing units 20, 30, 40 and/or the first computing unit 10. Such a distal arrangement has the advantage, for example, that this further computing unit 50 can be designed specifically for queries from the distal computing units 20, 30, 40 and/or the first computing unit 10. The computing unit 50 can be set up to query the value of the calculation parameter ω from a predeterminable data source.

The further computing unit 50 can be set up to return the value of the calculation parameter ω not only at a singular point in time, but over a predeterminable time interval. The predeterminable time interval can be transmitted together with the request for the calculation parameter ω, or can be read by the computing unit 50 from a dedicated memory location. If the value of the calculation parameter ω varies over time, it is possible that, starting from a reference time t ₀ (which can, for example, correspond to a time when a request is received by the further computing unit 50, or alternatively is transmitted with the request), the calculation parameter ω changes over time averaged value over a predeterminable time interval corresponds to the time before the reference time t ₀ . Alternatively or additionally, it is possible for the value of the calculation parameter ω to be updated linearly in a time interval after the reference time t ₀ , for example constant with the value of the calculation parameter ω at the reference time t ₀ .

4 illustrates, by way of example, a flowchart of a sequence of the method in the first computing unit 10 according to a possible embodiment. The method starts in step 100. Then (101) the first computing unit 10 receives the message 200. Then (102) the first computing unit 10 extracts the identifier 222 from the message 200 and the necessary sequence of queries assigned to the identifier 222. Now (103) the distal computing units 20, 30, 40 are as in the following 5-8 illustrated according to the assigned sequence queried in parallel and/or serially and the answers received. The received responses from the distal computing units 20, 30, 40) are consolidated (104) and a result is synthesized (105) depending on the responses. This ends the procedure. Here and in the exemplary embodiments presented below, it is possible for content to be extracted from the payload of the message 200

5 illustrates by way of example a possible sequence of queries in step 103. A first query (1031) is carried out in parallel with a serial combination of a second query (1032) and a third query (1033) and further in parallel with a third query (1034). Advantageously, the first query (1031), second query (1032), third query (1033) and fourth query (1034) are each carried out to a distal computing unit 20 assigned to this respective query (1031, 1032, 1033, 1034), in particular uniquely assigned, 30, 40.

6 illustrates an example of a further possible sequence of queries in step 103. Here, no query is carried out on distal computing units (20, 30, 40). Instead, a surrogate query (1040) is carried out within the first computing unit 10 in order to synthesize the answers necessary to determine the result. The surrogate query (1040) can, for example, contain that compared to the one in 5 In the embodiment shown, a respective response from the distal computing units (20, 30, 40) is not determined by query (1031, 1032, 1033, 1034) and receiving the response, but instead, in particular without a query to the respective distal computing units 20, 30, 40 , is appreciated. Alternatively, the surrogate query (1040) can also return a specifiable value.

7 illustrates by way of example an even further possible sequence of queries in step 103. Parallel to the first query (1031), the surrogate query (1040) is carried out here, which in the exemplary embodiment is compared to that in 5 illustrated embodiment, the second request (1032), third request (1033) and fourth request (1034) analogous to that in 6 illustrated embodiment replaced.

8th illustrates by way of example an even further possible sequence of queries in step 103, which is again compared to that in 5 illustrated embodiment is shown. Instead of the first query (1031), the surrogate query (1040) is executed here, which repeats the first query (1031) analogously to that in 6 illustrated embodiment replaced.

QUOTES INCLUDED IN THE DESCRIPTION

This list of documents listed by the applicant was generated automatically and is included solely for the better information of the reader. The list is not part of the German patent or utility model application. The DPMA assumes no liability for any errors or omissions.

Cited patent literature

• EP 3484186 B1 [0002]
• DE 102019201231 A1 [0003]

Claims (19)

Method for routing at least one information request, preferably a plurality of information requests, in a system comprising a plurality of network participants (10, 20, 30, 40) which are connected via at least one data transmission system (11), the at least one information request from at least one first network participant (10) who has received a first message (200), and wherein the routing is determined depending on a payload (220) of the first message (200). Procedure according to Claim 1 , whereby the routing is carried out depending on an identifier (222) contained in the payload (220). Procedure according to Claim 2 , whereby the identifier (222) is determined based on a keyword (221) preceding the identifier (222) in the payload (220). Procedure according to one of the Claims 2 or 3 , wherein the identifier (222) is assigned to an entity (301, ..., 308) from a hierarchically arranged data structure (300) comprising a plurality of entities (301, ..., 308). Procedure according to Claim 4 , wherein the entities (301, ... 308) are arranged in the hierarchically arranged data structure (300) in the form of a tree. Procedure according to Claim 5 , where the relation between a child entity and a parent entity is an “is a” relation. Procedure according to one of the Claims 4 until 6 , where the routing that is assigned to the subordinate entity includes all network participants (20, 30, 40) as routing destinations that are also assigned to the superior entity. Procedure according to Claim 7 , whereby additional network participants are inserted as routing destinations in the routing that is assigned to the subordinate entity compared to the routing that is assigned to the parent entity. Method according to one of the preceding claims, wherein the routing comprises a predeterminable sequence (in particular with a predeterminable order) of information requests to network participants predetermined by the routing. Method according to one of the preceding claims, wherein a response to the information request to be transmitted back to the first network participant (10) depending on a payload of the information request is determined and received by the first network participant (10). Method according to one of the preceding claims, wherein the payload of the information request is determined depending on the payload of the first message (200). Procedure according to Claim 11 , where the payload of the information request includes the payload of the first message (200). Method according to one of the preceding claims, wherein the routing comprises a plurality of network participants, to whom a plurality of information requests are transmitted in parallel, in particular from the first network participant. Method according to one of the preceding claims, wherein the routing comprises a plurality of network participants to whom the same information request is transmitted consecutively. Procedure according to Claim 14 , wherein the routing includes that this information request is transmitted to a first network participant of the plurality of network participants, who transmits this information request, in particular enriched with information determined by it, to a second network participant of the plurality of network participants. Procedure according to Claim 14 or 15 , whereby a last network participant of this plurality of network participants then transmits feedback dependent on the information determined by the plurality of network participants back to the first network participant (10). Computer program that is set up to carry out the procedure according to one of the Claims 1 until 16 to carry out. Network participant (10), which is set up to use the method according to one of the Claims 1 until 14 to carry out. Network system comprising the network participant (10). Claim 18 , which are set up, the procedure according to one of the Claims 15 until 16 to carry out.

Images