Abstract: Methods, systems, and computer readable media for regulating pinhole preservation traffic generated or received by firewall or network address translator (NAT) session initiation protocol (SIP) user agent clients (UACs) are disclosed. One method includes, maintaining a list of contact information for a plurality of SIP UACs registering from behind at least one of a firewall and a NAT. The method further includes iterating through the list to generate SIP messages to the different UACs such that the SIP messages to the different UACs are spaced at substantially regular intervals with respect to each other, wherein the SIP messages to the different UACs trigger responses from the UACs such that the responses are spaced at substantially regular intervals with respect each other.

Abstract: An improved communication method for sending media between a sending node and receiving node during a conversation. When network bandwidth is insufficient to transmit a full bit rate representation of time-sensitive media, then a reduced bit rate representation of the media is transmitted for the purpose of increasing the ability of the recipient to review the media upon receipt and continue the conversation in the real-time mode when the bandwidth on the network is insufficient to support the transmission of the full bit rate representation. Media that is ascertained as not time-sensitive on the other hand is transmitted when bandwidth in excess of what is needed for time-sensitive media becomes available.

Abstract: A device having under-run management capabilities and to a method for managing under-runs. The method includes providing, to a memory unit, channel information from multiple channels; allocating time slots for communication channel transmissions; the method is characterized by including: sending, during a time slot allocated for a transmission of channel information from an enabled communication channel, to the shift register channel information of an enabled communication channel, serially outputting the received channel information from the shift register towards a communication line while serially replacing the outputted channel information by a predefined content such that the shift register stores a communication channel disable code when an under-run occurs; defining a communication channel as a disabled communication channel once the under-run occurs; and transmitting, during a time slot allocated to a disabled communication channel, idle signals to the communication line.

Abstract: Presented herein are systems and methods that facilitate the portability and management of user data maintained at two or more services. In embodiments, a configurable profile management interface or interfaces are provided to a user, which enable the user to identify data elements that may be maintained across one or more services. In embodiments, a user has the ability to set precedence values by identifying which elements from which service or services should be considered as sources of truth. In embodiments, those sources of truth may be used to propagate changes to one or more services. In embodiments, the profile synchronization functionality may be incorporated within a human resources (HR) system. In embodiments, the user can also configure a schedule for transferring data, can import some or all of the data, and/or can export all or some of the data.

Abstract: A network acceleration device simultaneously caches and intelligently serves different historical versions of stored network content. For example, the network acceleration device may receive one or more requests for original content; however, subsequent updates to the content may create varying versions of the content, e.g., a pre-update version and one or more post-update versions. Client devices that requested the content prior to the update receive the pre-update version from the network acceleration device. Client devices that requested content after the update receive the post-update version from the network device. Moreover, the network acceleration device facilitates the simultaneous delivery of the pre-update version and the post-update version without waiting for delivery of the pre-update version to be complete. Thus, the network acceleration device may facilitate decreased download times by seamlessly and transparently providing both versions of the content simultaneously.

Abstract: One embodiment of the invention sets forth a control crossbar unit that is designed to transmit control information from control information generators to destination components within the computer system. The control information may belong to various traffic paradigms, such as short-latency data traffic, narrow-width data traffic or broadcast data traffic. The physical connections within the control crossbar unit are categorized based on the different types of control information being transmitted through the control crossbar unit. The physical connections belong to the following categories: one-to-one (OTO) connections, one-to-many (OTM) connections, valid-to-one (VTO) connections, valid-to-many (VTM) connections wire-to-one (WTO) connections and wire-to-many (WTM) connections.

Abstract: Performing transmission of data over network using at least a first and second rate adaptation algorithm. The transmission of data may use a plurality of buffers. It may be determined that a number of available buffers of the plurality of buffers is below a first threshold. Accordingly, data may be transmitted according to the second rate adaptation algorithm which provides increased flowrate. During the transmission of the data, it may be determined that the number of available buffers of the plurality of buffers exceeds a second threshold. Accordingly, data may be transmitted according to the first rate adaptation algorithm that provides increased throughput.

Abstract: According to at least one embodiment, a method comprises receiving, into a capacity planning system, workload information representing an expected workload of client accesses of streaming media files from a site. The method further comprises receiving, into the capacity planning system, at least one service parameter that defines a desired service characteristic to be provided by a media server configuration under the expected workload. The method further comprises determining, by the capacity planning system, for at least one server configuration, how many servers of the at least one server configuration to be included at the site for supporting the expected workload in compliance with the at least one service parameter.

