Method for constructing optimal time-controlled paths in a large computer network

Patent metadata

Field	Value
Publication number	US-9860191-B2
Application number	US-201314410503-A
Country	US
Kind code	B2
Filing date	Apr 19, 2013
Priority date	Jun 25, 2012
Publication date	Jan 2, 2018
Grant date	Jan 2, 2018

Abstract

Embodiments of the invention relate to the dynamic creation of TT paths in a large computer network having computer nodes, communication channels, and distribution modules (DMs), which all have access to a global time base, wherein a scheduling instance, aimed at establishing a time-controlled path with specified path time characteristics from a transmitting to a receiving node along an existing virtual connection (VC), requests from each DM in the VC all the TT path descriptor lists (TTPDLs) confirmed by said DMs, then transmits the specified path time characteristics and all confirmed TTPDLs to a dynamic scheduler that creates a new TTPDL for each DM in the VC, the existing reserved TTPDLs of the DMs affected remaining unchanged, wherein the corresponding new TTPDLs are transmitted to each DM in the VC, and wherein each DM in the VC reserves the TT path requested and confirms the reservation to the scheduling instance.

First claim

The invention claimed is:

1. A method for the dynamic creation of time-controlled (TT) paths in a large computer network consisting of a plurality of computer nodes, distribution modules and communication channels, wherein all distribution modules have access to a global time base,
characterised in that
a scheduling instance, which is aimed at establishing a time-controlled path with specified path time characteristics from a transmitting computer node (SRK) to a receiving computer node along an existing virtual connection, firstly, by means of a request message, requests from each distribution module arranged in the virtual connection all the TT path descriptor lists (TTPDLs) already confirmed by said distribution modules, then transmits the specified path time characteristics and all confirmed TTPDLs to a dynamic scheduler, and wherein the dynamic scheduler creates a new TTPDL for each distribution module arranged in the virtual connection, wherein the existing reserved TTPDLs of the distribution modules affected remain unchanged, and wherein the corresponding new TTPDLs are transmitted to each distribution module arranged in the virtual connection, wherein each distribution module arranged in the virtual connection reserves the TT path requested and confirms the successful reservation to the scheduling instance by means of a confirmation message, and wherein following the transient failure and restart of a distribution module during a specified reintegration interval, the distribution module does not perform a new reservation, and wherein all scheduling instances transmit, to the distribution modules affected, their confirmed active and passive reservations periodically with a period that is smaller than the reintegration interval.

2. The method according to claim 1 , characterised in that a reservation of a TT path in a distribution module is performed for a future reservation interval with specified start point and end point.

3. The method according to claim 1 characterised in that a reservation of a TT path in a distribution module at a given moment in time can be active or passive, wherein a switchover from the passive to the active state and vice versa is triggered by an activation message to the distribution module affected.

4. The method according to claim 1 , characterised in that following the request to a distribution module to transmit all confirmed TTPDLs to a scheduling instance, a reservation timeout is started in the distribution module, during which no further requests of this type may be handled.

5. The method according to claim 1 , characterised in that the failure of a distribution module is identified by the absence of the alive messages to be transmitted periodically by the distribution module.

6. The method according to claim 1 , characterised in that the construction of a time-controlled path is performed by the distribution module, which is directly connected to the SRK.

7. The method according to claim 1 , characterised in that the communication between the scheduling instance and the distribution modules is secured by cryptographic methods.

8. A scheduling instance for use in a method according to claim 1 .

9. The scheduling instance according to claim 8 , characterised in that it is configured as a transmitting computer node, as a distinguished distribution module, as a system administrator or as another selected computer node, or characterised in that the function thereof is performed by the transmitting computer node, a distinguished distribution module, a system administrator or another selected computer node.

10. A scheduler for use in a method according to claim 1 .

11. The scheduler according to claim 10 , characterised in that the scheduler and a scheduling instance according to claim 1 are provided in common hardware.

12. The scheduler according to claim 10 , characterised in that the scheduler is formed separately from a scheduling instance.

13. The scheduler according to claim 12 , characterised in that the functions thereof are provided in a cloud of the computer network.

14. A computer network, in particular a large computer network consisting of a plurality of computer nodes, distribution modules and communication channels, wherein all distribution modules have access to a global time base, for carrying out a method according to claim 1 .

Assignees

• Fts Computertechnik Gmbh

Inventors

• Kopetz Hermann

Classifications

• H04L41/5096

  wherein the managed service relates to distributed or central networked applications · CPC title

• G06F9/5072 Primary

  Grid computing · CPC title

• H04L47/783 Primary

  Distributed allocation of resources, e.g. bandwidth brokers · CPC title

• G06F2209/5014

  Reservation · CPC title

• H04L47/72

  using reservation actions during connection setup · CPC title