Abstract: A network switch for implementing a Software Defined Network can include one or more memory resources storing a flow table and including a buffer. The network switch can receive and analyze data packets to generate a lookup key for each respective data packet. Using the lookup key, the network switch can perform a lookup in the flow table to determine a rule number for the respective data packet. Based on the rule number, the network switch can generate an event record for the respective data packet, and store the event record in a block of the buffer. When the block is full, the network switch can stream a set of event records from the buffer to a processing resource to enable the processing resource to update counter tables, external to the network switch, to implement the Software Defined Network.

Abstract: According to an example, a method for bandwidth guarantee and work conservation includes determining virtual machine (VM) bandwidth guarantees assigned to VMs in a network including a source VM that communicates with destination VMs. The method further includes assigning minimum bandwidth guarantees to communications between the source VM with the destination VMs by dividing a VM bandwidth guarantee assigned to the source VM between the destination VMs based on active VM-to-VM communications between the source VM and the destination VMs. The method also includes allocating, by a processor, spare bandwidth capacity in the network to a communication between the source VM and a destination VM based on the assigned minimum bandwidth guarantees.

Abstract: A network switch for implementing a Software Defined Network can include one or more memory resources storing a flow table and including a buffer. The network switch can receive and analyze data packets to generate a lookup key for each respective data packet. Using the lookup key, the network switch can perform a lookup in the flow table to determine a rule number for the respective data packet. Based on the rule number, the network switch can generate an event record for the respective data packet, and store the event record in a block of the buffer. When the block is full, the network switch can stream a set of event records from the buffer to a processing resource to enable the processing resource to update counter tables, external to the network switch, to implement the Software Defined Network.

Abstract: Each of a plurality of data packets that is received on a network switch can be associated with a corresponding event record that identifies one or more flow table rules for that data packet. A plurality of event records, which individually can correspond to one or more of the data packets, is transmitted to a programmable resource for use in controlling a Software Defined Network.

Abstract: According to one embodiment, a method comprises evaluating messages between nodes of a distributed computing environment. Based on timing relationships of the messages, probability of causal links between pairs of messages determined. Based on the determined probability, at least one causal path comprising a plurality of causal links is inferred. Further, an overall probability that the inferred causal path is accurate is determined. In certain embodiments, the overall probability is output for the corresponding causal path to provide an indication of the confidence of the accuracy of such inferred causal path.

Abstract: Example methods, systems, and apparatus to dynamically select between memory error detection and memory error correction are disclosed herein. An example system includes a buffer, to store a flag settable to a first value to indicate that a memory page is to store error protection information to detect but not correct errors in the memory page. The flag is settable to a second value to indicate that the error protection information is to detect and correct errors for the memory page. The example system includes a memory controller to receive a request based on the flag to enable error detection without correction for the memory page when the flag is set to the first value, and to enable error detection and correction for the memory page when the flag is set to the second value.

Abstract: According to an example, a method for bandwidth guarantee and work conservation includes determining virtual machine (VM) bandwidth guarantees assigned to VMs in a network including a source VM that communicates with destination VMs. The method further includes assigning minimum bandwidth guarantees to communications between the source VM with the destination VMs by dividing a VM bandwidth guarantee assigned to the source VM between the destination VMs based on active VM-to-VM communications between the source VM and the destination VMs. The method also includes allocating, by a processor, spare bandwidth capacity in the network to a communication between the source VM and a destination VM based on the assigned minimum bandwidth guarantees.

Abstract: A multi-core processor includes at least one first core and at least one second core. The first core is optimized to run applications, and the second core is optimized to meet the computing demands of operating-system-like code. The first core and the second core execute the same instruction set.

Abstract: A rate limit manager is to assign network traffic flows to hardware rate limiters. The network traffic flows are associated with rate limit values. The rate limit manager determines threshold values to assign flow(s) to hardware rate limiters, and the rate limit manager is to assign flow(s) to a last remaining unassigned hardware rate limiter independent of the threshold value.

