A METHOD TO IMPROVE THE QUALITY OF SERVICE IN A COMPUTER NETWORK

Abstract

A method to improve the quality of service in a computer network consisting of nodes and starcouplers and/or access points and wireless and/or wired connections, by changing a current configuration (CUR_CONF) of the computer network to a new configuration (NEW_CONF) of the computer network, whereby—the computer network in the current configuration (CUR_CONF) communicates one message or a multitude of messages (1101a, 1101b, 1101c, 1102a, 1102b) and—a monitor (M) observes at least some traffic pattern (TP) that the message or multitude of messages (1101a, 1101b, 1101c, 1102a, 1102b) generate and—an extractor (E) formulates the traffic pattern (TP) of the message or multitude of messages (1101a, 1101b, 1101c, 1102a, 1102b) and—the extractor (E) following said analysis generates one or many traffic parameters (T_PAR) to the message or multitude of messages (1101a, 1101b, 1101c, 1102a, 1102b) and—an optimizer (O) uses the traffic parameters (T_PAR) to generate the new configuration (NEW_CONF) and/or to generate recommendations (RE-COM) for a new configuration (NEW_CONF).

Claims

1. A method to improve the quality of service in a computer network consisting of nodes and starcouplers and/or access points and wireless and/or wired connections, the method comprising: changing a current configuration (CUR_CONF) of the computer network to a new configuration (NEW_CONF) of the computer network, wherein: the computer network in the current configuration (CUR_CONF) communicates one message or a multitude of messages (1101a, 1101b, 1101c, 1102a, 1102b), a monitor (M) observes at least some traffic pattern (TP) that the message or multitude of messages (1101a, 1101b, 1101c, 1102a, 1102b) generate, an extractor (E) formulates the traffic pattern (TP) of the message or multitude of messages (1101a, 1101b, 1101c, 1102a, 1102b), the extractor (E) following said analysis generates one or many traffic parameters (T_PAR) to the message or multitude of messages (1101a, 1101b, 1101c, 1102a, 1102b), and an optimizer (O) uses the traffic parameters (T_PAR) to generate the new configuration (NEW_CONF) and/or to generate recommendations (RECOM) for a new configuration (NEW_CONF).

2. The method of claim 1, wherein the computer network in a current configuration (CUR_CONF) communicates a subset (1101a, 1101b, 1101c, 1102a, 1102b) of the messages (1101a, 1101b, 1101c, 1102a, 1102b) according an unsynchronized communication paradigm and the monitor (M) observes the traffic pattern (TP) of said set of unsynchronized messages (1101a, 1101b, 1101c, 1102a, 1102b) and the extractor (E) analyses said traffic pattern (TP) and the extractor (E) assigns one parameter or a multitude of parameters to said unsynchronized messages (1101a, 1101b, 1101c, 1102a, 1102b) and the optimizer (O) uses the traffic parameters (T_PAR) to generate a new configuration (NEW_CONF) in which a unsynchronized message or a multitude of unsynchronized messages (1101a, 1101b, 1101c) are communicated according a time-triggered communication paradigm at least through a part of the computer network.

3. The method of claim 1, wherein the optimizer (O) executes one or a multitude of the following optimization steps: modifying the priorities with which messages are forwarded by starcouplers, modifying the routes of messages through a network (i.e., a message will be sent along a different path), encrypting or decrypting messages or parts of messages, stop to encrypt/decrypt messages or parts of messages, modifying the communication speed with which messages are communicated on the communication links 110, packing of several messages into a single message, splitting a single message in several messages, and modifying the contents of a message or a multitude of messages.

4. A starcoupler (203) connected to a distributed computer network, wherein the starcoupler (203) implements a monitor (M) function in accordance with the method of claim 1.

5. A network element (EX-OPT) connected to a distributed computer network, wherein the element (EX-OPT) communicates with at least one monitor (M) in the computer network and executes an extractor (E) function according to the method of claim 1.

6. A network element (EX-OPT) connected to the computer network, wherein the element (EX-OPT) communicates with at least one monitor (M) in the computer network and executes an optimizer (O) function according to the method of claim 1.

7. The method of claim 3, wherein the step of encrypting or decrypting messages or parts of messages comprises modifying the encryption key used for encryption of messages or parts of messages.

