Abstract: A system and method comprise a first buffer having a first capacity and a first threshold level adapted to store data frames having the lowest priority, a second buffer having a second capacity greater than the first capacity and a second threshold level greater than the first threshold level adapted to store data frames having a medium priority, a third buffer having a third capacity greater than the second capacity and a third threshold level greater than the second threshold level adapted to store data frames having the highest priority. The system further includes means for differentiating a data frame as having lowest, medium or highest priority and storing the data frame in the respective first, second or third buffer, and discarding the data frame in response to the first, second or third buffer reaching the respective threshold level.

Abstract: A system coupled between at least one input port and at least one output port comprises at least one queue, each queue being identified by a QID and operable to receive and buffer data in at least one service flow from the at least one input port. The system further comprises a predetermined at least one token allocated to each queue, each token indicative whether a predetermined amount of data may be dequeued from a queue and transmitted to the output port. The system comprises at least one group of queues where each queue in the group has a subordinate QID identifying a subordinate queue in the group having a lower priority for reallocating unused tokens. The at least one output port receives at least one output flow comprising the dequeued data from the at least one queue.

Abstract: A system and method comprise a first buffer having a first capacity and a first threshold level adapted to store data frames having the lowest priority, a second buffer having a second capacity greater than the first capacity and a second threshold level greater than the first threshold level adapted to store data frames having a medium priority, a third buffer having a third capacity greater than the second capacity and a third threshold level greater than the second threshold level adapted to store data frames having the highest priority. The system further includes means for differentiating a data frame as having lowest, medium or highest priority and storing the data frame in the respective first, second or third buffer, and discarding the data frame in response to the first, second or third buffer reaching the respective threshold level.

Abstract: A system and method for constrained machine address learning comprises provisioning a first network port as being associated with at least one virtual connection at a second network port, and constraining machine address learning to only between the provisioned first network port and its associated at least one virtual connection.

Abstract: A system coupled between at least one input port and at least one output port comprises at least one queue, each queue being identified by a QID and operable to receive and buffer data in at least one service flow from the at least one input port. The system further comprises a predetermined at least one token allocated to each queue, each token indicative whether a predetermined amount of data may be dequeued from a queue and transmitted to the output port. The system comprises at least one group of queues where each queue in the group has a subordinate QID identifying a subordinate queue in the group having a lower priority for reallocating unused tokens. The at least one output port receives at least one output flow comprising the dequeued data from the at least one queue.

Abstract: Provided are a system and method for time-based scheduling in a communications environment. In one example, the method includes assigning at least one token to each of multiple active queues during a predefined period of time. Each token authorizes an amount of data to be dequeued from the queue. The method also includes waiting until the end of the predefined period of time before starting a new round of assigning. At least one of the queues is nominated based on the token assigned to the queue, where the nomination authorizes the dequeuing of the amount of data from the queue. The nomination is sent to a memory system to dequeue the data and send the data to a network uplink.

Abstract: Provided are a system and method for time-based scheduling in a communications environment. In one example, the method includes assigning at least one token to each of multiple active queues during a predefined period of time. Each token authorizes an amount of data to be dequeued from the queue. The method also includes waiting until the end of the predefined period of time before starting a new round of assigning. At least one of the queues is nominated based on the token assigned to the queue, where the nomination authorizes the dequeuing of the amount of data from the queue. The nomination is sent to a memory system to dequeue the data and send the data to a network uplink.

Abstract: In one aspect, the present invention provides a method of communicating across a serial line 26. In this method, n parallel streams of data 30 are to be received at a destination 20. In a first embodiment, the n parallel streams of data 30 characterized in that one of streams of data includes a unique characteristic that can be used to distinguish that one from each of the other streams of data. In a second embodiment, each of the n streams of data 30 are in a particular pattern that includes a detectable characteristic. At the destination 20, the unique characteristic and/or detectable characteristic can be detected to correct space and/or time errors in the streams of data. For example, the destination 20 might be a receiver that includes a serial-to-parallel converter 28 and calibration circuitry 34.