CA2301630A1 - Method and circuit arrangement for the transmission of message units in message streams of different priority - Google Patents
Method and circuit arrangement for the transmission of message units in message streams of different priority Download PDFInfo
- Publication number
- CA2301630A1 CA2301630A1 CA002301630A CA2301630A CA2301630A1 CA 2301630 A1 CA2301630 A1 CA 2301630A1 CA 002301630 A CA002301630 A CA 002301630A CA 2301630 A CA2301630 A CA 2301630A CA 2301630 A1 CA2301630 A1 CA 2301630A1
- Authority
- CA
- Canada
- Prior art keywords
- message
- queue
- groups
- wgn
- streams
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Abandoned
Links
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L47/00—Traffic control in data switching networks
- H04L47/50—Queue scheduling
- H04L47/52—Queue scheduling by attributing bandwidth to queues
- H04L47/525—Queue scheduling by attributing bandwidth to queues by redistribution of residual bandwidth
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L47/00—Traffic control in data switching networks
- H04L47/50—Queue scheduling
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L47/00—Traffic control in data switching networks
- H04L47/50—Queue scheduling
- H04L47/52—Queue scheduling by attributing bandwidth to queues
- H04L47/522—Dynamic queue service slot or variable bandwidth allocation
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L47/00—Traffic control in data switching networks
- H04L47/50—Queue scheduling
- H04L47/62—Queue scheduling characterised by scheduling criteria
- H04L47/621—Individual queue per connection or flow, e.g. per VC
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L47/00—Traffic control in data switching networks
- H04L47/50—Queue scheduling
- H04L47/62—Queue scheduling characterised by scheduling criteria
- H04L47/6215—Individual queue per QOS, rate or priority
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L47/00—Traffic control in data switching networks
- H04L47/50—Queue scheduling
- H04L47/62—Queue scheduling characterised by scheduling criteria
- H04L47/622—Queue service order
- H04L47/623—Weighted service order
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L47/00—Traffic control in data switching networks
- H04L47/50—Queue scheduling
- H04L47/62—Queue scheduling characterised by scheduling criteria
- H04L47/6285—Provisions for avoiding starvation of low priority queues
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L49/00—Packet switching elements
- H04L49/90—Buffering arrangements
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L49/00—Packet switching elements
- H04L49/90—Buffering arrangements
- H04L49/9036—Common buffer combined with individual queues
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04Q—SELECTING
- H04Q11/00—Selecting arrangements for multiplex systems
- H04Q11/04—Selecting arrangements for multiplex systems for time-division multiplexing
- H04Q11/0428—Integrated services digital network, i.e. systems for transmission of different types of digitised signals, e.g. speech, data, telecentral, television signals
- H04Q11/0478—Provisions for broadband connections
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L12/00—Data switching networks
- H04L12/54—Store-and-forward switching systems
- H04L12/56—Packet switching systems
- H04L12/5601—Transfer mode dependent, e.g. ATM
- H04L2012/5638—Services, e.g. multimedia, GOS, QOS
- H04L2012/5646—Cell characteristics, e.g. loss, delay, jitter, sequence integrity
- H04L2012/5651—Priority, marking, classes
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L12/00—Data switching networks
- H04L12/54—Store-and-forward switching systems
- H04L12/56—Packet switching systems
- H04L12/5601—Transfer mode dependent, e.g. ATM
- H04L2012/5678—Traffic aspects, e.g. arbitration, load balancing, smoothing, buffer management
- H04L2012/5679—Arbitration or scheduling
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L12/00—Data switching networks
- H04L12/54—Store-and-forward switching systems
- H04L12/56—Packet switching systems
- H04L12/5601—Transfer mode dependent, e.g. ATM
- H04L2012/5678—Traffic aspects, e.g. arbitration, load balancing, smoothing, buffer management
- H04L2012/5681—Buffer or queue management
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
- Communication Control (AREA)
Abstract
Message units belonging to message streams pass through a message stream-specific queue (Q1,......,Qm). Said queues are arranged in groups (WG1,...,WGn) in order to guarantee the throughput of the message streams in addition to ensuring that account is taken of priority. At least two of the groups at a time are arranged in a partner-group (PWG). The groups belonging to a partner group (PWG) are managed in such a way that if no message unit can be transmitted from one of the groups momentarily, the transmission opportunity is passed on from the group concerned to one of the other groups in that partner group (PWG).
Description
Method and circuit arrangement for the transmission of message units in message streams of different priority The invention relates to a method and a circuit arrangement as claimed in the precharacterizing clause of patent claim 1 and 4, respectively. Such a method and such a circuit arrangement are already known from Patent Application 197 05 789.6-31, which was not published before this.
This method and this circuit arrangement are intended to solve the problem of allowing the transmission lines in an ATM system and the buffer stores respectively associated with them to be utilized efficiently. To this end, the invention provides that, in the case of a buffer store which is filled to a specific level, when a message cell which is associated with a virtual connection of relatively high priority arrives on the respective transmission line, one or more of the message cells (which are currently stored in the buffer store) of a selected virtual connection of low priority is or are discarded as a function of the number of lower priority stored message cells for this virtual connection.
US Patent Specification 5,268,900 discloses a method for the transmission of message units which are associated with message streams of different priority and traffic class, jointly via one transmission channel, in which - the message units associated with the respective message stream each pass through a queue which is specific to the priority and traffic class, - the queues are combined on the basis of their traffic classes to form queue groups, AMENDED SHEET
GR 97 P 2266 P - lA-- the queue groups are each controlled by a separate queue control device in such a manner that queues are combined to form partner queue groups that are specific to the traffic class, where they have priorities that differ for the same traffic class.
K.Sriram, "Methodologies for bandwidth allocation, transmission scheduling, and congestion avoidance in broadband ATM networks", Computer Networks and ISDN 26, 1993, pages 43-59 discloses an operating strategy for message streams of different priority via a joint transmission channel, in which a plurality of queues are controlled on the basis of their priority in such a manner that one queue is exclusively prioritized with respect to the remaining queues, in that transmission of message units from one of the remaining message units is allowed only in the situation where no message units can be transmitted from this queue with maximum priority.
In contrast to this, the object of the present invention is now to describe a way in which a method and a circuit arrangement according to the precharacterizing clause of patent claim 1 and 4, respectively, can be formed, in order additionally to ensure throughput guarantees while taking account of priorities for the message streams.
In the case of a method and a circuit arrangement according to the precharacterizing clause of patent claim 1 AMENDED SHEET
and 4, respectively, this object is achieved by the method features and the circuit features specified in these patent claims.
The invention in this case results in the advantage that the following performance features can be provided with relatively little control complexity and with relatively little circuit complexity:
1. Individual minimum bit rates are guaranteed for each message cell stream irrespective of its priority.
This method and this circuit arrangement are intended to solve the problem of allowing the transmission lines in an ATM system and the buffer stores respectively associated with them to be utilized efficiently. To this end, the invention provides that, in the case of a buffer store which is filled to a specific level, when a message cell which is associated with a virtual connection of relatively high priority arrives on the respective transmission line, one or more of the message cells (which are currently stored in the buffer store) of a selected virtual connection of low priority is or are discarded as a function of the number of lower priority stored message cells for this virtual connection.
US Patent Specification 5,268,900 discloses a method for the transmission of message units which are associated with message streams of different priority and traffic class, jointly via one transmission channel, in which - the message units associated with the respective message stream each pass through a queue which is specific to the priority and traffic class, - the queues are combined on the basis of their traffic classes to form queue groups, AMENDED SHEET
GR 97 P 2266 P - lA-- the queue groups are each controlled by a separate queue control device in such a manner that queues are combined to form partner queue groups that are specific to the traffic class, where they have priorities that differ for the same traffic class.
K.Sriram, "Methodologies for bandwidth allocation, transmission scheduling, and congestion avoidance in broadband ATM networks", Computer Networks and ISDN 26, 1993, pages 43-59 discloses an operating strategy for message streams of different priority via a joint transmission channel, in which a plurality of queues are controlled on the basis of their priority in such a manner that one queue is exclusively prioritized with respect to the remaining queues, in that transmission of message units from one of the remaining message units is allowed only in the situation where no message units can be transmitted from this queue with maximum priority.
In contrast to this, the object of the present invention is now to describe a way in which a method and a circuit arrangement according to the precharacterizing clause of patent claim 1 and 4, respectively, can be formed, in order additionally to ensure throughput guarantees while taking account of priorities for the message streams.
In the case of a method and a circuit arrangement according to the precharacterizing clause of patent claim 1 AMENDED SHEET
and 4, respectively, this object is achieved by the method features and the circuit features specified in these patent claims.
The invention in this case results in the advantage that the following performance features can be provided with relatively little control complexity and with relatively little circuit complexity:
1. Individual minimum bit rates are guaranteed for each message cell stream irrespective of its priority.
2. A bit rate which exceeds the sum of the throughput guarantees is allocated strictly on the basis of the priority of the message cell streams, that is to say the message cell streams of high priority (1) are assigned first, and if there are none of these to be transmitted, only then are the message cell streams of lower priority (2) assigned.
3. If the minimum bit rate is not fully utilized by one of the message cell streams, then this bit rate can be made available to other message cell streams.
Advantageous refinements of the method according to the present invention result from the dependent claims which refer back to patent claim 1.
The present invention will now be described in more detail in the following text with reference to a drawing.
As an example, the drawing shows schematically a line device LE which is inserted between two transmission line sections L1 and L2 in an ATM system operating using an asynchronous transfer mode. In this case, the only circuit elements of the line device LE
which are shown are those which are required for understanding of the present invention. Furthermore, this line device is shown as being representative of other line devices inserted into transmission line sections in the ATM system.
In general, the following text does not describe the general ATM principle in any more detail, since this is well known.
Message cells occur on the transmission line section L1 and, in a known manner, have an external header in addition to an information part (user part) .
In this case, among other details, such an external header contains the association with a specific virtual connection. A virtual connection may either be a virtual channel connection (individual connection) or a virtual path connection (bundle of a plurality of individual connections). A virtual channel connection is in this case assigned a virtual channel number VCI
(virtual channel identifier) while, in contrast, a virtual path connection is assigned a virtual path number VPI (virtual path identifier) in the external header of the respective message cell. In the case of a virtual path connection, a virtual channel number VCI
is also specified in the external cell header, in order to allow the individual virtual channel connections carried within the virtual path connection to be identified.
The input of the line device LE (FIGURE 1) is formed by a conversion device CONY. This conversion device CONY now places an internal cell header in front of each message cell that occurs on the transmission line section L1, in order to allow the respective message cell to be passed on within the ATM system.
This internal cell header is formed on the basis of the content of the external cell header contained in each of the message cells. In this case, one of m queue identifications QID is assigned statistically on the basis, inter alia, of the VCI or VPI/VCI contained in the respective external cell header. The respective queue identification QID results in an address reduction with respect to the associated VCI
or VPI/VCI, and is included in the associated internal cell header.
The message cells, which have had an internal cell header added to them in this way, are fed successively to a demultiplexing device DEMUR which is connected to a buffer store PS via m demultiplexing outputs. The demultiplexing outputs are individually assigned to the said queue identifications QID.
The buffer store TS has a large number of memory locations from which a maximum of m logic queues can be formed, as will be explained in more detail in the following text. These logic queues, which are denoted by Q1 to Qm in the drawing, are actuated individually by the demultiplexing device DEMUR with the aid of the queue identifications QID contained in the received message cells. On such actuation of a logic queue, the message cell provided with the current queue identification is transferred to this logic queue. The individual logic queues are in this case each formed by a FIFO memory (first-in-first-out memory) which can simultaneously buffer-store a plurality of message cells.
The logic queues, Q1 to Qm are combined to form queue groups, for example on the basis of the priorities defined for the virtual connections. These queue groups, which are denoted by WG1 to WGn in the drawing are, for example, each assigned to one of n priorities, and are actuated by a queue control device SC. However, since this queue control device SC is not the subject matter of the present invention, it will not be described in any more detail.
Each of these queue groups is in this case controlled by a separate queue control device SCx where n = 1,...,n ("Scheduler"). In this case, queues which have been combined to form a queue group X are actuated by the associated queue control device SCx on the basis of predetermined cell scheduling. In the process, one message cell is taken from each logic queue in such a control cycle, and is passed on in the direction of the transmission line section L2 shown in the drawing.
Furthermore, in the exemplary embodiment, a plurality of queue groups are in each case combined to form a partner queue group. As an example, the drawing in this case shows the queue groups WGl to WGn jointly forming such a partner queue group PWG. In general, the queue groups which are assigned to one partner queue group in this case have different priorities, but this is not a requirement.
Each queue group (WG1 to WGn) in a partner queue group (PWG) is activated by a high-level control device, which is not shown in the drawing, to transmit message cells at a bit rate (cell rate) Rx in the direction of the transmission section L2. At least two of these bit rates Rx are not equal to zero.
Furthermore, the queue groups (WG1 to WGn) associated with a partner queue group (PWG) are jointly assigned a monitoring device KE, in which case bidirectional communication links for control purposes that have not yet been mentioned exist between this monitoring device KE and each of the queue groups, as is indicated in the drawing by a dashed connection line.
The object of the monitoring device KE, in the situation where a queue group cannot currently transmit a message cell, even though this queue group has been activated to do so by a higher-level device which is not shown in more detail in the drawing, is to transfer this transmission capability in accordance with a predetermined priority algorithm to another queue group within the partner queue group. In general, the situation where a queue group cannot currently transmit a message cell may be due to the fact that there are no more message cells stored in the queues assigned to this queue group or, based on the scheduling of the queue control device (SC1...SCn) assigned to the relevant queue group, it is not permissible to transmit a message cell since, otherwise, a message cell stream would exceed a maximum permissible peak bit rate, for example.
The following text shows how the following transmission characteristics can be implemented, as an example, using the method according to the invention and the line device LE according to the invention and illustrated in the drawing:
1. Individual minimum bit rates are guaranteed for each message cell stream irrespective of its priority.
2. A bit rate which exceeds the sum of the throughput guarantees is allocated strictly on the basis of the priority of the message cell streams, that is to say the message cell streams of high priority (1) are assigned first, and if there are none of these to be transmitted, only then are the message cell streams of lower priority (2) assigned.
3. If the minimum bit rate is not fully utilized by one of the message cell streams, then this bit rate can be made available to other message cell streams, which can also be assigned to another queue group.
The following assumptions are made in order to illustrate this example:
1. There are only two queue groups, with the queue group WG1 having a high priority, while the queue group WG2, on the other hand, has a low priority.
2. R1 - 50 Mbit/s is greater than the sum of the throughput guarantees for the high-priority message cell streams.
3. R2 - 20 Mbit/s is identical to the sum of the throughput guarantees for the low-priority message cell streams.
Advantageous refinements of the method according to the present invention result from the dependent claims which refer back to patent claim 1.
The present invention will now be described in more detail in the following text with reference to a drawing.
As an example, the drawing shows schematically a line device LE which is inserted between two transmission line sections L1 and L2 in an ATM system operating using an asynchronous transfer mode. In this case, the only circuit elements of the line device LE
which are shown are those which are required for understanding of the present invention. Furthermore, this line device is shown as being representative of other line devices inserted into transmission line sections in the ATM system.
In general, the following text does not describe the general ATM principle in any more detail, since this is well known.
Message cells occur on the transmission line section L1 and, in a known manner, have an external header in addition to an information part (user part) .
In this case, among other details, such an external header contains the association with a specific virtual connection. A virtual connection may either be a virtual channel connection (individual connection) or a virtual path connection (bundle of a plurality of individual connections). A virtual channel connection is in this case assigned a virtual channel number VCI
(virtual channel identifier) while, in contrast, a virtual path connection is assigned a virtual path number VPI (virtual path identifier) in the external header of the respective message cell. In the case of a virtual path connection, a virtual channel number VCI
is also specified in the external cell header, in order to allow the individual virtual channel connections carried within the virtual path connection to be identified.
The input of the line device LE (FIGURE 1) is formed by a conversion device CONY. This conversion device CONY now places an internal cell header in front of each message cell that occurs on the transmission line section L1, in order to allow the respective message cell to be passed on within the ATM system.
This internal cell header is formed on the basis of the content of the external cell header contained in each of the message cells. In this case, one of m queue identifications QID is assigned statistically on the basis, inter alia, of the VCI or VPI/VCI contained in the respective external cell header. The respective queue identification QID results in an address reduction with respect to the associated VCI
or VPI/VCI, and is included in the associated internal cell header.
The message cells, which have had an internal cell header added to them in this way, are fed successively to a demultiplexing device DEMUR which is connected to a buffer store PS via m demultiplexing outputs. The demultiplexing outputs are individually assigned to the said queue identifications QID.
The buffer store TS has a large number of memory locations from which a maximum of m logic queues can be formed, as will be explained in more detail in the following text. These logic queues, which are denoted by Q1 to Qm in the drawing, are actuated individually by the demultiplexing device DEMUR with the aid of the queue identifications QID contained in the received message cells. On such actuation of a logic queue, the message cell provided with the current queue identification is transferred to this logic queue. The individual logic queues are in this case each formed by a FIFO memory (first-in-first-out memory) which can simultaneously buffer-store a plurality of message cells.
The logic queues, Q1 to Qm are combined to form queue groups, for example on the basis of the priorities defined for the virtual connections. These queue groups, which are denoted by WG1 to WGn in the drawing are, for example, each assigned to one of n priorities, and are actuated by a queue control device SC. However, since this queue control device SC is not the subject matter of the present invention, it will not be described in any more detail.
Each of these queue groups is in this case controlled by a separate queue control device SCx where n = 1,...,n ("Scheduler"). In this case, queues which have been combined to form a queue group X are actuated by the associated queue control device SCx on the basis of predetermined cell scheduling. In the process, one message cell is taken from each logic queue in such a control cycle, and is passed on in the direction of the transmission line section L2 shown in the drawing.
Furthermore, in the exemplary embodiment, a plurality of queue groups are in each case combined to form a partner queue group. As an example, the drawing in this case shows the queue groups WGl to WGn jointly forming such a partner queue group PWG. In general, the queue groups which are assigned to one partner queue group in this case have different priorities, but this is not a requirement.
Each queue group (WG1 to WGn) in a partner queue group (PWG) is activated by a high-level control device, which is not shown in the drawing, to transmit message cells at a bit rate (cell rate) Rx in the direction of the transmission section L2. At least two of these bit rates Rx are not equal to zero.
Furthermore, the queue groups (WG1 to WGn) associated with a partner queue group (PWG) are jointly assigned a monitoring device KE, in which case bidirectional communication links for control purposes that have not yet been mentioned exist between this monitoring device KE and each of the queue groups, as is indicated in the drawing by a dashed connection line.
The object of the monitoring device KE, in the situation where a queue group cannot currently transmit a message cell, even though this queue group has been activated to do so by a higher-level device which is not shown in more detail in the drawing, is to transfer this transmission capability in accordance with a predetermined priority algorithm to another queue group within the partner queue group. In general, the situation where a queue group cannot currently transmit a message cell may be due to the fact that there are no more message cells stored in the queues assigned to this queue group or, based on the scheduling of the queue control device (SC1...SCn) assigned to the relevant queue group, it is not permissible to transmit a message cell since, otherwise, a message cell stream would exceed a maximum permissible peak bit rate, for example.
The following text shows how the following transmission characteristics can be implemented, as an example, using the method according to the invention and the line device LE according to the invention and illustrated in the drawing:
1. Individual minimum bit rates are guaranteed for each message cell stream irrespective of its priority.
2. A bit rate which exceeds the sum of the throughput guarantees is allocated strictly on the basis of the priority of the message cell streams, that is to say the message cell streams of high priority (1) are assigned first, and if there are none of these to be transmitted, only then are the message cell streams of lower priority (2) assigned.
3. If the minimum bit rate is not fully utilized by one of the message cell streams, then this bit rate can be made available to other message cell streams, which can also be assigned to another queue group.
The following assumptions are made in order to illustrate this example:
1. There are only two queue groups, with the queue group WG1 having a high priority, while the queue group WG2, on the other hand, has a low priority.
2. R1 - 50 Mbit/s is greater than the sum of the throughput guarantees for the high-priority message cell streams.
3. R2 - 20 Mbit/s is identical to the sum of the throughput guarantees for the low-priority message cell streams.
4. Both queue groups WG1 and WG2 operate using the "Weighted Fair Queuing (WFQ)~~ method.
5. If WG1 has no more buffered message cells, the capability to transmit a message cell is transferred to WG2, and vice versa.
This results in the following behavior, that is to say a group WGx is assigned a minimum rate Rx as a transmission capability. The resultant arrival rate of all high-priority and low-priority message cell streams, respectively, together is in this case denoted by A1 and A2, respectively:
1. A1 > R1, A2 > R2: high-priority cell streams are jointly assigned R1 - 50 Mb/s, and low-priority cell streams are assigned R2 = 20 Mb/s 2. A1 > R1, A2 < R2: high-priority cell streams are jointly assigned R1 + (R2-A2), and low-priority cell streams are assigned A2 3. A1 < R1, A2 > R2: high-priority cell streams are jointly assigned A1, and low-priority cell streams are assigned R2 + (R1-A1) 4. A1 < R1, A2 < R2: high-priority cell streams are jointly assigned A1, and low-priority cell streams are assigned A2 The present invention has been described above using the example of a line device in an ATM system.
GR 97 P 2266 - 7a -However, this invention is not limited to such systems.
In fact, it can be used generally in systems in which message units which are associated with message streams of different priority are transmitted jointly via a physical or logic transmission channel, and, in doing so, the message units associated with the respective message stream pass through a queue which is specific to the message stream. As an example other than an ATM
system as mentioned above, a system operating using the packet-switching principle should be mentioned here, in which message units are transmitted in the form of data packets.
This results in the following behavior, that is to say a group WGx is assigned a minimum rate Rx as a transmission capability. The resultant arrival rate of all high-priority and low-priority message cell streams, respectively, together is in this case denoted by A1 and A2, respectively:
1. A1 > R1, A2 > R2: high-priority cell streams are jointly assigned R1 - 50 Mb/s, and low-priority cell streams are assigned R2 = 20 Mb/s 2. A1 > R1, A2 < R2: high-priority cell streams are jointly assigned R1 + (R2-A2), and low-priority cell streams are assigned A2 3. A1 < R1, A2 > R2: high-priority cell streams are jointly assigned A1, and low-priority cell streams are assigned R2 + (R1-A1) 4. A1 < R1, A2 < R2: high-priority cell streams are jointly assigned A1, and low-priority cell streams are assigned A2 The present invention has been described above using the example of a line device in an ATM system.
GR 97 P 2266 - 7a -However, this invention is not limited to such systems.
In fact, it can be used generally in systems in which message units which are associated with message streams of different priority are transmitted jointly via a physical or logic transmission channel, and, in doing so, the message units associated with the respective message stream pass through a queue which is specific to the message stream. As an example other than an ATM
system as mentioned above, a system operating using the packet-switching principle should be mentioned here, in which message units are transmitted in the form of data packets.
Claims (5)
1. A method for the transmission of message units, which are associated with message streams of different priority, jointly via one transmission channel, in which - message units that are associated with the respective message stream pass through a queue (Q1,...,Qm) which is specific to the message stream, - the queues (Q1,...,Qm) are combined on the basis of the priorities of the message streams which in each case pass through them to form queue groups (WG1,...,WGn), - the queue groups (WG1,...,WGn) are in each case controlled by a separate queue control device (Scx, where x = 1,...,n), in such a manner that at least two of the queue groups are in each case combined to form a partner queue group (PWG1), and - the queue groups (WG1,...,WGn) which are associated with a partner queue group (PWG1) are controlled in such a manner that, in the situation where no message unit can currently be transmitted from one of the queue groups, the transmission capability is transferred from the relevant queue group to one of the remaining queue groups (WG1,...,WGn) in the respective partner queue group (PWG1).
2. The method as claimed in claim 1, characterized, in that the message units are transmitted using an asynchronous transfer mode, in the form of message cells in the course of virtual connections, and in that each of the virtual connections is assigned one of the queues (Q1,..., Qm).
3. The method as claimed in claim 1, characterized in that the message units are transmitted using a packet-switching principle, in the form of data packets in the course of message streams, and in that each of the message streams is assigned one of the queues (Q1,...,Qm).
4. A circuit arrangement for the transmission of message units, which are associated with message streams of different priority, jointly via one transmission channel, which circuit arrangement is designed and arranged in such a manner, - that the message units which are associated with the respective message stream pass through a queue (Q1,...,Qm) which is specific to the message stream, - in that the queues are combined to form queue groups (WG1,...,WGn) on the basis of the priorities of the message streams which in each case pass through them, which queue groups (WG1,...,WGn) can each be controlled by a separate queue control device (Scx, where x = 1,...,n), - in that at least two of the queue groups are in each case combined to form a partner queue group (PWG), and - in that the queue groups (WG1,...,WGn) which belong to a partner queue group (PWG1) can be controlled by a monitoring device (KE) in such a manner that, in the situation where no message unit can currently be transmitted from one of the queue groups, the transmission capability can be transferred from the relevant queue group to one of the remaining queue groups (WG1,...,WGn) in the respective partner queue group (PWG1).
5. The method as claimed in one of claims 1 to 3, characterized in that the queues (Q1,...,Qm) through which message streams of equal priority pass are combined to form queue groups (WG1,...,WGn).
Applications Claiming Priority (3)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| DE19737852A DE19737852C2 (en) | 1997-08-29 | 1997-08-29 | Method and circuit arrangement for transmitting message units in message streams of different priority |
| DE19737852.8 | 1997-08-29 | ||
| PCT/DE1998/002386 WO1999012311A2 (en) | 1997-08-29 | 1998-08-14 | Transmitting message units in message streams with different priority |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CA2301630A1 true CA2301630A1 (en) | 1999-03-11 |
Family
ID=7840654
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CA002301630A Abandoned CA2301630A1 (en) | 1997-08-29 | 1998-08-14 | Method and circuit arrangement for the transmission of message units in message streams of different priority |
Country Status (5)
| Country | Link |
|---|---|
| EP (1) | EP1010293B1 (en) |
| CA (1) | CA2301630A1 (en) |
| DE (2) | DE19737852C2 (en) |
| ES (1) | ES2235366T3 (en) |
| WO (1) | WO1999012311A2 (en) |
Families Citing this family (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JP3733784B2 (en) | 1999-05-21 | 2006-01-11 | 株式会社日立製作所 | Packet relay device |
| DE10125337A1 (en) * | 2001-05-23 | 2002-07-18 | Infineon Technologies Ag | Packet data transfer method for controlling for a network node in which data packets are grouped according to their data transfer rate before transmission at an assigned time so that overall data transfer rates increase |
| CN113342544B (en) * | 2021-05-27 | 2023-09-01 | 北京奇艺世纪科技有限公司 | Design method of data storage architecture, message transmission method and device |
Family Cites Families (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US5231633A (en) * | 1990-07-11 | 1993-07-27 | Codex Corporation | Method for prioritizing, selectively discarding, and multiplexing differing traffic type fast packets |
| US5268900A (en) * | 1991-07-05 | 1993-12-07 | Codex Corporation | Device and method for implementing queueing disciplines at high speeds |
| DE19548985A1 (en) * | 1995-12-28 | 1997-07-03 | Siemens Ag | Method for prioritizing cell streams in systems that transmit information according to an asynchronous transfer mode (ATM) |
-
1997
- 1997-08-29 DE DE19737852A patent/DE19737852C2/en not_active Expired - Fee Related
-
1998
- 1998-08-14 WO PCT/DE1998/002386 patent/WO1999012311A2/en active IP Right Grant
- 1998-08-14 EP EP98948806A patent/EP1010293B1/en not_active Expired - Lifetime
- 1998-08-14 CA CA002301630A patent/CA2301630A1/en not_active Abandoned
- 1998-08-14 ES ES98948806T patent/ES2235366T3/en not_active Expired - Lifetime
- 1998-08-14 DE DE59812579T patent/DE59812579D1/en not_active Expired - Fee Related
Also Published As
| Publication number | Publication date |
|---|---|
| WO1999012311A3 (en) | 1999-05-27 |
| EP1010293B1 (en) | 2005-02-16 |
| DE19737852C2 (en) | 2001-06-07 |
| ES2235366T3 (en) | 2005-07-01 |
| DE59812579D1 (en) | 2005-03-24 |
| DE19737852A1 (en) | 1999-03-04 |
| WO1999012311A2 (en) | 1999-03-11 |
| EP1010293A2 (en) | 2000-06-21 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US6246691B1 (en) | Method and circuit configuration for the transmission of message units in message streams of different priority | |
| EP0763915B1 (en) | Packet transfer device and method adaptive to a large number of input ports | |
| EP1111858B1 (en) | A weighted round robin scheduling engine | |
| EP0817436B1 (en) | Packet switched communication system | |
| US6064650A (en) | Rate shaping in per-flow output queued routing mechanisms having output links servicing multiple physical layers | |
| US5926459A (en) | Rate shaping in per-flow queued routing mechanisms for available bit rate service | |
| US6377583B1 (en) | Rate shaping in per-flow output queued routing mechanisms for unspecified bit rate service | |
| US6064651A (en) | Rate shaping in per-flow output queued routing mechanisms for statistical bit rate service | |
| US6038217A (en) | Rate shaping in per-flow output queued routing mechanisms for available bit rate (ABR) service in networks having segmented ABR control loops | |
| EP0810809B1 (en) | A scheduling method and apparatus for supporting ATM connections having a guaranteed minimum bandwidth | |
| KR100328642B1 (en) | Arrangement and method relating to packet flow control | |
| EP1860835A2 (en) | Data switch for simultaneously processing data cells and data packets | |
| JP3115546B2 (en) | Method for optimally transmitting ATM cells | |
| US6768717B1 (en) | Apparatus and method for traffic shaping in a network switch | |
| CA2238795A1 (en) | Er information acceleration in abr traffic | |
| US5940397A (en) | Methods and apparatus for scheduling ATM cells | |
| EP0817433B1 (en) | Packet switched communication system and traffic shaping process | |
| EP2134037A1 (en) | Method and apparatus for scheduling data packet flows | |
| EP1111851B1 (en) | A scheduler system for scheduling the distribution of ATM cells | |
| US7643413B2 (en) | System and method for providing quality of service in asynchronous transfer mode cell transmission | |
| CA2301630A1 (en) | Method and circuit arrangement for the transmission of message units in message streams of different priority | |
| EP0817431B1 (en) | A packet switched communication system | |
| EP0817435B1 (en) | A switch for a packet communication system | |
| JP3416156B2 (en) | Method and circuit arrangement for transmitting information cells via virtual connections of different priorities | |
| EP0817432B1 (en) | A packet switched communication system |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| EEER | Examination request | ||
| FZDE | Discontinued |