CA2241742C - Method for prioritizing cell streams in systems which transmit information by an asynchronous transfer mode (atm) - Google Patents
Method for prioritizing cell streams in systems which transmit information by an asynchronous transfer mode (atm) Download PDFInfo
- Publication number
- CA2241742C CA2241742C CA002241742A CA2241742A CA2241742C CA 2241742 C CA2241742 C CA 2241742C CA 002241742 A CA002241742 A CA 002241742A CA 2241742 A CA2241742 A CA 2241742A CA 2241742 C CA2241742 C CA 2241742C
- Authority
- CA
- Canada
- Prior art keywords
- cell
- cell streams
- streams
- weighting factor
- priority
- 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.)
- Expired - Fee Related
Links
Classifications
-
- 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/5672—Multiplexing, e.g. coding, scrambling
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
In up-to-date ATM switching systems, information is transmitted in cells by the WEIGHTED FAIR QUEUING
SCHEDULING method. In order to be able to use connection sections particularly efficiently, according to the invention the cell streams are prioritized on the basis of this known method. This is achieved in that the weighting factors allocated to a first quantity of cell streams are selected such that they differ very much more than the weighting factors allocated to the remaining quantity of cell streams.
SCHEDULING method. In order to be able to use connection sections particularly efficiently, according to the invention the cell streams are prioritized on the basis of this known method. This is achieved in that the weighting factors allocated to a first quantity of cell streams are selected such that they differ very much more than the weighting factors allocated to the remaining quantity of cell streams.
Description
Method for prioritizing cell streams in systems which transmit information by an asynchronous transfer mode (ATM) In up-to-date ATM systems, information is transmitted in cells. These cells have a header part and an information part. The connection information is stored in the header part and the traffic data to be transmitted is stored in the information part. The actual transmission usually takes place via connection sections between the transmitter and the receiver. In the process, there may possibly be the need to utilize the connection sections in such a way that a plurality of transmission devices transmit the cell streams originating therefrom via the same connection section.
In order to be able to transmit the respective cell streams in accordance with the requirements of the individual cell streams, a so-called WEIGHTED FAIR QUEUING
SCHEDULING method has become established as the state of the art. The corresponding conditions are indicated, for example, in the publication "Virtual Spacing for Flexible Traffic Control", J. W. Roberts, International Journal of Communication Systems, Vol. 7, 307-318 (1994). Here, the individual cell streams are allocated different weighting factors with which the actual transmission procedure to the individual connection sections is controlled. In order to understand this better, please refer to Figure 3.
PCT/DE 96/02320 18.02.98 Description Here, cell streams 1 ... n are disclosed by way of example. The n cell streams are directed by a transmission device DEMUR in the direction of one or more receivers. In practice, only one common connection section is used in this context. In addition, weighting factors r1 ... ra are allocated to n cell streams. For the sake of easier comprehension, it will be assumed that only two cell streams, namely the cell streams 1, 2 are to be routed via one connection section. In addition, the connection section is to have a maximum transmission capacity of 150 Mbit/sec. The two cell streams 1 and 2 are allocated weighting factors r1 _ 2 and rz - 1. The effect of this is that cell stream 1 is transmitted at a transmission rate of 100 Mbit/sec and cell stream 2 is transmitted at only 50 Mbit/sec if cells are waiting to be transmitted.
The problem with such a procedure is that the capacity utilization of the connection is not ensured to an optimum degree, in particular in terms of different services. This is particularly due to the fact that, for example, connections with guaranteed service quality have to be treated differently from, for example, connections without any service quality guarantees. Thus, the former are, as a rule, switched through as a function of the service quality parameters and/or connection parameters, something which is less significant in the case of the latter. Here, the necessary data are transmitted only if the connection section is otherwise subjected to low loading. This is the case in particular if the cell streams do not fully utilize the available transmission capacities.
The publication "IEICE Transactions on Communica-tions '92, Changhwan OH et al: Priority Control ATM for Switching Systems" discloses a method for prioritizing cell streams to be transmitted. According to this, the AMENDED SHEET
GR 95 P 2277 P - 2a -cells of the streams are divided into classes on the basis of their QOS (Quality of Service). A priority logic then decides which AMENDED SHEET
cells are to be read out of a buffer. However, this publication does not indicate how prioritization is to be controlled by allocating weighting factors.
In addition, the European patent application EP-A-0 681 385 A2 also discloses a method for prioritizing cell streams. Here, prioritization is also performed by means of a priority logic by writing cells into queues and reading them out again in accordance with quality criteria (delay quality classes) by means of the priority logic. However, this document does not indicate either how prioritization is to be controlled by alloca-ting weighting factors.
The invention is based on the object of indica-ting a way in which the capacity utilization of connec-tion sections can be controlled in an optimum and effi-cient fashion.
AMENDED SHEET
The invention is achieved on the basis of the features disclosed in the preamble of Patent Claim 1, by means of the features of the characterizing part.
An advantage with the invention is, in particular, that prioritization is achieved by selection of extreme values of the weighting factors. This entails the advantage that the cell streams via the respective connection section can be controlled as a function of these priorities, and optimum capacity utilization is thus ensured.
There is provision for the cell streams to be formed from a plurality of substreams to which, if appropriate, different weighting factors are allocated in each case. This entails the advantage that the transmission of information within one connection section can be carried out with different priorities.
There is provision that, if appropriate, different weighting factors are allocated to the substreams of a cell stream. This entails the advantage of prioritizing information within a cell stream.
There is provision that at least one counting device is provided per substream and priority, the counter reading of which is incremented when a cell of the respective substream arrives and is decremented when a cell of the respective substream leaves. This entails the advantage that the occupancy level of cells in the system can be detected.
There is provision for a scheduler to pass on the cells according to the valuation of the counting devices.
This entails the advantage of a particularly efficient utilization of the connection section.
4a In accordance with one aspect of this invention, there is provided a method for prioritizing information to be transmitted in asynchronous transfer mode cell streams, comprising of the steps of: forming a plurality of cell streams each having a plurality of cells, the cell streams being directed via a common connection section to further transmission devices in the asynchronous transfer mode;
allocating different weighting factors during a transmission procedure; allocating weighting factors to a first quantity of the cell streams having a lower priority which are many times smaller than the weighting factors allocated to a remaining quantity of the cell streams having a relatively higher priority; and the weighting factors of the lower priority cell streams being divided by a factor C1 such that (r~/C1~ xC2<ri where ri is the weighting factor for all the high-priority cell streams, r~ is the weighting factor for all the low-priority cell streams, and wherein C2 is very much larger than 1.
In accordance with another aspect of this invention, there is provided a method for prioritizing information to be transmitted in asynchronous transfer mode cell streams, comprising the steps of: forming a plurality of cell streams, each having a plurality of cells, the cell streams being directed via a common connection section for further transmission in the asynchronous transfer mode, said common connection section having a given maximum transmission rate capacity; allocating a weighting factor parameter during a transmission procedure to each of the cell streams, a value of the weighting factor parameter determining a transmission rate of the respective cell stream based on the given maximum transmission capacity; at least one of the cell streams corresponding to a connection requiring a guaranteed service quality while at least one of ' 4b the other cell streams corresponding to a connection without a service quality guarantee; and providing the at least one cell stream corresponding to the guaranteed service quality with a value of the weighting factor parameter which is many times greater than a value of the weighting factor parameter allocated to all of the cell streams corresponding to the connections without the service quality guarantee, so that the same weighting factor parameter used for determining the transmission rate for each cell stream is also used to determine whether the respective cell stream has a guaranteed service quality.
The invention is explained in more detail below with reference to an exemplary embodiment.
Figure 1 shows a general type of the inventive method, Figure 2 shows a special embodiment of the inventive method, Figure 3 shows the prior art on which the invention is based.
Fig. 1 explains in more detail the method according to the invention by means of a general exemplary embodiment. Here, a cell stream i upstream of the transmission procedure is provided with a weighting factor r;. Figure 1 shows two cell streams, namely cell stream 1 and cell stream 2. Starting from a transmitter device DEMUX, which is usually designed as a demultiplexer, they are transmitted via a common connection section to one or more reception devices. Here, one of the cell streams, for example cell stream 1, is allocated a weighting factor r1, while the remaining cell stream, namely cell stream 2, is allocated a weighting factor r2. So that one of the two cell 4c streams can then be prioritized in terms of the transmission, one of the weighting factors, for example r2 is selected such that it is very much smaller than the remaining weighting factor r1. Very much smaller should mean here that the quotient of r1 and r2 is very much larger than 1. For practical considerations, a factor of 100 has proven perfectly acceptable.
However, in practice, a plurality of cell streams occur, and these have to be transmitted via a common connection section. For the further considerations it will be assumed that this plurality of cell streams will be n. In addition, it will be assumed that cell streams are to be transmitted with only 2 priorities. A dis-tinction will therefore be made only between a high priority and a low priority.
In this case, all the high-priority cell streams are allocated the same weighting factor ri while all the low-priority cell streams are allocated the same weigh ting factor rj . It will be assumed, by way of example, that the number of high-priority cell streams is nh. For the high-priority cell streams the following therefore applies: 1 s i ~ nh. In addition, the number of all the low-priority cell streams is n1. Here, it is true that nh + 1 s j ~ nh + n1. In addition, according to the invention the weighting factors of the lower-priority cell streams are divided by a factor C1, which ultimately means that the following is true (r~/C1) =C2 c ri for all i, j .
The constant factor C2 should be very much larger here than 1. Here too, an order of magnitude of 100 has come to be accepted for practical considerations.
Figure 2 illustrates a further refinement of the invention:
Here, it is assumed that a cell stream has a plurality of substreams with a different priority in each case. However, the substreams cannot readily be derived from the mainstream since, with ATM cells, this may possibly lead to messages overtaking one another. How-ever, the substreams whose priority levels differ can be prioritized according to the principle presented above by providing and weighting the number of high-priority cells and the number of low-priority cells of each cell stream with the respective weighting factors.
In accordance with Fig. 2, the variable 1 sig nifies the number of the substream and the variable k signifies the number of the superordinate cell stream. In addition, each cell stream is allocated two weighting factors rkl (1 = 1, 2). The allocation of these weighting factors causes a single cell stream to look like two separate cell streams to the scheduler S. Here, the weighting factors rkl are calculated in the fashion specified above. The scheduler S defines the sequence in which the cells are passed on.
In addition, each of the substreams is allocated a counting device Skl in terms of its priority, a matrix of counting devices being produced. Such counting devices are used to calculate the difference between the number of cells which have penetrated the system and the number of cells which have left the system via the scheduler S
for each cell stream k and each priority 1. The counter reading of the counting device Skl is incremented by 1 if a cell of the cell stream k with the priority 1 penetrates the system. The counter reading of the counting device is decremented by 1 if a cell with the priority 1 of the cell stream k is passed on by the scheduler S. If the counting device has a value greater than 0, this means that the number of incoming cells is greater than the number of transmitted cells for this specific substream and this specifically allocated priority. In this case, further cells of the same prio rity 1 of the same substream k may be transmitted by the scheduler S. However, if the counting device has a counter reading of 0, this means that the number of incoming and outcoming cells is identical; therefore, no further cells for this substream are transmitted by the scheduler S. The cells transmitted by the scheduler S do not have to have the priority of the decremented counter.
From the relationship described above it emerges that if a cell stream has only "priority 1" cells and the remaining cell streams have "priority 2" cells, the cell streams of the higher priority have precedence in terms of the transmission. If all the cell streams have cells with the same priority, the active cell streams are treated as if the cells have no priority whatsoever. If cell streams have two priorities, only the substreams whose counting device Skl > 0 are treated in accordance with the allocated weighting factor rkl. Substreams whose counting device Skl - 0 are treated almost always only if Skl - 0 for all k. In this case, each low-priority cell stream k is held back in terms of its weighting factor rl k
In order to be able to transmit the respective cell streams in accordance with the requirements of the individual cell streams, a so-called WEIGHTED FAIR QUEUING
SCHEDULING method has become established as the state of the art. The corresponding conditions are indicated, for example, in the publication "Virtual Spacing for Flexible Traffic Control", J. W. Roberts, International Journal of Communication Systems, Vol. 7, 307-318 (1994). Here, the individual cell streams are allocated different weighting factors with which the actual transmission procedure to the individual connection sections is controlled. In order to understand this better, please refer to Figure 3.
PCT/DE 96/02320 18.02.98 Description Here, cell streams 1 ... n are disclosed by way of example. The n cell streams are directed by a transmission device DEMUR in the direction of one or more receivers. In practice, only one common connection section is used in this context. In addition, weighting factors r1 ... ra are allocated to n cell streams. For the sake of easier comprehension, it will be assumed that only two cell streams, namely the cell streams 1, 2 are to be routed via one connection section. In addition, the connection section is to have a maximum transmission capacity of 150 Mbit/sec. The two cell streams 1 and 2 are allocated weighting factors r1 _ 2 and rz - 1. The effect of this is that cell stream 1 is transmitted at a transmission rate of 100 Mbit/sec and cell stream 2 is transmitted at only 50 Mbit/sec if cells are waiting to be transmitted.
The problem with such a procedure is that the capacity utilization of the connection is not ensured to an optimum degree, in particular in terms of different services. This is particularly due to the fact that, for example, connections with guaranteed service quality have to be treated differently from, for example, connections without any service quality guarantees. Thus, the former are, as a rule, switched through as a function of the service quality parameters and/or connection parameters, something which is less significant in the case of the latter. Here, the necessary data are transmitted only if the connection section is otherwise subjected to low loading. This is the case in particular if the cell streams do not fully utilize the available transmission capacities.
The publication "IEICE Transactions on Communica-tions '92, Changhwan OH et al: Priority Control ATM for Switching Systems" discloses a method for prioritizing cell streams to be transmitted. According to this, the AMENDED SHEET
GR 95 P 2277 P - 2a -cells of the streams are divided into classes on the basis of their QOS (Quality of Service). A priority logic then decides which AMENDED SHEET
cells are to be read out of a buffer. However, this publication does not indicate how prioritization is to be controlled by allocating weighting factors.
In addition, the European patent application EP-A-0 681 385 A2 also discloses a method for prioritizing cell streams. Here, prioritization is also performed by means of a priority logic by writing cells into queues and reading them out again in accordance with quality criteria (delay quality classes) by means of the priority logic. However, this document does not indicate either how prioritization is to be controlled by alloca-ting weighting factors.
The invention is based on the object of indica-ting a way in which the capacity utilization of connec-tion sections can be controlled in an optimum and effi-cient fashion.
AMENDED SHEET
The invention is achieved on the basis of the features disclosed in the preamble of Patent Claim 1, by means of the features of the characterizing part.
An advantage with the invention is, in particular, that prioritization is achieved by selection of extreme values of the weighting factors. This entails the advantage that the cell streams via the respective connection section can be controlled as a function of these priorities, and optimum capacity utilization is thus ensured.
There is provision for the cell streams to be formed from a plurality of substreams to which, if appropriate, different weighting factors are allocated in each case. This entails the advantage that the transmission of information within one connection section can be carried out with different priorities.
There is provision that, if appropriate, different weighting factors are allocated to the substreams of a cell stream. This entails the advantage of prioritizing information within a cell stream.
There is provision that at least one counting device is provided per substream and priority, the counter reading of which is incremented when a cell of the respective substream arrives and is decremented when a cell of the respective substream leaves. This entails the advantage that the occupancy level of cells in the system can be detected.
There is provision for a scheduler to pass on the cells according to the valuation of the counting devices.
This entails the advantage of a particularly efficient utilization of the connection section.
4a In accordance with one aspect of this invention, there is provided a method for prioritizing information to be transmitted in asynchronous transfer mode cell streams, comprising of the steps of: forming a plurality of cell streams each having a plurality of cells, the cell streams being directed via a common connection section to further transmission devices in the asynchronous transfer mode;
allocating different weighting factors during a transmission procedure; allocating weighting factors to a first quantity of the cell streams having a lower priority which are many times smaller than the weighting factors allocated to a remaining quantity of the cell streams having a relatively higher priority; and the weighting factors of the lower priority cell streams being divided by a factor C1 such that (r~/C1~ xC2<ri where ri is the weighting factor for all the high-priority cell streams, r~ is the weighting factor for all the low-priority cell streams, and wherein C2 is very much larger than 1.
In accordance with another aspect of this invention, there is provided a method for prioritizing information to be transmitted in asynchronous transfer mode cell streams, comprising the steps of: forming a plurality of cell streams, each having a plurality of cells, the cell streams being directed via a common connection section for further transmission in the asynchronous transfer mode, said common connection section having a given maximum transmission rate capacity; allocating a weighting factor parameter during a transmission procedure to each of the cell streams, a value of the weighting factor parameter determining a transmission rate of the respective cell stream based on the given maximum transmission capacity; at least one of the cell streams corresponding to a connection requiring a guaranteed service quality while at least one of ' 4b the other cell streams corresponding to a connection without a service quality guarantee; and providing the at least one cell stream corresponding to the guaranteed service quality with a value of the weighting factor parameter which is many times greater than a value of the weighting factor parameter allocated to all of the cell streams corresponding to the connections without the service quality guarantee, so that the same weighting factor parameter used for determining the transmission rate for each cell stream is also used to determine whether the respective cell stream has a guaranteed service quality.
The invention is explained in more detail below with reference to an exemplary embodiment.
Figure 1 shows a general type of the inventive method, Figure 2 shows a special embodiment of the inventive method, Figure 3 shows the prior art on which the invention is based.
Fig. 1 explains in more detail the method according to the invention by means of a general exemplary embodiment. Here, a cell stream i upstream of the transmission procedure is provided with a weighting factor r;. Figure 1 shows two cell streams, namely cell stream 1 and cell stream 2. Starting from a transmitter device DEMUX, which is usually designed as a demultiplexer, they are transmitted via a common connection section to one or more reception devices. Here, one of the cell streams, for example cell stream 1, is allocated a weighting factor r1, while the remaining cell stream, namely cell stream 2, is allocated a weighting factor r2. So that one of the two cell 4c streams can then be prioritized in terms of the transmission, one of the weighting factors, for example r2 is selected such that it is very much smaller than the remaining weighting factor r1. Very much smaller should mean here that the quotient of r1 and r2 is very much larger than 1. For practical considerations, a factor of 100 has proven perfectly acceptable.
However, in practice, a plurality of cell streams occur, and these have to be transmitted via a common connection section. For the further considerations it will be assumed that this plurality of cell streams will be n. In addition, it will be assumed that cell streams are to be transmitted with only 2 priorities. A dis-tinction will therefore be made only between a high priority and a low priority.
In this case, all the high-priority cell streams are allocated the same weighting factor ri while all the low-priority cell streams are allocated the same weigh ting factor rj . It will be assumed, by way of example, that the number of high-priority cell streams is nh. For the high-priority cell streams the following therefore applies: 1 s i ~ nh. In addition, the number of all the low-priority cell streams is n1. Here, it is true that nh + 1 s j ~ nh + n1. In addition, according to the invention the weighting factors of the lower-priority cell streams are divided by a factor C1, which ultimately means that the following is true (r~/C1) =C2 c ri for all i, j .
The constant factor C2 should be very much larger here than 1. Here too, an order of magnitude of 100 has come to be accepted for practical considerations.
Figure 2 illustrates a further refinement of the invention:
Here, it is assumed that a cell stream has a plurality of substreams with a different priority in each case. However, the substreams cannot readily be derived from the mainstream since, with ATM cells, this may possibly lead to messages overtaking one another. How-ever, the substreams whose priority levels differ can be prioritized according to the principle presented above by providing and weighting the number of high-priority cells and the number of low-priority cells of each cell stream with the respective weighting factors.
In accordance with Fig. 2, the variable 1 sig nifies the number of the substream and the variable k signifies the number of the superordinate cell stream. In addition, each cell stream is allocated two weighting factors rkl (1 = 1, 2). The allocation of these weighting factors causes a single cell stream to look like two separate cell streams to the scheduler S. Here, the weighting factors rkl are calculated in the fashion specified above. The scheduler S defines the sequence in which the cells are passed on.
In addition, each of the substreams is allocated a counting device Skl in terms of its priority, a matrix of counting devices being produced. Such counting devices are used to calculate the difference between the number of cells which have penetrated the system and the number of cells which have left the system via the scheduler S
for each cell stream k and each priority 1. The counter reading of the counting device Skl is incremented by 1 if a cell of the cell stream k with the priority 1 penetrates the system. The counter reading of the counting device is decremented by 1 if a cell with the priority 1 of the cell stream k is passed on by the scheduler S. If the counting device has a value greater than 0, this means that the number of incoming cells is greater than the number of transmitted cells for this specific substream and this specifically allocated priority. In this case, further cells of the same prio rity 1 of the same substream k may be transmitted by the scheduler S. However, if the counting device has a counter reading of 0, this means that the number of incoming and outcoming cells is identical; therefore, no further cells for this substream are transmitted by the scheduler S. The cells transmitted by the scheduler S do not have to have the priority of the decremented counter.
From the relationship described above it emerges that if a cell stream has only "priority 1" cells and the remaining cell streams have "priority 2" cells, the cell streams of the higher priority have precedence in terms of the transmission. If all the cell streams have cells with the same priority, the active cell streams are treated as if the cells have no priority whatsoever. If cell streams have two priorities, only the substreams whose counting device Skl > 0 are treated in accordance with the allocated weighting factor rkl. Substreams whose counting device Skl - 0 are treated almost always only if Skl - 0 for all k. In this case, each low-priority cell stream k is held back in terms of its weighting factor rl k
Claims (3)
1. A method for prioritizing information to be transmitted in asynchronous transfer mode cell streams, comprising of the steps of:
forming a plurality of cell streams each having a plurality of cells, the cell streams being directed via a common connection section to further transmission devices in the asynchronous transfer mode;
allocating different weighting factors during a transmission procedure;
allocating weighting factors to a first quantity of the cell streams having a lower priority which are many times smaller than the weighting factors allocated to a remaining quantity of the cell streams having a relatively higher priority; and the weighting factors of the lower priority cell streams being divided by a factor C1 such that (r j/C1)×C2 < r i where r i is the weighting factor for all the high-priority cell streams, rj is the weighting factor for all the low-priority cell streams, and wherein C2 is very much larger than 1.
forming a plurality of cell streams each having a plurality of cells, the cell streams being directed via a common connection section to further transmission devices in the asynchronous transfer mode;
allocating different weighting factors during a transmission procedure;
allocating weighting factors to a first quantity of the cell streams having a lower priority which are many times smaller than the weighting factors allocated to a remaining quantity of the cell streams having a relatively higher priority; and the weighting factors of the lower priority cell streams being divided by a factor C1 such that (r j/C1)×C2 < r i where r i is the weighting factor for all the high-priority cell streams, rj is the weighting factor for all the low-priority cell streams, and wherein C2 is very much larger than 1.
2. A method for prioritizing information to be transmitted in asynchronous transfer mode cell streams, comprising the steps of:
forming a plurality of cell streams, each having a plurality of cells, the cell streams being directed via a common connection section for further transmission in the asynchronous transfer mode, said common connection section having a given maximum transmission rate capacity;
allocating a weighting factor parameter during a transmission procedure to each of the cell streams, a value of the weighting factor parameter determining a transmission rate of the respective cell stream based on the given maximum transmission capacity;
at least one of the cell streams corresponding to a connection requiring a guaranteed service quality while at least one of the other cell streams corresponding to a connection without a service quality guarantee; and providing the at least one cell stream corresponding to the guaranteed service quality with a value of the weighting factor parameter which is many times greater than a value of the weighting factor parameter allocated to all of the cell streams corresponding to the connections without the service quality guarantee, so that the same weighting factor parameter used for determining the transmission rate for each cell stream is also used to determine whether the respective cell stream has a guaranteed service quality.
forming a plurality of cell streams, each having a plurality of cells, the cell streams being directed via a common connection section for further transmission in the asynchronous transfer mode, said common connection section having a given maximum transmission rate capacity;
allocating a weighting factor parameter during a transmission procedure to each of the cell streams, a value of the weighting factor parameter determining a transmission rate of the respective cell stream based on the given maximum transmission capacity;
at least one of the cell streams corresponding to a connection requiring a guaranteed service quality while at least one of the other cell streams corresponding to a connection without a service quality guarantee; and providing the at least one cell stream corresponding to the guaranteed service quality with a value of the weighting factor parameter which is many times greater than a value of the weighting factor parameter allocated to all of the cell streams corresponding to the connections without the service quality guarantee, so that the same weighting factor parameter used for determining the transmission rate for each cell stream is also used to determine whether the respective cell stream has a guaranteed service quality.
3. The method according to claim 2, including the step of providing the values of the weighting factor parameter corresponding to the cell streams without the service quality approximately 100 times smaller than the values of the weighting factor parameter allocated to the at least one cell stream having the guaranteed service quality.
Applications Claiming Priority (3)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| DE19548985.3 | 1995-12-28 | ||
| DE19548985A DE19548985A1 (en) | 1995-12-28 | 1995-12-28 | Method for prioritizing cell streams in systems that transmit information according to an asynchronous transfer mode (ATM) |
| PCT/DE1996/002320 WO1997024902A1 (en) | 1995-12-28 | 1996-12-04 | Process for prioritising of cell streams in systems which transmit data in an asynchronous mode (atm) |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CA2241742A1 CA2241742A1 (en) | 1997-07-10 |
| CA2241742C true CA2241742C (en) | 2006-06-13 |
Family
ID=7781561
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CA002241742A Expired - Fee Related CA2241742C (en) | 1995-12-28 | 1996-12-04 | Method for prioritizing cell streams in systems which transmit information by an asynchronous transfer mode (atm) |
Country Status (9)
| Country | Link |
|---|---|
| US (1) | US6526061B1 (en) |
| EP (1) | EP0870416B1 (en) |
| JP (1) | JP3859721B2 (en) |
| AT (1) | ATE238638T1 (en) |
| CA (1) | CA2241742C (en) |
| DE (2) | DE19548985A1 (en) |
| DK (1) | DK0870416T3 (en) |
| ES (1) | ES2197958T3 (en) |
| WO (1) | WO1997024902A1 (en) |
Families Citing this family (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| GB9520807D0 (en) * | 1995-10-11 | 1995-12-13 | Newbridge Networks Corp | Fair queue servicing using dynamic weights |
| DE19737852C2 (en) * | 1997-08-29 | 2001-06-07 | Siemens Ag | Method and circuit arrangement for transmitting message units in message streams of different priority |
| DE19748006A1 (en) * | 1997-10-30 | 1999-05-06 | Siemens Ag | Method for the redundant transmission of ATM cells |
| US6246691B1 (en) | 1998-08-14 | 2001-06-12 | Siemens Aktiengesellschaft | Method and circuit configuration for the transmission of message units in message streams of different priority |
| US6470016B1 (en) * | 1999-02-09 | 2002-10-22 | Nortel Networks Limited | Servicing output queues dynamically according to bandwidth allocation in a frame environment |
| JP2001177575A (en) * | 1999-12-20 | 2001-06-29 | Nec Corp | Preferential control system |
| US20030206521A1 (en) * | 2002-05-06 | 2003-11-06 | Chunming Qiao | Methods to route and re-route data in OBS/LOBS and other burst swithched networks |
Family Cites Families (12)
| 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 |
| CA2104753C (en) * | 1992-10-29 | 1999-02-16 | Kotikalapudi Sriram | Bandwidth allocation, transmission scheduling, and congestion avoidance in broadband atm networks |
| JP2655464B2 (en) | 1992-12-25 | 1997-09-17 | 日本電気株式会社 | Packet switching method |
| WO1995003657A1 (en) * | 1993-07-21 | 1995-02-02 | Fujitsu Limited | Atm exchange |
| JP2655481B2 (en) * | 1994-04-28 | 1997-09-17 | 日本電気株式会社 | Priority control method in output buffer type ATM switch |
| US5533020A (en) * | 1994-10-31 | 1996-07-02 | International Business Machines Corporation | ATM cell scheduler |
| US5793747A (en) * | 1996-03-14 | 1998-08-11 | Motorola, Inc. | Event-driven cell scheduler and method for supporting multiple service categories in a communication network |
| US6049526A (en) * | 1996-03-27 | 2000-04-11 | Pmc-Sierra Ltd. | Enhanced integrated rate based available bit rate scheduler |
| US6018527A (en) * | 1996-08-13 | 2000-01-25 | Nortel Networks Corporation | Queue service interval based cell scheduler with hierarchical queuing configurations |
| DE19634492B4 (en) * | 1996-08-26 | 2004-10-14 | Siemens Ag | Method for the optimized transmission of ATM cells over connection sections |
| JP2001519121A (en) * | 1997-04-04 | 2001-10-16 | アセンド コミュニケーションズ インコーポレイテッド | High-speed packet scheduling method and apparatus |
| US5987031A (en) * | 1997-05-22 | 1999-11-16 | Integrated Device Technology, Inc. | Method for fair dynamic scheduling of available bandwidth rate (ABR) service under asynchronous transfer mode (ATM) |
-
1995
- 1995-12-28 DE DE19548985A patent/DE19548985A1/en not_active Withdrawn
-
1996
- 1996-12-04 WO PCT/DE1996/002320 patent/WO1997024902A1/en active IP Right Grant
- 1996-12-04 DK DK96946039T patent/DK0870416T3/en active
- 1996-12-04 US US09/091,087 patent/US6526061B1/en not_active Expired - Lifetime
- 1996-12-04 ES ES96946039T patent/ES2197958T3/en not_active Expired - Lifetime
- 1996-12-04 AT AT96946039T patent/ATE238638T1/en active
- 1996-12-04 EP EP96946039A patent/EP0870416B1/en not_active Expired - Lifetime
- 1996-12-04 DE DE59610385T patent/DE59610385D1/en not_active Expired - Lifetime
- 1996-12-04 JP JP52396497A patent/JP3859721B2/en not_active Expired - Fee Related
- 1996-12-04 CA CA002241742A patent/CA2241742C/en not_active Expired - Fee Related
Also Published As
| Publication number | Publication date |
|---|---|
| ES2197958T3 (en) | 2004-01-16 |
| JP2000503178A (en) | 2000-03-14 |
| EP0870416B1 (en) | 2003-04-23 |
| CA2241742A1 (en) | 1997-07-10 |
| WO1997024902A1 (en) | 1997-07-10 |
| US6526061B1 (en) | 2003-02-25 |
| JP3859721B2 (en) | 2006-12-20 |
| DK0870416T3 (en) | 2003-05-19 |
| ATE238638T1 (en) | 2003-05-15 |
| DE19548985A1 (en) | 1997-07-03 |
| DE59610385D1 (en) | 2003-05-28 |
| EP0870416A1 (en) | 1998-10-14 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US6091708A (en) | Traffic shaper with multiply queued virtual paths | |
| EP1256214B1 (en) | Multi-level scheduling method for multiplexing packets in a communications network | |
| EP1111858B1 (en) | A weighted round robin scheduling engine | |
| EP0734195B1 (en) | A delay-minimizing system with guaranteed bandwith for real-time traffic | |
| US6839358B2 (en) | Relaying apparatus | |
| JP3430470B2 (en) | Method and apparatus for scheduling transmission of multiple data streams | |
| WO2002067514A1 (en) | Dynamic bandwidth allocation | |
| CA2285243A1 (en) | Hierarchical packet scheduling method and apparatus | |
| US6049541A (en) | Distributed telecommunications switching system and method | |
| CA2241742C (en) | Method for prioritizing cell streams in systems which transmit information by an asynchronous transfer mode (atm) | |
| EP0913969A1 (en) | Method, arrangement and communication system for upstream timeslot assignment | |
| CA2371325A1 (en) | Scheduler implementing weighted fair queuing by a weight limited first in-first out methodology | |
| US6430152B1 (en) | Scheduler system for scheduling the distribution of ATM cells | |
| KR100251778B1 (en) | Adaptive cell scheduling method using queue occupancy information and switching systems | |
| US7170904B1 (en) | Adaptive cell scheduling algorithm for wireless asynchronous transfer mode (ATM) systems | |
| CN100466619C (en) | Access business service quality control device and method | |
| US20050073951A1 (en) | Method and apparatus for request/grant priority scheduling | |
| US7450510B1 (en) | System and method for distributing guaranteed bandwidth among service groups in a network node | |
| CA2263400C (en) | Process for optimising load distribution between connection sections of data package transmission systems | |
| KR960014421B1 (en) | Priority control method of atm switch | |
| US7130267B1 (en) | System and method for allocating bandwidth in a network node | |
| JPH11510009A (en) | Assignable and dynamic switch flow control | |
| CA2299406C (en) | An atm buffer controller and a method thereof | |
| Katevenis et al. | Multi-queue management and scheduling for improved QoS in communication networks | |
| CA2301630A1 (en) | Method and circuit arrangement for the transmission of message units in message streams of different priority |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| EEER | Examination request | ||
| MKLA | Lapsed |
Effective date: 20141204 |