Sun Microsystems, Inc.

Oracle America, Inc.

Michael F Speer

Jason L Goldschmidt

Viswanathan Swaminathan

Christoph L Schuba

Gerard M Fernando

Arvind Srinivasan

Amit Narayan Gupta

Marcelino M Dignum

Jagadeesh Kalki

Benjamin H Stoltz

Cahya Adiansyah Masputra

Neil Evan Lydick

Ashish Kishorchandra Mehta

Alain D Durand

Ling Yan

Ciaran Murphy

Methods, systems, and computer storage media for providing a multi-tenant system that executes graph language requests using graph operations of a graph language. A graph language request&#x2014;that configures tenant data for tenants in a multi-tenant system&#x2014;is executed using a graph operations engine. The graph operations engine receives and parses a graph language request that includes a list of tenants and a definition of data operations. The set of data operations of the definition are executed on a tree of data operation nodes comprising a plurality of leaf nodes and a root node. Executing the data operations is based on graph language actions (e.g., composition, transformation, and aggregation) that support asynchronously returning results data associated with configuring the Tenant data. Executing the data operations of the definition causes generation of results data (e.g., root node results or leaf node results) configuration of the tenant data in the multi-tenant system.

Graph operations engine for tenant management in a multi-tenant system

Some embodiments of the present invention provide a system for packet classification and spreading in a virtualized system. The system can use information in a packet's header to determine a destination system-image in the virtualized system, and a packet-spreading policy for the destination system-image. The system can determine a key using the information in a packet's header. Alternatively, the system can hash the information in the packet's header to obtain an index value. Next, the system can use the key or the index value to perform a lookup in a table which associates keys or index values with system images and/or packet-spreading policies. Once the destination system-image and the packet-spreading policy are determined, the system can deliver the packet to a thread on the destination system-image according to the packet-spreading policy.

Method and apparatus for packet classification and spreading in a virtualized system

A method and apparatus for timely delivery of classes and objects is provided. A header comprising timing information is attached to said classes and/or objects. A 'start loading' time and a 'load by' time are specified in the header. Other classes and/or objects to be loaded are also specified in the header. Optional compression, security, and/or error resilience schemes are also specified in the header. A process for creating the header and attaching it to a class or object is provided. A process for receiving and processing a class or object with an attached header is provided. Embodiments of the invention allow timely delivery of classes and/or objects over a wide variety of transport mechanisms, including unreliable transport mechanisms and those lacking any guarantees of timely delivery.

Distributing data via a network including timing information

A flow manager may receive prioritized packet flow rules from one or more network services where each rule may include a packet filter and prioritized actions. Each action of a packet flow rule may be either terminating or non-terminating. A flow manager may generate a unified rule set according to the received packet flow rules and may additionally validate the unified rule set to identity errors. When validating the unified rule set, a flow manager may compare the unified rule set against one or more defined policies. Alternatively, a flow manager may apply the unified rule set to either captured or manually specified simulated network packets. A flow manager may also identity extraneous rules or actions. Further, a flow manager may present the unified rule set for manual verification and may receive input identifying errors and specifying modification to correct the errors.

Rule set verification

A datacenter system including a plurality of nodes configured to send and receive a service request, a service table on the plurality of nodes configured to store route information extracted from a signaling mechanism, and a forwarding engine configured to route the service request to at least one of the plurality of nodes using route information from the service table.

Method for distributed end-to-end dynamic horizontal scalability

A method for sending a plurality of messages to a plurality of recipients including obtaining the plurality of messages for the plurality of recipients, grouping the plurality of messages into a data structure, generating a system call from a user-level application to a kernel, wherein the system call includes a reference to the data structure, and for each message in the plurality of messages in the data structure: extracting a selected message from the plurality of messages in the data structure using the reference to the data structure, and sending the selected message to one of the plurality of recipients.

Multiple message send routine for network packets

A flow manager may receive packet flow rules from one or more network services and may generate a unified rule set according to the received packet flow rules. A flow manager may additionally split the unified rule set into subsets for enforcement by one or more flow enforcement devices and may install the rule subsets onto the flow enforcement devices. When splitting the unified rule set into subsets, a flow manager may analyze a network topology connecting the flow enforcement devices. A flow manager may also receive additional packet flow rules, integrate them into the unified rule set, update the rule subsets according to the additional rules, and install the updated subsets onto the flow enforcement devices.

Distributed flow enforcement

One embodiment of the present invention provides a system that resolves conflicts between network service rules for network data traffic in a system where rule patterns with longer prefixes match before rule patterns with shorter prefixes. The system operates by receiving a set of network service rules for network data traffic from multiple network services, wherein network service rules from different network services can possibly conflict. Each of these network service rules specifies: a filter that defines a prefix for a set of packets in the packet flow, and an action list that specifies one or more actions to be applied to the set of packets. Next, the system identifies a conflict between a higher priority rule and a lower priority rule in the set of network service rules. The system resolves this conflict by prepending an action list of the higher priority rule to an action list of a rule with a filter that defines a longer prefix.

Resolving conflicts between network service rule sets for network data traffic in a system where rule patterns with longer prefixes match before rule patterns with shorter prefixes

Method for handling byte code in a configurable manner

A method and apparatus for efficient and reliable multicasting in a network environment. In embodiments of the invention, a sender transmits identical information encapsulated in data packets to a plurality of receivers. Periodically, receivers submit responses that include control information regarding the loss or receipt of data packets transmitted by the sender. Using these information a sender retransmits any undelivered packets to intended receivers. Responses submitted by the participating receivers, generate a traffic flow that can consume a substantial portion of the network bandwidth. Thus, in embodiments of the invention, the rate at which the responses are submitted is monitored and controlled to minimize control traffic. Over congestion of the network bandwidth with control information is undesirable as it adversely effects the data transmission rate. Thus, in embodiments of the invention, packet loss responses are generated at time intervals. These intervals are adjustable based on the performance of the receivers. A time interval in generation of packet loss information may result in a lower error correction rate. However, since the control traffic that results from the generation of the responses is monitored, the failure states associated with an over congested network bandwidth are minimized.

Growing community of inventors

Mountain View, CA, United States of America

Michael F Speer