8. The method of claim 3, wherein in the step of modifying the communication speed with which messages are communicated, the communication links comprise wireless communication.

Description

BRIEF DESCRIPTION OF FIGURES

[0029] The invention will be explained hereinafter in greater detail on the basis of the drawing. In the drawings

[0030] FIG. 1 depicts a computer network in accordance to the state of the art,

[0031] FIG. 2 depicts another computer network according to the state of the art,

[0032] FIG. 2a depicts an exemplary flowchart of traffic as communicated in the network depicted in FIG. 2,

[0033] FIG. 3 depicts with the help of a flowchart monitoring, extracting, and optimizing of traffic in a computer network,

[0034] FIG. 4 shows an exemplary network with a monitor,

[0035] FIG. 5 gives an example of an extractor with its input and output,

[0036] FIG. 6 gives an example of an optimization with the help of a time diagram,

[0037] FIG. 7 gives an example of time-triggered communication with the help of a time diagram (state of the art),

[0038] FIG. 8 gives another example of time-triggered communication similar to FIG. 7 and

[0039] FIG. 9 gives an exemplary realization of an integrated extractor and optimizer within a network.

[0040] FIG. 1 depicts an example of a computer network with nodes 101-105 that are connected with wired communication links 110, preferably bi-directional communication links, to a starcoupler 201. The nodes 101-105 exchange messages with each other, by sending the messages to the starcoupler 201, which then forwards the messages to the respective receivers. Furthermore, the starcoupler 201 may generate messages on its own and transmit these messages to the nodes 101-105.

[0041] FIG. 2 depicts an example of a computer network in which multiple starcouplers 203, 205, 207 are connected to each other and the nodes 101-105 in the network are connected only to a subset of the starcouplers 203, 205, 207. The communication of two nodes may involve two or more starcouplers 203, 205, 207.

[0042] FIG. 2a depicts a flowchart of an example how messages are communicated in the network depicted in FIG. 2 that is configured according a current configuration CUR_CONF. The flowchart depicts nodes 101 and 102 sending messages 1101a, 1101b, 1101c, of length 1101_LENGTH containing a message identifier 1101 and messages 1102a, 1102b of length 1102_LENGTH containing a message identifier 1102 to the starcoupler 203. Starcoupler 203 forwards the messages to starcoupler 205. Starcoupler 205 forwards the messages to starcoupler 207. Finally, starcoupler 207 forwards the messages to the receiving node 104. Messages 1101a, 1101b, 1101c are part of the same flow of messages. Furthermore, 1101a, 1101b, 1101c are periodic, meaning that node 101 is configured to send the messages sequentially with a temporal distance of P1101 timeunits apart from each other. Analogously, messages 1102a and 1102b are part of the same flow of messages. Also, messages 1102a and 1102b are periodic, meaning that node 102 is configured to send the messages sequentially with a temporal distance of P1102 timeunits apart from each other. As both nodes 101 and 102 are artificial entities, they are not capable of perfectly measuring time, thus, the message periods P1101 and P1102 may vary slightly. For example due to imperfect oscillators, node 102 may send its message 1102b not precisely P1102 after message 1102a, but already early after P1102r timeunits.

[0043] As depicted the points in time 1401a and 1402a of transmission of the respective messages 1101a and 1102a from nodes 101 and 102 occur close to each other such that the starcoupler 203 needs to serialize the messages when forwarding them to starcoupler 205. As it happens in this scenario, message 1101a is received slightly before 1102a and, thus, the starcoupler forwards 1101a at first, immediately followed by message 1102a.

[0044] As depicted, the next message 1101b from node 101 is sent at 1401b. When the message is received by node 104 the observed duration between the reception of message 1101a and 1101b is equal to the duration P1101.

[0045] As depicted, the next message 1101c from node 101 is sent at 1401c. At about the same point in time (at 1402b) also node 102 sends a message 1102b (P1102r timeunits after its preceding message 1102a). As this time message 1102b is received slightly earlier than message 1101c, the starcoupler 203 forwards the message 1102b before message 1101c. Consequently, node 104 receives message 1101c at a point in time P1101+J1101 timeunits after the previously receive message 1101b.

