CA2211077A1 - Method and apparatus for implementing a communication service contract using cell arrival information - Google Patents
Method and apparatus for implementing a communication service contract using cell arrival informationInfo
- Publication number
- CA2211077A1 CA2211077A1 CA002211077A CA2211077A CA2211077A1 CA 2211077 A1 CA2211077 A1 CA 2211077A1 CA 002211077 A CA002211077 A CA 002211077A CA 2211077 A CA2211077 A CA 2211077A CA 2211077 A1 CA2211077 A1 CA 2211077A1
- Authority
- CA
- Canada
- Prior art keywords
- cells
- service
- circuit
- cell
- 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.)
- Abandoned
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
- H04Q—SELECTING
- H04Q11/00—Selecting arrangements for multiplex systems
- H04Q11/04—Selecting arrangements for multiplex systems for time-division multiplexing
- H04Q11/0428—Integrated services digital network, i.e. systems for transmission of different types of digitised signals, e.g. speech, data, telecentral, television signals
- H04Q11/0478—Provisions for broadband connections
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L12/00—Data switching networks
- H04L12/54—Store-and-forward switching systems
- H04L12/56—Packet switching systems
- H04L12/5601—Transfer mode dependent, e.g. ATM
- H04L2012/5614—User Network Interface
- H04L2012/5615—Network termination, e.g. NT1, NT2, PBX
-
- 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/5629—Admission control
- H04L2012/5631—Resource management and allocation
- H04L2012/5632—Bandwidth allocation
- H04L2012/5635—Backpressure, e.g. for ABR
-
- 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/5629—Admission control
- H04L2012/5631—Resource management and allocation
- H04L2012/5636—Monitoring or policing, e.g. compliance with allocated rate, corrective actions
-
- 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/5629—Admission control
- H04L2012/5631—Resource management and allocation
- H04L2012/5636—Monitoring or policing, e.g. compliance with allocated rate, corrective actions
- H04L2012/5637—Leaky Buckets
-
- 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
-
- 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/568—Load balancing, smoothing or shaping
-
- 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
Abstract
To simplify the service decision made in a queue based digital switch, a method and apparatus is introduced that makes service decisions based upon the history of incoming cells. The apparatus includes a minimum service rate circuit that monitors the rate of arriving cells. The minimum service rate circuit tests the arriving cells to determine if they are in conformance with the minimum service rate of a service contract. The minimum service rate circuit may use a continuous state leaky bucket algorithm or virtual scheduling algorithm as specified in the CCITT Recommendation I.371 document to determine if a cell is in conformance with the minimum service rate of the service contract. When a cell arrives that conforms to the minimum service rate, the minimum service rate circuit notifies the server and the server serves the queue associated with the connection.
Description
Method and Appara~us for Implementing a Commllnit~tion Service ~'on~-r~ct Using Cell Arrival Information FIELD OF THE INVENTION
The present invention relates to the field of digital communication switches. More particularly, the present invention relates to a digital switch that uses the history of cell arrivals to make service ~lerisiQns.
BAcKGRouND OF THE INVENTION
Cell switching is a method of transmitting digital information wherein the information is broken into equal sized units called "cells." The cells of information are usually grouped into larger units called "frames."
The individual cells of information are transmitted from a source node to a destination node through a "connection." A
connection consists of a pathway through a digital network. A digital network is constructed of digital switches coupled together by digital communication lines. At the destination node, the individual cells of information may be reconstructed into the frame.
Each cell origin~s at a source node and is transmitted across the communications lines. The communication lines carry the cells of information between the digital switches along the connection pathway. The digital switches route the cells from incoming communication lines to outgoing communication lines and finally to a destination node coupled to a digital switch.
Each digital switch in the network can be connected to several communication lines. Furthermore, each communication line can carry several different connections simultaneously. A digital switch may employ a set of queues to handle the connections and a queue server to serve the queues. Por such digital switches, serving a connection with the queue server entails removing an incoming cell from an input queue associated with the connection and sending the cell out on a communication line or to a destination node coupled to the digital switch. A service algorithm is employed to select a connection for service. To fully utilize the bandwidth of a communication line, it must be possible to select a cell for service during each service time. The service time refers to the amount of time it takes to transmit a single cell onto the communication line.
The objective of the service algorithm is to ensure that every connection receives the appropriate amount of service.
When a communication service provider agrees to provide service to a customer, the two parties enter into a communication traffic contract. This contract contains constraints that the customer agrees to adhere to. These constraints are referred to in this document as an arrival contract. For example, the arrival contract may limit the customer on how fast the customer may send cells to the network.
Another part of the communication traffic contract may be used when a queue and queue server are used in the connection. For connections with a queue and queue server, the service provider may agree to provide the customer with a minimal level of service. This minimal level of service is referred to in this document as a service contract and may contain an initial burst and a minimum service rate.
To implement the arrival contract, the digital switch has a traffic policing circuit at the customer interface to the digital switch.
The traffic policing circuit monitors the incoming cells sent from the customer to the service provider and determines when cells do not conform to the arrival contract. To implement a service contract, the digital switch has a service algorithm circuit that determines when the digital switch should service the queues for each connection that are handled by the digital switch. The service contract is not necessary when there is no queue associated with a connection.
. CA 02211077 1997-07-21 W 096/29805 PCT~US96/03011 SUMMARY AND OB.JECTS OF TI~E INV~ON
One object of the present invention is to provide a simplified service algorithm that makes service decisions based upon the history of cell arrivals. By monitoring the arrival of incoming cells, the present invention helps to simplify the server in the ~y~Lenl.
This and other objects are performed by the improved ingress circuit of the present invention. The ingress circuit includes a minimum service rate circuit that monitors the rate of arriving cells.
The minimum service rate circuit notifies the connection server when cells arrive in conformance with the minimum service rate of the service contract. The minimum service rate circuit may use a continuous state leaky bucket or virtual scheduling algorithm as specified in the CCITT Recommendation I.371 document to determine if a cell is in conformance with the minimum service rate of the service contract. When a cell arrives that conforms to the minimum service rate, the minimum service rate circuit notifies the server and the server serves the queue associated with the connection.
Other objects, features and advantages of the present invention will be apparent from the accompanying drawings, and from the detailed description that follows below.
BRIEF DESCR~rlON OF THE DRAWINGS
The present invention is illustrated by way of example and not limitation in the figures of the accompanying drawings in which like re~e~ ces indicate similar elements and in which:
Figure 1 illustrates a digital communication network constructed with StratacomTM BPXTM and Il'XTM digital switches;
Figure 2 illustrates a prior art internal block diagram of a StratacomTM BPXTM digital switch;
Figure 3 illustrates an internal block diagram of a Network Interface card;
Figure 4 illustrates an internal block diagram of the ingress circuit in a Network Interface card;
Figure 5a illustrates a conceptual diagram of the Generic Cell Rate Algorithm (also known as the "leaky bucket" algorithm);
Figure 5b illustrates a flow diagram of the Generic Cell Rate Algorithm (also known as the "leaky bucket" algorithm);
Figure 6 illustrates a conceptual diagram of a typical user service contract with a digital communication service provider;
Figure 7 illustrates a conceptual diagram of a Generic Cell Rate Algorithm that implements traffic policing for the user service contract of Figure 6;
Figure 8 illustrates an expanded block diagram of the ingress circuit including the traffic policing circuit and the service algorithm;
Figure 9 illustrates a block diagram of an improved ingress circuit that includes a minimum service rate circuit that informs the server when it should serve a queue;
Figure lOa illustrates a conceptual diagram of a leaky bucket for use in a minimum service rate circuit, the leaky bucket has a leak rate equal to the minimum service rate and an limit L that implements an initial burst.
Figure lOb illustrates a an example of how the minimum service rate circuit leaky bucket is used to make service decisions.
Figu~e 11 illustrates a block diagram of an alternate emborlim~nt of an improved ingress circuit that uses the existing traffic policing circuit to implenl~nt an initial burst; and Figu~e 12 illustrates a conceptual diagram of the leaky bucket in the alternate embodiment where the leaky bucket implements both traffic policing and an initial burst.
DETAILED DESC :K~ 11O~
Methods and s~ h~rnPs for using cell arrival information to make queue service decisions in a digital communication ~yslelll are disclosed.
A Broadband Nelwu,k Figure 1 illustrates a digital communications network topology.
The network illustrated in Figure 1 is a cell switched digital communication network constructed of Broadband Packet Exchanger (BPXTM) modules and Integrated Packet Exchanger (IPXTM) modules sold by Stratacom of San Jose, California. The Stratacom BPXTM
modules and the Stratacom IPXTM modules function as digital switches that are capable of building virtual connections for routing cells. The Stratacom BPXTM modules serve as the backbone for a broadband digital Wide Area Network (WAN). The Stratacom IPXTM
modules couple smaller narrowband digital communication links to the broadband digital network.
Each BPXTM module is a digital switch coupled to one or more broadband digital communication lines. Examples of broadband digital communication lines include E3 lines, T3 lines, and OC3 lines.
The BPXTM digital switches are also coupled to IPXTM digital switches using broadband digital communication links.
Each IPXTM digital switch in Figure 1 is used to couple slower digital communication lines to the broadband digital communication network. The customer premise equipment 160 may consist of any type of digital communication equipment such a Private Branch Exchange (PBX) or a packet router.
Figure 2 illustrates a block diagram of the internal mechanisms of an existing BPXTM digital switch. Each BPXTM digital switch consists of a plurality of Network Interface units (NI 173 and NI 175) and a BPX
Control Card (BCC) unit 190.
Each Network Interface unit is connected to a broadband digital communication line. Every Broadband Network Interface unit is also coupled to a high-speed backplane bus 180 within the BPXTM digital CA 022ll077 l997-07-2l switch. In the present embodim~nt the backplane bus 180 of the BPXTM comprises the StratabusTM.
The BCC unit 190 is also coupled to the backplane bus 180. The BCC unit 190 functions as a digital crossbar switch that routes data cells to and from all the different digital comm~mication lines that are coupled to the BPXTM digital switch.
A Network Tnterf~ce Card Figure 3 illustrates an internal block diagram of a Network Interface card 300. In one embodiment, the Network Interface card 300 is a Stratacom ATM Service Interface (ASI) card 300. The Network Interface card 300 comprises an ingress circuit 310, an egress circuit 320 and a StratabusTM interface circuit 340. The ingress circuit 310is connected to a communications line and processes incoming data cells received from the communications line. The egress circuit 320 iS also connected to the communications line and processes outgoing data cells. The StratabusTM interface circuit 340 is coupled to both the ingress circuit 310 and the egress circuit 320 and distributes data cells to the StratabusTM 310 within the BPXTM digital switch.
Figure 4 illustrates an internal block diagram of the ingress circuit 310. The ingress circuit 310 consists of a Traffic Policing circuit 420 and the remaining ingress service circuitry 430. The purpose of the Traffic policing circuit 420iS to enforce the arrival contract by acting as a traffic policing device. The Traffic policing circuit 420 determines if each incoming data cell is a "conforming" cell.
Specifically, the Traffic policing circuit 420 determines if each incoming data cell conforms with the limits placed upon the incoming data link according to the arrival contract.
For example, if a user sends a series of data cells so quickly that the user exceeds the maximum incoming data cell rate allowed by the arrival contract, then the Traffic policing circuit 420 will indicate that the cells are "nonconforming" data cells according to the arrival contract. Nonconforming data cells may be tagged as low priority or simply discarded. Discarded data cells may not be recovered. Data cells that are tagged as low priority are kept within the digital switch W 096/29805 PCTrUS96/03011 and transmitted if there is sufficient bandwidth available. However, data cells tagged as low priority are the first to be discarded when congestion occurs in the network.
The Traffic Poli~ ing Circuit To enforce the limits specified within the arrival contract, the Traffic Policing circuit 420 implements a Generic cell rate algorithm such as continuous-state leaky bucket algorithm or the virtual scheduling algorithm as described in the CCITT Recommendation I.371 Document, Geneva 1992 (See Annex 1).
Figures 5a and 5b illustrate a conceptual diagram and a flow diagram that describe how the continuous-state leaky bucket algorithm operates. The virtual scheduling algorithm is similarly described in detail in the CCITT Recommendation I.371 Document.
The continuous-state leaky bucket algorithm maintains a "bucket" of debit markers. Figure 5a illustrates a conceptual diagram of the leaky bucket. Each time a cell arrives, the bucket depth is compared to a threshold limit to determine whether the cell is a conforming cell.
The cell conforms if the bucket depth is less than the threshold limit.
When a cell conforms, a debit marker is placed into the debit marker bucket. The debit markers are removed from the debit marker bucket at a leak rate equal to the sustainable cell rate. When cells arrive at a rate faster than the sustainable cell rate, the debit markers accumulate in the debit marker bucket. Eventually, the debit marker bucket exceeds the limit thereby signaling nonconforming cells. Although the continuous-state leaky bucket algorithm is explained with rer~ ce to a bucket of markers, the continuous-state leaky bucket algorithm is usually simply implemented using a single counter as explained below.
As illustrated in Figure 5b, the continuous-state leaky bucket algorithm is invoked when a cell is received at step 510. A temporary bucket counter (X') is calculated at step 520 by subtracting off the amount of time since the last conforming cell. The temporary bucket counter (X') is tested at step 530 to determine if it is less than zero. If the temporary bucket counter (X') is less than zero then it is set to zero -W 096t29805 PCTrUS96/03011 .
at step 540 (the bucket level is not allowed to drop below zero) and the cell is lle~mPf~ col~ollning at step 570 where the bucket is incr~mente~l by the cost of processing the conforming cell. If the temporary bucket counter (X') was not less than zero at step 530 then the temporary bucket counter (X') is tested to see if it exceeds a limit set on the bucket.
If the temporary bucket counter (X') exceeds the limit, then the cell is deemed nonconforming at step 560. Otherwise the cell is deemed conforming at step 570 and the bucket counter (X) is incremented by the cost of processing the conforming cell.
An Example of Traffic Policing Figure 6 illustrates a diagram of one possible type of data communication traffic contract. The data communication traffic contract illustrated in Figure 6 is ~i.ofinPll by different two data cell rates. The first data cell rate is the sustainable cell rate (SCR). The sustainable cell rate defines the maximum rate at which the user may continually transmit cells into the Sy~lell~ without being penalized. If the user sends data cells at a rate less than the sustainable cell rate, then every data cell sent by the user will conform to the terms of the contract and thus every cell will be served by the data communication service provider.
The second data cell rate defined by the data communication traffic contract of Figure 6 is the peak cell rate (PCR). The peak cell rate represents the highest cell rate at which the user may transmit cells during a short "burst" period. If the user ever transmits cells faster than the peak cell rate, then some cells will be nonconforming and will be discarded. When a user sends data cells at a rate faster than the sustainable cell rate (SCR) but below the peak cell rate (PCR) for a long period of time then the ~y~Lell~ will eventually overflow and cells will be found to be nonconforming, these nonconforming cells will be tagged. The amount of cells that the service provider will serve when cells are transmitted at a rate faster than the sustainable cell rate (SCR) but below the peak cell rate (PCR) is known as the burst tolerance.
Figure 7 illustrates how the data communication service contract of Figure 6 can be implemented with a pair of leaky buckets.
. CA 02211077 1997-07-21 Each bucket represents a set of debit markers. The first bucket has room for enough debit markers to h~n~lle a burst of data cells. This is typically used to handle short bursts that are created due to the cell delay variation in the network. The ffrst bucket has a debit marker leak rate equal to the peak cell rate (PCR). If the average data rate of the incoming data frames exceeds the peak cell rate, then the debit markers will overflow and the data cells that caused the overflow will be deemed nonconforming and therefore thrown out.
The second bucket has a leak rate equal to the sustainable cell rate (SCR) of the communications service contract. When the rate ol incoming data cells exceeds the sustainable cell rate, the debit markers will accumulate in the second bucket. The debit markers will accumulate in the second bucket until the number of debit markers in the second bucket exceeds the Ll limit that implements the burst tolerance. When the debit markers that stack up in the second bucket exceed the Ll limit, subsequent incoming data cells are deemed nonconforming by the traffic policing circuit.
The Ingress Service Circuit After cells pass through the Traffic Policing circuit 420, the cells are passed on to the ingress service circuitry 430. Figure 8 illustrates a block diagram further defining the ingress service circuitry 430. The ingress service circuitry 430 in the Network Interface card places each received data cell into a queue associated with the connection. If no other connection shares the queue, it is referred to as a virtual connection queue. Each virtual connection queue is serviced by a queue server circuit 830.
The ingress service circuitry 430 is responsible for serving the virtual connections carried by the communication line in a manner that satisfies a communication contract bet~,~reen the communications provider and the customer. Typically, a minimum service rate is configured for each connection carried by the communication line.
The communications provider is required to serve each connection at or above the minimum service rate configured for the connection to conform with the communications contract. Each connection may . CA 02211077 1997-07-21 W 096/29805 PCTrUS96/03011 also have an initial burst spe- ifie~l The initial burst is rlefinel1 as the number of cells that will be served without queuing when the customer bursts traffic into that connection.
Prior art switching equipment, such as the Stratacom(~ IPX(~, fulfill the terms of the service contract by implementing a sophisticated service algorithm that instructs a queue server circuit when to serve a queue associated with a virtual connection. The sophisticated service algorithm must carefully monitor each virtual connection queue in order to ensure that the initial burst and minimal service rate requirements are met.
Implementing Service Decisions With Arrival Information Existing digital switches fulfill the minimum service rate requirements of a communications service contract using a sophisticated service algorithm 840 as illustrated in Figure 8. To more efficiently fulfill the minimum service rate terms of the communications service contract, the present invention introduces the concept of using cell arrival information to assist the queue server in making service decisions. By using cell arrival information to ~ assist in making service decisions, the implementation of the queue server circuit can be greatly simplified.
Figure 9 illustrates an ingress circuit constructed according to the teachings of the present invention. In the improved ingress circuit of Figure 9, the flow of arriving cells is routed to both the Traffic policing circuit 920 and a minimum service rate circuit 960.
The Traffic policing circuit 920 enforces the limits on how fast the customer can transmit cells into the network as previously described.
After cells pass through the Traffic policing circuit 920, the cells are queued into a plurality of virtual connection queues.
The minimum service rate circuit 96û implements an algorithm simil~r to the traffic policing circuit, except that the minimum service rate circuit 960 uses the information to make service decisions. For example the continuous-state leaky bucket algorithm or the virtual scheduling algorithm as described in the CCll-l Recommendation I.371 Document can be used. A service W096/29805 PCT~US96/03011 .
~le~i~iQn information line 950 connects the minimum service rate circuit 960 and the service combining circuit 935. The service combining circuit 935 passes the service ~leri~ic)ns made by the minimum service rate circuit 960 to the queue server circuit 930 which serves the queues. The service combining circuit 935 may also receive service decisions from other service circuits, such as the other service circuit 945. This service information is combined with the service information from the minimum service rate circuit 960 to cause the queue server circuit 930 to service virtual connection queues. The minimum service rate circuit will not send a service event if the traffic policing circuit discards the cell.
For purposes of an example, this specification will describe an embo~ Pnt that uses the continuous-state leaky bucket algorithm although either the continuous-state leaky bucket algorithm or the virtual scheduling algorithm could be used. Figure lOa illustrates a conceptual diagram of a leaky bucket for a rninimum service rate circuit 960 that implements the requirements of the communication service contract. As illustrated in Figure lOa, the markers are removed from leaky bucket at a rate equal to the minimum service rate. As long as the number of markers are below the limit L, each incoming cell will cause the minimum service rate circuit 960 to instruct the queue service circuit to serve the queue. The limit L is set such that if the customers transmits cells at the maximum allowed arrival rate, then the digital switch will immediately server the ffrst n cells where n equals the initial burst. The limit L is a function of the maximum allowed arrival rate, the lead rate (minimum service rate), and the initial burst. Specifically:
Li itL (MaximumArrivalrate-MinimumServiceRate) x I iti 1 B t Maximum Arrival rate For example, if the maximum allowed arrival rate equals twice the minimum service rate and the initial burst is 6 cells, then -. . , (2 x MSR - MSR) LlmltL = 2xMSR x 6 cells = --x 6 cells = 3 cells An Example of Service Dericion.~ Made With Cell Arrival Inform~tion Figure 10b illustrates an example of how the minimum service rate circuit 960 operates to fulfill the minimum service rate and the initial burst . In the example of Figure 10b, the initial burst is set to 6 cells and the cells are being sent by the customer at the maximum cell rate which equals twice the minimum service rate. Thus, the leak rate of the leaky bucket is the minimum service rate and the limit L is set to 3. Starting from an initial empty situation, after the first cell arrives the bucket contains a marker for the first cell. Because the markers are below the limit L, a serve command is sent to the queue server circuit.
When the second cell arrives, another marker is added to the bucket, but one marker leaks out such that the bucket contains a single marker again. Again, a serve command is sent to the queue server circuit. When the third cell arrives, another marker is added to the bucket. Since the bucket is still below the limit L, another serve command is sent. When the fourth cell arrives, another marker is added to the bucket and another marker leaks out such that the bucket contains two markers and another serve command is sent. When the fifth cell arrives, another marker is added to the bucket and another serve command is sent since the markers are still below the limit L.
When the sixth cell arrives, another marker is added to the bucket but another marker leaks out such the markers remain below the limit L
and another serve command is sent. When the seventh cell arrives, another marker is added to the bucket such that the limit L is exceeded. Since the markers are above the limit L, no service command is sent. When the eighth cell arrives, no marker is added to the bucket since the bucket had exceed the limit, but one marker drained out such that the markers are below the limit L. This causes a serve command to be sent to the queue server circuit. When the ninth cell arrives, another marker is added to the bucket such that the . CA 02211077 1997-07-21 W 096/29805 PCTrUS96/0301 limit L is again Pxceedell cause no serve command to be sent. When the tenth cell arrives, no marker is added to the bucket since the bucket was above the limit, but another marker drained out such that the markers again fall below the limit L. This causes another serve command to be sent. Since the cells are being transmitted at twice the minimum service rate, the minimum service rate circuit 960 will continue sending a serve command for every other arriving cell.
Referring back to Figure 9, it should be noted that the minimum service rate circuit 960 is not the only source of serve commands. The queue server circuit 930 may also receive service decisions from the other service circuit 945. In Figure 9, the other service circuit 945 receives information about network congestion through congestion information line 970. When the service circuit 945 determines that there is not much congestion in the network, the service circuit 945 specifies that additional cells above the minimum service can be served.
Alternate embodiment: Traffic Policing Implementing Initial Burst In an alternate embodiment, an existing traffic policing circuit is used to assist the queue server in making service decisions. By using information gathered from the traffic policing circuit to assist in making service decisions, the implementation of the queue server circuit is greatly simplified.
Figure 11 illustrates the alternate embodiment of an ingress circuit that implements the initial burst of the service contract using the traffic policing circuit. In the ingress circuit of Figure 11, a service decision information line 1150 connects the traffic policing circuit 1120 and the service algorithm circuit 1140. A service algorithm circuit 1140 is coupled to the queue server circuit 1130 and controls the queue server circuit 1130. The service algorithm 1140 determines when each virtual queue will be served. In the ingress circuit of Figure 11, the traffic policing circuit 1120 provides serve commands to the service algorithm circuit 1140 such that the Traffic policing circuit 1120 implements the initial burst portion of the service contract. The use of the traffic policing circuit information is best explained by example.
CA 022ll077 l997-07-2l W 096t29805 PCTrUS96/03011 .
As described above, many traffic policing circuits implement some version of the continuous-state leaky bucket algorithm to enforce the limits on how fast customers may send cells into the network. To impl~ment the initial burst of the service contract, a second limit can be added to the leaky bucket in the traffic policing circuit. Figure 12 illustrates the Traffic polidng leaky bucket further enhanced to include a second L0 limit. (The Ll limit is the burst tolerance limit as previously described.) The second L0 limit implements the initial burst for the service contract. If a data cell arrives and the debit markers in the traffic policing leaky bucket are below the L0 limit, then the traffic policing circuit 1120 will inform the service algorithm 1140 that a cell must be served (Since the initial burst has not been reached). Once the debit markers in the bucket stack up above the L0 limit, there is no longer a requirement to serve the cells immediately such that the incoming data cells are processed normally.
Thus, the service algorithm 1140 uses the information sent by the traffic policing circuit to implement the initial burst requirement.
Specifically, when the traffic policing circuit indicates that cell has been received while the queue is below the L0 limit and sends a serve command, then the service algorithm 1140 instructs the queue server to serve the associated virtual queue. Thus, if the debit markers in the bucket remain below the L0 limit, then every cell will be served im~ne~ tPly. If one wishes to set a minimum service rate equal to the sustainable cell rate, then the L0 limit can be set equal to the L1 limit.
Certain types of virtual connection always require immediate service from the queue server 1130. For example, a virtual connection that is carrying a telephone connection must be serviced irr me(1i~t~ly.
If a virtual connection carrying a telephone connection is not serviced fast enough, gaps and pops will be audible by the callers. By adjusting the service parameters of the service contract, the traffic policing circuit 1120 can provide the service algorithm 1140 with information such that those types of connections are serviced properly. For example, to h~n~lle a telephone connection that requires constant service, the Traffic policing circuit 1120 can set the L0 limit above the L1 burst tolerance limit. By setting the L0 limit above the L1 burst tolerance limit, every conforming cell that arrives will be in1rne~1iAt~ly served by the queue server 1130 such that the telephone conversation will be carried properly.
Similar to the ingress circuit of Figure 9, the service algorithm 1140 in Figure 11 may also receive network congestion information from the network. Using the network congestion information, the service algorithm 1140 can adjust the amount of traffic allowed to enter the network based on the current network congestion.
In the foregoing specification, the invention has been described in terms of specific exemplary embodiments. It will, however, be evident that various modifications and changes may be made thereto without departing from the broader spirit and scope of the invention as set forth in the appended claims. The sperific~tion and drawings are, accordingly, to be regarded in an illustrative rather than a restrictive sense.
The present invention relates to the field of digital communication switches. More particularly, the present invention relates to a digital switch that uses the history of cell arrivals to make service ~lerisiQns.
BAcKGRouND OF THE INVENTION
Cell switching is a method of transmitting digital information wherein the information is broken into equal sized units called "cells." The cells of information are usually grouped into larger units called "frames."
The individual cells of information are transmitted from a source node to a destination node through a "connection." A
connection consists of a pathway through a digital network. A digital network is constructed of digital switches coupled together by digital communication lines. At the destination node, the individual cells of information may be reconstructed into the frame.
Each cell origin~s at a source node and is transmitted across the communications lines. The communication lines carry the cells of information between the digital switches along the connection pathway. The digital switches route the cells from incoming communication lines to outgoing communication lines and finally to a destination node coupled to a digital switch.
Each digital switch in the network can be connected to several communication lines. Furthermore, each communication line can carry several different connections simultaneously. A digital switch may employ a set of queues to handle the connections and a queue server to serve the queues. Por such digital switches, serving a connection with the queue server entails removing an incoming cell from an input queue associated with the connection and sending the cell out on a communication line or to a destination node coupled to the digital switch. A service algorithm is employed to select a connection for service. To fully utilize the bandwidth of a communication line, it must be possible to select a cell for service during each service time. The service time refers to the amount of time it takes to transmit a single cell onto the communication line.
The objective of the service algorithm is to ensure that every connection receives the appropriate amount of service.
When a communication service provider agrees to provide service to a customer, the two parties enter into a communication traffic contract. This contract contains constraints that the customer agrees to adhere to. These constraints are referred to in this document as an arrival contract. For example, the arrival contract may limit the customer on how fast the customer may send cells to the network.
Another part of the communication traffic contract may be used when a queue and queue server are used in the connection. For connections with a queue and queue server, the service provider may agree to provide the customer with a minimal level of service. This minimal level of service is referred to in this document as a service contract and may contain an initial burst and a minimum service rate.
To implement the arrival contract, the digital switch has a traffic policing circuit at the customer interface to the digital switch.
The traffic policing circuit monitors the incoming cells sent from the customer to the service provider and determines when cells do not conform to the arrival contract. To implement a service contract, the digital switch has a service algorithm circuit that determines when the digital switch should service the queues for each connection that are handled by the digital switch. The service contract is not necessary when there is no queue associated with a connection.
. CA 02211077 1997-07-21 W 096/29805 PCT~US96/03011 SUMMARY AND OB.JECTS OF TI~E INV~ON
One object of the present invention is to provide a simplified service algorithm that makes service decisions based upon the history of cell arrivals. By monitoring the arrival of incoming cells, the present invention helps to simplify the server in the ~y~Lenl.
This and other objects are performed by the improved ingress circuit of the present invention. The ingress circuit includes a minimum service rate circuit that monitors the rate of arriving cells.
The minimum service rate circuit notifies the connection server when cells arrive in conformance with the minimum service rate of the service contract. The minimum service rate circuit may use a continuous state leaky bucket or virtual scheduling algorithm as specified in the CCITT Recommendation I.371 document to determine if a cell is in conformance with the minimum service rate of the service contract. When a cell arrives that conforms to the minimum service rate, the minimum service rate circuit notifies the server and the server serves the queue associated with the connection.
Other objects, features and advantages of the present invention will be apparent from the accompanying drawings, and from the detailed description that follows below.
BRIEF DESCR~rlON OF THE DRAWINGS
The present invention is illustrated by way of example and not limitation in the figures of the accompanying drawings in which like re~e~ ces indicate similar elements and in which:
Figure 1 illustrates a digital communication network constructed with StratacomTM BPXTM and Il'XTM digital switches;
Figure 2 illustrates a prior art internal block diagram of a StratacomTM BPXTM digital switch;
Figure 3 illustrates an internal block diagram of a Network Interface card;
Figure 4 illustrates an internal block diagram of the ingress circuit in a Network Interface card;
Figure 5a illustrates a conceptual diagram of the Generic Cell Rate Algorithm (also known as the "leaky bucket" algorithm);
Figure 5b illustrates a flow diagram of the Generic Cell Rate Algorithm (also known as the "leaky bucket" algorithm);
Figure 6 illustrates a conceptual diagram of a typical user service contract with a digital communication service provider;
Figure 7 illustrates a conceptual diagram of a Generic Cell Rate Algorithm that implements traffic policing for the user service contract of Figure 6;
Figure 8 illustrates an expanded block diagram of the ingress circuit including the traffic policing circuit and the service algorithm;
Figure 9 illustrates a block diagram of an improved ingress circuit that includes a minimum service rate circuit that informs the server when it should serve a queue;
Figure lOa illustrates a conceptual diagram of a leaky bucket for use in a minimum service rate circuit, the leaky bucket has a leak rate equal to the minimum service rate and an limit L that implements an initial burst.
Figure lOb illustrates a an example of how the minimum service rate circuit leaky bucket is used to make service decisions.
Figu~e 11 illustrates a block diagram of an alternate emborlim~nt of an improved ingress circuit that uses the existing traffic policing circuit to implenl~nt an initial burst; and Figu~e 12 illustrates a conceptual diagram of the leaky bucket in the alternate embodiment where the leaky bucket implements both traffic policing and an initial burst.
DETAILED DESC :K~ 11O~
Methods and s~ h~rnPs for using cell arrival information to make queue service decisions in a digital communication ~yslelll are disclosed.
A Broadband Nelwu,k Figure 1 illustrates a digital communications network topology.
The network illustrated in Figure 1 is a cell switched digital communication network constructed of Broadband Packet Exchanger (BPXTM) modules and Integrated Packet Exchanger (IPXTM) modules sold by Stratacom of San Jose, California. The Stratacom BPXTM
modules and the Stratacom IPXTM modules function as digital switches that are capable of building virtual connections for routing cells. The Stratacom BPXTM modules serve as the backbone for a broadband digital Wide Area Network (WAN). The Stratacom IPXTM
modules couple smaller narrowband digital communication links to the broadband digital network.
Each BPXTM module is a digital switch coupled to one or more broadband digital communication lines. Examples of broadband digital communication lines include E3 lines, T3 lines, and OC3 lines.
The BPXTM digital switches are also coupled to IPXTM digital switches using broadband digital communication links.
Each IPXTM digital switch in Figure 1 is used to couple slower digital communication lines to the broadband digital communication network. The customer premise equipment 160 may consist of any type of digital communication equipment such a Private Branch Exchange (PBX) or a packet router.
Figure 2 illustrates a block diagram of the internal mechanisms of an existing BPXTM digital switch. Each BPXTM digital switch consists of a plurality of Network Interface units (NI 173 and NI 175) and a BPX
Control Card (BCC) unit 190.
Each Network Interface unit is connected to a broadband digital communication line. Every Broadband Network Interface unit is also coupled to a high-speed backplane bus 180 within the BPXTM digital CA 022ll077 l997-07-2l switch. In the present embodim~nt the backplane bus 180 of the BPXTM comprises the StratabusTM.
The BCC unit 190 is also coupled to the backplane bus 180. The BCC unit 190 functions as a digital crossbar switch that routes data cells to and from all the different digital comm~mication lines that are coupled to the BPXTM digital switch.
A Network Tnterf~ce Card Figure 3 illustrates an internal block diagram of a Network Interface card 300. In one embodiment, the Network Interface card 300 is a Stratacom ATM Service Interface (ASI) card 300. The Network Interface card 300 comprises an ingress circuit 310, an egress circuit 320 and a StratabusTM interface circuit 340. The ingress circuit 310is connected to a communications line and processes incoming data cells received from the communications line. The egress circuit 320 iS also connected to the communications line and processes outgoing data cells. The StratabusTM interface circuit 340 is coupled to both the ingress circuit 310 and the egress circuit 320 and distributes data cells to the StratabusTM 310 within the BPXTM digital switch.
Figure 4 illustrates an internal block diagram of the ingress circuit 310. The ingress circuit 310 consists of a Traffic Policing circuit 420 and the remaining ingress service circuitry 430. The purpose of the Traffic policing circuit 420iS to enforce the arrival contract by acting as a traffic policing device. The Traffic policing circuit 420 determines if each incoming data cell is a "conforming" cell.
Specifically, the Traffic policing circuit 420 determines if each incoming data cell conforms with the limits placed upon the incoming data link according to the arrival contract.
For example, if a user sends a series of data cells so quickly that the user exceeds the maximum incoming data cell rate allowed by the arrival contract, then the Traffic policing circuit 420 will indicate that the cells are "nonconforming" data cells according to the arrival contract. Nonconforming data cells may be tagged as low priority or simply discarded. Discarded data cells may not be recovered. Data cells that are tagged as low priority are kept within the digital switch W 096/29805 PCTrUS96/03011 and transmitted if there is sufficient bandwidth available. However, data cells tagged as low priority are the first to be discarded when congestion occurs in the network.
The Traffic Poli~ ing Circuit To enforce the limits specified within the arrival contract, the Traffic Policing circuit 420 implements a Generic cell rate algorithm such as continuous-state leaky bucket algorithm or the virtual scheduling algorithm as described in the CCITT Recommendation I.371 Document, Geneva 1992 (See Annex 1).
Figures 5a and 5b illustrate a conceptual diagram and a flow diagram that describe how the continuous-state leaky bucket algorithm operates. The virtual scheduling algorithm is similarly described in detail in the CCITT Recommendation I.371 Document.
The continuous-state leaky bucket algorithm maintains a "bucket" of debit markers. Figure 5a illustrates a conceptual diagram of the leaky bucket. Each time a cell arrives, the bucket depth is compared to a threshold limit to determine whether the cell is a conforming cell.
The cell conforms if the bucket depth is less than the threshold limit.
When a cell conforms, a debit marker is placed into the debit marker bucket. The debit markers are removed from the debit marker bucket at a leak rate equal to the sustainable cell rate. When cells arrive at a rate faster than the sustainable cell rate, the debit markers accumulate in the debit marker bucket. Eventually, the debit marker bucket exceeds the limit thereby signaling nonconforming cells. Although the continuous-state leaky bucket algorithm is explained with rer~ ce to a bucket of markers, the continuous-state leaky bucket algorithm is usually simply implemented using a single counter as explained below.
As illustrated in Figure 5b, the continuous-state leaky bucket algorithm is invoked when a cell is received at step 510. A temporary bucket counter (X') is calculated at step 520 by subtracting off the amount of time since the last conforming cell. The temporary bucket counter (X') is tested at step 530 to determine if it is less than zero. If the temporary bucket counter (X') is less than zero then it is set to zero -W 096t29805 PCTrUS96/03011 .
at step 540 (the bucket level is not allowed to drop below zero) and the cell is lle~mPf~ col~ollning at step 570 where the bucket is incr~mente~l by the cost of processing the conforming cell. If the temporary bucket counter (X') was not less than zero at step 530 then the temporary bucket counter (X') is tested to see if it exceeds a limit set on the bucket.
If the temporary bucket counter (X') exceeds the limit, then the cell is deemed nonconforming at step 560. Otherwise the cell is deemed conforming at step 570 and the bucket counter (X) is incremented by the cost of processing the conforming cell.
An Example of Traffic Policing Figure 6 illustrates a diagram of one possible type of data communication traffic contract. The data communication traffic contract illustrated in Figure 6 is ~i.ofinPll by different two data cell rates. The first data cell rate is the sustainable cell rate (SCR). The sustainable cell rate defines the maximum rate at which the user may continually transmit cells into the Sy~lell~ without being penalized. If the user sends data cells at a rate less than the sustainable cell rate, then every data cell sent by the user will conform to the terms of the contract and thus every cell will be served by the data communication service provider.
The second data cell rate defined by the data communication traffic contract of Figure 6 is the peak cell rate (PCR). The peak cell rate represents the highest cell rate at which the user may transmit cells during a short "burst" period. If the user ever transmits cells faster than the peak cell rate, then some cells will be nonconforming and will be discarded. When a user sends data cells at a rate faster than the sustainable cell rate (SCR) but below the peak cell rate (PCR) for a long period of time then the ~y~Lell~ will eventually overflow and cells will be found to be nonconforming, these nonconforming cells will be tagged. The amount of cells that the service provider will serve when cells are transmitted at a rate faster than the sustainable cell rate (SCR) but below the peak cell rate (PCR) is known as the burst tolerance.
Figure 7 illustrates how the data communication service contract of Figure 6 can be implemented with a pair of leaky buckets.
. CA 02211077 1997-07-21 Each bucket represents a set of debit markers. The first bucket has room for enough debit markers to h~n~lle a burst of data cells. This is typically used to handle short bursts that are created due to the cell delay variation in the network. The ffrst bucket has a debit marker leak rate equal to the peak cell rate (PCR). If the average data rate of the incoming data frames exceeds the peak cell rate, then the debit markers will overflow and the data cells that caused the overflow will be deemed nonconforming and therefore thrown out.
The second bucket has a leak rate equal to the sustainable cell rate (SCR) of the communications service contract. When the rate ol incoming data cells exceeds the sustainable cell rate, the debit markers will accumulate in the second bucket. The debit markers will accumulate in the second bucket until the number of debit markers in the second bucket exceeds the Ll limit that implements the burst tolerance. When the debit markers that stack up in the second bucket exceed the Ll limit, subsequent incoming data cells are deemed nonconforming by the traffic policing circuit.
The Ingress Service Circuit After cells pass through the Traffic Policing circuit 420, the cells are passed on to the ingress service circuitry 430. Figure 8 illustrates a block diagram further defining the ingress service circuitry 430. The ingress service circuitry 430 in the Network Interface card places each received data cell into a queue associated with the connection. If no other connection shares the queue, it is referred to as a virtual connection queue. Each virtual connection queue is serviced by a queue server circuit 830.
The ingress service circuitry 430 is responsible for serving the virtual connections carried by the communication line in a manner that satisfies a communication contract bet~,~reen the communications provider and the customer. Typically, a minimum service rate is configured for each connection carried by the communication line.
The communications provider is required to serve each connection at or above the minimum service rate configured for the connection to conform with the communications contract. Each connection may . CA 02211077 1997-07-21 W 096/29805 PCTrUS96/03011 also have an initial burst spe- ifie~l The initial burst is rlefinel1 as the number of cells that will be served without queuing when the customer bursts traffic into that connection.
Prior art switching equipment, such as the Stratacom(~ IPX(~, fulfill the terms of the service contract by implementing a sophisticated service algorithm that instructs a queue server circuit when to serve a queue associated with a virtual connection. The sophisticated service algorithm must carefully monitor each virtual connection queue in order to ensure that the initial burst and minimal service rate requirements are met.
Implementing Service Decisions With Arrival Information Existing digital switches fulfill the minimum service rate requirements of a communications service contract using a sophisticated service algorithm 840 as illustrated in Figure 8. To more efficiently fulfill the minimum service rate terms of the communications service contract, the present invention introduces the concept of using cell arrival information to assist the queue server in making service decisions. By using cell arrival information to ~ assist in making service decisions, the implementation of the queue server circuit can be greatly simplified.
Figure 9 illustrates an ingress circuit constructed according to the teachings of the present invention. In the improved ingress circuit of Figure 9, the flow of arriving cells is routed to both the Traffic policing circuit 920 and a minimum service rate circuit 960.
The Traffic policing circuit 920 enforces the limits on how fast the customer can transmit cells into the network as previously described.
After cells pass through the Traffic policing circuit 920, the cells are queued into a plurality of virtual connection queues.
The minimum service rate circuit 96û implements an algorithm simil~r to the traffic policing circuit, except that the minimum service rate circuit 960 uses the information to make service decisions. For example the continuous-state leaky bucket algorithm or the virtual scheduling algorithm as described in the CCll-l Recommendation I.371 Document can be used. A service W096/29805 PCT~US96/03011 .
~le~i~iQn information line 950 connects the minimum service rate circuit 960 and the service combining circuit 935. The service combining circuit 935 passes the service ~leri~ic)ns made by the minimum service rate circuit 960 to the queue server circuit 930 which serves the queues. The service combining circuit 935 may also receive service decisions from other service circuits, such as the other service circuit 945. This service information is combined with the service information from the minimum service rate circuit 960 to cause the queue server circuit 930 to service virtual connection queues. The minimum service rate circuit will not send a service event if the traffic policing circuit discards the cell.
For purposes of an example, this specification will describe an embo~ Pnt that uses the continuous-state leaky bucket algorithm although either the continuous-state leaky bucket algorithm or the virtual scheduling algorithm could be used. Figure lOa illustrates a conceptual diagram of a leaky bucket for a rninimum service rate circuit 960 that implements the requirements of the communication service contract. As illustrated in Figure lOa, the markers are removed from leaky bucket at a rate equal to the minimum service rate. As long as the number of markers are below the limit L, each incoming cell will cause the minimum service rate circuit 960 to instruct the queue service circuit to serve the queue. The limit L is set such that if the customers transmits cells at the maximum allowed arrival rate, then the digital switch will immediately server the ffrst n cells where n equals the initial burst. The limit L is a function of the maximum allowed arrival rate, the lead rate (minimum service rate), and the initial burst. Specifically:
Li itL (MaximumArrivalrate-MinimumServiceRate) x I iti 1 B t Maximum Arrival rate For example, if the maximum allowed arrival rate equals twice the minimum service rate and the initial burst is 6 cells, then -. . , (2 x MSR - MSR) LlmltL = 2xMSR x 6 cells = --x 6 cells = 3 cells An Example of Service Dericion.~ Made With Cell Arrival Inform~tion Figure 10b illustrates an example of how the minimum service rate circuit 960 operates to fulfill the minimum service rate and the initial burst . In the example of Figure 10b, the initial burst is set to 6 cells and the cells are being sent by the customer at the maximum cell rate which equals twice the minimum service rate. Thus, the leak rate of the leaky bucket is the minimum service rate and the limit L is set to 3. Starting from an initial empty situation, after the first cell arrives the bucket contains a marker for the first cell. Because the markers are below the limit L, a serve command is sent to the queue server circuit.
When the second cell arrives, another marker is added to the bucket, but one marker leaks out such that the bucket contains a single marker again. Again, a serve command is sent to the queue server circuit. When the third cell arrives, another marker is added to the bucket. Since the bucket is still below the limit L, another serve command is sent. When the fourth cell arrives, another marker is added to the bucket and another marker leaks out such that the bucket contains two markers and another serve command is sent. When the fifth cell arrives, another marker is added to the bucket and another serve command is sent since the markers are still below the limit L.
When the sixth cell arrives, another marker is added to the bucket but another marker leaks out such the markers remain below the limit L
and another serve command is sent. When the seventh cell arrives, another marker is added to the bucket such that the limit L is exceeded. Since the markers are above the limit L, no service command is sent. When the eighth cell arrives, no marker is added to the bucket since the bucket had exceed the limit, but one marker drained out such that the markers are below the limit L. This causes a serve command to be sent to the queue server circuit. When the ninth cell arrives, another marker is added to the bucket such that the . CA 02211077 1997-07-21 W 096/29805 PCTrUS96/0301 limit L is again Pxceedell cause no serve command to be sent. When the tenth cell arrives, no marker is added to the bucket since the bucket was above the limit, but another marker drained out such that the markers again fall below the limit L. This causes another serve command to be sent. Since the cells are being transmitted at twice the minimum service rate, the minimum service rate circuit 960 will continue sending a serve command for every other arriving cell.
Referring back to Figure 9, it should be noted that the minimum service rate circuit 960 is not the only source of serve commands. The queue server circuit 930 may also receive service decisions from the other service circuit 945. In Figure 9, the other service circuit 945 receives information about network congestion through congestion information line 970. When the service circuit 945 determines that there is not much congestion in the network, the service circuit 945 specifies that additional cells above the minimum service can be served.
Alternate embodiment: Traffic Policing Implementing Initial Burst In an alternate embodiment, an existing traffic policing circuit is used to assist the queue server in making service decisions. By using information gathered from the traffic policing circuit to assist in making service decisions, the implementation of the queue server circuit is greatly simplified.
Figure 11 illustrates the alternate embodiment of an ingress circuit that implements the initial burst of the service contract using the traffic policing circuit. In the ingress circuit of Figure 11, a service decision information line 1150 connects the traffic policing circuit 1120 and the service algorithm circuit 1140. A service algorithm circuit 1140 is coupled to the queue server circuit 1130 and controls the queue server circuit 1130. The service algorithm 1140 determines when each virtual queue will be served. In the ingress circuit of Figure 11, the traffic policing circuit 1120 provides serve commands to the service algorithm circuit 1140 such that the Traffic policing circuit 1120 implements the initial burst portion of the service contract. The use of the traffic policing circuit information is best explained by example.
CA 022ll077 l997-07-2l W 096t29805 PCTrUS96/03011 .
As described above, many traffic policing circuits implement some version of the continuous-state leaky bucket algorithm to enforce the limits on how fast customers may send cells into the network. To impl~ment the initial burst of the service contract, a second limit can be added to the leaky bucket in the traffic policing circuit. Figure 12 illustrates the Traffic polidng leaky bucket further enhanced to include a second L0 limit. (The Ll limit is the burst tolerance limit as previously described.) The second L0 limit implements the initial burst for the service contract. If a data cell arrives and the debit markers in the traffic policing leaky bucket are below the L0 limit, then the traffic policing circuit 1120 will inform the service algorithm 1140 that a cell must be served (Since the initial burst has not been reached). Once the debit markers in the bucket stack up above the L0 limit, there is no longer a requirement to serve the cells immediately such that the incoming data cells are processed normally.
Thus, the service algorithm 1140 uses the information sent by the traffic policing circuit to implement the initial burst requirement.
Specifically, when the traffic policing circuit indicates that cell has been received while the queue is below the L0 limit and sends a serve command, then the service algorithm 1140 instructs the queue server to serve the associated virtual queue. Thus, if the debit markers in the bucket remain below the L0 limit, then every cell will be served im~ne~ tPly. If one wishes to set a minimum service rate equal to the sustainable cell rate, then the L0 limit can be set equal to the L1 limit.
Certain types of virtual connection always require immediate service from the queue server 1130. For example, a virtual connection that is carrying a telephone connection must be serviced irr me(1i~t~ly.
If a virtual connection carrying a telephone connection is not serviced fast enough, gaps and pops will be audible by the callers. By adjusting the service parameters of the service contract, the traffic policing circuit 1120 can provide the service algorithm 1140 with information such that those types of connections are serviced properly. For example, to h~n~lle a telephone connection that requires constant service, the Traffic policing circuit 1120 can set the L0 limit above the L1 burst tolerance limit. By setting the L0 limit above the L1 burst tolerance limit, every conforming cell that arrives will be in1rne~1iAt~ly served by the queue server 1130 such that the telephone conversation will be carried properly.
Similar to the ingress circuit of Figure 9, the service algorithm 1140 in Figure 11 may also receive network congestion information from the network. Using the network congestion information, the service algorithm 1140 can adjust the amount of traffic allowed to enter the network based on the current network congestion.
In the foregoing specification, the invention has been described in terms of specific exemplary embodiments. It will, however, be evident that various modifications and changes may be made thereto without departing from the broader spirit and scope of the invention as set forth in the appended claims. The sperific~tion and drawings are, accordingly, to be regarded in an illustrative rather than a restrictive sense.
Claims (19)
1. A method of controlling transmission of cells in a network, said method comprising the steps of:
receiving a plurality of cells from an interface;
storing said plurality of cells in a queue;
using a set of service events to transmit said cells from said queue into said network, a portion of said set of service events generated based on a conforming decision that is made when said cell arrive from said interface wherein the conforming decision is based on the history of cell arrivals at the interface.
receiving a plurality of cells from an interface;
storing said plurality of cells in a queue;
using a set of service events to transmit said cells from said queue into said network, a portion of said set of service events generated based on a conforming decision that is made when said cell arrive from said interface wherein the conforming decision is based on the history of cell arrivals at the interface.
2. The method as claimed in claim 1 wherein said conforming decision is a virtual scheduling algorithm.
3. The method as claimed in claim 1 wherein said conforming decision is a continuous state leaky bucket algorithm.
4. The method as claimed in claim 3 wherein said state leaky bucket algorithm has a limit L set by Limit L =
5. The method of claim 1 wherein another portion of said service events is based on congestion in said network.
6. A method of controlling transmission of cells in a network, said method comprising the steps of:
receiving a plurality of cells from an interface;
policing said plurality cells received from said interface such that a set of requirements from an arrival contract are enforced, said step of policing performed by a traffic policing circuit;
storing said in a cells in a queue;
transmitting said cells from said queue into said network, said traffic policing circuit implementing an initial burst.
receiving a plurality of cells from an interface;
policing said plurality cells received from said interface such that a set of requirements from an arrival contract are enforced, said step of policing performed by a traffic policing circuit;
storing said in a cells in a queue;
transmitting said cells from said queue into said network, said traffic policing circuit implementing an initial burst.
7. The method as claimed in claim 6 wherein said traffic policing circuit implements a virtual scheduling algorithm.
8. The method as claimed in claim 6 wherein said traffic policing circuit implements a continuous state leaky bucket algorithm.
9. The method as claimed in claim 8 wherein said state leaky bucket algorithm has a limit L set by Limit L =
10. An apparatus for providing a minimum rate of service, said apparatus comprising the elements of:
an interface, said interface for receiving a plurality of cells transmitted by a customer;
a queue for storing said plurality of cells transmitted by said customer;
a queue server for serving said plurality of cells stored in said queue; and a minimum service rate circuit, said minimum service rate circuit having a cell rate monitor for monitoring an incoming rate of said plurality of cells, said cell rate monitor signaling said queue server when a cell arrives in conformance with said minimum rate of service.
an interface, said interface for receiving a plurality of cells transmitted by a customer;
a queue for storing said plurality of cells transmitted by said customer;
a queue server for serving said plurality of cells stored in said queue; and a minimum service rate circuit, said minimum service rate circuit having a cell rate monitor for monitoring an incoming rate of said plurality of cells, said cell rate monitor signaling said queue server when a cell arrives in conformance with said minimum rate of service.
11. The apparatus as claimed in claim 10 wherein said cell rate monitor implements a virtual scheduling algorithm.
12. The apparatus as claimed in claim 10 wherein said cell rate monitor implements a continuous state leaky bucket algorithm.
13. The apparatus as claimed in 12 wherein said state leaky bucket algorithm has a limit L set by Limit L =
14. The method of claim 1 wherein said queue server also receives information about congestion in said network.
15. An apparatus for providing a minimum rate of service for cells transmitted by a customer destined for a network, said apparatus comprising the elements of:
an interface, said interface for receiving a plurality of cells transmitted by said customer;
a traffic policing circuit, said traffic policing circuit enforcing an arrival contract on said plurality of cells transmitted by said customer, said traffic policing implementing an initial burst defined in a service contract;
a queue for storing said plurality of cells transmitted by said customer;
a queue server for serving said plurality of cells stored in said queue, said queue server coupled to said traffic policing circuit to receive initial burst information.
an interface, said interface for receiving a plurality of cells transmitted by said customer;
a traffic policing circuit, said traffic policing circuit enforcing an arrival contract on said plurality of cells transmitted by said customer, said traffic policing implementing an initial burst defined in a service contract;
a queue for storing said plurality of cells transmitted by said customer;
a queue server for serving said plurality of cells stored in said queue, said queue server coupled to said traffic policing circuit to receive initial burst information.
16. The apparatus as claimed in claim 15 wherein said cell rate monitor implements a virtual scheduling algorithm.
17. The apparatus as claimed in claim 15 wherein said cell rate monitor implements a continuous state leaky bucket algorithm.
18. The apparatus as claimed in 17 wherein said state leaky bucket algorithm has a limit L set by Limit L =
19. The apparatus of claim 1 wherein said queue server also receives information about congestion in said network.
Applications Claiming Priority (2)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| US08/407,906 | 1995-03-20 | ||
| US08/407,906 US5570360A (en) | 1995-03-20 | 1995-03-20 | Method and apparatus for implementing communication service contract using cell arrival information |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CA2211077A1 true CA2211077A1 (en) | 1996-09-26 |
Family
ID=23614042
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CA002211077A Abandoned CA2211077A1 (en) | 1995-03-20 | 1996-03-06 | Method and apparatus for implementing a communication service contract using cell arrival information |
Country Status (5)
| Country | Link |
|---|---|
| US (1) | US5570360A (en) |
| EP (1) | EP0815674A1 (en) |
| AU (1) | AU5183196A (en) |
| CA (1) | CA2211077A1 (en) |
| WO (1) | WO1996029805A1 (en) |
Families Citing this family (78)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JP3458469B2 (en) * | 1994-07-15 | 2003-10-20 | ソニー株式会社 | Signal receiving apparatus and communication method |
| EP0705007A3 (en) * | 1994-09-30 | 2003-01-29 | Roke Manor Research Limited | ATM queuing and scheduling apparatus |
| CA2214838C (en) | 1995-03-08 | 2008-02-26 | Avril Joy Smith | Broadband switching system |
| AU720173B2 (en) | 1995-03-08 | 2000-05-25 | British Telecommunications Public Limited Company | Broadband switching network |
| NZ303240A (en) * | 1995-03-08 | 1999-06-29 | British Telecomm | Bandwidth allocation depending on load for broadband switching system |
| GB9514206D0 (en) | 1995-07-12 | 1995-09-13 | British Telecomm | Rate controller |
| JP3335087B2 (en) * | 1995-08-09 | 2002-10-15 | キヤノン株式会社 | Network system, node device, and control method therefor |
| ATE279061T1 (en) * | 1995-08-18 | 2004-10-15 | Cit Alcatel | METHOD AND DEVICE FOR CHECKING THE CONFORMITY OF A TRAFFIC MONITORING SYSTEM |
| AU709365B2 (en) | 1996-01-09 | 1999-08-26 | British Telecommunications Public Limited Company | A service multiplexer |
| US5982749A (en) * | 1996-03-07 | 1999-11-09 | Lsi Logic Corporation | ATM communication system interconnect/termination unit |
| US5831971A (en) * | 1996-08-22 | 1998-11-03 | Lucent Technologies, Inc. | Method for leaky bucket traffic shaping using fair queueing collision arbitration |
| JP2991125B2 (en) * | 1996-09-06 | 1999-12-20 | 日本電気株式会社 | Cell rate monitoring device for ABR |
| US6016307A (en) | 1996-10-31 | 2000-01-18 | Connect One, Inc. | Multi-protocol telecommunications routing optimization |
| JP3686680B2 (en) | 1996-10-31 | 2005-08-24 | シーメンス アクチエンゲゼルシヤフト | Asynchronous transmission communication cell transfer method having granularity selectable for speed |
| EP0935863B1 (en) * | 1996-10-31 | 2002-05-02 | Infineon Technologies AG | Method of routing asynchronously transferred message cells with a 100 % power capacity utilization |
| US5926458A (en) * | 1997-01-31 | 1999-07-20 | Bay Networks | Method and apparatus for servicing multiple queues |
| US6118776A (en) | 1997-02-18 | 2000-09-12 | Vixel Corporation | Methods and apparatus for fiber channel interconnection of private loop devices |
| US6185203B1 (en) | 1997-02-18 | 2001-02-06 | Vixel Corporation | Fibre channel switching fabric |
| US6151325A (en) * | 1997-03-31 | 2000-11-21 | Cisco Technology, Inc. | Method and apparatus for high-capacity circuit switching with an ATM second stage switch |
| GB2327317B (en) | 1997-07-11 | 2002-02-13 | Ericsson Telefon Ab L M | Access control and resourse reservation in a communications network |
| US5870589A (en) * | 1997-07-23 | 1999-02-09 | International Business Machines Corporation | Method for enhanced broadcast and unknown server operation |
| US6104700A (en) * | 1997-08-29 | 2000-08-15 | Extreme Networks | Policy based quality of service |
| US6252878B1 (en) | 1997-10-30 | 2001-06-26 | Cisco Technology, Inc. | Switched architecture access server |
| US6526060B1 (en) | 1997-12-05 | 2003-02-25 | Cisco Technology, Inc. | Dynamic rate-based, weighted fair scheduler with explicit rate feedback option |
| US6144669A (en) * | 1997-12-12 | 2000-11-07 | Newbridge Networks Corporation | Prioritized PVC management queues for improved frame processing capabilities |
| US6859438B2 (en) | 1998-02-03 | 2005-02-22 | Extreme Networks, Inc. | Policy based quality of service |
| US6738814B1 (en) * | 1998-03-18 | 2004-05-18 | Cisco Technology, Inc. | Method for blocking denial of service and address spoofing attacks on a private network |
| JP2000059370A (en) * | 1998-08-04 | 2000-02-25 | Fujitsu Ltd | Device and method for controlling traffic |
| US6269096B1 (en) | 1998-08-14 | 2001-07-31 | Cisco Technology, Inc. | Receive and transmit blocks for asynchronous transfer mode (ATM) cell delineation |
| US6535520B1 (en) | 1998-08-14 | 2003-03-18 | Cisco Technology, Inc. | System and method of operation for managing data communication between physical layer devices and ATM layer devices |
| US6381245B1 (en) | 1998-09-04 | 2002-04-30 | Cisco Technology, Inc. | Method and apparatus for generating parity for communication between a physical layer device and an ATM layer device |
| US6243749B1 (en) | 1998-10-08 | 2001-06-05 | Cisco Technology, Inc. | Dynamic network address updating |
| US6427174B1 (en) | 1998-11-12 | 2002-07-30 | Cisco Technology, Inc. | Dynamic IP addressing and quality of service assurance |
| US7165117B1 (en) | 1998-11-12 | 2007-01-16 | Cisco Technology, Inc. | Dynamic IP addressing and quality of service assurance |
| US7165122B1 (en) | 1998-11-12 | 2007-01-16 | Cisco Technology, Inc. | Dynamic IP addressing and quality of service assurance |
| US6430155B1 (en) * | 1998-11-30 | 2002-08-06 | Cisco Technology, Inc. | Congestion avoidance on communications networks |
| US7616640B1 (en) | 1998-12-02 | 2009-11-10 | Cisco Technology, Inc. | Load balancing between service component instances |
| US6442165B1 (en) | 1998-12-02 | 2002-08-27 | Cisco Technology, Inc. | Load balancing between service component instances |
| US6700872B1 (en) | 1998-12-11 | 2004-03-02 | Cisco Technology, Inc. | Method and system for testing a utopia network element |
| US6917617B2 (en) * | 1998-12-16 | 2005-07-12 | Cisco Technology, Inc. | Use of precedence bits for quality of service |
| US6643260B1 (en) | 1998-12-18 | 2003-11-04 | Cisco Technology, Inc. | Method and apparatus for implementing a quality of service policy in a data communications network |
| US6438106B1 (en) | 1998-12-22 | 2002-08-20 | Nortel Networks Limited | Inter-class schedulers utilizing statistical priority guaranteed queuing and generic cell-rate algorithm priority guaranteed queuing |
| US6535511B1 (en) | 1999-01-07 | 2003-03-18 | Cisco Technology, Inc. | Method and system for identifying embedded addressing information in a packet for translation between disparate addressing systems |
| US6453357B1 (en) * | 1999-01-07 | 2002-09-17 | Cisco Technology, Inc. | Method and system for processing fragments and their out-of-order delivery during address translation |
| US6449655B1 (en) | 1999-01-08 | 2002-09-10 | Cisco Technology, Inc. | Method and apparatus for communication between network devices operating at different frequencies |
| US6587468B1 (en) | 1999-02-10 | 2003-07-01 | Cisco Technology, Inc. | Reply to sender DHCP option |
| US6791941B1 (en) * | 1999-09-28 | 2004-09-14 | Lucent Technologies Inc. | Learning-based admission control adjustment in data networks |
| US6697369B1 (en) * | 1999-09-28 | 2004-02-24 | Lucent Technologies Inc | Admission control adjustment in data networks using maximum cell count |
| US6625155B1 (en) * | 1999-09-28 | 2003-09-23 | Lucent Technologies Inc. | Model-based admission control adjustment in data networks |
| US6952421B1 (en) | 1999-10-07 | 2005-10-04 | Cisco Technology, Inc. | Switched Ethernet path detection |
| US6484224B1 (en) | 1999-11-29 | 2002-11-19 | Cisco Technology Inc. | Multi-interface symmetric multiprocessor |
| US6798746B1 (en) | 1999-12-18 | 2004-09-28 | Cisco Technology, Inc. | Method and apparatus for implementing a quality of service policy in a data communications network |
| US7203171B1 (en) * | 1999-12-20 | 2007-04-10 | Cisco Technology, Inc. | Ingress discard in output buffered switching devices |
| EP1133202A1 (en) * | 2000-03-07 | 2001-09-12 | Lucent Technologies Inc. | Radio telecommunications system with improved use of air interface (II) |
| EP1133201A1 (en) * | 2000-03-07 | 2001-09-12 | Lucent Technologies Inc. | Radio telecommunications system with improved use of air interface (I) |
| US6977895B1 (en) | 2000-03-23 | 2005-12-20 | Cisco Technology, Inc. | Apparatus and method for rate-based polling of input interface queues in networking devices |
| US6735207B1 (en) | 2000-06-13 | 2004-05-11 | Cisco Technology, Inc. | Apparatus and method for reducing queuing memory access cycles using a distributed queue structure |
| US7126969B1 (en) * | 2000-07-06 | 2006-10-24 | Cisco Technology, Inc. | Scalable system and method for reliably sequencing changes in signaling bits in multichannel telecommunication lines transmitted over a network |
| US8619793B2 (en) * | 2000-08-21 | 2013-12-31 | Rockstar Consortium Us Lp | Dynamic assignment of traffic classes to a priority queue in a packet forwarding device |
| US6920498B1 (en) | 2000-08-31 | 2005-07-19 | Cisco Technology, Inc. | Phased learning approach to determining closest content serving sites |
| WO2002025988A1 (en) * | 2000-09-25 | 2002-03-28 | Themistoklis Rapsomanikis | Real-time traffic transfer in multi-service communication networks system and method |
| GR20000100320A (en) * | 2000-09-25 | 2002-07-31 | Θεμιστοκλης Ραψομανικης | Real-time traffic transfer in multi-service communication networks system and method |
| US6820123B1 (en) | 2000-09-28 | 2004-11-16 | Cisco Technology, Inc. | Method and apparatus for assigning hot objects to server load balancer |
| JP5048184B2 (en) * | 2001-01-26 | 2012-10-17 | 富士通株式会社 | Transmission rate monitoring apparatus and transmission rate monitoring method |
| US6904057B2 (en) * | 2001-05-04 | 2005-06-07 | Slt Logic Llc | Method and apparatus for providing multi-protocol, multi-stage, real-time frame classification |
| US7042848B2 (en) * | 2001-05-04 | 2006-05-09 | Slt Logic Llc | System and method for hierarchical policing of flows and subflows of a data stream |
| US6901052B2 (en) | 2001-05-04 | 2005-05-31 | Slt Logic Llc | System and method for policing multiple data flows and multi-protocol data flows |
| US7151744B2 (en) * | 2001-09-21 | 2006-12-19 | Slt Logic Llc | Multi-service queuing method and apparatus that provides exhaustive arbitration, load balancing, and support for rapid port failover |
| US7099275B2 (en) * | 2001-09-21 | 2006-08-29 | Slt Logic Llc | Programmable multi-service queue scheduler |
| US7386632B1 (en) | 2002-06-07 | 2008-06-10 | Cisco Technology, Inc. | Dynamic IP addressing and quality of service assurance |
| US7349416B2 (en) * | 2002-11-26 | 2008-03-25 | Cisco Technology, Inc. | Apparatus and method for distributing buffer status information in a switching fabric |
| US7477596B1 (en) * | 2004-08-31 | 2009-01-13 | Adtran, Inc. | Policing engine providing dynamic adjustment of peak and sustained data cell rates and efficient transfer of AAL5 cells |
| US7787361B2 (en) | 2005-07-29 | 2010-08-31 | Cisco Technology, Inc. | Hybrid distance vector protocol for wireless mesh networks |
| US7660318B2 (en) * | 2005-09-20 | 2010-02-09 | Cisco Technology, Inc. | Internetworking support between a LAN and a wireless mesh network |
| US20070110024A1 (en) * | 2005-11-14 | 2007-05-17 | Cisco Technology, Inc. | System and method for spanning tree cross routes |
| US8077609B2 (en) * | 2005-12-15 | 2011-12-13 | At&T Intellectual Property I, L.P. | Method for providing quality-of-service based services in a packet network |
| US7817556B2 (en) * | 2006-04-20 | 2010-10-19 | Cisco Technology, Inc. | Modification of policing methods to make them more TCP-friendly |
| EP1953959A1 (en) * | 2007-02-01 | 2008-08-06 | British Telecommunications Public Limited Company | Data communication |
Family Cites Families (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US5379297A (en) * | 1992-04-09 | 1995-01-03 | Network Equipment Technologies, Inc. | Concurrent multi-channel segmentation and reassembly processors for asynchronous transfer mode |
| US5313454A (en) * | 1992-04-01 | 1994-05-17 | Stratacom, Inc. | Congestion control for cell networks |
| ATE230535T1 (en) * | 1992-09-14 | 2003-01-15 | Siemens Ag | METHOD FOR BROADCASTING CELLS IN A COMMUNICATIONS NETWORK OPERating IN ASYNCHRONOUS TRANSFER MODE |
| US5436891A (en) * | 1993-01-14 | 1995-07-25 | Motorola, Inc. | Method and system for traffic management in cell relay networks |
| US5412647A (en) * | 1993-03-25 | 1995-05-02 | Northern Telecom Limited | Rate enforcement for frame relay networks |
| US5359592A (en) * | 1993-06-25 | 1994-10-25 | Stratacom, Inc. | Bandwidth and congestion control for queue channels in a cell switching communication controller |
| US5408472A (en) * | 1993-09-20 | 1995-04-18 | Motorola, Inc. | Device and method for cell processing in cell relay nodes |
| US5455825A (en) * | 1994-04-28 | 1995-10-03 | Mitsubishi Electric Research Laboratories | Tag-based scheduling system for digital communication switch |
-
1995
- 1995-03-20 US US08/407,906 patent/US5570360A/en not_active Expired - Lifetime
-
1996
- 1996-03-06 EP EP96908665A patent/EP0815674A1/en not_active Withdrawn
- 1996-03-06 CA CA002211077A patent/CA2211077A1/en not_active Abandoned
- 1996-03-06 WO PCT/US1996/003011 patent/WO1996029805A1/en not_active Application Discontinuation
- 1996-03-06 AU AU51831/96A patent/AU5183196A/en not_active Abandoned
Also Published As
| Publication number | Publication date |
|---|---|
| WO1996029805A1 (en) | 1996-09-26 |
| AU5183196A (en) | 1996-10-08 |
| US5570360A (en) | 1996-10-29 |
| EP0815674A1 (en) | 1998-01-07 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US5570360A (en) | Method and apparatus for implementing communication service contract using cell arrival information | |
| EP0487235B1 (en) | Bandwidth and congestion management in accessing broadband ISDN networks | |
| CA1279392C (en) | Packet switching system arranged for congestion control | |
| CA2211020A1 (en) | Frame based traffic policing for a digital switch | |
| EP0275678B1 (en) | Packet switching system arranged for congestion control through bandwidth management | |
| US6438135B1 (en) | Dynamic weighted round robin queuing | |
| EP0688481B1 (en) | Device and method for atm end system cell flow regulation | |
| EP1374498B1 (en) | An improved system for fabric packet control | |
| US6356629B1 (en) | Switched virtual circuit controller setup congestion management strategy | |
| US8009565B2 (en) | Switch with function for assigning queue based on a declared transfer rate | |
| US6473815B1 (en) | Queue sharing | |
| US20060013133A1 (en) | Packet-aware time division multiplexing switch with dynamically configurable switching fabric connections | |
| US20020116522A1 (en) | Network congestion control in a mixed traffic environment | |
| Doshi et al. | Congestion Control in ISDN Frame‐Relay Networks | |
| JP2002543740A (en) | Method and apparatus for managing traffic in an ATM network | |
| EP1312187A2 (en) | Apparatus and method for controlling queuing of data at a node on a network | |
| JPH11510665A (en) | Method for optimally transmitting ATM cells via connection elements | |
| EP0692892B1 (en) | Method and equipment for the real time management of resources in a virtual private network in ATM technique | |
| EP1032889B1 (en) | Apparatus and method for managing network congestion | |
| US5982751A (en) | Rare probability connection call registration method using payload type indication field information for asynchronous transfer mode switching system | |
| JP2790475B2 (en) | Communication traffic control method | |
| JP3090308B2 (en) | ATM switch | |
| Hartanto et al. | User-network policer: a new approach for ATM congestion control | |
| KR0153957B1 (en) | Call control method using the atm transferability data at atm switching system | |
| JP3044521B2 (en) | Cell flow rate limiter |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| FZDE | Discontinued |