Abstract: A network switch handles a data packet by determining a plurality of address items. An identifier is determined that is singularly associated with each address item in the set, the identifier having fewer bits than the associated address item. A flow key for the packet using (i) at least some of the plurality of fields, and (ii) the identifier associated with each address item in the set, and not the associated address item.

Abstract: Each of a plurality of data packets that is received on a network switch can be associated with a corresponding event record that identifies one or more flow table rules for that data packet. A plurality of event records, which individually can correspond to one or more of the data packets, is transmitted to a programmable resource for use in controlling a Software Defined Network.

Abstract: According to at least one embodiment, a method comprises identifying at least one causal path that includes a node of a distributed computing environment that is of interest. The method further comprises analyzing the identified at least one causal path to determine at least one time interval when the node is active in such causal path, and correlating consumption of a resource by the node to the node's activity in the at least one causal path.

Abstract: A system and method for detecting path failure in a network are described. The system and method include a network interface which receives packets over particular connections, and an agent able to monitor the network interface and start a no-traffic timer for each particular connection when a packet is received on the connection. The agent is further able, when the no-traffic timer expires, to check for outgoing data on the particular connection, and compare a count of previously sent test packets against a limit. If the count is below the limit the agent sends a new test packet on the particular connection, the test packet provides an indication of the state of a network path associated with the particular connection. If the count is above the limit the agent initiates failover procedures for the associated path.

Abstract: A system and method for detecting path failure in a network are described. The system and method include a network interface which receives packets over particular connections, and an agent able to monitor the network interface and start a no-traffic timer for each particular connection when a packet is received on the connection. The agent is further able, when the no-traffic timer expires, to check for outgoing data on the particular connection, and compare a count of previously sent test packets against a limit. If the count is below the limit the agent sends a new test packet on the particular connection, the test packet provides an indication of the state of a network path associated with the particular connection. If the count is above the limit the agent initiates failover procedures for the associated path.

Abstract: A system and method for comparing a digest value in an incoming response to a digest index (e.g., a hash table). The digest index includes digest values of data objects already cached at a cache. Data object retrieval is avoided when a match is found between the digest value and a digest value in the digest index.

Abstract: Information returned by a server to a client includes instructions, executable by either a proxy server or the client, for converting the returned information from a first representation to a second representation. The representation conversion may be made by a proxy server, for example, to make transmission of the returned information to the client more efficient, and/or to render the returned information in a format suitable for display by the client. By having the server embed representation conversion information in the query response, the representation conversion can take into account the type and other characteristics of information being returned, as well as the computational and display characteristics of the client.

Abstract: A system and method for comparing a digest value in an incoming response to a digest index (e.g., a hash table). The digest index includes digest values of data objects already cached at a cache. Data object retrieval is avoided when a match is found between the digest value and a digest value in the digest index.

Abstract: In a distributed network of host computers, a system and method are provided for translating names and addresses of the host computers. The names of a substantial number of all of the host computers of the network are collected by probing the network from a collecting site. The names are stored in a table. Name-address bindings, which may include time-to-live information, are obtained for each of the collected names. The name-address bindings can be compressed and transferred to a cache memory of a recipient computer, such as, for example, a proxy server. The recipient computer receives translation requests for any of the name-address bindings stored in the memory. These translation requests can include first translation requests for the any of the name-address bindings stored in the memory. In response to the requests, including the first requests, the recipient computer replies the name-address bindings to reduce response latencies.

Abstract: A computer implemented method adjusts a Web page including multimedia content according to the effective bandwidth and/or latency monitored on a network path connecting a server computer storing the Web page, and a client computer requesting the Web page. In response to receiving a request for the Web page in the server computer from the client computer, the server computer, or some other computer closely connected to the server computer monitors the effective bandwidth and/or latency of the network path. Using the measured effective bandwidth and/or latency, the content of the Web page is dynamically adjusted by the server computer while sending the Web page to the client.

Abstract: A client-server network including a number of client computer systems, each of the client computer systems having a network interface, a number of server computer systems, each of the server computer systems having a network interface, and a replicator system connecting the client computer systems to the server computer systems, the replicator system transparently processing a number of requests from the client systems to a number of services resident in the server systems.