[0046] Hence, the indeterministic ordering of messages 1101a, 1102a, 1101c, 1102b leads to a communication jitter J1101 and potential increase of latency (of J1101) of the flow of messages 1101a, 1101b, 1101c. As depicted in this example the jitter J1101 is equal the length of the message length 1102b. Hence, with growing length of message 1102b also the jitter and latency of the message flow from node 101 increases directly and proportionally.

[0047] FIG. 3 depicts the principle of the invention: in a computer network messages are communicated between nodes and/or starcouplers, where the messages are transmitted, forwarded, and received by the nodes/starcouplers following a current network configuration CUR_CONF. In such a computer network, a monitor M observes a subset of such messages. Of particular interest in this observation are temporal properties of the messages, e.g.: [0048] points in time when one, two, or more consecutive messages of the same flow, e.g. messages 1101a, 1101b, 1101c, are received at a node and/or starcoupler and/or multitude of nodes and/or starcoupler, [0049] points in time when one, two, or more consecutive messages of the same flow, e.g., messages 1101a, 1101b, 1101c, are forwarded by a starcoupler or a multitude of starcouplers, [0050] the relation of one, two, or more reception/forwarding points in time of messages belonging to two or more different flows, [0051] the message length of one, two, or more messages.

[0052] The monitor M formulates traffic patterns TP based on these observations and provides these traffic patterns TP as input to an extractor E. The extractor E generates one or a multitude of traffic parameters T_PAR for said messages, e.g., messages 1101a, 1101b, 1101c. Such traffic parameters T_PAR are for example: [0053] message length(s), [0054] classification of said messages into: periodic, sporadic, quasi-periodic messages, etc., [0055] message periods of said message(s), [0056] variance in the estimation of the period of said message(s), and/or [0057] estimated minimum inter-arrival time of said message(s) and their variances.

[0058] Based on the traffic parameters T_PAR an optimizer O generates either a new network configuration NEW_CONF with improved QoS and/or provides recommendation RECOM to the user of the computer network how to improve QoS.

[0059] FIG. 4 depicts an example realization of a monitor M. In this example starcoupler 203 implements a function MONITOR1 that observes the arrival points in time and the message lengths of messages on the ports PORT1, PORT2, PORT3. The observed information is available to the MONITOR1 via information channels 2110 from the ports PORT1, PORT2, PORT3. In an exemplary realization these information channels 2110 may be implemented using hardware registers, shared memories, or similar techniques. MONITOR1 is thus able to collect information of the messages transmitted from the nodes 101, 102, 103 to the starcoupler 203. For example, given the flowchart in FIG. 2a, the monitor MONITOR1 can learn the send points in time 1401a, 1401b, 1401c, 1402a, 1402b, of the messages 1101a, 1101b, 1101c, 1102a, 1102b. In this example said points in time, the message identifiers 1101, 1102, and message lengths form the traffic pattern TP that is handed to the extractor E.

[0060] FIG. 5 depicts an example application of an extractor E. In this example, the extractor E takes as input the traffic pattern TP from the monitor as described in FIG. 4. I.e., the extractor E takes as input the send points in time 1401a, 1401b, 1401c, 1402a, 1402b, of the messages 1101a, 1101b, 1101c, 1102a, 1102b, the message identifiers 1101, 1102 and the message lengths. For each message as identified by the message identifier 1101, 1102, the extractor produces a set of parameters T_PAR, comprising for example:

TABLE-US-00001 Message Message Identifier Length Message Class Message Period 1101 1101_LENGTH periodic 1101_PER 1102 1102_LENGTH periodic 1102_PER

[0061] While the message lengths 1101_LENGTH, 1102_LENGTH can be directly measured by the monitor, the message periods 1101_PER, 1102_PER need to be calculated by the extractor E from the send points in time 1401a, 1401b, 1401c, 1402a, 1402b. For this calculation statistical functions can be used. An example of a simple statistical function is: [0062] 1. for each message identifier, subtract consecutive send points in time from each other: [0063] a. for messages identified by 1101: 1401b-1401a; 1401c-1401b; [0064] b. for messages identified by 1102: 1402b-1402a [0065] 2. for each message identifier, select the minimum value of the preceding subtractions as the message period [0066] a. for messages identified by 1101: [0067] 1101_PER=min(1401b-1401a; 1401c-1401b) [0068] b. for message identified by 1102: [0069] 1102_PER=1402b-1402a

