Process for transmitting data packets of predefinable priority classes using ethernet from a first device to at least one other device

• US 6,519,263 B1
• Filed: 08/10/1998
• Issued: 02/11/2003
• Est. Priority Date: 03/08/1996
• Status: Expired due to Term

• Current Assignee: Lux Lighting S.A.R.L.
• Original Assignee: Siemens AG
• Inventors: Huth, Hans-Peter
• Primary Examiner(s): Holloway, III, Edwin C.
• Application Number:
  US09/117,942
• Time in Patent Office: 1,646 Days
• Field of Search: 370/444, 370/443, 370/439, 370/413, 370/452, 340/825.1, 340/3.6
• US Class Current: 370/444
• CPC Class Codes: H04L 12/40163 by assigning priority to messages according to a message field
• CPC Class Codes: H04L 12/413 with random access, e.g. carrier-sense multiple-access with collision detection [CSMA-CD]
• CPC Class Codes: H04L 47/2416 Real-time traffic
• CPC Class Codes: H04L 47/2433 Allocation of priorities to traffic types
• CPC Class Codes: H04L 49/205 Quality of Service based
• CPC Class Codes: H04L 49/351 for local area network [LAN], e.g. Ethernet switches

Abstract

In the method, at least one timing message is generated by a first arrangement at predefinable time intervals and is transmitted to at least a second arrangement. The timing message contains a synchronization method, as a function of which time intervals which are provided for the transmission of data packets (DP) each having a predefinable priority class are determined. After reception of the timing message, the received timing message is evaluated, a synchronization time being determined, as a function of which the time intervals which are provided for the transmission of data packets each having a predefinable priority class are determined.

Claims

1. A method for transmitting data packets with predefinable priority classes in a network from a first arrangement to at least one second arrangement, comprising:

generating at least one timing message by the first arrangement at predefinable time intervals and transmitting the at least one timing message to at least the second arrangement which is coupled to the first arrangement;

determining timing intervals as a function of a synchronization message in the at least one timing message, the timing intervals being provided for transmitting data packets each with a predefinable priority class;

receiving the timing message by the at least one second arrangement;

evaluating the received timing message, a synchronization time being determined as a function of which the timing intervals, which are provided for the transmission of data packets each having a predefinable priority class, are determined; and

reserving, for a communications connection which has any desired number of data packets to be transmitted, predefinable resources for the communications connection at a beginning of the communications connection as a function of the time intervals.

2. The method as claimed in claim 1, wherein a data packet is transmitted only in a time interval which is provided for a priority class which has been assigned to the data packet.

3. The method as claimed in claim 1, wherein a respective data packet to be transmitted is assigned one of at least two priority classes, wherein the respective data packet is unambiguously marked according to the priority class, and wherein the respective data packet is transmitted to the second arrangement taking into account the priority class assigned to the data packet.

4. The method as claimed in claim 3, wherein the respective data packet is received by the second arrangement, wherein the priority class assigned to the respective data packet is determined, and wherein the respective data packet is further transmitted taking into account the priority class assigned to the data packet.

5. The method as claimed in claim 3, wherein information contained in the respective data packet relating to at least one of a type of data packet and a communications connection to which the data packet is assigned, is analyzed, and wherein the assignment of the priority class is made taking into account the information.

6. The method as claimed in claim 1, wherein an access check is carried out for at least one data packet.

7. The method as claimed in claim 1, wherein signaling relating to a communications connection to which a respective data packet is assigned is carried out between the first and second arrangements with which the method is carried out and which are connected to one another, before the transmission of the respective data packet takes place.

8. The method as claimed in claim 3, wherein at least each priority class is assigned at least a part of a buffer, and wherein the respective data packet is stored only in the part of the buffer which is assigned to a priority class which was also assigned to the respective data packet.

9. The method as claimed in claim 8, wherein at least one of a number of stored data packets in the buffer and a number of stored data packets at least in a part of the buffer is determined, the part of the buffer being assigned to a priority class, and wherein only a data packet is stored which has a corresponding priority class with which the data packets stored in the buffer are output and transmitted in a predefinable sequence.

10. The method as claimed in claim 9, wherein a sequence is defined by the priority classes such that the data packets in the sequence are output and transmitted according to decreasing priority of the data packets.

11. The method as claimed in claim 9, wherein the sequence is defined by a predefinable scheduling method.

12. The method as claimed in claim 8, wherein when the buffer or at least a part of the buffer is completely filled with stored data packets which have not yet been read out, and when a further data packet to be transmitted is to be stored in the buffer or at least in the part of the buffer, an artificial collision is generated and information regarding the artificial collision is conveyed to the arrangement transmitting the data packet.

13. The method as claimed in claim 12, wherein an artificial collision is generated only if the data packet contains information that the generation of an artificial collision is permitted for the arrangement transmitting the data packet.