Abstract: Transmission Control Protocol (TCP) segments received from a server are processed to result in improved reliability. An embodiment of the method comprises receiving a first TCP segment from a server and placing the first TCP segment in a segment queue, the first TCP segment having a first sequence number. A determination is made as to whether a second TCP segment is missing from the segment queue based at least in part on a first sequence number. Responsive to determining that the second TCP is missing from the segment queue, placing a placeholder for the second TCP segment in the segment queue. The first TCP segment is delivered to an application responsive to the first TCP segment being the next TCP segment in a sequence.

Abstract: A host is coupled to a network via an intelligent network adaptor. The host is executing an application configured to receive application data from a peer via the network and the intelligent network adaptor using a stateful connection according to a connection-oriented protocol. The intelligent network adaptor performs protocol processing of the connection. Application data is copied from host memory not configured for access by the application (possibly OS-associated host memory) to host memory associated with the application (application-associated host memory). The application data is received from the peer by the intelligent network adaptor and copied to host memory not configured for access by the application. The operating system selectively provides, to the intelligent network adaptor, information of the memory associated with the application.

Abstract: Systems, methods and articles of manufacture are disclosed for effecting a desired collective operation on a parallel computing system that includes multiple compute nodes. The compute nodes may pipeline multiple collective operations to effect the desired collective operation. To select protocols suitable for the multiple collective operations, the compute nodes may also perform additional collective operations. The compute nodes may pipeline the multiple collective operations and/or the additional collective operations to effect the desired collective operation more efficiently.

Abstract: A method and apparatus for managing an overload condition in a network are disclosed. For example, the method monitors the network for a traffic overload condition, and determines whether a more severe traffic overload condition or a less severe traffic overload condition is detected by using a network monitor and controller. The method then selects using a network monitor and controller agent in response to a command from the network monitor and controller, a different bandwidth preservation scheme if the more severe traffic overload condition or the less severe traffic overload condition is detected, wherein the different bandwidth preservation scheme is based on a selection of a codec type and is applied to a portion of the traffic.

Abstract: A method of dynamically adjusting the number of task requests is provided, which is applicable to an Internet Small Computer System Interface (iSCSI) protocol. When a target receives a task request transmitted by an initiator or the target completes the task request, the number of transmissible tasks is calculated according to an average access data volume, an current access data volume, and an allowable access data volume in the target, and returned to the initiator, such that the number of the task requests transmitted simultaneously by the initiator does not exceed the number of transmissible tasks, thereby achieving flow control. The allowable access data volume is obtained through interactive and dynamic adjustment between the target and the initiator.

Abstract: Systems, methods and software useful for overcoming network congestion problems including head-of-line blocking issues and other network congestion problems. In certain aspects, flow control mechanisms implemented in a switch device or other network device manage buffer and system level resources using a scheduler to control the amount of data requested from a local SAN fabric. Switches and other network devices configured according to the present invention monitor each individual SCSI task, and are configured to apply flow control measures to each active session when buffering resources become scarce, such as when buffering data for a slower-speed WAN link or TCP/IP based interconnects of any speed.

Abstract: A method, apparatus, and system for managing load in a server are provided. The server performs events for a plurality of electronic communication devices, each of the devices enabled to transmit to the server, at a respective given time and at a respective given frequency, a request to perform a respective event. The server receives the requests and determines that its load is above a threshold load value during a given time period when the requests arrive. In response, for a subset of the devices, the server transmits a delay time to each electronic communication device in the subset. The delay time causes each device in the subset to change the respective given time to a respective new time comprising the delay time added to the respective given time such that a next request is transmitted from each device in the subset to the server at the respective new time.

Abstract: The invention is related to a method and a monitoring system for sample-analysis of data comprising a multitude of data packets. Defined parent population numbers (N) of data packets are sampled by an out of N sampling and classified or vice versa. Classification is done by classification rules to create sample-flow-groups of specific flows. Each sample-flow-group consists of a sample-flow-quantity of data packets having a sample-flow-size. According to the invention in each sample-flow-group sample-flow-variances and sample-flow ratios defined by the sample-flow-quantity in proportion to the sample number (n) are determined. Furthermore, an estimated flow size defined by an estimated sum of data sizes of data packages in a flow of the parent population number of data packets and its variance are calculated.

