Data network and a process for real time transmission of data packets in a data network

• US 5,802,060 A
• Filed: 12/01/1995
• Issued: 09/01/1998
• Est. Priority Date: 12/23/1994
• Status: Expired due to Fees

• Current Assignee: Koninklijke Philips N.V.
• Original Assignee: Hewlett-Packard Company (HP Inc.)
• Inventors: Fischbach, Juergen, Kuhn-Wettemann, Beate, Greiner, Harald
• Primary Examiner(s): Ton, Dang
• Application Number:
  US08/565,968
• Time in Patent Office: 1,005 Days
• Field of Search: 370/85.4, 370/85.5, 370/94.1, 370/94.2, 370/94.3, 370/60, 370/60.1, 370/61, 370/444, 370/447, 370/449, 370/450, 370/451, 370/403, 370/404, 370/405, 370/452, 370/455, 370/460, 370/461, 370/389
• US Class Current: 370/444
• CPC Class Codes: H04L 12/433 with asynchronous transmission, e.g. token ring, register insertion

Abstract

A data network comprises a plurality of spatially distributed stations whose access to the network is controlled by a token. In a process for real-time transmission of data packets through the data network, the following steps are carried out in each of the stations: assigning a priority step to each data packet to be transmitted depending on the dwell time of the data packet in the station, and summing up the data amounts of the respective data packets having the same priority step; reserving in the token, send capacity required for transmitting data packets, said reservation being effected in dependence upon the send capacity available, the priority and the data amount of the data packets to be transmitted from this station, and information which is contained in the token and which concerns the priority and the data amount of data packets to be transmitted from other stations; and transmitting the data packets corresponding to the reserved send capacity when the token is next received.

Claims

1. A process for real-time transmission of data packets in a data network comprising a plurality of spatially distributed stations whose access to the data network is controlled by a token, the following steps being carried out in each of said stations:

1.1 assigning a priority step (0. . . N-1) to each data packet to be transmitted depending on a dwell time of the data packet in a station and summing up data amounts of respective data packets having a same priority step;

1.2 reserving in the token, send capacity required for transmitting of data packets to be transmitted, said reserving being effected in dependence upon an available send capacity, the priority and a data amount of the data packets to be transmitted from this station, and information which is contained in the token and which concerns the priority and the data amount of data packets to be transmitted from other stations; and

1.3 transmitting the data packets to be transmitted corresponding to the reserved send capacity when the token has been received a next time.

3. A process according to claim 1, wherein the dwell time of the data packet in a station includes a maximum allowable delay of the data packet in the station, the priority step (0. . . N-1) being assigned to the data packet on the basis of a priority function having a stair-shaped characteristic, wherein priority steps occur at predetermined dwell times.

2. A process for real-time transmission of data packets in a data network comprising a plurality of spatially distributed stations whose access to the data network is controlled by a token, the following steps being carried out in each of said stations:

2.1 receiving in one station, the token from a preceding station, the content of said token indicating a total send capacity (T_free) as well as data amounts (T₀ . . . T_N-1) of data packets of all stations with the respective priority steps (0. . . N-1), transmitting data packets contained in a transmit queue, increasing the total send capacity (T_free) by a send capacity value (S_last) determined in a preceding token circulation cycle, reducing the data amounts (T₀ . . . T_N-1) of said data packets of all stations having the respective priority steps by one data quantity value (S₀ . . . S_N-1) of one priority step, said data quantity value being determined in the preceding token circulation cycle, and resetting the send capacity value (S_last) and the data quantity value (S₀ . . . S_N-1);

2.2 assigning a priority step to each data packet to be transmitted depending on a dwell time of a data packet in the one station and summing up the data amounts of the respective data packets having the same priority step;

2.3 starting with a highest priority step;

2.3.1 examining whether sufficient send capacity (M) is available for a data amount (S_step) of this priority step in the one station;

2.3.2 if yes, reducing available send capacity (M) by the data amount (S_step) of said one station, increasing the send capacity value (S_last) by the data amount (S_step) of said one station, reducing the available send capacity (M) by the data amount (T_step) of data packets of all stations of this priority step, and reducing the total send capacity (T_free) by the data amount (S_step) of said one station;

2.3.3 if no, examining whether there is still any send capacity (M) available;

