CA2043600C - Serving constant bit rate traffic in a broadband data switch - Google Patents
Serving constant bit rate traffic in a broadband data switchInfo
- Publication number
- CA2043600C CA2043600C CA002043600A CA2043600A CA2043600C CA 2043600 C CA2043600 C CA 2043600C CA 002043600 A CA002043600 A CA 002043600A CA 2043600 A CA2043600 A CA 2043600A CA 2043600 C CA2043600 C CA 2043600C
- Authority
- CA
- Canada
- Prior art keywords
- data
- bit rate
- queues
- sources
- queue
- 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
- H04L12/5602—Bandwidth control in ATM Networks, e.g. leaky bucket
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L49/00—Packet switching elements
- H04L49/30—Peripheral units, e.g. input or output ports
- H04L49/3081—ATM peripheral units, e.g. policing, insertion or extraction
-
- 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
Abstract
Abstract This invention relates to a method and apparatus for transmitting constant and variable bit rate traffic in a broadband ISDN switch. Data from constant bit rate sources such as television cameras is entered into a group of queues.
Each member of the group for queuing data of a different band of bit rates. Data is transmitted from these queues with highest priority from the queue storing data of the highest band of bit rates. If the longest enqueued entity of data in one of the other queues has been enqueued for more than a prespecified period, its priority is increased. Analytic studies have shown that use of three queues for constant bit rate traffic and a fourth queue for variable bit rate traffic allows a high occupancy in the output channels to be maintained with a negligible number of data entities excessively delayed.
Each member of the group for queuing data of a different band of bit rates. Data is transmitted from these queues with highest priority from the queue storing data of the highest band of bit rates. If the longest enqueued entity of data in one of the other queues has been enqueued for more than a prespecified period, its priority is increased. Analytic studies have shown that use of three queues for constant bit rate traffic and a fourth queue for variable bit rate traffic allows a high occupancy in the output channels to be maintained with a negligible number of data entities excessively delayed.
Description
20~3~
~` 1 -SERVING CONSTANT BIT RATE TRAFFIC IN A BROADBAND DATA SWITCH
Technical Field This invention relates to a method and apparatus for switching constant bit rate and variable bit rate packetized traffic through a data switch.
5 Problem ~ Telecommunications networks can be organized to set up circuit -: connections between end terminals or to set up connections such as packet switched ` connections. Such packet switched comlections are capable of transmitting s.ignals at a variable rate but can also be used for transmitting signals at a fixed rate. In 10 many cases, it is advantageous to transmit both types of signals over the same facility since different terrninals demand different types of service. Special packet ~; switched networks capable of handling broadband signals have recently become v available. One example is the broadband ISDN (BISDN) network specified in CCll~ Study Group 18: Recommendations for Broadband Aspects of ISDN.
15 BISDN uses for its basic data transport protocol, a layer 1 protocol called the Asynchronous Transfer Mode (ATM). In this mode, a series of cells are transmitted over the data transmission medium. Several cells are assembled into frames, each`' cell conveying 48 bytes of data and using 5 bytes of header information for routing.
These cells then form the basic atomic unit for the transmission of signals within a 20 broadband ISDN.
A large portion of the traffic that is served by a BISDN network is constant bit rate (CBR) traffic characterized by having a fixed rate of data transmission. One example of a terminal using CBR is an NTSC or HDTV video signal source. Such a source produces data at a constant rate. In order to have a 25 transmission network capable of trans nitting CBR data, such a network must be capable of delivering such data at a constant rate.
A problem arises in switching and transmitting such CBR traffic. The traffic sources are not synchronized with each other or with a standard clock within the system. Hence7 the arrival time of cells from CBR sources is random. While a30 switch can provide some buffering to receive cells from a number of sources7 the amount of buffering is limited and it is important to deliver the cells at a regular rate to outputs so that the receiving terminal receives a steady stream of data. Queuing delays resulting from contending cells, resulting from the random arrival of these cells give rise to variations in cell spacing which tends to become magnified as the ` 35 cells traverse the network. The network processes cells from terminals which ~'' . . , .~.. - , . . .
, . . .
~: .
. , .
~` 1 -SERVING CONSTANT BIT RATE TRAFFIC IN A BROADBAND DATA SWITCH
Technical Field This invention relates to a method and apparatus for switching constant bit rate and variable bit rate packetized traffic through a data switch.
5 Problem ~ Telecommunications networks can be organized to set up circuit -: connections between end terminals or to set up connections such as packet switched ` connections. Such packet switched comlections are capable of transmitting s.ignals at a variable rate but can also be used for transmitting signals at a fixed rate. In 10 many cases, it is advantageous to transmit both types of signals over the same facility since different terrninals demand different types of service. Special packet ~; switched networks capable of handling broadband signals have recently become v available. One example is the broadband ISDN (BISDN) network specified in CCll~ Study Group 18: Recommendations for Broadband Aspects of ISDN.
15 BISDN uses for its basic data transport protocol, a layer 1 protocol called the Asynchronous Transfer Mode (ATM). In this mode, a series of cells are transmitted over the data transmission medium. Several cells are assembled into frames, each`' cell conveying 48 bytes of data and using 5 bytes of header information for routing.
These cells then form the basic atomic unit for the transmission of signals within a 20 broadband ISDN.
A large portion of the traffic that is served by a BISDN network is constant bit rate (CBR) traffic characterized by having a fixed rate of data transmission. One example of a terminal using CBR is an NTSC or HDTV video signal source. Such a source produces data at a constant rate. In order to have a 25 transmission network capable of trans nitting CBR data, such a network must be capable of delivering such data at a constant rate.
A problem arises in switching and transmitting such CBR traffic. The traffic sources are not synchronized with each other or with a standard clock within the system. Hence7 the arrival time of cells from CBR sources is random. While a30 switch can provide some buffering to receive cells from a number of sources7 the amount of buffering is limited and it is important to deliver the cells at a regular rate to outputs so that the receiving terminal receives a steady stream of data. Queuing delays resulting from contending cells, resulting from the random arrival of these cells give rise to variations in cell spacing which tends to become magnified as the ` 35 cells traverse the network. The network processes cells from terminals which ~'' . . , .~.. - , . . .
, . . .
~: .
. , .
2~3~
generate these cells at different bit rates over a wide range varying from 64 kilobits per second to 140 megabits per second. The problem is further compounded by the fact that a typical BISDN network is likely to transmit variable bit rate ~VBR) trafflc as well as the constant bit rate traffic. No satisfactory arrangement exists in the prior S art for ensuring a very low probability of incurring excessive delay between two adjacent cellsl or jitter, destined for a CBR virtual connection. Jitter may be reduced to zero by providing an arbitrarily large buildout delay at the destination CBR
. . .
terminal. The amount of buffering required to accomplish this practically may bequite large depending upon the application and buffer management can also become10 complex.
Solution ` ' The above problem is solved and an advance is made over the prior art in accordance with our invention wherein we divide CBR traffic into an integral number of priority levels; then all traffic of the highest priority level is transmitted 15 before any traffic of the next lower priority level which is transmitted before any traffic of the next lower priority level etc. Advantageously, such an ar~angement allows the maximum delay incurred by the highest priority level to be limited to a smaller number than the delay incurred for a next lower priority level, etc. This solution also alleviates the problem of buffeIing in the CBR terminal.
In accordance with one specific embodiment of the invention, the highest priority levels are assigned to high bit rate CBR virtual channels and the lowest priority levels are assigned to low bit rate CBR virtual chalmels. This lirnits the size of the bu~fer required for the high bit rate terminals. In one specificembodiment, the priority levels are assigned to disjoint levels of the virtual CBR
25 channel rates. Advantageously, this arrangement ensures lower delay for high bit rate CBR virtual channels.
A situation may occur wherein badly jittered high priority traffic monopolizes the interface causing lower priority, well-behaved traffic to lose its smooth traffic characteristic. In accordance with one aspect of the invention, the 30 priority level of the next cell of a lower priority is given a priority adjustment based ` on its age in the queue or its age as the top cell in the queue. This improves per~orrnance and prevents high bit rate channels from "hogging" the physical channel thereby disrupting other lower priority traffic.
` Analytic studies have shown that three priority levels may be effectively - 35 used, the highest for the range of 140 megabits to 15 megabits per second, a medium level of priority for 15 to 1.5 rate and a lowest level of priority for rates less than :,-'.
, ~:
:,' :.
.
: 20~36~0 1.5 megabits. Using these values, analytic studies for a network ~lsing 150 megabit physical channels have shown that a build-out delay in excess of 55 microseconds for the highest priority level virtual CBR channels, of 110 microseconds for medium priority virtual CBR channels, and 440 microseconds for lowest priority virtual CBR
. 5 channels is almost never encountered. Specifically, the studies indicate that the probability of such a delay is about N x 10 l5 where N is the number of switching nodes through which the cells of the virtual channel are transmitted. For higherbandwidth physical channels, the probability is even lower, and the build-out delay may be decreased.
In accordance with one aspect of the invention there is provided a method of transmitting packetized data traffic from a number of sources having different bit rates comprising the steps of: entering data from sources having different bands of bit rates in different queues; and transmitting from queues serving higher bit -; rate sources with higher priority than data from queues serving lower bit rate sources;
and wherein some of said sources generate constant bit rate data and others generate variable bit rate data, wherein separate queues are used for serving constant bit rate data sources and variable bit rate data sources and wherein said transmitting comprises transmitting data from queues serving constant bit rate sources with higher priority than data from queues serving variable bit rate sources.
In accordance with another aspect of the invention there is provided - apparatus for transmitting packetized data from a plurality of sources having different bit rates comprising: a plurality of queues for storing entities of data, each queue for : storing data from sources having a different band of bit rates; processor means : operative under the control of a first program for controlling storage of data from .:
-: 25 each of said sources into one of said queues, said one queue for storing data of a band - of bit rates including a bit rate of said each source; and said processor means further operative under the control of a second program for controlling transmission of data stored in said queues, transmission of data from a queue for storing a first band of bit rates being given priority over transmission of data from a queue for storing a second ~- 30 band of bit rates, wherein said ~irst band has higher bit rates than said second band.
..
.:-'..
"' ' ~ 'I
`''.~ ',~
,,, . ' .
. ' ' .
2043~a - 3a -Brief Description of the Drawin~
FIG. 1 illustrates a node of a broadband ISDN network;
FIGs. 2-6 are flowcharts of operations performed to switch data entities ' through the broadband ISDN node in conformance with the principles of this - 5 invention.
Det~iled Description FIG. 1 is a block diagram of a broadband ISDN node. It comprises a plurality of input ports 102, each of which has a processor 104. The input portsprocess input data to generate cells which are transmitted through an ATM switching fabric 110 to one of a plurality of output ports 120. Each output port has a processor 122 comprising a central processing unit 124 and memory 130. The memory is used for storing a program 132 and four queues: queue 1, 134, queue 2, 136, queue 3, 138, and queue 4, 139. Three of these queues are for CBR traffic, one for VBR traf~lc.
These four queues are used to queue cells in order of priority and arrival time in accordance with the principles of this invention for transmission under the control of controller 124, operating under the control of program 132. Controller 124 is a control processing unit, a programmable logic array, or other controller.
FIG. 2 is a flow chart of the process for assigning priority to a virtual channel during call setup. The peak rate for a terminal of the exemplary system is 140 megabits per second (Mb/s). A request is received to set up a Yirtual channel (action block 201). The rate for this virtual channel is x and the type is constant bit rate or variable bit rate (action block 203). If the type is constant bit rate and x is no greater than 140 ~4b/s but greater than 15 ~4b/s, and the type is constant bit rate, then priority ~` 1 is selected (action block 205). If x is no greater than 15 Mb/s but greater ~han 1.5 25 Mb/s and the type is constant bit rate, then priority 2 is selected (action block 207). If x is no greater than 1.5 Mb/s and this is a constant bit rate channel, ,., :,.
".
. .
, . .
, .~ . . .~
" ~.
:- . . v .~ ' .
.: ~
2t~4361~
: - 4 -then priority 3 is selected (action block 209). If this is a variable bit rate virtual channel, then priority 4 is selected (action block 211). The selected priority is assigned to that virtual channel (action block 213). In the specific embodiment which has been analytically studied, B is 15 megabits per second, and C is 5 1.5 megabits per second; 15 megabit channels and 1.5 megabits channels are trea~ed as priority 1 and priority 2 channels, respectively. While in this specific embodiment, a single priority level is used for all VBR traffic, it may be desirable to use two or more levels to give higher priority to high speed VBR traffic.
~-~ FIG.3 is a flow diagram of the pertinent parts of an input port receive 10 process. A cell is received (action block 301). The virtual circuit of that cell is identified based on data in the cell (action blc.ck 303). The priority for that virtual circuit is then identified (action block 305) and the cell and a priority indicator is ~ transmitted to the appropriate output port via the switching fabric (action block 307).
-~ FIG. 4 is a flow diagrarn of an output port receive process. A cell and a 15 priority indication is received in the output port (action block 401). The received cell is stored in the queue for that priority indication (action block 403).
FIG. 5 is a flow diagram of a process which is used to increment the age count of the first cell in every queue once per cell time. Every 2.83 microseconds - (the cell time in a 155.56 Mb/s BISDN interface) the count of time, oT, is 20 incremented by one unit (action block 501) for all constant bit rate initial queued cells, i.e., the first cell in queues 134, 136, and 138. This is the process which allows :~ cells in lower priority CBR queues to be transmitted if they have been waiting a . sufficiently long tirne.
: . FIG. 6 is a flow diagram of an output port transmit process. All the 25 queues (134, 136, 138., and 139) for that port are first examined (action block 601).
Test 603 checks whether there are any cells in any queue. If not, the process ends : (action block 6ûS). If so, then the first cell from each non-empty queue is extracted . (action block 607). The priority for this cell is adjusted by the formula -- Pl = P0 - (A)(~T), where P0 is the priority of the queue, and the values of Pl for the 30 oldest entries in each of the queues are then examined (action block 609). 'Ihe cell is : then selected from the queue having the highest Pl value and this cell is transmitted (action block 611). The priority of the variable bit rate cell is not varied in this process. The result of performing the actions of FIG. 6 are that, in general, the cell from ~he highest priority queue having a cell is transmitted but for those cases in ~, 35 which the first cell in one of the other queues has been in that queue for a long time, that cell is then transmitted. This allows the engineered traffic of low priority queues .
.
.
. . . .
'~
2~3~3 to preserve its jitter characteristic. The value of A which has been selected based on ~; analytic studies is 0 for the priority 1 and 4 queues, 0.1 for the priority 2 queue, and 0.01 for the p~iority 3 queue, and the value of ~T is one step per cell time (2.83 microseconds). Thus, for example, if a cell has been enqueued as the first cell . 5 in queue 2 for ten cell times, its priority is increased (i.e., its priority number is : decreased) by one level.
The result of carrying out the actions of the flow charts of FIGS. 2-6 are that cells from high bit rate constant bit rate virtual channels are given priority over cells from lower bit rate constant bit rate channels which are in turn given priority 10 over v~iable bit rate channels. Further, if a cell from a constant bit rate channel has been waiting in a queue for a sufIiciently long time, its priority for transmission purposes is raised. If priority 1, 2, and 3 channels have 55, 110, and 440 rnicroseconds of buffering, respectively, and no 150 megabit channel is loaded beyond 95% of capacity, then there is a very low probability (approximately N times 15 10-15 for an N node connection) encountering a delay that exceeds the buffering supplied for a channel.
It is to be understood that the above description is only of one preferred embodiment of the invention. Numerous other arrangements may be devised by one - skilled in the art without departing from the scope of the invention. The invention is 20 thus limited only as defined in the accompanying claims.
.. .
.
,~`
. . .
, .;
:., ' .
generate these cells at different bit rates over a wide range varying from 64 kilobits per second to 140 megabits per second. The problem is further compounded by the fact that a typical BISDN network is likely to transmit variable bit rate ~VBR) trafflc as well as the constant bit rate traffic. No satisfactory arrangement exists in the prior S art for ensuring a very low probability of incurring excessive delay between two adjacent cellsl or jitter, destined for a CBR virtual connection. Jitter may be reduced to zero by providing an arbitrarily large buildout delay at the destination CBR
. . .
terminal. The amount of buffering required to accomplish this practically may bequite large depending upon the application and buffer management can also become10 complex.
Solution ` ' The above problem is solved and an advance is made over the prior art in accordance with our invention wherein we divide CBR traffic into an integral number of priority levels; then all traffic of the highest priority level is transmitted 15 before any traffic of the next lower priority level which is transmitted before any traffic of the next lower priority level etc. Advantageously, such an ar~angement allows the maximum delay incurred by the highest priority level to be limited to a smaller number than the delay incurred for a next lower priority level, etc. This solution also alleviates the problem of buffeIing in the CBR terminal.
In accordance with one specific embodiment of the invention, the highest priority levels are assigned to high bit rate CBR virtual channels and the lowest priority levels are assigned to low bit rate CBR virtual chalmels. This lirnits the size of the bu~fer required for the high bit rate terminals. In one specificembodiment, the priority levels are assigned to disjoint levels of the virtual CBR
25 channel rates. Advantageously, this arrangement ensures lower delay for high bit rate CBR virtual channels.
A situation may occur wherein badly jittered high priority traffic monopolizes the interface causing lower priority, well-behaved traffic to lose its smooth traffic characteristic. In accordance with one aspect of the invention, the 30 priority level of the next cell of a lower priority is given a priority adjustment based ` on its age in the queue or its age as the top cell in the queue. This improves per~orrnance and prevents high bit rate channels from "hogging" the physical channel thereby disrupting other lower priority traffic.
` Analytic studies have shown that three priority levels may be effectively - 35 used, the highest for the range of 140 megabits to 15 megabits per second, a medium level of priority for 15 to 1.5 rate and a lowest level of priority for rates less than :,-'.
, ~:
:,' :.
.
: 20~36~0 1.5 megabits. Using these values, analytic studies for a network ~lsing 150 megabit physical channels have shown that a build-out delay in excess of 55 microseconds for the highest priority level virtual CBR channels, of 110 microseconds for medium priority virtual CBR channels, and 440 microseconds for lowest priority virtual CBR
. 5 channels is almost never encountered. Specifically, the studies indicate that the probability of such a delay is about N x 10 l5 where N is the number of switching nodes through which the cells of the virtual channel are transmitted. For higherbandwidth physical channels, the probability is even lower, and the build-out delay may be decreased.
In accordance with one aspect of the invention there is provided a method of transmitting packetized data traffic from a number of sources having different bit rates comprising the steps of: entering data from sources having different bands of bit rates in different queues; and transmitting from queues serving higher bit -; rate sources with higher priority than data from queues serving lower bit rate sources;
and wherein some of said sources generate constant bit rate data and others generate variable bit rate data, wherein separate queues are used for serving constant bit rate data sources and variable bit rate data sources and wherein said transmitting comprises transmitting data from queues serving constant bit rate sources with higher priority than data from queues serving variable bit rate sources.
In accordance with another aspect of the invention there is provided - apparatus for transmitting packetized data from a plurality of sources having different bit rates comprising: a plurality of queues for storing entities of data, each queue for : storing data from sources having a different band of bit rates; processor means : operative under the control of a first program for controlling storage of data from .:
-: 25 each of said sources into one of said queues, said one queue for storing data of a band - of bit rates including a bit rate of said each source; and said processor means further operative under the control of a second program for controlling transmission of data stored in said queues, transmission of data from a queue for storing a first band of bit rates being given priority over transmission of data from a queue for storing a second ~- 30 band of bit rates, wherein said ~irst band has higher bit rates than said second band.
..
.:-'..
"' ' ~ 'I
`''.~ ',~
,,, . ' .
. ' ' .
2043~a - 3a -Brief Description of the Drawin~
FIG. 1 illustrates a node of a broadband ISDN network;
FIGs. 2-6 are flowcharts of operations performed to switch data entities ' through the broadband ISDN node in conformance with the principles of this - 5 invention.
Det~iled Description FIG. 1 is a block diagram of a broadband ISDN node. It comprises a plurality of input ports 102, each of which has a processor 104. The input portsprocess input data to generate cells which are transmitted through an ATM switching fabric 110 to one of a plurality of output ports 120. Each output port has a processor 122 comprising a central processing unit 124 and memory 130. The memory is used for storing a program 132 and four queues: queue 1, 134, queue 2, 136, queue 3, 138, and queue 4, 139. Three of these queues are for CBR traffic, one for VBR traf~lc.
These four queues are used to queue cells in order of priority and arrival time in accordance with the principles of this invention for transmission under the control of controller 124, operating under the control of program 132. Controller 124 is a control processing unit, a programmable logic array, or other controller.
FIG. 2 is a flow chart of the process for assigning priority to a virtual channel during call setup. The peak rate for a terminal of the exemplary system is 140 megabits per second (Mb/s). A request is received to set up a Yirtual channel (action block 201). The rate for this virtual channel is x and the type is constant bit rate or variable bit rate (action block 203). If the type is constant bit rate and x is no greater than 140 ~4b/s but greater than 15 ~4b/s, and the type is constant bit rate, then priority ~` 1 is selected (action block 205). If x is no greater than 15 Mb/s but greater ~han 1.5 25 Mb/s and the type is constant bit rate, then priority 2 is selected (action block 207). If x is no greater than 1.5 Mb/s and this is a constant bit rate channel, ,., :,.
".
. .
, . .
, .~ . . .~
" ~.
:- . . v .~ ' .
.: ~
2t~4361~
: - 4 -then priority 3 is selected (action block 209). If this is a variable bit rate virtual channel, then priority 4 is selected (action block 211). The selected priority is assigned to that virtual channel (action block 213). In the specific embodiment which has been analytically studied, B is 15 megabits per second, and C is 5 1.5 megabits per second; 15 megabit channels and 1.5 megabits channels are trea~ed as priority 1 and priority 2 channels, respectively. While in this specific embodiment, a single priority level is used for all VBR traffic, it may be desirable to use two or more levels to give higher priority to high speed VBR traffic.
~-~ FIG.3 is a flow diagram of the pertinent parts of an input port receive 10 process. A cell is received (action block 301). The virtual circuit of that cell is identified based on data in the cell (action blc.ck 303). The priority for that virtual circuit is then identified (action block 305) and the cell and a priority indicator is ~ transmitted to the appropriate output port via the switching fabric (action block 307).
-~ FIG. 4 is a flow diagrarn of an output port receive process. A cell and a 15 priority indication is received in the output port (action block 401). The received cell is stored in the queue for that priority indication (action block 403).
FIG. 5 is a flow diagram of a process which is used to increment the age count of the first cell in every queue once per cell time. Every 2.83 microseconds - (the cell time in a 155.56 Mb/s BISDN interface) the count of time, oT, is 20 incremented by one unit (action block 501) for all constant bit rate initial queued cells, i.e., the first cell in queues 134, 136, and 138. This is the process which allows :~ cells in lower priority CBR queues to be transmitted if they have been waiting a . sufficiently long tirne.
: . FIG. 6 is a flow diagram of an output port transmit process. All the 25 queues (134, 136, 138., and 139) for that port are first examined (action block 601).
Test 603 checks whether there are any cells in any queue. If not, the process ends : (action block 6ûS). If so, then the first cell from each non-empty queue is extracted . (action block 607). The priority for this cell is adjusted by the formula -- Pl = P0 - (A)(~T), where P0 is the priority of the queue, and the values of Pl for the 30 oldest entries in each of the queues are then examined (action block 609). 'Ihe cell is : then selected from the queue having the highest Pl value and this cell is transmitted (action block 611). The priority of the variable bit rate cell is not varied in this process. The result of performing the actions of FIG. 6 are that, in general, the cell from ~he highest priority queue having a cell is transmitted but for those cases in ~, 35 which the first cell in one of the other queues has been in that queue for a long time, that cell is then transmitted. This allows the engineered traffic of low priority queues .
.
.
. . . .
'~
2~3~3 to preserve its jitter characteristic. The value of A which has been selected based on ~; analytic studies is 0 for the priority 1 and 4 queues, 0.1 for the priority 2 queue, and 0.01 for the p~iority 3 queue, and the value of ~T is one step per cell time (2.83 microseconds). Thus, for example, if a cell has been enqueued as the first cell . 5 in queue 2 for ten cell times, its priority is increased (i.e., its priority number is : decreased) by one level.
The result of carrying out the actions of the flow charts of FIGS. 2-6 are that cells from high bit rate constant bit rate virtual channels are given priority over cells from lower bit rate constant bit rate channels which are in turn given priority 10 over v~iable bit rate channels. Further, if a cell from a constant bit rate channel has been waiting in a queue for a sufIiciently long time, its priority for transmission purposes is raised. If priority 1, 2, and 3 channels have 55, 110, and 440 rnicroseconds of buffering, respectively, and no 150 megabit channel is loaded beyond 95% of capacity, then there is a very low probability (approximately N times 15 10-15 for an N node connection) encountering a delay that exceeds the buffering supplied for a channel.
It is to be understood that the above description is only of one preferred embodiment of the invention. Numerous other arrangements may be devised by one - skilled in the art without departing from the scope of the invention. The invention is 20 thus limited only as defined in the accompanying claims.
.. .
.
,~`
. . .
, .;
:., ' .
Claims (9)
1. A method of transmitting packetized data traffic from a number of sources having different bit rates comprising the steps of:
entering data from sources having different bands of bit rates in different queues; and transmitting data from queues serving higher bit rate sources with higher priority than data from queues serving lower bit rate sources;
wherein some of said sources generate constant bit rate data and others generate variable bit rate data, wherein separate queues are used for serving constant bit rate data sources and variable bit rate data sources and wherein said transmitting comprises transmitting data from queues serving constant bit rate sources with higher priority than data from queues serving variable bit rate sources.
entering data from sources having different bands of bit rates in different queues; and transmitting data from queues serving higher bit rate sources with higher priority than data from queues serving lower bit rate sources;
wherein some of said sources generate constant bit rate data and others generate variable bit rate data, wherein separate queues are used for serving constant bit rate data sources and variable bit rate data sources and wherein said transmitting comprises transmitting data from queues serving constant bit rate sources with higher priority than data from queues serving variable bit rate sources.
2. Apparatus for transmitting packetized data from a plurality of sources having different bit rates comprising:
a plurality of queues for storing entities of data, each queue for storing data from sources having a different band of bit rates;
processor means operative under the control of a first program for controlling storage of data from each of said sources into one of said queues, said one queue for storing data of a band of bit rates including a bit rate of said each source; and said processor means further operative under the control of a second program for controlling transmission of data stored in said queues, transmission of data from a queue for storing a first band of bit rates being given priority over transmission of data from a queue for storing a second band of bit rates, wherein said first band has higher bit rates than said second band.
a plurality of queues for storing entities of data, each queue for storing data from sources having a different band of bit rates;
processor means operative under the control of a first program for controlling storage of data from each of said sources into one of said queues, said one queue for storing data of a band of bit rates including a bit rate of said each source; and said processor means further operative under the control of a second program for controlling transmission of data stored in said queues, transmission of data from a queue for storing a first band of bit rates being given priority over transmission of data from a queue for storing a second band of bit rates, wherein said first band has higher bit rates than said second band.
3. The apparatus of claim 2 wherein said plurality of queues comprises a plurality of queues for storing data from sources generating constant bit rate data, wherein said processor means are further operative under the control of said second program for controlling transmission of data stored in said queues for storing data from sources generating constant bit rate data with higher priority than data for queues storing data from sources generating variable bit data.
4. The apparatus of claim 2 wherein the priority of an oldest enqueued entity of data in a queue is increased if it has been enqueued for more than a predefined length of time for said queue.
5. The apparatus of claim 4 wherein a length of time that said oldest enqueued entity of data has been enqueued is measured only from a time that saidentity has been an oldest entity in the queue.
6. A method of transmitting packetized data traffic from a number of constant bit rate sources having different bit rates, said bit rates divided into a plurality of disjoint bands of bit rates, and another number of variable bit rate sources, comprising the steps of:
entering data from constant bit rate sources in ones of a plurality of first queues, each first queue for serving one of said different bands of bit rates;
entering data from variable bit rate sources in a second queue;
transmitting, data from a first queue serving a higher constant bit rate band with higher priority than data from a first queue serving a lower constant bit rate band, and wherein said second queue has lower priority than any of said first queues wherein the priority of an oldest enqueued entity of data in a queue is increased if it has been an oldest enqueued entity enqueued for more than a predefined time, and wherein transmitting comprises transmitting data from the queue with the highest priority having enqueued data to be transmitted.
entering data from constant bit rate sources in ones of a plurality of first queues, each first queue for serving one of said different bands of bit rates;
entering data from variable bit rate sources in a second queue;
transmitting, data from a first queue serving a higher constant bit rate band with higher priority than data from a first queue serving a lower constant bit rate band, and wherein said second queue has lower priority than any of said first queues wherein the priority of an oldest enqueued entity of data in a queue is increased if it has been an oldest enqueued entity enqueued for more than a predefined time, and wherein transmitting comprises transmitting data from the queue with the highest priority having enqueued data to be transmitted.
7. The method of claim 6 wherein said first queues comprise three queues, one for storing data from constant bit rate sources generating data in excess of approximately 15 megabits per second, one for storing data from constant bit rate sources generating data at rates at or below approximately 1.5 megabits per second, and one for rates between approximately 1.5 and 15 megabits per second.
8. The method of claim 7 wherein said data entities are cells of an asynchronous transfer mode frame.
9. The method of claim 8 wherein an oldest enqueued cell of one of said first queues has its priority increased by one level when it has been an oldest enqueued cell for approximately one cell interval of a highest bit rate of a band of said one first queue.
Applications Claiming Priority (2)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| US07/571,800 US5150358A (en) | 1990-08-23 | 1990-08-23 | Serving constant bit rate traffic in a broadband data switch |
| US571,800 | 1990-08-23 |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CA2043600A1 CA2043600A1 (en) | 1992-02-24 |
| CA2043600C true CA2043600C (en) | 1994-02-15 |
Family
ID=24285113
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CA002043600A Expired - Fee Related CA2043600C (en) | 1990-08-23 | 1991-05-30 | Serving constant bit rate traffic in a broadband data switch |
Country Status (6)
| Country | Link |
|---|---|
| US (1) | US5150358A (en) |
| EP (1) | EP0473330B1 (en) |
| JP (1) | JP2598185B2 (en) |
| CA (1) | CA2043600C (en) |
| DE (1) | DE69114084T2 (en) |
| ES (1) | ES2078452T3 (en) |
Families Citing this family (76)
| 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 |
| US5291487A (en) * | 1991-01-24 | 1994-03-01 | Micom Communications Corp. | Apparatus for, and method of, packing and unpacking information in transmission lines |
| US5301283A (en) * | 1992-04-16 | 1994-04-05 | Digital Equipment Corporation | Dynamic arbitration for system bus control in multiprocessor data processing system |
| US5287347A (en) * | 1992-06-11 | 1994-02-15 | At&T Bell Laboratories | Arrangement for bounding jitter in a priority-based switching system |
| ATE210361T1 (en) * | 1992-09-23 | 2001-12-15 | Siemens Ag | METHOD FOR MULTIPLEXING VIRTUAL CHANNELS ONTO A TRANSMISSION LINE |
| CA2104753C (en) * | 1992-10-29 | 1999-02-16 | Kotikalapudi Sriram | Bandwidth allocation, transmission scheduling, and congestion avoidance in broadband atm networks |
| MX9308193A (en) * | 1993-01-29 | 1995-01-31 | Ericsson Telefon Ab L M | CONTROLLED ACCESS ATM SWITCH. |
| US6408009B1 (en) * | 1993-06-04 | 2002-06-18 | Illinois Institute Of Technology | Method and apparatus for detecting collisions on and controlling access to a communications channel |
| AU722003B2 (en) * | 1993-06-07 | 2000-07-20 | Telstra Corporation Limited | Communication system |
| EP0702871A4 (en) * | 1993-06-07 | 1998-01-28 | Telecom Technologies Pty Ltd | Communication system |
| US5453979A (en) * | 1994-01-27 | 1995-09-26 | Dsc Communications Corporation | Method and apparatus for generating route information for asynchronous transfer mode cell processing |
| US5528592A (en) * | 1994-01-27 | 1996-06-18 | Dsc Communications Corporation | Method and apparatus for route processing asynchronous transfer mode cells |
| US5452293A (en) * | 1994-01-27 | 1995-09-19 | Dsc Communications Corporation | Apparatus and method of transmitting call information prior to establishing a connection path |
| US5463624A (en) * | 1994-04-15 | 1995-10-31 | Dsc Communications Corporation | Bus arbitration method for telecommunications switching |
| JP3474259B2 (en) * | 1994-05-26 | 2003-12-08 | 株式会社東芝 | Communication control device |
| US5533020A (en) * | 1994-10-31 | 1996-07-02 | International Business Machines Corporation | ATM cell scheduler |
| JPH08163145A (en) * | 1994-12-08 | 1996-06-21 | Nec Corp | Traffic shaping method for atm exchange and device therefor |
| JPH08163150A (en) * | 1994-12-12 | 1996-06-21 | Nec Corp | Cdv control method and device for cbr traffic |
| EP0717532A1 (en) * | 1994-12-13 | 1996-06-19 | International Business Machines Corporation | Dynamic fair queuing to support best effort traffic in an ATM network |
| SE504161C2 (en) * | 1995-03-13 | 1996-11-25 | Ericsson Telefon Ab L M | Device and method for digital communication systems |
| US6122297A (en) * | 1995-03-13 | 2000-09-19 | Telefonaktiebolaget Lm Ericsson | Arrangement and method relating to digital communication systems |
| US5675573A (en) * | 1995-03-22 | 1997-10-07 | Lucent Technologies Inc. | Delay-minimizing system with guaranteed bandwidth delivery for real-time traffic |
| US5563884A (en) * | 1995-03-27 | 1996-10-08 | Zenith Electronics Corporation | Reducing multiplex jitter in an ATM/MPEG system |
| EP0748086A1 (en) * | 1995-06-09 | 1996-12-11 | Siemens Aktiengesellschaft | Method for scheduling message cells leaving an ATM node |
| AU6501496A (en) * | 1995-07-19 | 1997-02-18 | Ascom Nexion Inc. | Point-to-multipoint transmission using subqueues |
| AU6501696A (en) * | 1995-07-19 | 1997-02-18 | Ascom Nexion Inc. | Method and system for controlling network service parameters in a cell based communications network |
| JPH11512583A (en) * | 1995-09-14 | 1999-10-26 | フジツウ ネットワーク コミュニケーションズ，インコーポレイテッド | Transmitter-controlled flow control for buffer allocation in a wide area ATM network |
| GB2306076B (en) * | 1995-10-03 | 2000-03-22 | Gen Datacomm Adv Res | ATM network switch |
| SE508328C2 (en) | 1995-11-09 | 1998-09-28 | Ericsson Telefon Ab L M | Device flow and method for packet flow control |
| US5757771A (en) * | 1995-11-14 | 1998-05-26 | Yurie Systems, Inc. | Queue management to serve variable and constant bit rate traffic at multiple quality of service levels in a ATM switch |
| US6327246B1 (en) | 1995-11-29 | 2001-12-04 | Ahead Communications Systems, Inc. | Controlled available bit rate service in an ATM switch |
| GB2307823B (en) * | 1995-11-29 | 2000-04-12 | Gen Datacomm Adv Res | Available bit rate services in ATM networks |
| US5771234A (en) * | 1995-12-06 | 1998-06-23 | Industrial Technology Research Institute | Method and system for ATM cell multiplexing under constant bit rate, variable bit rate and best-effort traffic |
| US5812526A (en) * | 1995-12-21 | 1998-09-22 | Industrial Technology Research Institute | Traffic control mechanism in ATM communications network |
| JP2000517488A (en) * | 1996-01-16 | 2000-12-26 | フジツウ ネットワーク コミュニケーションズ，インコーポレイテッド | Reliable and flexible multicast mechanism for ATM networks |
| US6201807B1 (en) * | 1996-02-27 | 2001-03-13 | Lucent Technologies | Real-time hardware method and apparatus for reducing queue processing |
| US6201790B1 (en) * | 1996-06-26 | 2001-03-13 | U.S. Philips Corporation | Network access control method, and device and system for implementing this method |
| FR2750555A1 (en) * | 1996-06-26 | 1998-01-02 | Philips Electronics Nv | Access control method e.g. for ATM transmission network |
| US5748905A (en) * | 1996-08-30 | 1998-05-05 | Fujitsu Network Communications, Inc. | Frame classification using classification keys |
| DE69734636T2 (en) * | 1996-09-25 | 2006-06-14 | Nippon Telegraph & Telephone | Circuit for the resolution of competition |
| US6208655B1 (en) * | 1996-11-27 | 2001-03-27 | Sony Europa, B.V., | Method and apparatus for serving data |
| US6124878A (en) * | 1996-12-20 | 2000-09-26 | Time Warner Cable, A Division Of Time Warner Enterainment Company, L.P. | Optimum bandwidth utilization in a shared cable system data channel |
| JPH10190740A (en) | 1996-12-25 | 1998-07-21 | Nec Corp | Transmission/reception device for radio atm |
| FR2758427B1 (en) * | 1997-01-13 | 1999-02-05 | Alsthom Cge Alcatel | SWITCHING ELEMENT, IN PARTICULAR ATM CELLS, IMPLEMENTING PROBABILIST PRIORITIES ATTACHED TO CELLS |
| KR100259082B1 (en) * | 1997-04-02 | 2000-06-15 | 김영환 | Method for determining priority in network traffic |
| US6282196B1 (en) * | 1997-04-14 | 2001-08-28 | Lucent Technologies Inc. | Dynamic build-out approach for use in packet voice systems |
| US5940389A (en) * | 1997-05-12 | 1999-08-17 | Computer And Communication Research Laboratories | Enhanced partially self-routing algorithm for controller Benes networks |
| US5987028A (en) * | 1997-05-12 | 1999-11-16 | Industrial Technology Research Insitute | Multiple channel ATM switch |
| US6049528A (en) * | 1997-06-30 | 2000-04-11 | Sun Microsystems, Inc. | Trunking ethernet-compatible networks |
| US6246680B1 (en) * | 1997-06-30 | 2001-06-12 | Sun Microsystems, Inc. | Highly integrated multi-layer switch element architecture |
| US6118760A (en) * | 1997-06-30 | 2000-09-12 | Sun Microsystems, Inc. | Management of entries in a network element forwarding memory |
| US6088356A (en) * | 1997-06-30 | 2000-07-11 | Sun Microsystems, Inc. | System and method for a multi-layer network element |
| US6014380A (en) * | 1997-06-30 | 2000-01-11 | Sun Microsystems, Inc. | Mechanism for packet field replacement in a multi-layer distributed network element |
| US6044087A (en) * | 1997-06-30 | 2000-03-28 | Sun Microsystems, Inc. | Interface for a highly integrated ethernet network element |
| US5938736A (en) * | 1997-06-30 | 1999-08-17 | Sun Microsystems, Inc. | Search engine architecture for a high performance multi-layer switch element |
| US6128666A (en) * | 1997-06-30 | 2000-10-03 | Sun Microsystems, Inc. | Distributed VLAN mechanism for packet field replacement in a multi-layered switched network element using a control field/signal for indicating modification of a packet with a database search engine |
| US6119196A (en) * | 1997-06-30 | 2000-09-12 | Sun Microsystems, Inc. | System having multiple arbitrating levels for arbitrating access to a shared memory by network ports operating at different data rates |
| US6016310A (en) * | 1997-06-30 | 2000-01-18 | Sun Microsystems, Inc. | Trunking support in a high performance network device |
| US6081522A (en) * | 1997-06-30 | 2000-06-27 | Sun Microsystems, Inc. | System and method for a multi-layer network element |
| US6044418A (en) * | 1997-06-30 | 2000-03-28 | Sun Microsystems, Inc. | Method and apparatus for dynamically resizing queues utilizing programmable partition pointers |
| US5920566A (en) * | 1997-06-30 | 1999-07-06 | Sun Microsystems, Inc. | Routing in a multi-layer distributed network element |
| US6052738A (en) * | 1997-06-30 | 2000-04-18 | Sun Microsystems, Inc. | Method and apparatus in a packet routing switch for controlling access at different data rates to a shared memory |
| US6094435A (en) * | 1997-06-30 | 2000-07-25 | Sun Microsystems, Inc. | System and method for a quality of service in a multi-layer network element |
| US6081512A (en) * | 1997-06-30 | 2000-06-27 | Sun Microsystems, Inc. | Spanning tree support in a high performance network device |
| US6483831B1 (en) | 1997-12-19 | 2002-11-19 | Telefonaktiebolaget Lm Ericsson (Publ) | Asynchronous transfer mode switch |
| US6747954B1 (en) | 1997-12-19 | 2004-06-08 | Telefonaktiebolaget Lm Ericsson (Publ) | Asynchronous transfer mode switch providing pollstate status information |
| CN1135800C (en) * | 1998-12-18 | 2004-01-21 | 艾利森电话股份有限公司 | Internet protocol handler for telecommunications platform with processor cluster |
| US7269728B1 (en) * | 1999-09-21 | 2007-09-11 | Nortel Networks Limited | Apparatus and method for distributing management keys in a multicast domain |
| US7016369B2 (en) * | 2000-12-22 | 2006-03-21 | Telefonaktiebolaget Lm Ericsson (Publ) | Binding information for telecommunications network |
| US6912390B2 (en) * | 2000-12-22 | 2005-06-28 | Telefonaktiebolaget Lm Ericsson | Connection handling in SRNC relocation |
| US7418523B2 (en) * | 2001-01-25 | 2008-08-26 | Ericsson Ab | Operation of a multiplicity of time sorted queues with reduced memory |
| US6980513B2 (en) * | 2001-09-24 | 2005-12-27 | Transwitch Corporation | Methods and apparatus for the fair allocation of bandwidth among MCR and best effort service connections in an ATM switch |
| EP1351453B1 (en) * | 2002-04-03 | 2006-04-12 | Alcatel | Method and apparatuses for packet reordering in a network processor |
| US6822939B2 (en) | 2002-05-20 | 2004-11-23 | Transwitch Corporation | Method and apparatus for guaranteeing a minimum cell rate (MCR) for asynchronous transfer mode (ATM) traffic queues |
| US10856331B1 (en) * | 2019-09-10 | 2020-12-01 | Cypress Semiconductor Corporation | Devices, systems, and methods for mitigating aggressive medium reservations |
Family Cites Families (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US4630261A (en) * | 1984-07-30 | 1986-12-16 | International Business Machines Corp. | Integrated buffer management and signaling technique |
| JPS6423643A (en) * | 1987-07-17 | 1989-01-26 | Daihatsu Motor Co Ltd | Communication system |
| JPH0258149A (en) * | 1988-08-24 | 1990-02-27 | Mitsubishi Electric Corp | Access permission controller |
| JP2810393B2 (en) * | 1988-12-23 | 1998-10-15 | 三菱電機株式会社 | Cell multiplexer |
| JPH0358646A (en) * | 1989-07-27 | 1991-03-13 | Nec Corp | Band assignment system in packet communication network |
| US5014265A (en) * | 1989-11-30 | 1991-05-07 | At&T Bell Laboratories | Method and apparatus for congestion control in a data network |
-
1990
- 1990-08-23 US US07/571,800 patent/US5150358A/en not_active Expired - Lifetime
-
1991
- 1991-05-30 CA CA002043600A patent/CA2043600C/en not_active Expired - Fee Related
- 1991-08-13 EP EP91307468A patent/EP0473330B1/en not_active Expired - Lifetime
- 1991-08-13 ES ES91307468T patent/ES2078452T3/en not_active Expired - Lifetime
- 1991-08-13 DE DE69114084T patent/DE69114084T2/en not_active Expired - Fee Related
- 1991-08-13 JP JP22632691A patent/JP2598185B2/en not_active Expired - Fee Related
Also Published As
| Publication number | Publication date |
|---|---|
| JP2598185B2 (en) | 1997-04-09 |
| CA2043600A1 (en) | 1992-02-24 |
| US5150358A (en) | 1992-09-22 |
| DE69114084T2 (en) | 1996-04-04 |
| DE69114084D1 (en) | 1995-11-30 |
| EP0473330B1 (en) | 1995-10-25 |
| JPH04245742A (en) | 1992-09-02 |
| EP0473330A1 (en) | 1992-03-04 |
| ES2078452T3 (en) | 1995-12-16 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CA2043600C (en) | Serving constant bit rate traffic in a broadband data switch | |
| US5268900A (en) | Device and method for implementing queueing disciplines at high speeds | |
| EP0577269B1 (en) | Arrangement for bounding jitter in a priority-based switching system | |
| EP0471344B1 (en) | Traffic shaping method and circuit | |
| US5629928A (en) | Dynamic fair queuing to support best effort traffic in an ATM network | |
| EP0533900B1 (en) | Low delay or low loss cell switch for atm | |
| US5390184A (en) | Flexible scheduling mechanism for ATM switches | |
| US5278828A (en) | Method and system for managing queued cells | |
| US6535484B1 (en) | Method and apparatus for per traffic flow buffer management | |
| US6388993B1 (en) | ATM switch and a method for determining buffer threshold | |
| US6768717B1 (en) | Apparatus and method for traffic shaping in a network switch | |
| JP2682494B2 (en) | Multi-access communication system | |
| EP0973304A2 (en) | Apparatus and method for bandwidth management | |
| US6192049B1 (en) | Jitterless and lossless switching fabric with network routing | |
| US6865156B2 (en) | Bandwidth control method, cell receiving apparatus, and traffic control system | |
| JP3820272B2 (en) | Exchange device | |
| Aramaki et al. | Parallel'ATOM'switch architecture for high-speed ATM networks | |
| US7450510B1 (en) | System and method for distributing guaranteed bandwidth among service groups in a network node | |
| KR100221324B1 (en) | Apparatus and method of dynamic priority queueing discipline using the per-session frame defined by the synchronus counter operation in atm networks | |
| Todorova et al. | Delay constraints and admission control in ATM networks | |
| Todorova et al. | Resource Allocation and Delay Constraints in ATM Networks | |
| JPH07321796A (en) | Virtual path shaping device | |
| JP3080344B2 (en) | Virtual path shaping device | |
| WO2000074321A9 (en) | Apparatus and method for traffic shaping in a network switch | |
| JPH0795212A (en) | Congestion control system for atm exchange system |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| EEER | Examination request | ||
| MKLA | Lapsed |