Abstract: The present invention relates to a queue management unit and method for streaming video packets in a wireless network. The method includes determining a type of frame from a header of a video packet received at a transmit buffer. The method further includes discarding the received frame if the received frame is dependent upon any previously discarded frame, otherwise storing the received frame in one of a plurality of sub-queues of the transmit buffer according to the type of frame, where each sub-queue of the plurality of sub-queues stores frames corresponding to one type of frame. Also, the method includes creating space in the transmit buffer if there is insufficient space for a higher priority frame by discarding lower priority frames, as well as discarding frames in the transmit if the received frame is delayed more than a maximum period of time.

Abstract: The invention provides an Ethernet-based data transmission method, which is applied to a control system with a plurality of nodes. The method comprises: a first node caches the data needed to be sent (S101); if the current communication macro-cycle comprises the time segment for the first node to send data, the first node sends the cached data in the time segment for the first node to send data within the current communication macro-cycle; if the current communication macro-cycle does not comprise the time segment for the first node to send data, the first node does not send the cached data in the current communication macro-cycle; wherein other nodes do not send data in the time segment for the first node to send data within the current communication macro-cycle, and the communication macro-cycles have same durations and each communication macro-cycle consists of a plurality of time segments with a fixed length (S102). The invention further provides Ethernet nodes and a control system.

Abstract: It is the object of the present invention to provide a processing apparatus, processing method, processing program and recording medium capable of reducing the concentration of load upstream in the communication path of a network, and to improve the efficiency of a network system.

Abstract: A method for receiving data in a network acceleration architecture for use with TCP (transport control protocol), iSCSI (Internet Small Computer System Interface) and RDMA (Remote Direct Memory Access) over TCP, including providing a hardware acceleration engine, called a streamer, adapted for communication with and processing data from a consumer application in a system that supports TCP, iSCSI and RDMA over TCP, providing a software protocol processor adapted for carrying out TCP implementation, the software control processor being called a TCE (TCP Control Engine), and providing an asynchronous dual-queue interface for exchanging information between the streamer and TCE, wherein the streamer and TCE are adapted to operate asynchronously and independently of one another.

Abstract: Live media content is delivered in substantially real-time to a player device from a streamer and through a content delivery network. The streamer receives live media content and encodes and streams the content over the content delivery network. The content delivery network is configured to provide minimal buffering. A player device accessing the streaming channel receives media frames and buffers the frames while rending the received frames in order of receipt. If the buffer is loaded to the point that the currently rendered data lags the actual live feed by more than a threshold amount of time, the player skips over one or more video frames to bring the rendered content more current. For instance, the buffer can be flushed and more recent content can be received from the content delivery network.

Abstract: Initiating peer-to-peer tunnels between clients in a mobility domain. When initiated by the controller, the access nodes establish a peer-to-peer tunnel for suitable client traffic so as to bypass “slow” tunnels through the controller. Traffic through this “fast” tunnel may be initiated once established or traffic may be temporarily queued. This queue and release process may be bidirectional or unidirectional depending on the traffic. Completion of slow tunnel traffic may be sensed in a number of ways. Slow tunnel traffic may be timed out, and queued traffic released after a preset time since the last packet was sent through the slow tunnel. The identity of the last packet sent through the slow tunnel may be retained, and queued traffic released when an acknowledgement for that packet is received. A special packet may be sent through the slow tunnel and queued traffic released when an acknowledgement for that packet is received.

Abstract: A method and system for transmitting multimedia content from a server to a client device includes a source multimedia retriever to retrieve source multimedia content data. A transcoded multimedia retriever retrieves transcoded multimedia content data, the transcoded multimedia content data being a transcoded version of the source multimedia content, and the transcoded multimedia content data being time shifted with respect to the source multimedia content data. A data packet formulator formulates a data packet comprising the source multimedia content data and the time shifted transcoded multimedia content data. A data packet transmitter transmits the data packet from the server to the client device.

Abstract: A block-request streaming system provides for improvements in the user experience and bandwidth efficiency of such systems, typically using an ingestion system that generates data in a form to be served by a conventional file server (HTTP, FTP, or the like), wherein the ingestion system intakes content and prepares it as files or data elements to be served by the file server. A client device can be adapted to take advantage of the ingestion process. The client device might be configured to optimize use of resources, given the information available to it from the ingestion system. This may include configurations to determine the sequence, timing and construction of block requests based on monitoring buffer size and rate of change of buffer size, use of variable sized requests, mapping of block requests to underlying transport connections, flexible pipelining of requests, and/or use of whole file requests based on statistical considerations.