2.3.3.1 if yes, reducing available send capacity (M) by part of data amount (S_step,max.) of said one station until send capacity (M) no longer exists, increasing the capacity value (S_last) by said part of the data amount (S_step,max) of said one station, increasing the data amount (T_step) of data packets of all stations having this priority step by the residual data amount (S_step,rest), and reducing the total send capacity (T_free) by said part of the data amount (S_step,max.) of said one station;

2.3.3.2 if no, increasing the data amount (T_step) of said data packets of all stations having this priority step by the data amount (S_step) of said one station.

4. A process according to claim 2 comprising the following step prior to step 2.3:

determining the send capacity (M) on the basis of the total send capacity (T_free).

5. A process according to claim 2, wherein the total send capacity (T_free) in step 2.1 does not exceed a maximum value defined by the token circulation time.

6. A process according to claim 2, wherein the data packets are assigned to different classes, said classes being defined by a maximum allowable delay time and a maximum data packet magnitude, and an amount of data which can be transmitted in one class being the same for all stations or predetermined for each individual station.

7. A process according to claim 2, wherein the send capacity value (S_last) and the data quantity value (S₀ . . . S_N-1) are reset to zero.

8. A data network comprising a plurality of spatially distributed stations whose access to the network is controlled by a token, each of said stations comprising:

8.1 an assignment means for assigning a priority step (0. . . N-1) to each data packet to be transmitted, depending on a dwell time of the data packet in a station and for summing up the data amounts of data packets respectively having a same priority step;

8.2 reservation means for reserving in the token, send capacity required for transmitting data packets, said reserving being effected in dependence upon an available send capacity, a priority and data amount of each of the data packets to be transmitted from this station, and information which is contained in the token and which concerns the priority and the data amount of data packets to be transmitted from other stations; and

8.3 transmitting means for transmitting the data packets to be transmitted corresponding to the reserved send capacity when the token has is next received.

11. A data network according to claim 8, wherein the dwell time of the data packet in a station includes a maximum allowable delay of the data packet in the station, the priority step (0. . . N-1) being assigned to the data packet on the basis of a priority function having a stair-shaped characteristic, wherein priority steps occur at predetermined dwell times.

9. A data network comprising a plurality of spatially distributed stations whose access to the network is controlled by a token, each of said stations comprising:

9.1 token receiving means in a one station for receiving the token from a preceding station, the content of said token indicating a total send capacity (T_free) as well as data amounts (T₀ . . . T_N-1) of data packets of all stations with respective priority steps (0. . . N-1),

9.2 a transmitting means in said one station for transmitting data packets contained in a transmit queue,

9.3 total send capacity calculation means for increasing a total send capacity value (T_free) by a send capacity value (S_last) determined in a preceding token circulation cycle, for reducing data amounts (T₀ . . . T_N-1) of data packets of all stations having the respective priority steps by one data quantity value (S₀ . . . S_n-1 of one priority step, said data quantity value being determined in a preceding token circulation cycle, and for resetting the send capacity value (S_last) and the data quantity value (S₀ . . . S_N-1);

9.4 priority determination means for assigning a priority step to each data packet to be transmitted depending on a dwell time of the data packet in the one station and for summing up the data amounts of the respective data packets having the same priority step;

said priority determination means carrying out the following steps, starting with a highest priority step;

10. 4.1 examining whether sufficient send capacity (M) is available for a data amount (S_step) of this priority step in said one station;

9.4.2 if yes, reducing the available send capacity (M) by the data amount (S_step) of said one station, increasing the send capacity value (S_last) by the data amount (S_step) of said one station, and reducing the available send capacity (M) by the data amount (T_step) of data packets of all stations of this priority step, and reducing the total send capacity (T_free) by the data amount (S_step) of said one station;

9.4.3 if no, examining whether there is still any send capacity (M) available;

9.4.3.1 if yes, reducing the available send capacity (M) by part of a data amount (S_step max.) of said one station until send capacity (M) no longer exists, increasing the capacity value (S_last) by said part of the data amount (S_step,max.) of said one station, increasing the data amount (T_step) of data packets of all stations having this priority step by a residual data amount (S_step,rest), and reducing a total send capacity (T_free) by said part of the data amount (S_step,max.) of said one station;

9.4.3.2 if no, increasing the data amount (T_step) of data packets of all stations having this priority step by the data amount (S_step) of said one station.