[0070] FIG. 6 depicts an example application of an optimizer. In this example the optimizer improves the traffic as shown in the flowchart of FIG. 2a, in particular, the jitter of messages identified with message identifier 1101, by reconfiguring the network according a new configuration NEW_CONF. In this example, the new configuration NEW_CONF causes (parts of) the network to communicate messages identified by message identifier 1101 as time-triggered communication (a description of time-triggered communication is given in below in FIGS. 7 and 8).

[0071] The first part, until the transmission of message 1102b from node 102, the flowchart is identical to the one presented in FIG. 2a. However, in FIG. 6 the starcoupler 203 is implementing an optimization step in that it handles message 1101c as time-triggered message. In particular, this means that starcoupler 203 knows when message 1101c will arrive (because of the parameter set T_PAR calculated by the extractor E) and will not start to forward message 1102b as in FIG. 2a. On the contrary, the starcoupler 203 will wait for message 1101c to arrive and forward 1101c first, before message 1102b. The optimization step OPT is highlighted in FIG. 6. As depicted, 1101c is forwarded to starcouplers 205 and consequently also to starcoupler 207 and finally is received by node 104. As depicted the communication jitter J1101r is almost 0 in this scenario as opposed to the value J1101 in FIG. 2a.

[0072] Other examples of optimizations (not depicted) are: [0073] modifying the priorities with which messages are forwarded by starcouplers [0074] modifying the routes of messages through a network (i.e., a message will be sent along a different path) [0075] encrypting or decrypting messages or parts of messages [0076] modifying the encryption key used for encryption of messages or parts of messages [0077] stop to encrypt/decrypt messages or parts of messages [0078] modifying the communication speed with which messages are communicated on the communication links 110, e.g., in wireless communication examples [0079] packing of several messages into a single message [0080] splitting a single message in several messages [0081] modifying the contents of a message or a multitude of messages

[0082] FIG. 7 depicts a flowchart describing an example of time-triggered communication. In this example the nodes 101 and 102 as depicted in FIG. 1 exchange time-triggered messages 1102 and 1102 via the starcoupler 201 to the node 105. The defining characteristic of time-triggered communication is that the points in time of the transmission of the messages 1401, 1402 and/or the points in time of the forwarding of the messages 1403, 1404 are already known ahead in time of the transmission/forwarding of the messages. The points in time of transmission 1401, 1402 and/or the points in time of the forwarding 1403, 1404 of the messages can be assigned, e.g., already at the design time of the computer network. The points in time of transmission, forwarding, reception, or a subset of them are called the communication schedule. The synchronization of local clocks in nodes and starcouplers (and/or in access points) enables that the communication schedule in the nodes and/or starcoupler and/or access points is executed synchronously. Different synchronization protocols can be used to synchronize said local clocks, for example, existing synchronization standards are: SAE AS6802, IEEE 1588, and IEEE 802.1AS.

[0083] FIG. 8 depicts another flowchart of an example of time-triggered communication. In this example groups of messages 1601, 1602 are assigned to single points in time of transmission 1501, 1502 and points in time of forwarding 1503, 1504. As depicted in FIG. 4 the assignment of messages to groups 1601, 1602 is not changed as the messages are delivered through the network. However, this is not necessarily always the case. For example, a starcoupler 201 may implement only one point in time of forwarding 1503 and, when this point in time is reached, then forwarding all messages either belonging to group 1601 or group 1602. In general, the relation of messages to groups can vary for each node and/or starcoupler and/or access point.

[0084] FIG. 9 depicts a computer network consisting of nodes 101-105 and starcouplers 203, 205, 207. Furthermore FIG. 9 shows an example of an element EX-OPT that realizes the extractor E and the optimizer O function. Additionally the device may execute the optimizer function OPTIMIZE. Another realization would jointly implement the extractor and the optimizer functions in a node or a starcoupler. Other realizations implement the extractor and the optimizer in individual components, for example in different, nodes and/or starcouplers.