Abstract: Device connection routing for controllers is provided. A computing device is configured with multiple controllers that provide connections for peripheral devices. The controllers enable the peripheral devices to interact with the computing device through a bus. Each device connection is routed to one of the multiple controllers based on one or more pre-determined factors. These factors may include load-balancing, power saving, quality of service, data flow requirements, and the like. Device connection routing may be dynamically managed to respond to changing states of the peripheral devices and the controllers. The device connection routing may be performed for controllers associated with any type of wired or wireless buses, such as Universal Serial Bus (USB), IEEE 1394, Secure Digital Input/Output (SDIO), and the like.

Abstract: A client terminal CT transmits an acquisition request for musical composition information. An associated information provision server KS continuously receives the acquisition request at a given time interval. The associated information provision server KS transmits timing specification information along with the musical composition information corresponding to the acquisition request to the client terminal CT. The timing specification information specifies timing for the client terminal CT to transmit the acquisition request next. The associated information provision server KS controls a polling interval for acquisition requests. In this manner, acquisition requests can be distributed to those transmitted at a given time interval and those received in accordance with the timing specification information. A simple method can be used to prevent acquisition requests from being concentrated on the associated information provision server KS.

Abstract: Embodiments of the present invention set forth techniques for a content player to stream a media file using multiple network connections. To stream the media file, the content player downloads metadata associated with a requested media file, establishes a network connection with multiple content servers (or multiple network connections with a single content server or both) and begins requesting portions of the media file. In response, the requested portions are transmitted to the content player. The content player may employ a predictive multi-connection scheduling approach to determine which network connection to use in downloading a given chunk.

Abstract: In one embodiment, a method for controlling reads in a computer input/output (I/O) interconnect is provided. A read request is received over the computer I/O interconnect from a first device, the request requesting data of a first size. Then it is determined whether fulfilling the read request would cause the total size of a completion queue to exceed a first predefined threshold. If fulfilling the read request would cause the total size of the completion queue to exceed the first predefined threshold, then the read request is temporarily restricted from being forwarded upstream.

Abstract: A system balances bandwidth used by a data stream. The system receives data in the data stream and partitions the data into bursts. The system then identifies whether a size of a current one of the bursts is less than a size of a maximum burst associated with the data stream and schedules an additional burst in the data stream when the current burst size is less than the maximum burst size. The system transmits the current burst and the additional burst to balance bandwidth used by the data stream.

Abstract: Particular embodiments include cooperative monitoring of peer-to-peer activity on a network including maintaining communication between a local monitoring process and a network monitoring process such that a process can use both network monitoring and local monitoring. The cooperative monitoring includes monitoring a local peer using local monitoring of a point in the network by monitoring packets passing through the point, monitoring the network using network monitoring by a monitoring system or agent coupled to the network, and analyzing the result of network monitoring and local monitoring to determine at least one file transfer association with the local peer.

Abstract: An advanced processor comprises a plurality of multithreaded processor cores each having a data cache and instruction cache. A data switch interconnect is coupled to each of the processor cores and configured to pass information among the processor cores. A messaging network is coupled to each of the processor cores and a plurality of communication ports. In one aspect of an embodiment of the invention, the data switch interconnect is coupled to each of the processor cores by its respective data cache, and the messaging network is coupled to each of the processor cores by its respective message station. Advantages of the invention include the ability to provide high bandwidth communications between computer systems and memory in an efficient and cost-effective manner.

Abstract: The present invention relates to systems, apparatus, and methods of utilizing delta coding in acceleration proxy servers. The method including storing, at a proxy server, a plurality of dictionary pages within a page storage disk and indexing, at the proxy server, the plurality of dictionary pages with fingerprint identifiers. The fingerprint identifiers are configured to uniquely identify data strings within each of the plurality of dictionary pages. The method further includes receiving, at the proxy server, a data request. The request includes a plurality of fingerprints associated with the requested data.

