Abstract: A count of data segments is maintained. The count includes data segments in a queue and data segments in transit between a data source and the queue. A flow of data segments from the data source is controlled, based on a value of the count.

Abstract: A count of data segments is maintained. The count includes data segments in a queue and data segments in transit between a data source and the queue. A flow of data segments from the data source is controlled, based on a value of the count.

Abstract: Improved systems and methods for processing data traveling in a network in an efficient manner are provided. In many network implementations input/output ports have one or a small number of bandwidths. These ports sometimes lead to higher bandwidth ports than the source or destination needs. A method and system are provided wherein some of the input and output ports are known to be underutilized. Only a relatively small number of output ports require a complicated merge scheduler that provides configurable data transmission “fairness” between input ports. Accordingly, a method and system are provided wherein preprocessing of input data reduces the cost of the merge circuits required at the outputs.

Abstract: Method and System for flow management with scheduling is provided. The system includes a traffic shaper/scheduler, a system monitor, and a modification amount register (MAR) module. The traffic shaper/scheduler implements scheduling algorithm to arbitrate between flows. The system monitor monitors the flows and generates modification request for a target flow to update the MAR. The MAR may be consumed by the scheduling algorithm when the flow associated with the MAR is selected in a scheduling event.

Abstract: A credit-based method and apparatus are provided for controlling data communications between a sender and a receiver coupled by a link. A pipe-cleaning operation resets credits to a known value thereby compensating for errors in the link. Embodiments provide separate links for returning credits and returning pipe-cleaning responses. Further embodiments include a queue split for credit-based management and local management.

Abstract: Systems, including computer program products, and methods for modifying an effective data rate are described. The systems and methods include receiving data at a traffic rate scheduler and determining an amount of interference traffic to send to the traffic rate scheduler. The method also includes inserting interference traffic with the data in the traffic rate scheduler.

Abstract: A count of data segments is maintained. The count includes data segments in a queue and data segments in transit between a data source and the queue. A flow of data segments from the data source is controlled, based on a value of the count.

Abstract: A system and method that includes monitoring a state of a physical queue receiving data is shown. The system and method includes generating, queuing, and scheduling messages based on the state of the physical queue, sending the messages to a virtual queue system, and approximating the state of the physical queue in a virtual queue system based on the messages. The system and method includes modifying a transmission rate towards the physical queue based on a state stored in the virtual queue system.

Abstract: When a mode indicator indicates a first mode a flow of data segments to an access module is controlled by transmitting an identifier for a queue to the access module, receiving a signal indicating a status of the queue in response to transmitting the identifier, and transmitting data to the access module based on the status of the queue. When a mode indicator indicates a second mode a flow of data segments to an access module is controlled by receiving one or more signals indicating a status of a queue from the access module, and transmitting data to the access module based on the status of the queue.

Abstract: At the provider edge of a core network, an egress interface may schedule based on a class dominance model, a destination dominance model or a herein-proposed class-destination dominance model. In the latter, queues are organized into sub-divisions, where each of the subdivisions includes a subset of the queues having a per hop behavior in common and at least one of the subsets of the queues is further organized into a group of queues storing protocol data units having a common destination. Scheduling may then be performed on a destination basis first, then a per hop behavior basis. Thus providing user-awareness to a normally user-unaware class dominance scheduling model.