Abstract: Systems and methods for dynamically offloading network traffic flows in one or more virtual networks are disclosed. An example method begins with identifying a virtual router through which to route network traffic of a specific network flow, wherein the specific network flow has a source endpoint existing on a source host machine and a destination endpoint existing on a destination host machine. Flow statistics including statistics about the specific network flow are received. A determination is made as to whether the specific network flow meets an offload rule using the received flow statistics. In response to determining that the specific flow meets the offload rule, the specific network flow is offloaded from the virtual router.

Abstract: Systems and methods for dynamically offloading network traffic flows in one or more virtual networks are disclosed. An example method begins with identifying a virtual router through which to route network traffic of a specific network flow, wherein the specific network flow has a source endpoint existing on a source host machine and a destination endpoint existing on a destination host machine. Flow statistics including statistics about the specific network flow are received. A determination is made as to whether the specific network flow meets an offload rule using the received flow statistics. In response to determining that the specific flow meets the offload rule, the specific network flow is offloaded from the virtual router.

Abstract: A system and method are provided that allocate bandwidth on a global large scale network. Bandwidth allocation is based on the predicted bandwidth demands of the network users. Each user may be assigned one of a plurality of different values that determines the amount of bandwidth allocated to that user. In instances where an application runs on behalf of a plurality of remote clients, a system and method is provided that allows for the allocation of bandwidth based each individual remote client.

Abstract: Load balancing in a server pool may be achieved by rebalancing subsets of backend servers allocated to frontend servers. The rebalancing may be achieved by determining a max and min subset of servers and transferring backend servers between the subsets.

Abstract: A computerized-method of integrating workforce information data across multiple business units is provided. Workforce information for each business unit is parsed into discrete sized data blocks. There are multiple steps to processing each data block, and the steps are executed sequentially on each data block and in parallel with processing of other data blocks.

Abstract: The present invention pertains to the allocation of bandwidth on a global large scale network. Systems and methods are provided to base bandwidth allocation on the predicted bandwidth demands of the network users. In allocating bandwidth, each user is assigned a user weight value, and is to be allocated bandwidth in proportion to that value. In addition, the bandwidth allocation is enforced so as to ensure that bandwidth allocation policies are maintained.

Abstract: Bandwidth is allocated by leveraging a bursty characteristic of data transmission signals to efficiently utilize network resources. Network performance is observed over a time period to identify patterns of data transmission rates as different signals are processed. To compensate for the fact that different jobs/tasks peak at different times, the total bandwidth limit may be increased by a scaling factor. The scaling factor is calculated using information obtained by observing network performance during the time period. The scaling factor is used to increase the total bandwidth available for all jobs/tasks executing during the time period without exceeding any bandwidth limits. The data transmission rate of each job/task may then be adjusted to utilize the newly available bandwidth.

Abstract: The present invention pertains to the allocation of bandwidth on a global large scale network. Systems and methods are provided to base bandwidth allocation on the predicted bandwidth demands of the network users. In allocating bandwidth, each user is assigned a user weight value, and is to be allocated bandwidth in proportion to that value. In addition, the bandwidth allocation is enforced so as to ensure that bandwidth allocation policies are maintained.

Abstract: A system and method are provided that allocate bandwidth on a global large scale network. Bandwidth allocation is based on the predicted bandwidth demands of the network users. Each user may be assigned one of a plurality of different values that determines the amount of bandwidth allocated to that user. In instances where an application runs on behalf of a plurality of remote clients, a system and method is provided that allows for the allocation of bandwidth based each individual remote client.

Abstract: A method of updating execution instructions of a multi-core processor comprising receiving execution instructions at a processor including multiple programmable processing cores integrated on a single die, selecting subset of at least one of the cores, and loading at least a portion of the execution instructions to the subset of cores and replacing existing execution instructions, associated with the first subset of programmable processing cores, with the received execution instructions while at least one of the other cores continues to process received packets, wherein a sequence of threads provided by the cores sequentially retrieve packets to process from at least one queue, the sequence proceeding from a subsequence of at least one thread of one core to a subsequence of at least one thread on another core and wherein the sequence of threads is specified by data identifying, at least, the next core in the sequence.