Abstract: A computer readable medium comprising software instructions for: obtaining an allocation policy by a MAC layer executing on a host; receiving, a request for a transmit kernel buffer (TxKB) by a sending application executing on at least one processor of the host; obtaining a location of a plurality of available TxKBs on the host; obtaining a location of at least one available network interface on the host; obtaining a location of the sending application; allocating one of the plurality of available TxKBs to obtain an allocated TxKB, wherein the one of the plurality of available TxKBs is selected according to the allocation policy using the location of the plurality of available TxKB, the location of the at least one available network interface, and the location of the sending application, to obtain an allocated TxKB; and providing, to the sending application, the location of the allocated TxKB.

Abstract: A technique for optimally balancing the load between a series of coprocessors that takes into consideration the load associated with each coprocessor. A cost associated with a packet is determined. This cost along with the coprocessor's current load is used to determine an anticipated load. The anticipated load is used to select a coprocessor that is to process the packet. In one embodiment, the coprocessor with the minimal anticipated load is selected. In another embodiment, an output port associated with the packet is checked to determine if it is congested. If so, a coprocessor other than the coprocessor with the minimum load is selected.

Abstract: Embodiments for an apparatus and method are provided that can build latency in streaming applications that use data packets. In an embodiment, a system has an under-run forecasting mechanism, a statistics monitoring mechanism, and a playback queuing mechanism. The under-run forecasting mechanism determines an estimate of when a supply of data packets to convert will be exhausted. The statistics monitoring mechanism measures the arrival fluctuations of the supply of data packets. The playback queuing mechanism can build the latency.

Abstract: A communication method includes steps of: transmitting a plurality of packets to a network according to a window specifying a data amount of the packets to be transmitted to the network; receiving ACK related to the packets transmitted to the network, and detecting whether or not packet discard occurs; measuring a RTT by using the received ACK; calculating a discarding interval indicating a time interval of the packet discard; calculating an increase amount for a current window by using the calculated discarding interval; and updating the current window by using the calculated increase amount if the packet discard is not detected.

Abstract: A method, system, and computer program product are disclosed for implementing an asynchronous collective operation in a multi-node data processing system. In one embodiment, the method comprises sending data to a plurality of nodes in the data processing system, broadcasting a remote get to the plurality of nodes, and using this remote get to implement asynchronous collective operations on the data by the plurality of nodes. In one embodiment, each of the nodes performs only one task in the asynchronous operations, and each nodes sets up a base address table with an entry for a base address of a memory buffer associated with said each node. In another embodiment, each of the nodes performs a plurality of tasks in said collective operations, and each task of each node sets up a base address table with an entry for a base address of a memory buffer associated with the task.

Abstract: A link layer system is provided. The link layer system a first link layer control module and a retry queue for storing a transmitted data packet. The retry control module is coupled to the first link layer control module, which directs the retry queue to discard the transmitted data packet when an acknowledgment bit is received by the first link layer control module.

Abstract: The present invention concerns a method of calculating a filtered filling level of the input buffer of a gateway generating a data stream from a received data stream resisting the jitter of the stream received. It applies more particularly to a gateway receiving an MPEG (Moving Picture Experts Group) transport stream received according to the IP protocol (Internet Protocol) and retransmitted over an ASI interface (Asynchronous Serial Interface). The invention proposes a method of calculating a filtered filling level of the input buffer resisting the jitter of the stream received. The received stream passing through an input buffer, the method is based on a regulation as a function of the maximum level of the buffer evaluated over a period of time, making it possible to protect against the effects of the jitter introduced into the received stream.

Abstract: A communication processing apparatus that acts as a server for transmitting data to a client includes a data transceiver configured to carry out communications with the client; a rate controller configured to control a bitrate of data transmitted to the client; and a data processor configured to prepare data to transmit in accordance with the bitrate. The rate controller includes a throughput calculator configured to extract an effective data transmission and reception period not including an ineffective data transmission and reception period in a period during which a communication connection is maintained between the server and the client, and to calculate a maximum throughput on the basis of the length of the effective data transmission and reception period and the amount of data transmitted; and a bitrate setter configured to set a bitrate within a range of up to a maximum allowable bitrate corresponding to the maximum throughput calculated by the throughput calculator.

Abstract: A network storage system includes a first data buffer, a second data buffer, a pre-allocating module and a control module. The first data buffer is utilized for storing a storage data received from a network-base. The second data buffer is coupled to the first data buffer and includes a plurality of data buffering units. The pre-allocating module is coupled to the second data buffer and utilized for allocating the plurality of data buffering units to the second data buffer in advance. The control module controls the first data buffer to write the stored storage data into the plurality of data buffering units.

