CA2211020A1 - Frame based traffic policing for a digital switch - Google Patents
Frame based traffic policing for a digital switchInfo
- Publication number
- CA2211020A1 CA2211020A1 CA002211020A CA2211020A CA2211020A1 CA 2211020 A1 CA2211020 A1 CA 2211020A1 CA 002211020 A CA002211020 A CA 002211020A CA 2211020 A CA2211020 A CA 2211020A CA 2211020 A1 CA2211020 A1 CA 2211020A1
- Authority
- CA
- Canada
- Prior art keywords
- frame
- cell
- conforming
- cells
- counter
- 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/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
- H04L2012/5646—Cell characteristics, e.g. loss, delay, jitter, sequence integrity
- H04L2012/5647—Cell loss
- H04L2012/5648—Packet discarding, e.g. EPD, PTD
-
- 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/5652—Cell construction, e.g. including header, packetisation, depacketisation, assembly, reassembly
Abstract
A frame based traffic policing system that determines if incoming data cells are conforming or non-conforming according to the traffic contract. The frame based traffic policing system first detects a cell at the beginning or end of a frame and determines if the frame conforms with a traffic contract. If the cell does not exceed the parameters of the traffic contract, then the frame based traffic policing system deems the cell as conforming. If the cell was the first cell of a frame, then frame based traffic policing system treats all the remaining cells in the frame as conforming or non-conforming depending upon if the first data cell was conforming or non-conforming. If the cell was the last cell of a frame, then frame based traffic policing system treats all the cells of the following frame as conforming or non-conforming depending upon if the last cell of the previous frame was conforming or non-conforming. In this manner, all the data cells from the same frame receive the same treatment by the network. The framed based traffic policing system improves the throughput of the network since the network will be less likely to waste resources transmitting cells from a corrupted frame.
Description
W O 96/29806 PCT~US96~D3~15 Frame Based Traffic P~ ;n~ For a Digital Switch FIELD OF THE INVEN rIoN
The present invention relates to the field of digital commlmicAtion switches. More particularly, the present invention relates to a frame based traffic policing system in a digital switch for a cell relay network.
BACKGROUND OF THE INVENTION
Cell switching is a method of trAn.~mit~in~ information wherein a frame of 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 network constructed of communication lines and switches. At the destination node, the individual cells of information are reconstructed into a frame.
Each frame of information usually indudes some type of data integrity mPrh~ni~m such as a data integrity value that is used to determine if the information in the frame was reliably transmitted across the network. If any information in the frame was corrupted during tr~n.smi~sion, then the data integrity value will indicate that a transmission error has occurred.
Digital communication networks have a limited amount of bandwidth such that only a certain amount of information can be tr~nsmitted across the network per unit time. To allocate the available bandwidth in a network, a network provider and the network customers enter into a communication "traffic contract" that specifies the rates at which customers may transmit data into the network.
The traffic contract is enforced at the entry point of the network with a traffic polidng function a~ the network interface. Each arriving cell is checked to determine whether the cell complies with the traffic contract. If a cell is deemed non-conforming (the cell does not comply with the traffic contract), the network provider may discard the cell.
Alternatively, the network provider may transmit the non-W O 96/29806 PCTrUS96/03515 conforming cell of inform~l;on at a reduced priority. Reduced priority cells are the first cells to be discarded when congestion is flete~-te~l within the network. An example of a traffic policing function is the "leaky bucket" algorithm as described in CCI~ Document I.371.
When a network provider discards a single non-conforming data cell from a frame, the data integrity mechanism for that frame will indicate a transmission error has occurred while transmitting the frame. When transmission errors occur during the transmission of a frame, the entire frame is discarded by the receiver and must be retransmitted across the network. Thus, all the individual cells fron.
a corrupted frame must be retransmitted regardless whether or not these cells contained transmission errors. The result is that the percent of frames that must be retransmitted may be much larger than the percent of cells discarded by the network. Additionally, the network wastes resources by transmitting cells from corrupted frames that must ultimately be retransmitted from the sender to the receiver.
W 096129806 PCT~US96~3~1 SU~ARY AND OBTF~S OF THE INv~T~oN
The primary object of the present invention is to provide a traffic policing :jy~ that determines if incoming cells comply with a communication traffic contract on a frame basis such that all cells within the same frame are treated in the same manner by the network. Thus, all the cells from a frame will be accepted or all the cells from a frame will be discarded. By treating all the cells within a frame in the same manner, the throughput of the digital network is maxi~ni7e~ during periods of network congestion.
This and other objects are performed by the frame-based traffic policing ~y~ lL of the present invention. The frame based traffic policing system examines the first data cell of each frame to determine if the first data cell complies with the user's communication traffic contract. If the first data cell of the frame coInplies with the communication traffic contract, then that first data cell will be determined to be "conforming". If the first data cell exceeds the parameters of the communication traffic contract, then that first data cell is determined to be "non-conforming." Non-conforming data cells may be tagged as low priority or simply discarded. The frame based traffic policing system then specifies the conformity of all the remaining data cells in the frame to be the same as the first data cell.
In this manner, if the first data cell from a particular frame is conforming, then all the data cells from that frame will be treated as conforming. Similarly, if the first data cell of the frame is ~le~me~l non conforming, then all the cells of that frame are non conforming.
Other objects, features and advantages of the present invention will be apparent from the accompanying drawings, and from the detailed description that follows below.
W O 96/29806 PCTrUS9610351 BRIEF DESCRIPTION OFTHE DRAWINGS
The present invention is illustrated by way of example and not limitation in the figures of the accompanying drawings in which like rerere~lces indicate similar elements and in which:
Figure la illustrates a prior art digital communication network constructed with StratacomTM BPXTM and IPXTM digital switches;
Figure lb illustrates a prior art internal block diagram of a StratacomTM BPXTM digital switch;
Figure 2 illustrates a data frame consisting of a number of data cells that carry digital information;
Figure 3 illustrates a digital communication network constructed with Stratacom BPXTM and IPXTM switches wherein the Stratacom BPXTM switches have ATM Service Interface (ASI) cards;
Figure 4 illustrates an internal block diagram of a Stratacom BPXTM digital switch with an ATM Service Interface (ASI) card;
Figure 5 illustrates an internal block diagram of an ATM
Service Interface (ASI) card;
Figure 6 illustrates an internal block diagram of the ingress circuit in an ATM Service Interface (ASI) card;
Figure 7 illustrates a flow diagram of a Continuous State Leaky Bucket Algorithm that implements traffic policing;
Figure 8 illustrates a flow diagram of a Virtual Scheduling Algorithm that implements traffic policing function;
Figure 9 illustrates a flow diagram of a frame-based traffic policing system that uses the Continuous State Leaky Bucket Algorithm;
Figure 10 illustrates a flow diagram of a frame-based traffic policing system that uses the Virtual Scheduling Algorithm;
Figure 11 illustrates a flow diagram of an alternate frame-based traffic policing system that uses the Continuous State Leaky Bucket Algorithm;
Figure 12 illustrates a flow diagram of an alternate frame-based traffic policing system that uses the Virtual Scheduling Algorithm.
W O 96/29806 PCTAUS96103~1 DETAILED DESCRIPTION
Methods and apparatus for implementing a frame-based traffic policing system for a digital communication system are disclosed.
A Broadband Network Figure la illustrates a prior art digital communications network topology. The network illustrated in Figure la 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 circuits 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 conununication 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 la 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 lb illustrates a block diagram of the internal mech~ni~m~ of a prior art BPXTM digital switch. Each BPXTM digital switch consists of a plurality of Broadband Network Interface (BNI) units (BNI 420 and BNI 430) and a BPX Control Card (BCC) unit 440.
Each Broadband Network Interface (BNI) unit consists of a network interface connected to a broadband digital communication line. Every Broadband Network Interface unit is also coupled to a high-speed backplane bus 410 within the BPXTM digital switch. In the W 096/29806 PCTrUS96/03~15 present embodiment the backplane bus 410 of the BPXTM comprises the StratabusTM.
The BCC unit 440 is also coupled to the backplane bus 410. The BCC unit 440 functions as a digital crossbar switch that routes data cells to and from all the different digital communication lines that are coupled to the BPXTM digital switch.
Cell Switched Communications In cell switched communications systems data frames of information are segmented into smaller cells. Figure 2 illustrates an example of a data frame of information. As illustrated in Figure 2, each data frame contains a header, a series of data cells, and a trailer The individual data cells of the data frame carry the information to be transmitted. The header and trailer contain overhead information such as a data integrity value used to reliably communicate the information contained in the data cells of the data frame. For example, a data integrity checksum such as a Cyclic Redundancy Check (CRC) value is usually placed in the trailer of a data frame to ensure the integrity of the transmitted frame.
A Broadband Network with the ATM Service Tnt~rf~ce Figure 3 illustrates a broadband network incorporating the teachings of this patent. In the network diagram of Figure 3 each BPXTM digital switch includes an Asynchronous Transfer Mode (ATM) Service Interface card (ASI). The ATM service interface (ASI) cards in each BPXTM digital switch can be used to directly connect a BPXTM digital switch to any customer premise equipment that uses asynchronous transfer mode (ATM) communications and supports the proper interface. In the present embodiment, a T3 based communication link is used to carry the information.
Figure 4 illustrates an internal block diagram of a BPXTM digital switch with an ATM service interface (ASI) card 450 installed.
Customer premise equipment (CPE) can be coupled directly to the ASI
card using an asynchronous transfer mode (ATM) communications link. Within the BPXTM switch, the ATM service interface (ASI) card 450 is coupled to the BCC crosspoint switch 440 via the high-speed WO 96/29806 PCT~lJS96J03515 StratabusTM 410 on the BPXTM backplane. In this manner, the illforlnation from the Customer premise equipment transmitted across the asynchronous transfer mode communications link can be switched to other communication links coupled to the BPXTM digital switch.
The ATM Service Tntf~rf~c~ Card Figure 5 illustrates an internal block diagram of an ATM service interface (ASI) card 500. The ATM service interface (ASI) card 500 comprises an ingress circuit 510, an egress circuit 520 and a StratabusTM
interface circuit 540. The ingress circuit 510 is connected to a communications line that uses asynchronous transfer mode (ATM) protocol. The ingress circuit 510 processes incoming data cells received from the communications line. The egress circuit 520 is also connected to the communications line and processes outgoing data cells. The StratabusTM interface circuit 540 is coupled to both the ingress circuit 510 and the egress circuit 520 and distributes data cells to the StratabusTM 410 within the BPXTM digital switch.
Figure 6 illustrates an internal block diagram of the ingress circuit 510. The ingress circuit 510 consists of a Traffic Policing circuit (UPC) 620 and the remaining ingress circuitry 630. The purpose of the Traffic Policing circuit 620 is to enforce the traffic contract to which a customer has subscribed. The Traffic Policing circuit 620 determines if each incoming data cell is a "conforming" cell. Specifically, the Traffic Policing circuit 620 determines if each incoming data cell complies with the limits placed upon the incoming data link according to a communication traffic contract.
For example, if a user sends a series of data cells so quickly that the user exceeds the maximum data rate allowed by the communication traffic contract, then the Traffic Policing circuit 620 will indicate that the cells are "non-conforming" data cells according to the communication traffic contract. Non-conforming 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 and transmitted if there is sufficient bandwidth available. However, data cells tagged as low priority are discarded if there is too much congestion in the network.
To enforce the limits specified within a communication traffic contract, the Traffic Policing circuit 620 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).
Figure 7 illustrates a flow diagram describing how the continuous-state leaky bucket algorithm operates. The continuous-state leaky bucket algorithm maintains a "bucket" of debit markers.
The debit markers are drained from the bucket over time. Each time a cell arrives, the depth of the bucket is evaluated with respect to a threshold. The cell is considered conforming if the bucket is below this threshold. If a cell is found to be conforming, debit markers are added to the bucket. When cells arrive at a faster rate than the traffic contract allows, debit markers accumulate in the debit marker bucket.
Eventually, the debit marker bucket overflows indicating that a user is exceeding the bounds of a communications traffic contract.
As illustrated in Figure 7, the algorithm is invoked when a cell is received at step 710. A temporary bucket counter (X') is calculated at step 720 by subtracting off the amount of time since the last conforming cell. The temporary bucket counter (X') is tested at step 730 to determine if it is less than zero. If the temporary bucket counter (X') is less than zero then it is set to zero at step 740 and the cell is llePTne~l conforming at step 770 where the bucket is incremented by the cost of processing the conforming cell. If the temporary bucket counter (X') was not less than zero at step 730 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 non-conforming at step 760. Otherwise the cell is deemed conforming at step 770 and the bucket counter (X) is incremented by the cost of processing the conforming cell.
Figure 8 illustrates a flow diagram of a virtual scheduling algorithm for performing traffic control. The virtual scheduling W 096129806 PCT~US96J~3515 algorithm updates a Theoretical Arrival Time value (TAT) that ~l~fin~?s a "nomin;~l" arrival time of a data cell assuming that the inco~ning cells are equally spaced when the source is active. If the actual arrival time of a cell is not too early relative to the Theoretical Arrival Time value (TAT), then the cell is conforming, otherwise the cell is non-conforming. Specifically, if the actual arrival time of a cell is later than the Theoretical Arrival Time value minus a limit (TAT-L) then the cell is conforming.
Referring to Figure 8, the algorithm is invoked when a cell is received at step 810. At step 830, the algorithm checks if the arrival time of the kth cell, ta(k), is after the current value of the Theoretical Arrival Time (TAT). If the cell arrived after the Theoretical Arrival Time (TAT) then the cell is conforming and Theoretical Arrival Time (TAT) is updated to the current time ta(k) (at step 840) plus the increment I (at step 870). If the cell arrives before the Theoretical Arrival Time (TAT), then the algorithm checks if the cell arrived longer than a limit L time before the Theoretical Arrival Time (TAT) at step 850. Specifically, if the arrival time of the kth cell is less than TAT-L (i.e., if TAT is greater than ta(k) + L), then the cell is non-conforming and the Theoretical Arrival Time (TAT) is unchanged.
Otherwise, the cell is conforming and the Theoretical Arrival Time (TAT) is increased by the increment I at step 870.
Referring back to frame diagram Figure 2, information is transmitted across communication lines as a set of data frames wherein each data frame is subdivided into a number of data cells.
Each data frame includes a data integrity value that is encoded within the data frame. (Usually in the frame trailer.) When a receiver at a destination node receives an entire data frame, the receiver evaluates the data with respect to the data integrity value included in the data frame. If the data integrity value in the frame does not match what is expected, then the data frame is discarded since it contains errors.
To receive a valid frame, every bit of information must be properly transmitted. If the network discards any data cell from a data frame, the computed data integrity value for the data frame will not W 096/29806 PCT~US96/03515 match the data integrity value received within the data frame. Thus if a single data cell is not transmitted, the entire data frame will be invalid and must be retransmitted.
Frame-Based Traffic Policing To increase the number of valid frames sent across a network when there are non-conforming data cells, a frame based traffic policing SysL~ has been implemented. In a first embodiment of a frame based traffic policing system, a conformity decision is first made for the first data cell of each data frame depending upon the current state of the traffic policing algorithm. The conformity determination for the remaining data cells in each frame then depends upon whether the first cell of the frame was conforming or not. By determining the conformity of each non-first data cell based upon the first data cell of the frame, each data frame will either be completely conforming or completely non-conforming. The frame based traffic policing system is best explained with reference to flow diagrams. The frame based traffic policing system will first be explained in the context of the continuous-state leaky bucket traffic control algorithm and then in the context of the virtual scheduling traffic control algorithm.
Figure 9 illustrates a flow diagram for the frame based version of the continuous-state leaky bucket traffic policing algorithm. The frame based continuous-state leaky bucket system is activated when a cell is received at step 910. As in the normal continuous-state leaky bucket system, a temporary bucket counter is calculated at step 920.
However, the frame based continuous-state leaky bucket system then differs at step 925 where it tests to see if the received cell is the first cellof a frame. If the received cell is the first cell of a frame, then cell is treated the same as in the normal continuous-state leaky bucket system of Figure 7. That is, the first cell is deemed conforming if the temporary bucket counter (X') is less than zero at step 930. If the temporary bucket counter (X') was not less than zero at step 930 then the temporary bucket counter (X') is tested at step 960 to see if it exceeds a limit (Ll) set on the bucket. If the temporary bucket counter (X') exceeds the Ll limit, then a flag is set indicating that first cell was WO !~6129806 PCT/US96J()3515 non-confo~ming at step 975 and the cell is ~le~merl non-conforming at step 980. Otherwise a flag is set indicating that first cell was conforming at step 965 and the cell is deemed conforming at step 990 and the bucket counter (X) is incremented by the cost of processing the conforming cell.
However, if at step 925 it is determined that the cell is not the first cell of a frame then a different method of determining conformity is used. If step 925 determines that the cell is not the first cell of a frame, then the sysLem tests if the first cell of the frame was conforming at step 940. If the first cell was non-conforming, then the current cell is also deemed non-conforming at step 980. If the first cell was conforming, then the system tests if the bucket counter has dropped below zero at step 945. If the bucket counter dropped below zero, then the system sets the bucket counter to zero at step 947 and deems the cell collro~ ing at step 990. If the bucket counter is not below zero, then one final test is performed.
A problem can occur if the last data cell in a frame that con~in~
the marker in~icAting the end of a frame becomes lost, dropped or damaged during transmission. Alternatively, an unscrupulous user may cause problems by not sending a cell containing an end of frame marker in an attempt to send more data cells than allowed by the user traffic contract. If either of these two events occur, the received frame will appear to be an oversized frame. The large number of cells in the oversized frame may overrun the buffers in the system.
The sys~..l of the present invention implements two features to prevent problems with oversized frames overrunning the buffers in the system. The first feature is that all End-of-frame (EOF) cells are treated as conforming such that EOF frames will not be dropped during transmission. The second feature is that the system of Figure 9 has a second limit that is an "absolute" limit. Any data cell received after the bucket counter exceeds the second (absolute) limit will be ~le~nle~l non-conforming. As illustrated in Figure 9, the system tests if the temporary bucket counter exceeds the second limit (L2) at step 950.
If the second limit is exceeded, then the cell is deemed non-W O 96/29806 PCTrUS96103515 col,rollliing at step 990. Otherwise, the cell is deemed conforming at step 980. To ensure that an entire frame can be served, the amount of space between the first limit and the second (absolute) limit is large enough to ~ccornmodate an entire frame of data cells. In this manner, even if the first cell of a frame is the last cell to fall below the first limit, the r~m~ining cells of that frame will also be deemed conforming since the second limit of the bucket counter will not be e~cceefl~
Figure 10 illustrates a flow diagram of a frame-based virtual scheduling algorithm for performing traffic control. Referring to Figure 10, the algorithm is invoked when a cell is received at step 1010. At step 1020, the system tests if the cell is the first cell of a frame.
If the cell is the first cell of a frame, then cell is treated the same as in the normal virtual scheduling algorithm of Figure 8. Specifically, at step 1030 the algorithm checks if the arrival time of the first cell, ta(k), is after the current value of the Theoretical Arrival Time (TAT). If the first cell arrived after the Theoretical Arrival Time (TAT) then the first cell is conforming such that a flag is set indicating that first cell was conforming (at step 1075) and the Theoretical Arrival Time (TAT) is updated to the current time ta(k) (at step 1035) plus the increment I
(at step 1090). If the cell arrives before the Theoretical Arrival Time (TAT), then the algorithm checks if the cell arrived longer than a limit L1 time before the Theoretical Arrival Time (TAT) at step 1060.
Specifically, if the arrival time of the kth cell is less than TAT-L1 (i.e., if TAT is greater than ta(k) + L1), then the first cell is non-conforming such that a flag is set indicating that the first cell was non-conforming (at step 1065) and the Theoretical Arrival Time (TAT) is unchanged.
Otherwise, the first cell is conforming such that a flag is set indicating that first cell was conforming (at step 1075) and the Theoretical Arrival Time (TAT) is increased by the increment I at step 1090.
If back at step 1020 the received cell was determined not to be a first cell of a frame, then the system checks the flag to determine if the first cell of the frame was conforming at step 1040. If the first cell of the frame was non-conforming, then this current cell is also deemed WO 96129806 PC-r/US96~03515 non-collfu~ ing~ If the first frame was conforming, then another test is performed at step 1050 to determine if the arrival time of the kth cell is less than TAT-L2 (i.e., if TAT is greater than ta(k) + L2). If the arrival time of the kth cell is less than TAT-L2 (TAT is greater than ta(k) + L2), then the cell is non-conforming and the Theoretical Arrival Time (TAT) is unchanged at step 1080. Otherwise, the cell is conforming such that the Theoretical Arrival Time (TAT) is increased by the increment I at step 1090.
Thus, the frame based traffic policing system of the present invention ensures that if the first data cell of a frame is non-conforming, then all the data cells of that frame will be non-conforming. Furthermore, if the first data cell of a frame is conforming, then all the data cells of that frame are deemed collrolllLing unless an absolute limit is exceeded. In this manner, the frame based traffic policing system treats every data cell from the same frame as all conforming or all non-conforming unless an overflow occurs.
~ltPrn:~te Embodiment of Frame-Based Traffic Policing In a ~ler~,led embodiment, the first cell of each frame cannot easily be distingtli~he~ Instead, the last data cell of each frame contains an End-Of-Frame (EOF) marker that identifies the data cell as being at the end of the frame. In such as situation, the first cell of the next frame can be identified as the cell following an End-Of-Frame (EOF) cell. In such an environment, the framed-based traffic policing ~y~ may make a conformity decision for an entire frame by determining if the last cell of the previous frame conforms. However, if the framed-based traffic policing system determines that the next entire frame should conform, then the framed-based traffic policing ~y~lell~ should deem the last cell of the current frame as conforming such that the beginning the next frame will easily be identified.
Figure 11 illustrates a flow diagram that describes the method steps performed by the frame based traffic policing system using the continuous state leaky bucket algorithm where the last cell of a frame before a conforming frame is always deemed conforming. The method begins at step 1110 when an incoming data cell is received.
The method then calculates a temporary bucket counter value at step 1115 by subtracting off the amount of time elapsed since the last conforming data cell. The frame based traffic policing system then determines if the incoming data cell is the last data cell of a frame or not at step 1117. If a received data cell is the last data cell of a frame, the frame based traffic policing system proceeds to step 1120 where it determines if the number of debit markers in the temporary bucket counter has dropped below zero. If the number of temporary bucket counter has dropped below zero, then the temporary bucket counter is set to zero at step 1123 and the method proceeds to step 1127 where the next frame is dePmell conforming and step 1129 where the cell is deemed col~folllling causing the bucket counter to be increased. If at step 1120 the temporary bucket counter was greater or equal to zero, then the temporary bucket counter is compared with the first bucket limit (L1). If the temporary bucket counter is less than the first bucket limit (L1), then the next frame is deemed conforming at step 1127 and the cell is deemed conforming causing the bucket counter to be increased at step 1129. Otherwise, if the temporary bucket counter exceeds the first limit, then the next frame will be deemed non-conforming. However, since this is the last cell of the current frame it must be still be handled a~ro~liately. Thus, the traffic policing system tests if the current frame is conforming at step 1126. If the current frame is not conforming then the last cell is deemed non-conforming at step 1143 and the frame is deemed non-conforming at step 1145. If the current frame is conforming then the next frame is deemed non-collroLllling at step 1128 and the last cell is deemed conforming causing the bucket counter to be increased at step 1129.
If back at step 1117, the cell was determined not to be the last cell of the frame, then the cell is handled like all the other cells in the frame unless the second (overflow) limit of the bucket counter is reached. Specifically, non last cells are first tested at step 1130 to determine if the current frame is conforming. If the current frame is not conforming then the cell is treated as non-conforming at step 1143.
. CA 022ll020 l997-07-2l W O 96t29806 PC~US96~3515 If the current frame is conforming, then temporary bucket counter is tested at step 1131 to see if it is less than zero. If the temporary bucket counter is less than zero then the temporary bucket counter is set to zero at step 1133 and the method proceeds to step 1129 where the cell is dePTner1 collrolll illg causing the bucket counter to be increased. If the temporary bucket counter is not less than zero then the temporary bucket counter is tested at step 1135 to determine if the second (L2) limit is excee-led If the overflow limit is exceeded then the cell is determined to be non-conforming at step 1143 and the remainder of the frame is deemed non-conforming at step 1145.
Figure 12 illustrates a flow diagram that describes the steps performed by the frame based traffic policing sysl~lll using the Virtual Scheduling algorithm where the last cell of a frame before a conforming frame is always deemed conforming. The method begins at step 1210 when an incoming data cell is received. The frame based traffic policing ~y~L~ then determines if the incoming data cell is the last data cell of a frame or not at step 1217. If a received data cell is the last data cell of a frame, the frame based traffic policing system proceeds to step 1220 where it checks if the arrival time of the kth cell, ta(k), is after the current value of the Theoretical Arrival Time (TAT).
If that cell arrived after the Theoretical Arrival Time (TAT) then the cell is conforming and thus the next frame will be deemed conforming. This is accomplished by proceeding to steps 1223, 1227 and 1229 where the next frame is deemed conforming (step 1227) and the current cell is deemed conforming causing the Theoretical Arrival Time (TAT) to be updated to the current time ta(k) (at set 1223) plus the increment I (at step 1229). If the cell arrives before the Theoretical Arrival Time (TAT), then the algorithm checks if the cell arrived longer than a limit L1 time before the Theoretical Arrival Time (TAT) at step 1225. Sperifi~lly, if the arrival time of the kth cell is less than TAT-L1 (i.e., if TAT is greater than ta(k) + L1), then that last cell is non-conforming. If the last data cell arrived within limit L1 of the Theoretical Arrival Time (TAT) then the next frame is deemed conforming at step 1227 and the cell is deemed conforming causing W 096/29806 PCTrUS96/03515 the bucket counter to be increased at step lZ29. Otherwise, if the if the last cell arrived ~leaL~l than L1 time units before the Theoretical Arrival Time (TAT), then the next frame will be deemed non-conforming. However, since this is the last cell of the current frame, it must still be handled a~ o~.;ately. The traffic policing system method tests if the current frame is conforming at step 1226. If the current frame is not conforming then the last cell is deemed non-conforming at step 1243 and the frame is deemed non-conforming at step 1245. If the current frame is conforming then the next frame is deemed non-conforming at step 1228 and the last cell is deemed conforming causing the bucket counter to be increased at step 1229.
If at step 1217, the cell was determined not to be the last cell of the frame, then the cell is handled like all the other cells in the frame unless the second (overflow) limit of the bucket counter is reached.
Specifically, non last cells are first tested at step 1230 to determine if the current frame is conforming. If the current frame is not conforming then the cell is treated as non-conforming at step 1243. If the current frame is conforming, then the cell is tested to see if it arrived after the Theoretical Arrival Time (TAT) at step 1231. If the cell arrived after the Theoretical Arrival Time (TAT) then the cell is de~me-l conforming causing the Theoretical Arrival Time (TAT) to be updated to the current time ta(k) (at set 1233) plus the increment I (at step 1229). If the cell arrived before the Theoretical Arrival Time (TAT), then another test is performed at step 1150 to determine if the arrival time of the kth cell is less than TAT-L2 (i.e., if TAT is greater than ta(k) + L2). If the arrival time of the kth cell is less than TAT-L2 (TAT is greater than ta(k) + L2), then the cell is non-conforming and the Theoretical Arrival Time (TAT) is unchanged at step 1143 and the remainder of the frame is deemed non-conforming at step 1245.
Otherwise, the cell is conforming such that the Theoretical Arrival Time (TAT) is increased by the increment I at step 1229.
Although the present invention has been described in terms of specific exemplary embodiments, it will be appreciated that various modifications and alterations might be made by those skilled in the art WO 96129806 PCT/IJS96/0351~i without departing from the spirit and scope of the invention as set forth in the following claims.
The present invention relates to the field of digital commlmicAtion switches. More particularly, the present invention relates to a frame based traffic policing system in a digital switch for a cell relay network.
BACKGROUND OF THE INVENTION
Cell switching is a method of trAn.~mit~in~ information wherein a frame of 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 network constructed of communication lines and switches. At the destination node, the individual cells of information are reconstructed into a frame.
Each frame of information usually indudes some type of data integrity mPrh~ni~m such as a data integrity value that is used to determine if the information in the frame was reliably transmitted across the network. If any information in the frame was corrupted during tr~n.smi~sion, then the data integrity value will indicate that a transmission error has occurred.
Digital communication networks have a limited amount of bandwidth such that only a certain amount of information can be tr~nsmitted across the network per unit time. To allocate the available bandwidth in a network, a network provider and the network customers enter into a communication "traffic contract" that specifies the rates at which customers may transmit data into the network.
The traffic contract is enforced at the entry point of the network with a traffic polidng function a~ the network interface. Each arriving cell is checked to determine whether the cell complies with the traffic contract. If a cell is deemed non-conforming (the cell does not comply with the traffic contract), the network provider may discard the cell.
Alternatively, the network provider may transmit the non-W O 96/29806 PCTrUS96/03515 conforming cell of inform~l;on at a reduced priority. Reduced priority cells are the first cells to be discarded when congestion is flete~-te~l within the network. An example of a traffic policing function is the "leaky bucket" algorithm as described in CCI~ Document I.371.
When a network provider discards a single non-conforming data cell from a frame, the data integrity mechanism for that frame will indicate a transmission error has occurred while transmitting the frame. When transmission errors occur during the transmission of a frame, the entire frame is discarded by the receiver and must be retransmitted across the network. Thus, all the individual cells fron.
a corrupted frame must be retransmitted regardless whether or not these cells contained transmission errors. The result is that the percent of frames that must be retransmitted may be much larger than the percent of cells discarded by the network. Additionally, the network wastes resources by transmitting cells from corrupted frames that must ultimately be retransmitted from the sender to the receiver.
W 096129806 PCT~US96~3~1 SU~ARY AND OBTF~S OF THE INv~T~oN
The primary object of the present invention is to provide a traffic policing :jy~ that determines if incoming cells comply with a communication traffic contract on a frame basis such that all cells within the same frame are treated in the same manner by the network. Thus, all the cells from a frame will be accepted or all the cells from a frame will be discarded. By treating all the cells within a frame in the same manner, the throughput of the digital network is maxi~ni7e~ during periods of network congestion.
This and other objects are performed by the frame-based traffic policing ~y~ lL of the present invention. The frame based traffic policing system examines the first data cell of each frame to determine if the first data cell complies with the user's communication traffic contract. If the first data cell of the frame coInplies with the communication traffic contract, then that first data cell will be determined to be "conforming". If the first data cell exceeds the parameters of the communication traffic contract, then that first data cell is determined to be "non-conforming." Non-conforming data cells may be tagged as low priority or simply discarded. The frame based traffic policing system then specifies the conformity of all the remaining data cells in the frame to be the same as the first data cell.
In this manner, if the first data cell from a particular frame is conforming, then all the data cells from that frame will be treated as conforming. Similarly, if the first data cell of the frame is ~le~me~l non conforming, then all the cells of that frame are non conforming.
Other objects, features and advantages of the present invention will be apparent from the accompanying drawings, and from the detailed description that follows below.
W O 96/29806 PCTrUS9610351 BRIEF DESCRIPTION OFTHE DRAWINGS
The present invention is illustrated by way of example and not limitation in the figures of the accompanying drawings in which like rerere~lces indicate similar elements and in which:
Figure la illustrates a prior art digital communication network constructed with StratacomTM BPXTM and IPXTM digital switches;
Figure lb illustrates a prior art internal block diagram of a StratacomTM BPXTM digital switch;
Figure 2 illustrates a data frame consisting of a number of data cells that carry digital information;
Figure 3 illustrates a digital communication network constructed with Stratacom BPXTM and IPXTM switches wherein the Stratacom BPXTM switches have ATM Service Interface (ASI) cards;
Figure 4 illustrates an internal block diagram of a Stratacom BPXTM digital switch with an ATM Service Interface (ASI) card;
Figure 5 illustrates an internal block diagram of an ATM
Service Interface (ASI) card;
Figure 6 illustrates an internal block diagram of the ingress circuit in an ATM Service Interface (ASI) card;
Figure 7 illustrates a flow diagram of a Continuous State Leaky Bucket Algorithm that implements traffic policing;
Figure 8 illustrates a flow diagram of a Virtual Scheduling Algorithm that implements traffic policing function;
Figure 9 illustrates a flow diagram of a frame-based traffic policing system that uses the Continuous State Leaky Bucket Algorithm;
Figure 10 illustrates a flow diagram of a frame-based traffic policing system that uses the Virtual Scheduling Algorithm;
Figure 11 illustrates a flow diagram of an alternate frame-based traffic policing system that uses the Continuous State Leaky Bucket Algorithm;
Figure 12 illustrates a flow diagram of an alternate frame-based traffic policing system that uses the Virtual Scheduling Algorithm.
W O 96/29806 PCTAUS96103~1 DETAILED DESCRIPTION
Methods and apparatus for implementing a frame-based traffic policing system for a digital communication system are disclosed.
A Broadband Network Figure la illustrates a prior art digital communications network topology. The network illustrated in Figure la 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 circuits 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 conununication 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 la 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 lb illustrates a block diagram of the internal mech~ni~m~ of a prior art BPXTM digital switch. Each BPXTM digital switch consists of a plurality of Broadband Network Interface (BNI) units (BNI 420 and BNI 430) and a BPX Control Card (BCC) unit 440.
Each Broadband Network Interface (BNI) unit consists of a network interface connected to a broadband digital communication line. Every Broadband Network Interface unit is also coupled to a high-speed backplane bus 410 within the BPXTM digital switch. In the W 096/29806 PCTrUS96/03~15 present embodiment the backplane bus 410 of the BPXTM comprises the StratabusTM.
The BCC unit 440 is also coupled to the backplane bus 410. The BCC unit 440 functions as a digital crossbar switch that routes data cells to and from all the different digital communication lines that are coupled to the BPXTM digital switch.
Cell Switched Communications In cell switched communications systems data frames of information are segmented into smaller cells. Figure 2 illustrates an example of a data frame of information. As illustrated in Figure 2, each data frame contains a header, a series of data cells, and a trailer The individual data cells of the data frame carry the information to be transmitted. The header and trailer contain overhead information such as a data integrity value used to reliably communicate the information contained in the data cells of the data frame. For example, a data integrity checksum such as a Cyclic Redundancy Check (CRC) value is usually placed in the trailer of a data frame to ensure the integrity of the transmitted frame.
A Broadband Network with the ATM Service Tnt~rf~ce Figure 3 illustrates a broadband network incorporating the teachings of this patent. In the network diagram of Figure 3 each BPXTM digital switch includes an Asynchronous Transfer Mode (ATM) Service Interface card (ASI). The ATM service interface (ASI) cards in each BPXTM digital switch can be used to directly connect a BPXTM digital switch to any customer premise equipment that uses asynchronous transfer mode (ATM) communications and supports the proper interface. In the present embodiment, a T3 based communication link is used to carry the information.
Figure 4 illustrates an internal block diagram of a BPXTM digital switch with an ATM service interface (ASI) card 450 installed.
Customer premise equipment (CPE) can be coupled directly to the ASI
card using an asynchronous transfer mode (ATM) communications link. Within the BPXTM switch, the ATM service interface (ASI) card 450 is coupled to the BCC crosspoint switch 440 via the high-speed WO 96/29806 PCT~lJS96J03515 StratabusTM 410 on the BPXTM backplane. In this manner, the illforlnation from the Customer premise equipment transmitted across the asynchronous transfer mode communications link can be switched to other communication links coupled to the BPXTM digital switch.
The ATM Service Tntf~rf~c~ Card Figure 5 illustrates an internal block diagram of an ATM service interface (ASI) card 500. The ATM service interface (ASI) card 500 comprises an ingress circuit 510, an egress circuit 520 and a StratabusTM
interface circuit 540. The ingress circuit 510 is connected to a communications line that uses asynchronous transfer mode (ATM) protocol. The ingress circuit 510 processes incoming data cells received from the communications line. The egress circuit 520 is also connected to the communications line and processes outgoing data cells. The StratabusTM interface circuit 540 is coupled to both the ingress circuit 510 and the egress circuit 520 and distributes data cells to the StratabusTM 410 within the BPXTM digital switch.
Figure 6 illustrates an internal block diagram of the ingress circuit 510. The ingress circuit 510 consists of a Traffic Policing circuit (UPC) 620 and the remaining ingress circuitry 630. The purpose of the Traffic Policing circuit 620 is to enforce the traffic contract to which a customer has subscribed. The Traffic Policing circuit 620 determines if each incoming data cell is a "conforming" cell. Specifically, the Traffic Policing circuit 620 determines if each incoming data cell complies with the limits placed upon the incoming data link according to a communication traffic contract.
For example, if a user sends a series of data cells so quickly that the user exceeds the maximum data rate allowed by the communication traffic contract, then the Traffic Policing circuit 620 will indicate that the cells are "non-conforming" data cells according to the communication traffic contract. Non-conforming 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 and transmitted if there is sufficient bandwidth available. However, data cells tagged as low priority are discarded if there is too much congestion in the network.
To enforce the limits specified within a communication traffic contract, the Traffic Policing circuit 620 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).
Figure 7 illustrates a flow diagram describing how the continuous-state leaky bucket algorithm operates. The continuous-state leaky bucket algorithm maintains a "bucket" of debit markers.
The debit markers are drained from the bucket over time. Each time a cell arrives, the depth of the bucket is evaluated with respect to a threshold. The cell is considered conforming if the bucket is below this threshold. If a cell is found to be conforming, debit markers are added to the bucket. When cells arrive at a faster rate than the traffic contract allows, debit markers accumulate in the debit marker bucket.
Eventually, the debit marker bucket overflows indicating that a user is exceeding the bounds of a communications traffic contract.
As illustrated in Figure 7, the algorithm is invoked when a cell is received at step 710. A temporary bucket counter (X') is calculated at step 720 by subtracting off the amount of time since the last conforming cell. The temporary bucket counter (X') is tested at step 730 to determine if it is less than zero. If the temporary bucket counter (X') is less than zero then it is set to zero at step 740 and the cell is llePTne~l conforming at step 770 where the bucket is incremented by the cost of processing the conforming cell. If the temporary bucket counter (X') was not less than zero at step 730 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 non-conforming at step 760. Otherwise the cell is deemed conforming at step 770 and the bucket counter (X) is incremented by the cost of processing the conforming cell.
Figure 8 illustrates a flow diagram of a virtual scheduling algorithm for performing traffic control. The virtual scheduling W 096129806 PCT~US96J~3515 algorithm updates a Theoretical Arrival Time value (TAT) that ~l~fin~?s a "nomin;~l" arrival time of a data cell assuming that the inco~ning cells are equally spaced when the source is active. If the actual arrival time of a cell is not too early relative to the Theoretical Arrival Time value (TAT), then the cell is conforming, otherwise the cell is non-conforming. Specifically, if the actual arrival time of a cell is later than the Theoretical Arrival Time value minus a limit (TAT-L) then the cell is conforming.
Referring to Figure 8, the algorithm is invoked when a cell is received at step 810. At step 830, the algorithm checks if the arrival time of the kth cell, ta(k), is after the current value of the Theoretical Arrival Time (TAT). If the cell arrived after the Theoretical Arrival Time (TAT) then the cell is conforming and Theoretical Arrival Time (TAT) is updated to the current time ta(k) (at step 840) plus the increment I (at step 870). If the cell arrives before the Theoretical Arrival Time (TAT), then the algorithm checks if the cell arrived longer than a limit L time before the Theoretical Arrival Time (TAT) at step 850. Specifically, if the arrival time of the kth cell is less than TAT-L (i.e., if TAT is greater than ta(k) + L), then the cell is non-conforming and the Theoretical Arrival Time (TAT) is unchanged.
Otherwise, the cell is conforming and the Theoretical Arrival Time (TAT) is increased by the increment I at step 870.
Referring back to frame diagram Figure 2, information is transmitted across communication lines as a set of data frames wherein each data frame is subdivided into a number of data cells.
Each data frame includes a data integrity value that is encoded within the data frame. (Usually in the frame trailer.) When a receiver at a destination node receives an entire data frame, the receiver evaluates the data with respect to the data integrity value included in the data frame. If the data integrity value in the frame does not match what is expected, then the data frame is discarded since it contains errors.
To receive a valid frame, every bit of information must be properly transmitted. If the network discards any data cell from a data frame, the computed data integrity value for the data frame will not W 096/29806 PCT~US96/03515 match the data integrity value received within the data frame. Thus if a single data cell is not transmitted, the entire data frame will be invalid and must be retransmitted.
Frame-Based Traffic Policing To increase the number of valid frames sent across a network when there are non-conforming data cells, a frame based traffic policing SysL~ has been implemented. In a first embodiment of a frame based traffic policing system, a conformity decision is first made for the first data cell of each data frame depending upon the current state of the traffic policing algorithm. The conformity determination for the remaining data cells in each frame then depends upon whether the first cell of the frame was conforming or not. By determining the conformity of each non-first data cell based upon the first data cell of the frame, each data frame will either be completely conforming or completely non-conforming. The frame based traffic policing system is best explained with reference to flow diagrams. The frame based traffic policing system will first be explained in the context of the continuous-state leaky bucket traffic control algorithm and then in the context of the virtual scheduling traffic control algorithm.
Figure 9 illustrates a flow diagram for the frame based version of the continuous-state leaky bucket traffic policing algorithm. The frame based continuous-state leaky bucket system is activated when a cell is received at step 910. As in the normal continuous-state leaky bucket system, a temporary bucket counter is calculated at step 920.
However, the frame based continuous-state leaky bucket system then differs at step 925 where it tests to see if the received cell is the first cellof a frame. If the received cell is the first cell of a frame, then cell is treated the same as in the normal continuous-state leaky bucket system of Figure 7. That is, the first cell is deemed conforming if the temporary bucket counter (X') is less than zero at step 930. If the temporary bucket counter (X') was not less than zero at step 930 then the temporary bucket counter (X') is tested at step 960 to see if it exceeds a limit (Ll) set on the bucket. If the temporary bucket counter (X') exceeds the Ll limit, then a flag is set indicating that first cell was WO !~6129806 PCT/US96J()3515 non-confo~ming at step 975 and the cell is ~le~merl non-conforming at step 980. Otherwise a flag is set indicating that first cell was conforming at step 965 and the cell is deemed conforming at step 990 and the bucket counter (X) is incremented by the cost of processing the conforming cell.
However, if at step 925 it is determined that the cell is not the first cell of a frame then a different method of determining conformity is used. If step 925 determines that the cell is not the first cell of a frame, then the sysLem tests if the first cell of the frame was conforming at step 940. If the first cell was non-conforming, then the current cell is also deemed non-conforming at step 980. If the first cell was conforming, then the system tests if the bucket counter has dropped below zero at step 945. If the bucket counter dropped below zero, then the system sets the bucket counter to zero at step 947 and deems the cell collro~ ing at step 990. If the bucket counter is not below zero, then one final test is performed.
A problem can occur if the last data cell in a frame that con~in~
the marker in~icAting the end of a frame becomes lost, dropped or damaged during transmission. Alternatively, an unscrupulous user may cause problems by not sending a cell containing an end of frame marker in an attempt to send more data cells than allowed by the user traffic contract. If either of these two events occur, the received frame will appear to be an oversized frame. The large number of cells in the oversized frame may overrun the buffers in the system.
The sys~..l of the present invention implements two features to prevent problems with oversized frames overrunning the buffers in the system. The first feature is that all End-of-frame (EOF) cells are treated as conforming such that EOF frames will not be dropped during transmission. The second feature is that the system of Figure 9 has a second limit that is an "absolute" limit. Any data cell received after the bucket counter exceeds the second (absolute) limit will be ~le~nle~l non-conforming. As illustrated in Figure 9, the system tests if the temporary bucket counter exceeds the second limit (L2) at step 950.
If the second limit is exceeded, then the cell is deemed non-W O 96/29806 PCTrUS96103515 col,rollliing at step 990. Otherwise, the cell is deemed conforming at step 980. To ensure that an entire frame can be served, the amount of space between the first limit and the second (absolute) limit is large enough to ~ccornmodate an entire frame of data cells. In this manner, even if the first cell of a frame is the last cell to fall below the first limit, the r~m~ining cells of that frame will also be deemed conforming since the second limit of the bucket counter will not be e~cceefl~
Figure 10 illustrates a flow diagram of a frame-based virtual scheduling algorithm for performing traffic control. Referring to Figure 10, the algorithm is invoked when a cell is received at step 1010. At step 1020, the system tests if the cell is the first cell of a frame.
If the cell is the first cell of a frame, then cell is treated the same as in the normal virtual scheduling algorithm of Figure 8. Specifically, at step 1030 the algorithm checks if the arrival time of the first cell, ta(k), is after the current value of the Theoretical Arrival Time (TAT). If the first cell arrived after the Theoretical Arrival Time (TAT) then the first cell is conforming such that a flag is set indicating that first cell was conforming (at step 1075) and the Theoretical Arrival Time (TAT) is updated to the current time ta(k) (at step 1035) plus the increment I
(at step 1090). If the cell arrives before the Theoretical Arrival Time (TAT), then the algorithm checks if the cell arrived longer than a limit L1 time before the Theoretical Arrival Time (TAT) at step 1060.
Specifically, if the arrival time of the kth cell is less than TAT-L1 (i.e., if TAT is greater than ta(k) + L1), then the first cell is non-conforming such that a flag is set indicating that the first cell was non-conforming (at step 1065) and the Theoretical Arrival Time (TAT) is unchanged.
Otherwise, the first cell is conforming such that a flag is set indicating that first cell was conforming (at step 1075) and the Theoretical Arrival Time (TAT) is increased by the increment I at step 1090.
If back at step 1020 the received cell was determined not to be a first cell of a frame, then the system checks the flag to determine if the first cell of the frame was conforming at step 1040. If the first cell of the frame was non-conforming, then this current cell is also deemed WO 96129806 PC-r/US96~03515 non-collfu~ ing~ If the first frame was conforming, then another test is performed at step 1050 to determine if the arrival time of the kth cell is less than TAT-L2 (i.e., if TAT is greater than ta(k) + L2). If the arrival time of the kth cell is less than TAT-L2 (TAT is greater than ta(k) + L2), then the cell is non-conforming and the Theoretical Arrival Time (TAT) is unchanged at step 1080. Otherwise, the cell is conforming such that the Theoretical Arrival Time (TAT) is increased by the increment I at step 1090.
Thus, the frame based traffic policing system of the present invention ensures that if the first data cell of a frame is non-conforming, then all the data cells of that frame will be non-conforming. Furthermore, if the first data cell of a frame is conforming, then all the data cells of that frame are deemed collrolllLing unless an absolute limit is exceeded. In this manner, the frame based traffic policing system treats every data cell from the same frame as all conforming or all non-conforming unless an overflow occurs.
~ltPrn:~te Embodiment of Frame-Based Traffic Policing In a ~ler~,led embodiment, the first cell of each frame cannot easily be distingtli~he~ Instead, the last data cell of each frame contains an End-Of-Frame (EOF) marker that identifies the data cell as being at the end of the frame. In such as situation, the first cell of the next frame can be identified as the cell following an End-Of-Frame (EOF) cell. In such an environment, the framed-based traffic policing ~y~ may make a conformity decision for an entire frame by determining if the last cell of the previous frame conforms. However, if the framed-based traffic policing system determines that the next entire frame should conform, then the framed-based traffic policing ~y~lell~ should deem the last cell of the current frame as conforming such that the beginning the next frame will easily be identified.
Figure 11 illustrates a flow diagram that describes the method steps performed by the frame based traffic policing system using the continuous state leaky bucket algorithm where the last cell of a frame before a conforming frame is always deemed conforming. The method begins at step 1110 when an incoming data cell is received.
The method then calculates a temporary bucket counter value at step 1115 by subtracting off the amount of time elapsed since the last conforming data cell. The frame based traffic policing system then determines if the incoming data cell is the last data cell of a frame or not at step 1117. If a received data cell is the last data cell of a frame, the frame based traffic policing system proceeds to step 1120 where it determines if the number of debit markers in the temporary bucket counter has dropped below zero. If the number of temporary bucket counter has dropped below zero, then the temporary bucket counter is set to zero at step 1123 and the method proceeds to step 1127 where the next frame is dePmell conforming and step 1129 where the cell is deemed col~folllling causing the bucket counter to be increased. If at step 1120 the temporary bucket counter was greater or equal to zero, then the temporary bucket counter is compared with the first bucket limit (L1). If the temporary bucket counter is less than the first bucket limit (L1), then the next frame is deemed conforming at step 1127 and the cell is deemed conforming causing the bucket counter to be increased at step 1129. Otherwise, if the temporary bucket counter exceeds the first limit, then the next frame will be deemed non-conforming. However, since this is the last cell of the current frame it must be still be handled a~ro~liately. Thus, the traffic policing system tests if the current frame is conforming at step 1126. If the current frame is not conforming then the last cell is deemed non-conforming at step 1143 and the frame is deemed non-conforming at step 1145. If the current frame is conforming then the next frame is deemed non-collroLllling at step 1128 and the last cell is deemed conforming causing the bucket counter to be increased at step 1129.
If back at step 1117, the cell was determined not to be the last cell of the frame, then the cell is handled like all the other cells in the frame unless the second (overflow) limit of the bucket counter is reached. Specifically, non last cells are first tested at step 1130 to determine if the current frame is conforming. If the current frame is not conforming then the cell is treated as non-conforming at step 1143.
. CA 022ll020 l997-07-2l W O 96t29806 PC~US96~3515 If the current frame is conforming, then temporary bucket counter is tested at step 1131 to see if it is less than zero. If the temporary bucket counter is less than zero then the temporary bucket counter is set to zero at step 1133 and the method proceeds to step 1129 where the cell is dePTner1 collrolll illg causing the bucket counter to be increased. If the temporary bucket counter is not less than zero then the temporary bucket counter is tested at step 1135 to determine if the second (L2) limit is excee-led If the overflow limit is exceeded then the cell is determined to be non-conforming at step 1143 and the remainder of the frame is deemed non-conforming at step 1145.
Figure 12 illustrates a flow diagram that describes the steps performed by the frame based traffic policing sysl~lll using the Virtual Scheduling algorithm where the last cell of a frame before a conforming frame is always deemed conforming. The method begins at step 1210 when an incoming data cell is received. The frame based traffic policing ~y~L~ then determines if the incoming data cell is the last data cell of a frame or not at step 1217. If a received data cell is the last data cell of a frame, the frame based traffic policing system proceeds to step 1220 where it checks if the arrival time of the kth cell, ta(k), is after the current value of the Theoretical Arrival Time (TAT).
If that cell arrived after the Theoretical Arrival Time (TAT) then the cell is conforming and thus the next frame will be deemed conforming. This is accomplished by proceeding to steps 1223, 1227 and 1229 where the next frame is deemed conforming (step 1227) and the current cell is deemed conforming causing the Theoretical Arrival Time (TAT) to be updated to the current time ta(k) (at set 1223) plus the increment I (at step 1229). If the cell arrives before the Theoretical Arrival Time (TAT), then the algorithm checks if the cell arrived longer than a limit L1 time before the Theoretical Arrival Time (TAT) at step 1225. Sperifi~lly, if the arrival time of the kth cell is less than TAT-L1 (i.e., if TAT is greater than ta(k) + L1), then that last cell is non-conforming. If the last data cell arrived within limit L1 of the Theoretical Arrival Time (TAT) then the next frame is deemed conforming at step 1227 and the cell is deemed conforming causing W 096/29806 PCTrUS96/03515 the bucket counter to be increased at step lZ29. Otherwise, if the if the last cell arrived ~leaL~l than L1 time units before the Theoretical Arrival Time (TAT), then the next frame will be deemed non-conforming. However, since this is the last cell of the current frame, it must still be handled a~ o~.;ately. The traffic policing system method tests if the current frame is conforming at step 1226. If the current frame is not conforming then the last cell is deemed non-conforming at step 1243 and the frame is deemed non-conforming at step 1245. If the current frame is conforming then the next frame is deemed non-conforming at step 1228 and the last cell is deemed conforming causing the bucket counter to be increased at step 1229.
If at step 1217, the cell was determined not to be the last cell of the frame, then the cell is handled like all the other cells in the frame unless the second (overflow) limit of the bucket counter is reached.
Specifically, non last cells are first tested at step 1230 to determine if the current frame is conforming. If the current frame is not conforming then the cell is treated as non-conforming at step 1243. If the current frame is conforming, then the cell is tested to see if it arrived after the Theoretical Arrival Time (TAT) at step 1231. If the cell arrived after the Theoretical Arrival Time (TAT) then the cell is de~me-l conforming causing the Theoretical Arrival Time (TAT) to be updated to the current time ta(k) (at set 1233) plus the increment I (at step 1229). If the cell arrived before the Theoretical Arrival Time (TAT), then another test is performed at step 1150 to determine if the arrival time of the kth cell is less than TAT-L2 (i.e., if TAT is greater than ta(k) + L2). If the arrival time of the kth cell is less than TAT-L2 (TAT is greater than ta(k) + L2), then the cell is non-conforming and the Theoretical Arrival Time (TAT) is unchanged at step 1143 and the remainder of the frame is deemed non-conforming at step 1245.
Otherwise, the cell is conforming such that the Theoretical Arrival Time (TAT) is increased by the increment I at step 1229.
Although the present invention has been described in terms of specific exemplary embodiments, it will be appreciated that various modifications and alterations might be made by those skilled in the art WO 96129806 PCT/IJS96/0351~i without departing from the spirit and scope of the invention as set forth in the following claims.
Claims (35)
1. A method of regulating incoming traffic on a data communication link, said data communication link receiving cells, said cells organized into frames, said method comprising the steps of:
determining if a first cell in a frame is conforming based upon a policing function;
determining if cells other than the first cell in a frame are conforming based upon the conformity determination of said first cell of the frame.
determining if a first cell in a frame is conforming based upon a policing function;
determining if cells other than the first cell in a frame are conforming based upon the conformity determination of said first cell of the frame.
2. The method as claimed in claim 1 wherein said policing function is a continuous state leaky bucket algorithm.
3. The method as claimed in claim 1 wherein said policing function is a virtual scheduling algorithm.
4. A method of regulating incoming traffic on a data communication link, the method comprising the steps of:
maintaining a counter for said communication link, said counter having a first limit;
receiving incoming cells on said data communication link, said incoming cells grouped into frames;
detecting if a received cell is a first cell in a frame, treating the received cell as conforming if the received cell is a first cell of the frame and said counter is within said first limit;
treating the received cell as non-conforming if the received cell is a first cell of the frame and said counter is not within said first limit;
treating the received cell as conforming if the received cell is not a first cell of the frame and the first cell of the frame was conforming; and treating the received cell as non-conforming if the received cell is not a first cell of the frame and the first cell of the frame was non-conforming.
maintaining a counter for said communication link, said counter having a first limit;
receiving incoming cells on said data communication link, said incoming cells grouped into frames;
detecting if a received cell is a first cell in a frame, treating the received cell as conforming if the received cell is a first cell of the frame and said counter is within said first limit;
treating the received cell as non-conforming if the received cell is a first cell of the frame and said counter is not within said first limit;
treating the received cell as conforming if the received cell is not a first cell of the frame and the first cell of the frame was conforming; and treating the received cell as non-conforming if the received cell is not a first cell of the frame and the first cell of the frame was non-conforming.
5. The method of claim 4 further comprising the steps of:
incrementing said counter by an increment value when a cell is treated as conforming;
decrementing said counter by an amount proportional to an elapsed time.
incrementing said counter by an increment value when a cell is treated as conforming;
decrementing said counter by an amount proportional to an elapsed time.
6. The method as claimed in claim 5 wherein the counter has a second limit and said method further comprises the step of:
treating the received cell as non-conforming if the received cell is not a first cell of the frame and the counter exceeds said second limit.
treating the received cell as non-conforming if the received cell is not a first cell of the frame and the counter exceeds said second limit.
7. The method as claimed in claim 4 wherein the non-conforming cells are discarded.
8. The method as claimed in claim 4 wherein the non-conforming cells are tagged as low priority such that said tagged cells are first to be dropped when congestion occurs.
9. The method as claimed in claim 4 wherein the counter is permitted to go above said first limit to accommodate an entire data frame.
10. The method as claimed in claim 4 wherein some of said cells are End-of-Frame cells and said End-of-Frame cells are always treated as conforming.
11 The method as claimed in claim 10 wherein said End-of-Frame cells are used to determine a start of a next frame.
12 The method as claimed in claim 4 wherein an End-of-Frame cell is treated as conforming when a respective frame from which said End-of-Frame cell belongs is conforming or when a frame following said End-of-Frame cell is conforming.
13 The method as claimed in claim 12 wherein said End-of-Frame cells are used to determine a start of a next frame.
14. An apparatus for regulating a data communication link, said data communication link receiving cells grouped into frames, the apparatus comprising the elements of:
a counter, the counter having a first limit;
a cell detection mechanism, the cell detection mechanism detecting if a received cell is a first cell of a frame; and a traffic policing mechanism, the traffic policing mechanism determining a first cell of a frame to be conforming if the counter is below the first limit else determining said first cell of a frame to be non-conforming, the traffic policing mechanism determining a subsequent cell of said frame to be conforming if the first cell of the frame was conforming else determining said subsequent cell to be non-conforming.
a counter, the counter having a first limit;
a cell detection mechanism, the cell detection mechanism detecting if a received cell is a first cell of a frame; and a traffic policing mechanism, the traffic policing mechanism determining a first cell of a frame to be conforming if the counter is below the first limit else determining said first cell of a frame to be non-conforming, the traffic policing mechanism determining a subsequent cell of said frame to be conforming if the first cell of the frame was conforming else determining said subsequent cell to be non-conforming.
15. The apparatus as claimed in claim 14 wherein the non-conforming cells are tagged as low priority such that said tagged cells are first to be dropped when congestion occurs.
16. The apparatus as claimed in claim 14 wherein said non-conforming cells are discarded.
17. The apparatus as claimed in claim 14 wherein the counter has a second limit and the traffic policing mechanism deems subsequent cells as non-conforming if said counter exceeds said second limit.
18. The apparatus as claimed in claim 17 wherein the counter is permitted to go above said first limit to accommodate a full data frame.
19. The apparatus as claimed in claim 14 wherein some of said cells are End-of-Frame cells and said End-of-Frame cells are always treated as conforming.
20. The apparatus as claimed in claim 19 wherein said End-of-Frame cells are used to determine a start of a next frame.
21. The apparatus as claimed in claim 14 wherein an End-of-Frame cell is treated as conforming when a respective frame from which said End-of-Frame cell belongs is conforming or when a frame following said End-of-Frame cell is conforming.
22. The apparatus as claimed in claim 21 wherein said End-of-Frame cells are used to determine a start of a next frame.
23. A method of regulating incoming traffic on a data communication link, said data communication link receiving cells, said cells organized into frames, said method comprising the steps of:
determining if a last cell of a frame is conforming based upon a traffic policing function;
determining if cells in a frame following said last cell are conforming based upon the conformity determination of said last cell.
determining if a last cell of a frame is conforming based upon a traffic policing function;
determining if cells in a frame following said last cell are conforming based upon the conformity determination of said last cell.
24. The method as claimed in claim 23 wherein said traffic policing function is a continuous state leaky bucket algorithm.
25. The method as claimed in claim 23 wherein said traffic policing function is a virtual scheduling algorithm.
26. The method as claimed in claim 23 wherein if a cell is a last cell of a frame then said cell is treated as conforming if a frame to which said last cell belongs is conforming.
27. An apparatus for regulating a data communication link, said data communication link receiving cells grouped into frames, the apparatus comprising the elements of:
a counter, the counter having a first limit;
a cell detection mechanism, the cell detection mechanism detecting if a received cell is an End-of-Frame cell; and a traffic policing mechanism, the traffic policing mechanism determining an End-of-Frame cell of a frame to be conforming if the counter is below the first limit else determining said End-of-Frame cell to be non-conforming, the traffic policing mechanism determining a subsequent frame to be conforming if said End-of-Frame cell was conforming else determining said subsequent frame to be non-conforming.
a counter, the counter having a first limit;
a cell detection mechanism, the cell detection mechanism detecting if a received cell is an End-of-Frame cell; and a traffic policing mechanism, the traffic policing mechanism determining an End-of-Frame cell of a frame to be conforming if the counter is below the first limit else determining said End-of-Frame cell to be non-conforming, the traffic policing mechanism determining a subsequent frame to be conforming if said End-of-Frame cell was conforming else determining said subsequent frame to be non-conforming.
28. The apparatus as claimed in claim 27 wherein the non-conforming cells are tagged as low priority such that said tagged cells are first to be dropped when congestion occurs.
29. The apparatus as claimed in claim 27 wherein said non-conforming cells are discarded.
30. The apparatus as claimed in claim 27 wherein the counter has a second limit and the traffic policing mechanism deems subsequent cells as non-conforming if said counter exceeds said second limit.
31. The apparatus as claimed in claim 27 wherein the counter is permitted to go above said first limit to accommodate a full data frame.
32. The apparatus as claimed in claim 27 wherein said End-of-Frame cells are always treated as conforming.
33. The apparatus as claimed in claim 27 wherein said traffic policing mechanism is a continuous state leaky bucket algorithm.
34. The apparatus as claimed in claim 27 wherein said traffic policing mechanism is a virtual scheduling algorithm.
35. The method as claimed in claim 27 wherein an End-of-Frame cell is treated as conforming if a frame to which said End-of-Frame cells belongs is conforming.
Applications Claiming Priority (2)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| US08/408,273 US5666353A (en) | 1995-03-21 | 1995-03-21 | Frame based traffic policing for a digital switch |
| US08/408,273 | 1995-03-21 |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CA2211020A1 true CA2211020A1 (en) | 1996-09-26 |
Family
ID=23615592
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CA002211020A Abandoned CA2211020A1 (en) | 1995-03-21 | 1996-03-15 | Frame based traffic policing for a digital switch |
Country Status (5)
| Country | Link |
|---|---|
| US (1) | US5666353A (en) |
| EP (1) | EP0815675A2 (en) |
| AU (1) | AU5253396A (en) |
| CA (1) | CA2211020A1 (en) |
| WO (1) | WO1996029806A2 (en) |
Families Citing this family (127)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US6604118B2 (en) | 1998-07-31 | 2003-08-05 | Network Appliance, Inc. | File system image transfer |
| US5867666A (en) | 1994-12-29 | 1999-02-02 | Cisco Systems, Inc. | Virtual interfaces with dynamic binding |
| US6097718A (en) | 1996-01-02 | 2000-08-01 | Cisco Technology, Inc. | Snapshot routing with route aging |
| US6147996A (en) * | 1995-08-04 | 2000-11-14 | Cisco Technology, Inc. | Pipelined multiple issue packet switch |
| GB9516931D0 (en) * | 1995-08-18 | 1995-10-18 | Newbridge Networks Corp | Method of traffic policing in broadband cell-based networks |
| ES2225858T3 (en) * | 1995-08-18 | 2005-03-16 | Alcatel | METHOD AND DEVICE FOR VERIFICATION OF THE OPERATION OF A CONTROL DEVICE. |
| US6182224B1 (en) | 1995-09-29 | 2001-01-30 | Cisco Systems, Inc. | Enhanced network services using a subnetwork of communicating processors |
| FI100158B (en) * | 1995-11-09 | 1997-09-30 | Nokia Telecommunications Oy | Traffic control in a telecommunication system |
| US6108303A (en) * | 1995-12-06 | 2000-08-22 | Pmc-Sierra Ltd. | Method and apparatus for traffic control in a cell-based network |
| US6091725A (en) | 1995-12-29 | 2000-07-18 | Cisco Systems, Inc. | Method for traffic management, traffic prioritization, access control, and packet forwarding in a datagram computer network |
| US6035105A (en) | 1996-01-02 | 2000-03-07 | Cisco Technology, Inc. | Multiple VLAN architecture system |
| JPH09214511A (en) * | 1996-02-05 | 1997-08-15 | Nec Corp | System for self-monitoring fault in cell processor |
| US6243667B1 (en) | 1996-05-28 | 2001-06-05 | Cisco Systems, Inc. | Network flow switching and flow data export |
| US6308148B1 (en) | 1996-05-28 | 2001-10-23 | Cisco Technology, Inc. | Network flow data export |
| US6212182B1 (en) | 1996-06-27 | 2001-04-03 | Cisco Technology, Inc. | Combined unicast and multicast scheduling |
| US6434120B1 (en) | 1998-08-25 | 2002-08-13 | Cisco Technology, Inc. | Autosensing LMI protocols in frame relay networks |
| JP3518209B2 (en) * | 1996-12-05 | 2004-04-12 | 株式会社日立製作所 | ATM exchange and congestion control method |
| US6304546B1 (en) | 1996-12-19 | 2001-10-16 | Cisco Technology, Inc. | End-to-end bidirectional keep-alive using virtual circuits |
| 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 |
| US6356530B1 (en) | 1997-05-23 | 2002-03-12 | Cisco Technology, Inc. | Next hop selection in ATM networks |
| US6122272A (en) | 1997-05-23 | 2000-09-19 | Cisco Technology, Inc. | Call size feedback on PNNI operation |
| US6862284B1 (en) | 1997-06-17 | 2005-03-01 | Cisco Technology, Inc. | Format for automatic generation of unique ATM addresses used for PNNI |
| US6078590A (en) | 1997-07-14 | 2000-06-20 | Cisco Technology, Inc. | Hierarchical routing knowledge for multicast packet routing |
| US6330599B1 (en) | 1997-08-05 | 2001-12-11 | Cisco Technology, Inc. | Virtual interfaces with dynamic binding |
| US6212183B1 (en) | 1997-08-22 | 2001-04-03 | Cisco Technology, Inc. | Multiple parallel packet routing lookup |
| US6157641A (en) | 1997-08-22 | 2000-12-05 | Cisco Technology, Inc. | Multiprotocol packet recognition and switching |
| US6512766B2 (en) | 1997-08-22 | 2003-01-28 | Cisco Systems, Inc. | Enhanced internet packet routing lookup |
| US6032272A (en) * | 1997-09-05 | 2000-02-29 | Nokia Telecommunications, Oy | Method and apparatus for performing packet based policing |
| US6205149B1 (en) * | 1997-09-11 | 2001-03-20 | 3Com Corporation | Quality of service control mechanism and apparatus |
| US6343072B1 (en) | 1997-10-01 | 2002-01-29 | Cisco Technology, Inc. | Single-chip architecture for shared-memory router |
| US6252878B1 (en) | 1997-10-30 | 2001-06-26 | Cisco Technology, Inc. | Switched architecture access server |
| US6111877A (en) | 1997-12-31 | 2000-08-29 | Cisco Technology, Inc. | Load sharing across flows |
| US6674716B1 (en) * | 1998-01-16 | 2004-01-06 | International Business Machines Corporation | Cell compliance decision method and apparatus |
| DE69840321D1 (en) | 1998-02-05 | 2009-01-22 | Alcatel Lucent | Cell elimination process |
| EP0935366A1 (en) | 1998-02-05 | 1999-08-11 | Alcatel | Cell tagging method for buffered and fragmented frames |
| US6457130B2 (en) | 1998-03-03 | 2002-09-24 | Network Appliance, Inc. | File access control in a multi-protocol file server |
| US6317844B1 (en) | 1998-03-10 | 2001-11-13 | Network Appliance, Inc. | File server storage arrangement |
| 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 |
| US6480467B1 (en) * | 1998-03-20 | 2002-11-12 | Lucent Technologies Inc. | Conformance definitions for guaranteed frame rate service |
| US6266327B1 (en) * | 1998-03-20 | 2001-07-24 | Lucent Technologies Inc. | Non-conformance indicator for the guaranteed frame rate service |
| US6046979A (en) * | 1998-05-04 | 2000-04-04 | Cabletron Systems, Inc. | Method and apparatus for controlling the flow of variable-length packets through a multiport switch |
| US6370116B1 (en) * | 1998-05-26 | 2002-04-09 | Alcatel Canada Inc. | Tolerant CIR monitoring and policing |
| FR2779302B1 (en) * | 1998-05-28 | 2000-06-23 | Alsthom Cge Alcatel | CONGESTION CONTROL IN AN ATM NODE |
| CA2333595C (en) * | 1998-05-29 | 2007-10-16 | Siemens Aktiengesellschaft | Method for removal of atm cells from an atm communications device |
| EP0961441A1 (en) | 1998-05-29 | 1999-12-01 | Siemens Aktiengesellschaft | Method for removing ATM cells from an ATM communications system |
| US6370121B1 (en) | 1998-06-29 | 2002-04-09 | Cisco Technology, Inc. | Method and system for shortcut trunking of LAN bridges |
| US6377577B1 (en) | 1998-06-30 | 2002-04-23 | Cisco Technology, Inc. | Access control list processing in hardware |
| US6182147B1 (en) | 1998-07-31 | 2001-01-30 | Cisco Technology, Inc. | Multicast group routing using unidirectional links |
| US6308219B1 (en) | 1998-07-31 | 2001-10-23 | Cisco Technology, Inc. | Routing table lookup implemented using M-trie having nodes duplicated in multiple memory banks |
| JP2000059370A (en) * | 1998-08-04 | 2000-02-25 | Fujitsu Ltd | Device and method for controlling traffic |
| US6101115A (en) | 1998-08-07 | 2000-08-08 | Cisco Technology, Inc. | CAM match line precharge |
| US6389506B1 (en) | 1998-08-07 | 2002-05-14 | Cisco Technology, Inc. | Block mask ternary cam |
| 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 |
| US6167445A (en) | 1998-10-26 | 2000-12-26 | Cisco Technology, Inc. | Method and apparatus for defining and implementing high-level quality of service policies in computer networks |
| US6286052B1 (en) | 1998-12-04 | 2001-09-04 | Cisco Technology, Inc. | Method and apparatus for identifying network data traffic flows and for applying quality of service treatments to the flows |
| CA2348525A1 (en) | 1998-10-27 | 2000-05-04 | Fujitsu Network Communications, Inc. | Frame based quality of service |
| US6343984B1 (en) | 1998-11-30 | 2002-02-05 | Network Appliance, Inc. | Laminar flow duct cooling system |
| US6442165B1 (en) | 1998-12-02 | 2002-08-27 | Cisco Technology, Inc. | Load balancing between service component instances |
| US7616640B1 (en) | 1998-12-02 | 2009-11-10 | 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 |
| EP1011226A1 (en) * | 1998-12-17 | 2000-06-21 | Alcatel | Data traffic policing method and device and a telecommunication network including such a device |
| 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 |
| US6771642B1 (en) | 1999-01-08 | 2004-08-03 | Cisco Technology, Inc. | Method and apparatus for scheduling packets in a packet switch |
| US7382736B2 (en) | 1999-01-12 | 2008-06-03 | Mcdata Corporation | Method for scoring queued frames for selective transmission through a switch |
| US6757791B1 (en) | 1999-03-30 | 2004-06-29 | Cisco Technology, Inc. | Method and apparatus for reordering packet data units in storage queues for reading and writing memory |
| US6603772B1 (en) | 1999-03-31 | 2003-08-05 | Cisco Technology, Inc. | Multicast routing with multicast virtual output queues and shortest queue first allocation |
| US6760331B1 (en) | 1999-03-31 | 2004-07-06 | Cisco Technology, Inc. | Multicast routing with nearest queue first allocation and dynamic and static vector quantization |
| US6704280B1 (en) * | 1999-06-10 | 2004-03-09 | Nortel Networks Limited | Switching device and method for traffic policing over a network |
| US6636480B1 (en) | 1999-09-08 | 2003-10-21 | Riverstone Networks, Inc. | Method and system for controlling data flow through a multiport switch |
| US6920498B1 (en) | 2000-08-31 | 2005-07-19 | Cisco Technology, Inc. | Phased learning approach to determining closest content serving sites |
| EP1187503A1 (en) * | 2000-09-11 | 2002-03-13 | Lucent Technologies Inc. | Mobile telecommunications network with improved downlink capacity |
| DE60041059D1 (en) * | 2000-09-11 | 2009-01-22 | Lucent Technologies Inc | Method and device for controlling source-specific data flow |
| US6820123B1 (en) | 2000-09-28 | 2004-11-16 | Cisco Technology, Inc. | Method and apparatus for assigning hot objects to server load balancer |
| US6654912B1 (en) * | 2000-10-04 | 2003-11-25 | Network Appliance, Inc. | Recovery of file system data in file servers mirrored file system volumes |
| US7356030B2 (en) | 2000-11-17 | 2008-04-08 | Foundry Networks, Inc. | Network switch cross point |
| US7596139B2 (en) | 2000-11-17 | 2009-09-29 | Foundry Networks, Inc. | Backplane interface adapter with error control and redundant fabric |
| US6735218B2 (en) * | 2000-11-17 | 2004-05-11 | Foundry Networks, Inc. | Method and system for encoding wide striped cells |
| US7236490B2 (en) * | 2000-11-17 | 2007-06-26 | Foundry Networks, Inc. | Backplane interface adapter |
| US7002980B1 (en) | 2000-12-19 | 2006-02-21 | Chiaro Networks, Ltd. | System and method for router queue and congestion management |
| US7042883B2 (en) | 2001-01-03 | 2006-05-09 | Juniper Networks, Inc. | Pipeline scheduler with fairness and minimum bandwidth guarantee |
| US7342942B1 (en) | 2001-02-07 | 2008-03-11 | Cortina Systems, Inc. | Multi-service segmentation and reassembly device that maintains only one reassembly context per active output port |
| US6944168B2 (en) * | 2001-05-04 | 2005-09-13 | Slt Logic Llc | System and method for providing transformation of multi-protocol packets in 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 |
| 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 |
| US7327760B1 (en) | 2001-05-08 | 2008-02-05 | Cortina Systems, Inc. | Multi-service segmentation and reassembly device operable with either a cell-based or a packet-based switch fabric |
| US7206283B2 (en) * | 2001-05-15 | 2007-04-17 | Foundry Networks, Inc. | High-performance network switch |
| US7126911B2 (en) * | 2001-08-06 | 2006-10-24 | Integrated Device Technology, Inc. | Timer rollover handling mechanism for traffic policing |
| US8543681B2 (en) | 2001-10-15 | 2013-09-24 | Volli Polymer Gmbh Llc | Network topology discovery systems and methods |
| US8868715B2 (en) | 2001-10-15 | 2014-10-21 | Volli Polymer Gmbh Llc | Report generation and visualization systems and methods and their use in testing frameworks for determining suitability of a network for target applications |
| US7633942B2 (en) * | 2001-10-15 | 2009-12-15 | Avaya Inc. | Network traffic generation and monitoring systems and methods for their use in testing frameworks for determining suitability of a network for target applications |
| JPWO2003053012A1 (en) * | 2001-12-14 | 2005-04-28 | 古河電気工業株式会社 | Policing control method, control device thereof, and network system using the control device |
| US7339890B2 (en) * | 2002-02-01 | 2008-03-04 | Broadcom Corporation | Scalable, high-resolution asynchronous transfer mode traffic shaper and method |
| US7187687B1 (en) | 2002-05-06 | 2007-03-06 | Foundry Networks, Inc. | Pipeline method and system for switching packets |
| US7649885B1 (en) | 2002-05-06 | 2010-01-19 | Foundry Networks, Inc. | Network routing system for enhanced efficiency and monitoring capability |
| US7266117B1 (en) | 2002-05-06 | 2007-09-04 | Foundry Networks, Inc. | System architecture for very fast ethernet blade |
| US7468975B1 (en) | 2002-05-06 | 2008-12-23 | Foundry Networks, Inc. | Flexible method for processing data packets in a network routing system for enhanced efficiency and monitoring capability |
| US20120155466A1 (en) | 2002-05-06 | 2012-06-21 | Ian Edward Davis | Method and apparatus for efficiently processing data packets in a computer network |
| US7161904B2 (en) * | 2002-06-04 | 2007-01-09 | Fortinet, Inc. | System and method for hierarchical metering in a virtual router based network switch |
| US20040022263A1 (en) * | 2002-08-02 | 2004-02-05 | Xiaodong Zhao | Cross point switch with out-of-band parameter fine tuning |
| US7130917B2 (en) * | 2002-09-26 | 2006-10-31 | Cisco Technology, Inc. | Quality of service in a gateway |
| CN1302638C (en) * | 2003-04-03 | 2007-02-28 | 华为技术有限公司 | Method for making message flow limitation by adopting token leakage cylinder |
| EP1614018A4 (en) * | 2003-04-14 | 2012-07-04 | Telchemy Inc | System for identifying and locating network problems |
| US6901072B1 (en) | 2003-05-15 | 2005-05-31 | Foundry Networks, Inc. | System and method for high speed packet transmission implementing dual transmit and receive pipelines |
| US7817659B2 (en) | 2004-03-26 | 2010-10-19 | Foundry Networks, Llc | Method and apparatus for aggregating input data streams |
| US8730961B1 (en) | 2004-04-26 | 2014-05-20 | Foundry Networks, Llc | System and method for optimizing router lookup |
| US7657703B1 (en) | 2004-10-29 | 2010-02-02 | Foundry Networks, Inc. | Double density content addressable memory (CAM) lookup scheme |
| US8448162B2 (en) | 2005-12-28 | 2013-05-21 | Foundry Networks, Llc | Hitless software upgrades |
| US7903654B2 (en) | 2006-08-22 | 2011-03-08 | Foundry Networks, Llc | System and method for ECMP load sharing |
| US8238255B2 (en) | 2006-11-22 | 2012-08-07 | Foundry Networks, Llc | Recovering from failures without impact on data traffic in a shared bus architecture |
| US8155011B2 (en) | 2007-01-11 | 2012-04-10 | Foundry Networks, Llc | Techniques for using dual memory structures for processing failure detection protocol packets |
| US8271859B2 (en) | 2007-07-18 | 2012-09-18 | Foundry Networks Llc | Segmented CRC design in high speed networks |
| US8037399B2 (en) | 2007-07-18 | 2011-10-11 | Foundry Networks, Llc | Techniques for segmented CRC design in high speed networks |
| US8509236B2 (en) | 2007-09-26 | 2013-08-13 | Foundry Networks, Llc | Techniques for selecting paths and/or trunk ports for forwarding traffic flows |
| US8190881B2 (en) | 2007-10-15 | 2012-05-29 | Foundry Networks Llc | Scalable distributed web-based authentication |
| US8284665B1 (en) * | 2008-01-28 | 2012-10-09 | Juniper Networks, Inc. | Flow-based rate limiting |
| WO2009100082A1 (en) * | 2008-02-04 | 2009-08-13 | Bayer Healthcare Llc | Semiconductor based analyte sensors and methods |
| US9309551B2 (en) | 2008-09-19 | 2016-04-12 | Ascensia Diabetes Care Holdings Ag | Electrical devices with enhanced electrochemical activity and manufacturing methods thereof |
| US8551400B2 (en) * | 2008-09-19 | 2013-10-08 | Bayer Healthcare Llc | Analyte sensors, testing apparatus and manufacturing methods |
| EP2341830A4 (en) | 2008-09-19 | 2012-10-31 | Bayer Healthcare Llc | Analyte sensors, systems, testing apparatus and manufacturing methods |
| US8090901B2 (en) | 2009-05-14 | 2012-01-03 | Brocade Communications Systems, Inc. | TCAM management approach that minimize movements |
| US8599850B2 (en) | 2009-09-21 | 2013-12-03 | Brocade Communications Systems, Inc. | Provisioning single or multistage networks using ethernet service instances (ESIs) |
| US9419888B2 (en) | 2011-12-22 | 2016-08-16 | Itron, Inc. | Cell router failure detection in a mesh network |
Family Cites Families (11)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US5280483A (en) * | 1990-08-09 | 1994-01-18 | Fujitsu Limited | Traffic control system for asynchronous transfer mode exchange |
| JPH04100342A (en) * | 1990-08-20 | 1992-04-02 | Toshiba Corp | Traffic control system |
| JP3073249B2 (en) * | 1991-03-20 | 2000-08-07 | 富士通株式会社 | Passing cell monitoring method in ATM exchange |
| US5224099A (en) * | 1991-05-17 | 1993-06-29 | Stratacom, Inc. | Circuitry and method for fair queuing and servicing cell traffic using hopcounts and traffic classes |
| GB9200897D0 (en) * | 1992-01-16 | 1992-03-11 | British Telecomm | Optical processing in asynchronous transfer mode network |
| US5426640A (en) * | 1992-01-21 | 1995-06-20 | Codex Corporation | Rate-based adaptive congestion control system and method for integrated packet networks |
| US5452330A (en) * | 1992-07-06 | 1995-09-19 | Digital Equipment Corporation | Bus-oriented switching system for asynchronous transfer mode |
| US5311513A (en) * | 1992-09-10 | 1994-05-10 | International Business Machines Corp. | Rate-based congestion control in packet communications networks |
| GB2272612B (en) * | 1992-11-06 | 1996-05-01 | Roke Manor Research | Improvements in or relating to ATM signal processors |
| US5274643A (en) * | 1992-12-11 | 1993-12-28 | Stratacom, Inc. | Method for optimizing a network having virtual circuit routing over virtual paths |
| US5402412A (en) * | 1993-10-15 | 1995-03-28 | Dsc Communications Corporation | System and method for monitoring a stream of events |
-
1995
- 1995-03-21 US US08/408,273 patent/US5666353A/en not_active Expired - Lifetime
-
1996
- 1996-03-15 WO PCT/US1996/003515 patent/WO1996029806A2/en not_active Application Discontinuation
- 1996-03-15 AU AU52533/96A patent/AU5253396A/en not_active Abandoned
- 1996-03-15 EP EP96908815A patent/EP0815675A2/en not_active Withdrawn
- 1996-03-15 CA CA002211020A patent/CA2211020A1/en not_active Abandoned
Also Published As
| Publication number | Publication date |
|---|---|
| WO1996029806A3 (en) | 1997-02-20 |
| US5666353A (en) | 1997-09-09 |
| AU5253396A (en) | 1996-10-08 |
| WO1996029806A2 (en) | 1996-09-26 |
| EP0815675A2 (en) | 1998-01-07 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US5666353A (en) | Frame based traffic policing for a digital switch | |
| US5570360A (en) | Method and apparatus for implementing communication service contract using cell arrival information | |
| AU602379B2 (en) | Packet switching system arranged for congestion control through bandwidth management | |
| US7120149B2 (en) | Methods and system for resequencing out of order data packets | |
| US7414968B1 (en) | Method for call admission on packet voice system statistical multiplexing and dynamic voice encoding | |
| US6219339B1 (en) | Method and apparatus for selectively discarding packets | |
| EP1137225B1 (en) | A switch and a switching method | |
| EP0275679A1 (en) | Packet switching system arranged for congestion control | |
| KR19980702345A (en) | Reliable ATM microwave links and networks | |
| US7046623B2 (en) | Fault recovery system and method for inverse multiplexed digital subscriber lines | |
| Doshi et al. | Congestion Control in ISDN Frame‐Relay Networks | |
| EP1032889B1 (en) | Apparatus and method for managing network congestion | |
| JP3261057B2 (en) | ATM switch and call admission priority control method | |
| Moors et al. | ATM receiver implementation issues | |
| US6418119B1 (en) | Data transmission apparatus and method thereof | |
| Bondi et al. | The influence of cell loss patterns and overheads on retransmission choices in broadband ISDN | |
| US5982751A (en) | Rare probability connection call registration method using payload type indication field information for asynchronous transfer mode switching system | |
| JP3019352B2 (en) | Policing method | |
| Muller | The Management Aspects of Frame Relay | |
| JPH02262742A (en) | System and device for voice packet communication | |
| KR0153925B1 (en) | Method of intelligent cell discarding in atm switching system | |
| JP3132719B2 (en) | Usage parameter control circuit | |
| Sahgal | Flow and congestion control in frame relay networks | |
| Sheu et al. | An adaptive cell checking controller for wireless ATM networks | |
| Chitre | Satellite communications for the next generation telecommunication services and networks |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| FZDE | Dead |