CA2084303C - Low delay or low loss switch for atm - Google Patents
Low delay or low loss switch for atm Download PDFInfo
- Publication number
- CA2084303C CA2084303C CA002084303A CA2084303A CA2084303C CA 2084303 C CA2084303 C CA 2084303C CA 002084303 A CA002084303 A CA 002084303A CA 2084303 A CA2084303 A CA 2084303A CA 2084303 C CA2084303 C CA 2084303C
- Authority
- CA
- Canada
- Prior art keywords
- cells
- cell
- switching
- loss priority
- memory area
- 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
- 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
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L49/00—Packet switching elements
- H04L49/10—Packet switching elements characterised by the switching fabric construction
- H04L49/104—Asynchronous transfer mode [ATM] switching fabrics
- H04L49/105—ATM switching elements
- H04L49/108—ATM switching elements using shared central buffer
-
- 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/5647—Cell loss
-
- 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/5649—Cell delay or jitter
-
- 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
-
- 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
- H04L2012/5682—Threshold; Watermark
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
A ATM switching arrangement is disclosed in which two types of cells are distinguished. A first type of cells is marked as low loss and a second type of cells is marked as low delay. In the switching arrangement a cell buffer (9) is subdivided into a first memory area (LL) for the low loss cells and a second area (LD) for the low delay cells. In the case of the cell buffer (9) being completely filled, low loss cells get read-in priority over low delay cells.
In reading out from the cell buffer low delay cells take priority over low loss cells, unless the low delay area is empty. It is also possible to set a threshold value for the content of the low loss area; when the content of the low loss area exceeds the threshold value, outputting of the low loss cells can then be started.
In reading out from the cell buffer low delay cells take priority over low loss cells, unless the low delay area is empty. It is also possible to set a threshold value for the content of the low loss area; when the content of the low loss area exceeds the threshold value, outputting of the low loss cells can then be started.
Description
Low delay or low loss switch for ATM
The invention relates to a telecommunication switching arrangement for switching digital data which are contained in data cells provided with a cell header, the arrangement comprising a crosspoint switch for switching cells from an input line of the switch to an output line of the switch, the switch being provided with a cell buffer memory for storing the cells to be switched through.
Such an arrangement can be used for fast packet-switching techniques which are known under the name of ATM
(Asynchronous Transfer Mode). The power of ATM is its ability to provide bandwidth on demand: different sources can have different bandwidth requirements.
Fast packet switching techniques clearly provide the flexibility for integration of mixed traffic streams, such as voice, data and video. Due to provision for the stochastic bandwidth requirements of some traffic sources, it is not so clear at first. sight whether a reasonable degree of utilization of switching and transmission resources can be achieved. That is, the primary benefit of fast packet switching lies in its flexibility to serve different traffic streams. The invention has for its object to provide an ATM system that can serve different types of traffic streams and which also uses capacity more efficiently than known arrangements.
Thereto, one aspect of the invention provides a telecommunication switching arrangement for switching digital data contained in data cells provided with a cell header, said cell header containing a cell loss priority field for storing a value representative of a cell loss priority of the data cell, the arrangement comprising a la crosspoint switch for switching incoming data cells from a plurality of input lines of the switch to an output line of the switch, the crosspoint switch further comprising a cell buffer memory for storing the data cells to be switched through, the improved arrangement comprising: (a) a cell buffer memory comprising first and second memory areas, the first memory area for storing first cells having a high loss priority value and the second memory area for storing second cells having aglow loss priority value, (b) determining means coupled to the input lines for determining the value in said cell loss priority field of the cell header of each incoming data cell to determine whether its cell loss priority is a high loss or low loss priority value, (c) allocating means in said crosspoint switch for in response to the determining means determining a high loss priority value of an incoming first cell for allocating said incoming first cell to the first memory area and in response to the determining means determining a low loss priority value of an incoming second cell for allocating said incoming second cell to the second memory a--rea, (d) switching means in said crosspoint switch for reading out for switching purposes first the high loss priority cells from the first memory area and for switching to reading out the low loss priority cells from the second,memory area when the number of cells stored in said second memory area exceeds a predetermined value, wherein said determining means, in response to the cell buffer memory being full, are arranged for storing incoming second cells having a low loss priority value in the first memory area by replacing first cells having a high loss priority value stored therein.
The invention relates to a telecommunication switching arrangement for switching digital data which are contained in data cells provided with a cell header, the arrangement comprising a crosspoint switch for switching cells from an input line of the switch to an output line of the switch, the switch being provided with a cell buffer memory for storing the cells to be switched through.
Such an arrangement can be used for fast packet-switching techniques which are known under the name of ATM
(Asynchronous Transfer Mode). The power of ATM is its ability to provide bandwidth on demand: different sources can have different bandwidth requirements.
Fast packet switching techniques clearly provide the flexibility for integration of mixed traffic streams, such as voice, data and video. Due to provision for the stochastic bandwidth requirements of some traffic sources, it is not so clear at first. sight whether a reasonable degree of utilization of switching and transmission resources can be achieved. That is, the primary benefit of fast packet switching lies in its flexibility to serve different traffic streams. The invention has for its object to provide an ATM system that can serve different types of traffic streams and which also uses capacity more efficiently than known arrangements.
Thereto, one aspect of the invention provides a telecommunication switching arrangement for switching digital data contained in data cells provided with a cell header, said cell header containing a cell loss priority field for storing a value representative of a cell loss priority of the data cell, the arrangement comprising a la crosspoint switch for switching incoming data cells from a plurality of input lines of the switch to an output line of the switch, the crosspoint switch further comprising a cell buffer memory for storing the data cells to be switched through, the improved arrangement comprising: (a) a cell buffer memory comprising first and second memory areas, the first memory area for storing first cells having a high loss priority value and the second memory area for storing second cells having aglow loss priority value, (b) determining means coupled to the input lines for determining the value in said cell loss priority field of the cell header of each incoming data cell to determine whether its cell loss priority is a high loss or low loss priority value, (c) allocating means in said crosspoint switch for in response to the determining means determining a high loss priority value of an incoming first cell for allocating said incoming first cell to the first memory area and in response to the determining means determining a low loss priority value of an incoming second cell for allocating said incoming second cell to the second memory a--rea, (d) switching means in said crosspoint switch for reading out for switching purposes first the high loss priority cells from the first memory area and for switching to reading out the low loss priority cells from the second,memory area when the number of cells stored in said second memory area exceeds a predetermined value, wherein said determining means, in response to the cell buffer memory being full, are arranged for storing incoming second cells having a low loss priority value in the first memory area by replacing first cells having a high loss priority value stored therein.
The invention makes use of the insight that some sources require low delay .
variation whereas other sources require low loss probabilities for ATM cells.
From the CCITT' Draft Recommendation L361: "ATM layer specification for B-ISDN", January 1990, it is known that the ATM cell header should have a CeU Loss Priority (CLP) bit. This CLP bH
creates the possibility to distinguish between two types of cells.
The performance of the ATM network as exposed to the user, depends primarily on the call acceptance probability. Known methods of resource allocation usually decide to accept an ATM connection if the resulting cell loss probability for of the aggregate input traffic remains below a preset maximum value. In these known methods the expected cell delay is considered of minor importance. Sometimes a higher cell loss probability can be tolerated, which then could be specified in the cell header, e.g. by using the CLP bit. Hereby two classes of traffic are introduced. The first class encompasses traffic requiring low loss probability. Traffic of the other class gives in on loss probability but gets a lower delay variation in return.
Sources that generate traffic whose time relation needs to be restored after passage through the asynchronous transfer network , benefit from a low delay variance.
This is so since delay dejirier buffers in the terminal equipment can be kept smaller if the trans-network delay variance is small. Traffic sources that generate traffic for which the integrity is of prime importance, on the other hand, w~71 prefer a low probability of cell loss.
An example of the latter is (machine oriented) data traffic, an example of the first is (human oriented) audiovisual traffic.
With integrated circuit technology one can realize buffers for several hundreds of ATM cells on one chip. These buffers, together with on-chip control logic, can be used to implement LDOLL (Low Delay Or Low Loss) queues. An LDOLL queuing policy favours low delay (or high loss) cells in service priority and low loss cells in storage priority.
To describe the sources of different traffic streams it should be realized that a cell transmission takes a few micro-seconds, a burst of cells (activity period of a source) lasts, wo ~ae19o6o ~~ret~t,gzeooa6~
variation whereas other sources require low loss probabilities for ATM cells.
From the CCITT' Draft Recommendation L361: "ATM layer specification for B-ISDN", January 1990, it is known that the ATM cell header should have a CeU Loss Priority (CLP) bit. This CLP bH
creates the possibility to distinguish between two types of cells.
The performance of the ATM network as exposed to the user, depends primarily on the call acceptance probability. Known methods of resource allocation usually decide to accept an ATM connection if the resulting cell loss probability for of the aggregate input traffic remains below a preset maximum value. In these known methods the expected cell delay is considered of minor importance. Sometimes a higher cell loss probability can be tolerated, which then could be specified in the cell header, e.g. by using the CLP bit. Hereby two classes of traffic are introduced. The first class encompasses traffic requiring low loss probability. Traffic of the other class gives in on loss probability but gets a lower delay variation in return.
Sources that generate traffic whose time relation needs to be restored after passage through the asynchronous transfer network , benefit from a low delay variance.
This is so since delay dejirier buffers in the terminal equipment can be kept smaller if the trans-network delay variance is small. Traffic sources that generate traffic for which the integrity is of prime importance, on the other hand, w~71 prefer a low probability of cell loss.
An example of the latter is (machine oriented) data traffic, an example of the first is (human oriented) audiovisual traffic.
With integrated circuit technology one can realize buffers for several hundreds of ATM cells on one chip. These buffers, together with on-chip control logic, can be used to implement LDOLL (Low Delay Or Low Loss) queues. An LDOLL queuing policy favours low delay (or high loss) cells in service priority and low loss cells in storage priority.
To describe the sources of different traffic streams it should be realized that a cell transmission takes a few micro-seconds, a burst of cells (activity period of a source) lasts, wo ~ae19o6o ~~ret~t,gzeooa6~
say, a fraction of a second, and the connection between source ~~d ~ ~t~a~ can stand for a several minutes.
Connections do not always need the full bandwidth for the whole duration of the connection. Moreover, the bandwidth requirement usually differs for the go or return path of a connection. Some traffic sources like some video coders have a variable bit rate (VBR).
E.g. in the case of a file transfer, a burst of packets is transmitted.
Termination of the file transfer does not necessarily imply immediate termination of the connection because more data may be exchanged subsequently. In the case of a VBR coder, the cell rate (i.e.
bandwidth) may change every 1/25 s. (resp. 1/30 s.), once every video frame. With its cell buffer array the LDOLL queue can allow for short periods of overload. This could provide an alternative for burst blocking.
The invention will be further explained in the following with reference to the drawing Figures, in which:
Figure 1 shows an embodiment of an ATM switching arrangement according to the invention;
Figure 2 shows a graphical representation of the probability of loss of LD and LL cells of the switching element according to the invention, compared with a FIFO policy;
Figure 3 shows a graphical representation of the delay of LL and LD cells compared with cell delay in a FIFO read-out policy;
Figure 4 shows a graphical representation of the probability of LL and LD cell loss compared with a FIFO policy, dependent on a threshold value;
Figure 5 shows a graphical representation of the cell delay of LL and Ld cells compared with a FIFO policy, dependent on. a threshold value.
Fig. 1 shows an ATM switching arrangement which might be considered the elementary building block of an ATM network. The arrangement has N ATM input links 1-1 through 1-N and one ATM output link 2. It is assumed that all links of the switching arrangement operate synchronously; the interval between two successive (idle) cell arrivals is called a time slot.
The cell receivers 3-1 through 3-N deserialize an incoming cell and store it after ~'O 92/i9060 PC.T/NL9~10006~
2~8~~~J
complete reception into input buffers 4-1 through ~1-N. Deserialization makes it possible to examine the header information, and to process ATM cells in p~u-allel. This allows practical switching elements to cope with the high switching speeds (millions of cells per second). Cell queuing element 5 receives the ATM cells from the input buffers. This cell queuing element can be implemented as a well-known elastic read-write buffer. It transfers the non-empty cells from the input buffers to the cell buffer array 6.
Cell queuing element 5 can also evaluate the value of the CLP bit in the cell header. This value is transferred to a switch actuator 6 which controls the opening and closing of a pair of switches g. The cell to be transferred to the cell buffer will thereby be placed in the LL part of the cell buffer or in the LD part, depending on the value of the CLP bit.
The cells are transferred from the input buffers to the cell buffer array 6 with storage priority for LL cells. That is, when the cell buffer array is full, an LL cell present at an input buffer will (under control of switch actuator 6) replace the oldest LD cell in the cell buffer array. By replacing the oldest LD cell the average delay for LD cells is minimised. LL
cells are lost only due to blocking when the cell buffer array is completely filled with LL cells.
LD cells are lost due to replacement or blocking when the cell buffer array is full.
The cells in the buffer array are organised in' two linked lists: one list to comprise all low delay (LD) cells (the law delay area LD), the other for all low loss (LL) cells (the low loss area LL). For each type the oldest cell is always at the head of the list.
Cell server 7 takes cells out of the cell buffer 9; the type of cells to be read out depends on the number of LL cells and LD cells in the cell buffer. In this service policy a threshold TH (which f.i. has,a value 40) is used, which means that LD cells are served first as Long as less than 40 LL cells are in the cell buffer array 9. The decision which type of cell should be read out is taken by a monitoring cixcuit 13, which monitors the number of cells in the low loss area of the cell buffer. Zf number of cells in LL exceeds the (adjustable) threshold TH, a switch pair 12a, 12b is actuated whereby reading of cells from the LD
urea is stopped and reading of cells from the LL area is started.
The output buffer transfer cells to the cell transmitter 11 which serializes it and puts them onto its outgoing link 2. Every time slot, cell service takes place prior to the enqueuing of a new cell into the cell buffer.
WO 92/19060 P~'/NL92/00067 The cell server could optionally bypass the cell enqueuer and the cell buffer.
This situation occurs for example, if the cell server finds the cell array 9 empty, and the input buffers hold at least one cell. It must be noted that, even i:F cells were transferred from the input to the output buffers infinitely fast, the (de)serialization of cells, introduces a delay of one time slot, i.e. the time needed for transmission of an entire cell.
However, if it is assumed that enqueuing and subsequent serving takes a single time slot or mare, the minimal delay introduced by the switching arrangement is two time slots.
In figures 2 through 9 results are shown of calculations and simulations that have been carried out to investigate the properties of the switching element of fzgure 1. In this simulation attention has been paid to variations in source activity and especially interesting is the case where temporary overload occurs. A switching element having two inputs has been assumed. It is also assumed that the LDOLL queue feeds a transmission outlet with a capacity of 150 Mbitls. The cell size was assumed to be 53 octets, with a payload of 44 octets. A
number of connections is multiplexed on each input channel. One channel carries the combined output streams of a number of VBR coders, with an average bit rate of 3.9 Mbitls. The other channel carries traffic produced by a number of onloff sources (e.g. file servers), with a peak band width of 3 Mbit/s and an average on-time and off-time of 0.1 s.The VBR
output stream consists of 90% LD cells and 10% LL cells. For the on-off traffic the reverse ratio is assumed. Each 1/30-th second, the bits of one frame are packed into cells which are transmitted at a constant average rate.
The simulation of the LDOLL queue is carried out with a cell buffer size of 50 buffers and a threshold value TH of 40 and with a varying number of traffic sources. The numbers of on-off and VBR sources were chosen the same, so that the LD load was about 2!3 of the total load. By varying the numuers of both sources from 19 to 23 the total load applied to the LDOLL queue could be varied.
Figure 2 shows the probability of loss of LD (dashed line) and LL cells (unbroken line) of the switching element according to the invention, compared with a FIFO
(first-in, fzrst-out) way of outputting cells from the cell buffer (dotted lirie). The cell loss probability is shown in this figure as a function of the loading. The cell loss that would occur if conventional FIFO queuing were used, is almost entirely inflicted on the LD
cells; the WO 92/19060 PC'I'/INL92l00067 ~~8~~~~
average LL cell loss probability is greatly reduced. This remains true even if the loading approaches unity. Then the LD cell loss probability becomes 1, since because of the storage priority the buffer as sen by LL cells is virtually empty. Figure 2 shows that in case of buffer overload the LD cells, by the replacement mechanism, are the first ones to be discarded.
In figure 3 the delay of LL cells (dashed line) and of LD cells (unbroken line) and are compared with cell delay in a FIFO read-out policy (dotted line). The cell delay is shown in this figure as a function of the loading. This figure shows that, compared with a FIF~ policy, the delay of LD cells is significantly reduced at the expense of a higher delay of LL cells.
Figure 4 shows the probability of LL and LD cell loss compared with a FIFO
policy, dependent on the threshold value TH. It appears that the LD loss probability is relatively insensitive to changes in the value TH.
Figure S illustrates the cell delay of LL and Ld cells compared with a FIFO
palicy, dependent on the threshold value TH. Increasing TH lessens the average delay for LD
cells and increases the average LL cell delay, at the same time increasing the loss rate of LL
cells. With this scenario there is no TH that yields an LD cell delay larger than that for LL
cells.
Connections do not always need the full bandwidth for the whole duration of the connection. Moreover, the bandwidth requirement usually differs for the go or return path of a connection. Some traffic sources like some video coders have a variable bit rate (VBR).
E.g. in the case of a file transfer, a burst of packets is transmitted.
Termination of the file transfer does not necessarily imply immediate termination of the connection because more data may be exchanged subsequently. In the case of a VBR coder, the cell rate (i.e.
bandwidth) may change every 1/25 s. (resp. 1/30 s.), once every video frame. With its cell buffer array the LDOLL queue can allow for short periods of overload. This could provide an alternative for burst blocking.
The invention will be further explained in the following with reference to the drawing Figures, in which:
Figure 1 shows an embodiment of an ATM switching arrangement according to the invention;
Figure 2 shows a graphical representation of the probability of loss of LD and LL cells of the switching element according to the invention, compared with a FIFO policy;
Figure 3 shows a graphical representation of the delay of LL and LD cells compared with cell delay in a FIFO read-out policy;
Figure 4 shows a graphical representation of the probability of LL and LD cell loss compared with a FIFO policy, dependent on a threshold value;
Figure 5 shows a graphical representation of the cell delay of LL and Ld cells compared with a FIFO policy, dependent on. a threshold value.
Fig. 1 shows an ATM switching arrangement which might be considered the elementary building block of an ATM network. The arrangement has N ATM input links 1-1 through 1-N and one ATM output link 2. It is assumed that all links of the switching arrangement operate synchronously; the interval between two successive (idle) cell arrivals is called a time slot.
The cell receivers 3-1 through 3-N deserialize an incoming cell and store it after ~'O 92/i9060 PC.T/NL9~10006~
2~8~~~J
complete reception into input buffers 4-1 through ~1-N. Deserialization makes it possible to examine the header information, and to process ATM cells in p~u-allel. This allows practical switching elements to cope with the high switching speeds (millions of cells per second). Cell queuing element 5 receives the ATM cells from the input buffers. This cell queuing element can be implemented as a well-known elastic read-write buffer. It transfers the non-empty cells from the input buffers to the cell buffer array 6.
Cell queuing element 5 can also evaluate the value of the CLP bit in the cell header. This value is transferred to a switch actuator 6 which controls the opening and closing of a pair of switches g. The cell to be transferred to the cell buffer will thereby be placed in the LL part of the cell buffer or in the LD part, depending on the value of the CLP bit.
The cells are transferred from the input buffers to the cell buffer array 6 with storage priority for LL cells. That is, when the cell buffer array is full, an LL cell present at an input buffer will (under control of switch actuator 6) replace the oldest LD cell in the cell buffer array. By replacing the oldest LD cell the average delay for LD cells is minimised. LL
cells are lost only due to blocking when the cell buffer array is completely filled with LL cells.
LD cells are lost due to replacement or blocking when the cell buffer array is full.
The cells in the buffer array are organised in' two linked lists: one list to comprise all low delay (LD) cells (the law delay area LD), the other for all low loss (LL) cells (the low loss area LL). For each type the oldest cell is always at the head of the list.
Cell server 7 takes cells out of the cell buffer 9; the type of cells to be read out depends on the number of LL cells and LD cells in the cell buffer. In this service policy a threshold TH (which f.i. has,a value 40) is used, which means that LD cells are served first as Long as less than 40 LL cells are in the cell buffer array 9. The decision which type of cell should be read out is taken by a monitoring cixcuit 13, which monitors the number of cells in the low loss area of the cell buffer. Zf number of cells in LL exceeds the (adjustable) threshold TH, a switch pair 12a, 12b is actuated whereby reading of cells from the LD
urea is stopped and reading of cells from the LL area is started.
The output buffer transfer cells to the cell transmitter 11 which serializes it and puts them onto its outgoing link 2. Every time slot, cell service takes place prior to the enqueuing of a new cell into the cell buffer.
WO 92/19060 P~'/NL92/00067 The cell server could optionally bypass the cell enqueuer and the cell buffer.
This situation occurs for example, if the cell server finds the cell array 9 empty, and the input buffers hold at least one cell. It must be noted that, even i:F cells were transferred from the input to the output buffers infinitely fast, the (de)serialization of cells, introduces a delay of one time slot, i.e. the time needed for transmission of an entire cell.
However, if it is assumed that enqueuing and subsequent serving takes a single time slot or mare, the minimal delay introduced by the switching arrangement is two time slots.
In figures 2 through 9 results are shown of calculations and simulations that have been carried out to investigate the properties of the switching element of fzgure 1. In this simulation attention has been paid to variations in source activity and especially interesting is the case where temporary overload occurs. A switching element having two inputs has been assumed. It is also assumed that the LDOLL queue feeds a transmission outlet with a capacity of 150 Mbitls. The cell size was assumed to be 53 octets, with a payload of 44 octets. A
number of connections is multiplexed on each input channel. One channel carries the combined output streams of a number of VBR coders, with an average bit rate of 3.9 Mbitls. The other channel carries traffic produced by a number of onloff sources (e.g. file servers), with a peak band width of 3 Mbit/s and an average on-time and off-time of 0.1 s.The VBR
output stream consists of 90% LD cells and 10% LL cells. For the on-off traffic the reverse ratio is assumed. Each 1/30-th second, the bits of one frame are packed into cells which are transmitted at a constant average rate.
The simulation of the LDOLL queue is carried out with a cell buffer size of 50 buffers and a threshold value TH of 40 and with a varying number of traffic sources. The numbers of on-off and VBR sources were chosen the same, so that the LD load was about 2!3 of the total load. By varying the numuers of both sources from 19 to 23 the total load applied to the LDOLL queue could be varied.
Figure 2 shows the probability of loss of LD (dashed line) and LL cells (unbroken line) of the switching element according to the invention, compared with a FIFO
(first-in, fzrst-out) way of outputting cells from the cell buffer (dotted lirie). The cell loss probability is shown in this figure as a function of the loading. The cell loss that would occur if conventional FIFO queuing were used, is almost entirely inflicted on the LD
cells; the WO 92/19060 PC'I'/INL92l00067 ~~8~~~~
average LL cell loss probability is greatly reduced. This remains true even if the loading approaches unity. Then the LD cell loss probability becomes 1, since because of the storage priority the buffer as sen by LL cells is virtually empty. Figure 2 shows that in case of buffer overload the LD cells, by the replacement mechanism, are the first ones to be discarded.
In figure 3 the delay of LL cells (dashed line) and of LD cells (unbroken line) and are compared with cell delay in a FIFO read-out policy (dotted line). The cell delay is shown in this figure as a function of the loading. This figure shows that, compared with a FIF~ policy, the delay of LD cells is significantly reduced at the expense of a higher delay of LL cells.
Figure 4 shows the probability of LL and LD cell loss compared with a FIFO
policy, dependent on the threshold value TH. It appears that the LD loss probability is relatively insensitive to changes in the value TH.
Figure S illustrates the cell delay of LL and Ld cells compared with a FIFO
palicy, dependent on the threshold value TH. Increasing TH lessens the average delay for LD
cells and increases the average LL cell delay, at the same time increasing the loss rate of LL
cells. With this scenario there is no TH that yields an LD cell delay larger than that for LL
cells.
Claims (4)
1. A telecommunication switching arrangement for switching digital data contained in data cells provided with a cell header, said cell header containing a cell loss priority field for storing a value representative of a cell loss priority of the data cell, the arrangement comprising a crosspoint switch for switching incoming data cells from a plurality of input lines of the switch to an output line of the switch, the crosspoint switch further comprising a cell buffer memory for storing the data cells to be switched through, the improved arrangement comprising:
(a) a cell buffer memory comprising first and second memory areas, the first memory area for storing first cells having a high loss priority value and the second memory area for storing second cells having a low loss priority value, (b) determining means coupled to the input lines for determining the value in said cell loss priority field of the cell header of each incoming data cell to determine whether its cell loss priority is a high loss or low loss priority value, (c) allocating means in said crosspoint switch for in response to the determining means determining a high loss priority value of an incoming first cell for allocating said incoming first cell to the first memory area and in response to the determining means determining a low loss priority value of an incoming second cell for allocating said incoming second cell to the second memory area, (d) switching means in said crosspoint switch for reading out for switching purposes first the high loss priority cells from the first memory area and for switching to reading out the low loss priority cells from the second memory area when the number of cells stored in said second memory area exceeds a predetermined value, wherein said determining means, in response to the cell buffer memory being full, are arranged for storing incoming second cells having a low loss priority value in the first memory area by replacing first cells having a high loss priority value stored therein.
(a) a cell buffer memory comprising first and second memory areas, the first memory area for storing first cells having a high loss priority value and the second memory area for storing second cells having a low loss priority value, (b) determining means coupled to the input lines for determining the value in said cell loss priority field of the cell header of each incoming data cell to determine whether its cell loss priority is a high loss or low loss priority value, (c) allocating means in said crosspoint switch for in response to the determining means determining a high loss priority value of an incoming first cell for allocating said incoming first cell to the first memory area and in response to the determining means determining a low loss priority value of an incoming second cell for allocating said incoming second cell to the second memory area, (d) switching means in said crosspoint switch for reading out for switching purposes first the high loss priority cells from the first memory area and for switching to reading out the low loss priority cells from the second memory area when the number of cells stored in said second memory area exceeds a predetermined value, wherein said determining means, in response to the cell buffer memory being full, are arranged for storing incoming second cells having a low loss priority value in the first memory area by replacing first cells having a high loss priority value stored therein.
2. The switching arrangement of claim 1, wherein the determining means comprises a queuing element for storing the incoming data cells and an evaluation circuit connected to the queuing element and to the allocating means.
3. The switching arrangement of claim 2, wherein the switching means comprises a monitoring means connected to the second memory area for monitoring the number of cells stored therein and in response to the number monitored exceeding the predetermined threshold switching the reading out means to the second memory area.
4. The arrangement of claim 1, wherein said determining means are arranged for replacing first the oldest first cells in the first memory.
Applications Claiming Priority (3)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| EP91200835.6 | 1991-04-10 | ||
| EP91200835 | 1991-04-10 | ||
| PCT/NL1992/000067 WO1992019060A1 (en) | 1991-04-10 | 1992-04-09 | Low delay or low loss cell switch for atm |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CA2084303A1 CA2084303A1 (en) | 1992-10-11 |
| CA2084303C true CA2084303C (en) | 2003-12-09 |
Family
ID=8207602
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CA002084303A Expired - Fee Related CA2084303C (en) | 1991-04-10 | 1992-04-09 | Low delay or low loss switch for atm |
Country Status (10)
| Country | Link |
|---|---|
| US (1) | US5390176A (en) |
| EP (1) | EP0533900B1 (en) |
| JP (1) | JP3420763B2 (en) |
| KR (1) | KR100229558B1 (en) |
| AU (1) | AU650339B2 (en) |
| CA (1) | CA2084303C (en) |
| CZ (1) | CZ282752B6 (en) |
| DE (1) | DE69221411T2 (en) |
| HU (1) | HU216033B (en) |
| WO (1) | WO1992019060A1 (en) |
Families Citing this family (44)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US6985487B1 (en) | 1990-07-27 | 2006-01-10 | Kabushiki Kaisha Toshiba | Broadband switching networks |
| JP2909165B2 (en) * | 1990-07-27 | 1999-06-23 | 株式会社東芝 | Broadband communication network, end user terminal, communication network, broadband communication node, communication node, interface adapter, multipoint connection interface, multipoint connection control device and access unit |
| JP3128654B2 (en) | 1990-10-19 | 2001-01-29 | 富士通株式会社 | Supervisory control method, supervisory control device and switching system |
| JPH0614049A (en) * | 1992-03-19 | 1994-01-21 | Fujitsu Ltd | Cell abort controller in atm and its method |
| SE515178C2 (en) * | 1992-03-20 | 2001-06-25 | Ericsson Telefon Ab L M | Procedures and devices for prioritizing buffer management in packet networks |
| FI91695C (en) * | 1992-10-05 | 1994-07-25 | Nokia Telecommunications Oy | Procedure for prioritizing traffic between local networks that are connected via a backbone network |
| FR2700865B1 (en) * | 1993-01-27 | 1995-02-24 | Alcatel Nv | Cell buffer management device. |
| US5689499A (en) * | 1993-03-26 | 1997-11-18 | Curtin University Of Technology | Method and apparatus for managing the statistical multiplexing of data in digital communication networks |
| FR2707023B1 (en) * | 1993-06-24 | 1995-09-22 | Boyer Jacqueline | |
| US5696764A (en) * | 1993-07-21 | 1997-12-09 | Fujitsu Limited | ATM exchange for monitoring congestion and allocating and transmitting bandwidth-guaranteed and non-bandwidth-guaranteed connection calls |
| JP3354689B2 (en) * | 1994-02-28 | 2002-12-09 | 富士通株式会社 | ATM exchange, exchange and switching path setting method thereof |
| JP2713153B2 (en) * | 1994-03-09 | 1998-02-16 | 日本電気株式会社 | Bridge device |
| GB2288947B (en) * | 1994-04-20 | 1999-01-06 | Roke Manor Research | Improvements in or relating to ATM communication systems |
| FI98774C (en) * | 1994-05-24 | 1997-08-11 | Nokia Telecommunications Oy | Method and apparatus for prioritizing traffic in an ATM network |
| US5487061A (en) * | 1994-06-27 | 1996-01-23 | Loral Fairchild Corporation | System and method for providing multiple loss and service priorities |
| US5553061A (en) * | 1994-06-27 | 1996-09-03 | Loral Fairchild Corporation | Packet processor having service priority and loss priority features |
| JP3553138B2 (en) * | 1994-07-14 | 2004-08-11 | 株式会社ルネサステクノロジ | Semiconductor storage device |
| US5495478A (en) * | 1994-11-14 | 1996-02-27 | Dsc Communications Corporation | Apparatus and method for processing asynchronous transfer mode cells |
| US5539729A (en) * | 1994-12-09 | 1996-07-23 | At&T Corp. | Method for overload control in a packet switch that processes packet streams having different priority levels |
| JP2570641B2 (en) * | 1994-12-20 | 1997-01-08 | 日本電気株式会社 | Self-routing switch method and circuit in ATM switch |
| US5675573A (en) * | 1995-03-22 | 1997-10-07 | Lucent Technologies Inc. | Delay-minimizing system with guaranteed bandwidth delivery for real-time traffic |
| US5724352A (en) * | 1995-08-31 | 1998-03-03 | Lucent Technologies Inc. | Terabit per second packet switch having assignable multiple packet loss probabilities |
| US6122279A (en) * | 1995-10-02 | 2000-09-19 | Virata Limited | Asynchronous transfer mode switch |
| FR2740283B1 (en) * | 1995-10-24 | 1997-12-19 | Thomson Csf | DEVICE FOR REGULATING THE ATM CELL FLOW WITHIN AN ATM BREWER |
| SE508328C2 (en) | 1995-11-09 | 1998-09-28 | Ericsson Telefon Ab L M | Device flow and method for packet flow control |
| FR2747256B1 (en) * | 1996-04-05 | 1998-06-19 | Thomson Csf | METHOD FOR ESTIMATING THE DATA CELL LOSS RATE IN A DIGITAL TRANSMISSION NETWORK SWITCH |
| US5953336A (en) * | 1996-08-05 | 1999-09-14 | Virata Limited | Method and apparatus for source rate pacing in an ATM network |
| GB9618137D0 (en) * | 1996-08-30 | 1996-10-09 | Sgs Thomson Microelectronics | Improvements in or relating to an ATM switch |
| FI103310B (en) | 1996-11-15 | 1999-05-31 | Nokia Telecommunications Oy | Implementation of buffering in a packet switching data communication network |
| US6111858A (en) * | 1997-02-18 | 2000-08-29 | Virata Limited | Proxy-controlled ATM subnetwork |
| KR100236036B1 (en) * | 1997-03-31 | 1999-12-15 | 전주범 | Method of discarding atm cells in an atm nic |
| GB9719316D0 (en) | 1997-09-12 | 1997-11-12 | Power X Limited | Priority selection means for data transmission apparatus |
| US6147970A (en) * | 1997-09-30 | 2000-11-14 | Gte Internetworking Incorporated | Quality of service management for aggregated flows in a network system |
| US6198723B1 (en) * | 1998-04-14 | 2001-03-06 | Paxonet Communications, Inc. | Asynchronous transfer mode traffic shapers |
| US6993018B1 (en) * | 1999-08-03 | 2006-01-31 | Telefonaktiebolaget Lm Ericsson (Publ) | Priority signaling for cell switching |
| JP2004502344A (en) * | 2000-06-26 | 2004-01-22 | コーニンクレッカ フィリップス エレクトロニクス エヌ ヴィ | Low delay and low loss packet switch |
| US7423972B2 (en) * | 2000-11-28 | 2008-09-09 | Flash Networks Ltd. | System and method for a transmission rate controller |
| US6937607B2 (en) * | 2001-06-21 | 2005-08-30 | Alcatel | Random early discard for cell-switched data switch |
| US20030016625A1 (en) * | 2001-07-23 | 2003-01-23 | Anees Narsinh | Preclassifying traffic during periods of oversubscription |
| US20030067874A1 (en) * | 2001-10-10 | 2003-04-10 | See Michael B. | Central policy based traffic management |
| US7606158B2 (en) * | 2004-09-24 | 2009-10-20 | Cisco Technology, Inc. | Hierarchical flow control for router ATM interfaces |
| TWI330964B (en) | 2007-01-29 | 2010-09-21 | Via Tech Inc | Packet processing method and a network device using the method |
| CN103401805A (en) * | 2007-03-29 | 2013-11-20 | 威盛电子股份有限公司 | Network device |
| US9130743B2 (en) * | 2011-06-21 | 2015-09-08 | Pyxim Wireless, Inc. | Method and apparatus for communicating between low message rate wireless devices and users via monitoring, control and information systems |
Family Cites Families (10)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| EP0312628B1 (en) * | 1987-10-20 | 1993-12-29 | International Business Machines Corporation | High-speed modular switching apparatus for circuit and packet switched traffic |
| JPH01221042A (en) * | 1988-02-29 | 1989-09-04 | Toshiba Corp | Congestion control method for packet exchange |
| US5101402A (en) * | 1988-05-24 | 1992-03-31 | Digital Equipment Corporation | Apparatus and method for realtime monitoring of network sessions in a local area network |
| DE3833490A1 (en) * | 1988-10-01 | 1990-04-05 | Philips Patentverwaltung | COUPLING PANEL FOR A MEDIATION SYSTEM |
| US4914650A (en) * | 1988-12-06 | 1990-04-03 | American Telephone And Telegraph Company | Bandwidth allocation and congestion control scheme for an integrated voice and data network |
| US5140584A (en) * | 1989-03-01 | 1992-08-18 | Kabushiki Kaisha Toshiba | Packet communication system and method of controlling same |
| JP2860661B2 (en) * | 1989-03-14 | 1999-02-24 | 国際電信電話 株式会社 | ATM switch |
| US5179557A (en) * | 1989-07-04 | 1993-01-12 | Kabushiki Kaisha Toshiba | Data packet communication system in which data packet transmittal is prioritized with queues having respective assigned priorities and frequency weighted counting of queue wait time |
| US5050161A (en) * | 1989-12-04 | 1991-09-17 | Bell Communications Research, Inc. | Congestion management based on multiple framing strategy |
| US5166930A (en) * | 1990-12-17 | 1992-11-24 | At&T Bell Laboratories | Data channel scheduling discipline arrangement and method |
-
1992
- 1992-04-09 DE DE69221411T patent/DE69221411T2/en not_active Expired - Fee Related
- 1992-04-09 KR KR1019920703152A patent/KR100229558B1/en not_active IP Right Cessation
- 1992-04-09 HU HUP9203898A patent/HU216033B/en not_active IP Right Cessation
- 1992-04-09 CA CA002084303A patent/CA2084303C/en not_active Expired - Fee Related
- 1992-04-09 CZ CS923530A patent/CZ282752B6/en not_active IP Right Cessation
- 1992-04-09 AU AU17468/92A patent/AU650339B2/en not_active Ceased
- 1992-04-09 JP JP50954192A patent/JP3420763B2/en not_active Expired - Fee Related
- 1992-04-09 EP EP92909960A patent/EP0533900B1/en not_active Expired - Lifetime
- 1992-04-09 WO PCT/NL1992/000067 patent/WO1992019060A1/en active IP Right Grant
-
1993
- 1993-09-23 US US08/126,146 patent/US5390176A/en not_active Expired - Fee Related
Also Published As
| Publication number | Publication date |
|---|---|
| HUT64656A (en) | 1994-01-28 |
| CZ353092A3 (en) | 1993-11-17 |
| KR100229558B1 (en) | 1999-11-15 |
| CZ282752B6 (en) | 1997-09-17 |
| KR930701040A (en) | 1993-03-16 |
| DE69221411T2 (en) | 1998-02-12 |
| JP3420763B2 (en) | 2003-06-30 |
| EP0533900B1 (en) | 1997-08-06 |
| EP0533900A1 (en) | 1993-03-31 |
| AU650339B2 (en) | 1994-06-16 |
| WO1992019060A1 (en) | 1992-10-29 |
| CA2084303A1 (en) | 1992-10-11 |
| HU216033B (en) | 1999-04-28 |
| AU1746892A (en) | 1992-11-17 |
| JPH05508283A (en) | 1993-11-18 |
| US5390176A (en) | 1995-02-14 |
| HU9203898D0 (en) | 1993-03-29 |
| DE69221411D1 (en) | 1997-09-11 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CA2084303C (en) | Low delay or low loss switch for atm | |
| US5278828A (en) | Method and system for managing queued cells | |
| AU602379B2 (en) | Packet switching system arranged for congestion control through bandwidth management | |
| US5394396A (en) | Supervision control system | |
| CA2065043C (en) | Method for prioritizing selectively discarding and multiplexing differing traffic type fast packets | |
| US5850399A (en) | Hierarchical packet scheduling method and apparatus | |
| CA2247367C (en) | Event-driven cell scheduler and method for supporting multiple service categories in a communication network | |
| EP0487235B1 (en) | Bandwidth and congestion management in accessing broadband ISDN networks | |
| US7145868B2 (en) | Congestion management in a multi-port shared memory switch | |
| JPH04245742A (en) | Method and device for transmitting packet data traffic | |
| EP0973304A2 (en) | Apparatus and method for bandwidth management | |
| US5910942A (en) | Device to regulate the flow of ATM cells within an ATM packet switch | |
| Lund et al. | Fair prioritized scheduling in an input-buffered switch | |
| Chao et al. | A new QoS-guaranteed cell discarding strategy: self-calibrating pushout | |
| Awater et al. | Optimal queueing policies for fast packet switching of mixed traffic | |
| USRE42121E1 (en) | Method and system for a hierarchical traffic shaper | |
| Chao et al. | An ATM queue manager with multiple delay and loss priorities | |
| Katevenis et al. | Multi-queue management and scheduling for improved QoS in communication networks | |
| Kubota et al. | Congestion control for bursty video traffic in ATM networks | |
| KR100221324B1 (en) | Apparatus and method of dynamic priority queueing discipline using the per-session frame defined by the synchronus counter operation in atm networks | |
| Hsing | Simulation and performance evaluation of an ATM multiplexer using priority scheduling (for B-ISDN environment) | |
| Blackwell et al. | An Experimental Flow-Controlled Multicast ATM Switch | |
| Newman | Fast packet switching for broadband ISDN | |
| Casoni | A selective packet discard scheme for supporting internet QoS in congested ATM switches | |
| Sabaa et al. | Implementation of a window-based scheduler in an ATM switch |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| EEER | Examination request | ||
| MKLA | Lapsed |