Abstract: A method and system for message delivery in a messaging network are provided for enabling scaling. A messaging network includes a group of a plurality of queue managers, each of which includes means for carrying out a method comprising: receiving a message at a queue manager, removing at least some of the original message data to form a link message, adding a reference to the link message referring to the queue manager, sending the link message to a link message queue, and putting the original message to a local queue on the first queue manager. A link message queue may provided on each of the queue managers in the group, or single link message queue may be provided on one queue manager and accessible by the other queue managers in the group.

Abstract: A mechanism provides for sending an envelope and replying to an envelope. A transmitter is configured to send an envelope. A receiver is coupled to the transmitter, wherein the receiver is configured to receive the envelope and generate a reply envelope. A send buffer is coupled to the transmitter. A receive buffer is coupled to the receiver. A retry timer is coupled to the transmitter, wherein the retry timer is configured to reset upon the receipt of a reply envelope correlated to the transmit envelope. The transmitter is configured to retransmit an envelope if the transmitter does not receive a corresponding reply envelope within a selected time period as determined by the retry timer. This leads to a decrease in the total number of envelopes, transmitted from both the transmitter and the receiver.

Abstract: An apparatus and method for an improved bulk read socket call are provided. With the apparatus and method, a new field, so_rcvlen, is added to the socket structure that identifies the bulk read size requested by the user. The kernel of the prior art recv( ) function is also modified so that it sets the so_rcvlen to the size requested by the user prior to the recv( ) function going to sleep and waiting for the full data size requested by the user. A new flag, SP_MSGWAITALL, is also provided in the socket structure. In the TCP input processing, when data is received for a particular socket, the current setting of the SP_MSGWAITALL is checked. If the SP_MSGWAITALL flag is set, it is determined whether the amount of data stored in the socket receive buffer is less than the value of so_rcvlen. If not, the TCP input processing does not wake up the recv( ) thread. However, for every alternate segment, the TCP input processing sends back an acknowledgment (ACK).

Abstract: A method and system for concurrent processing transmit requests uses transmit queue including a circular buffer and a queue state including a producer index, a consumer index, and a producer list. Producer processes write to the circular buffer concurrently. The producer list signals which portion of the circular buffer are allocated to each of the producer processes.

Abstract: Techniques are provided for more robust counter-based anti-replay protection with respect to packets sent between network devices. A network device receives packets sent over a network from another network device. Each packet contains a source identifier that identifies a device that is the source of the packet, a destination identifier that identifies a device that is the intended destination of the packet, a sender identifier that identifies a network device that encrypted and sent the packet and a sequence number associated with the packet. The network device stores data indicating source identifier, destination identifier, sender identifier and sequence number for packets received over time.

Abstract: A method and apparatus for the dynamic adjustments of video streams sent from a server to a client is provided. Using both short term and long term thinning mechanisms, the server reduces its data transfer rate when bandwidth is reduced and increases its data transfer rate when bandwidth is available. In the short term mechanism, the server will dynamically adjust the transmission rate of the video or the quality of the video based on parameters returned by the client. These parameters include currently-buffered data-size, buffered-data duration, and packet loss rate. In the long term mechanism, the server will adjust the current maximum quality level allowed depending upon the round trip times of data packets transmitted. This invention decreases client rebuffering and packet loss and increases the efficiency of available bandwidth.

Abstract: Methods and apparatus to provide a high throughput pipelined data path are described. In one embodiment, an apparatus may include three stages to process inbound data packets, e.g., to align one or more bits of data. Other embodiments are also described.

Abstract: A method and system for retrieving web-site based information by a spider engine at a target bandwidth is described. A target bandwidth is received from the spider engine. A wait time is calculated by a timing module. Data retrieval from a web site is delayed by the calculated wait time so that data is retrieved at the desired target bandwidth.

Abstract: A network device for scheduling packets in a plurality of queues. The network device includes a plurality of configurable mechanisms, each of which is configured to process information in one of a plurality of queues based on a predefined bandwidth. A scheduler services an associated one of the plurality of queues based on the predefined bandwidth. The network device also includes means for tracking whether or not the plurality of queues has exceeded a predefined threshold. If the plurality of queues has exceeded the predefined threshold, a new bandwidth allocation is calculated for each of the plurality of queues. The new bandwidth allocation replaces the predefined bandwidth and is proportional to the predefined bandwidth for each of the plurality of queues.