Abstract: Techniques for managing a TCP congestion window. Such techniques include incrementing an acknowledgement (ACK) count for non-duplicate Transmission Control Protocol ACKs received, comparing the ACK count to a congestion window factor representing the ratio of a congestion window size associated with a connection to a maximum segment size associated with the connection, and, based on the comparing, incrementing the congestion window factor.

Abstract: According to some embodiments, a processing element arranges for a packet to be transmitted through a port without storing a packet identifier in a local transmit queue if a number of transmit buffers to be associated with the packet does not exceed a pre-determined threshold.

Abstract: Techniques are described herein that may be used to invalidate all entries in a table. For example, the table may be a flow cache. For example, an expiry time may be associated with one or more entries in the table. The expiry time of an entry may be initially set to the sum of the system time, the expiry time of the protocol associated with the entry, and a global time variable. To check if the entry is expired at any time, the current system time may be added to the global time variable and if the result is greater than the expiry time in the entry, then the entry is expired. To invalidate all the entries, the global time variable may be incremented by a large amount which may equal the maximum expiry time of all protocols. This may cause all entries to expire. New entries may be added using the new incremented value of the global time variable and will hence not expire.

Abstract: Techniques for optimizing queuing performance include passing, from a ring having M slots, one or more enqueue requests and one or more dequeue requests to a queue manager, and determining whether the ring is full, and if the ring is full, sending only an enqueue request to the queue manager when one of the M slots is next available, otherwise, sending both an enqueue request and a dequeue request to the queue manager.

Abstract: Partitioning of a Transmission Control Protocol (TCP) Control Block (TCB) associated with a TCP connection into multiple, independently accessible data structures. A first of the data structures includes TCB data used in handling an egress direction of the TCP connection while a second of the data structures includes TCB data used in handling an ingress direction of the TCP connection.

Abstract: Techniques for managing a TCP congestion window. Such techniques include incrementing an acknowledgement (ACK) count for non-duplicate Transmission Control Protocol ACKs received, comparing the ACK count to a congestion window factor representing the ratio of a congestion window size associated with a connection to a maximum segment size associated with the connection, and, based on the comparing, incrementing the congestion window factor.

Abstract: Techniques are described herein that may be used to invalidate all entries in a table. For example, the table may be a flow cache. For example, an expiry time may be associated with one or more entries in the table. The expiry time of an entry may be initially set to the sum of the system time, the expiry time of the protocol associated with the entry, and a global time variable. To check if the entry is expired at any time, the current system time may be added to the global time variable and if the result is greater than the expiry time in the entry, then the entry is expired. To invalidate all the entries, the global time variable may be incremented by a large amount which may equal the maximum expiry time of all protocols. This may cause all entries to expire. New entries may be added using the new incremented value of the global time variable and will hence not expire.

Abstract: A method and apparatus for implementing a very efficient random early detection algorithm in the forwarding path of a network device. Under one embodiment of the method flows are associated with corresponding Weighted Random Early Detection (WRED) drop profile parameters, and a flow queue is allocated to each of multiple flows. Estimated drop probability values are repeatedly generated for the flow queues based on existing flow queue state data in combination with WRED drop profile parameters. In parallel, various packet forwarding operations are performed, including packet classification, which assigns a packet to a flow queue for enqueing. In conjunction with this, a determination is made to whether to enqueue the packet in the flow queue or drop it by comparing the estimated drop probability value for the flow queue with a random number that is generated in the forwarding path.

Abstract: Techniques that may be utilized in a multiprocessor computing system are described. In one embodiment, one or more addresses (such as source and/or destination addresses) of a received packet are encoded to reduce the size of the addresses and the encoded one or more addresses are utilized to classifying the received packet.

Abstract: An arrangement of buffer in a memory unit including a plurality of memory banks may store information in rows that span the memory banks. Moreover, a processor may be adapted to (i) establish a plurality of buffers to be associated with the memory unit, wherein the size of each buffer is less than the width of a memory bank, and (ii) arrange for a selected buffer to begin in a memory bank other than a memory bank in which a previously selected buffer begins.