Hewlett Packard Enterprise Development LP

Wisconsin Alumni Research Foundation

Chaithan M Prakash

Puneet Sharma

Sujata Banerjee

Yoshio Frank Turner

Charles F Clark

Srinivasa Akella

Joon-Myung Kang

Yadi Ma

Aaron Robert Gember-Jacobson

Junggun Lee

Joon Myung Kang

Raajay Viswanathan

Dave Lenrow

David Lenrow

Example implementations disclosed herein can be used to generate composite network policy graphs based on multiple network policy graphs input by network users that may have different goals for the network. The resulting composite network policy graph can be used to program a network so that it meets the requirements necessary to achieve the goals of at least some of the network users. In one example implementation, a method can include receiving multiple network policy graphs, generating composite endpoint groups based on relationships between endpoint groups and policy graph sources, generating composite paths based on the relationships between the endpoints and the network policy graphs, generating a composite network policy graph based on the composite endpoint groups and the composite paths, and analyzing the composite network policy graph to determine conflicts or errors.

Network policy graphs

An enterprise computer system efficiently adjusts the number of middleboxes associated with the the enterprise, for example, with changes in demand, by transferring not only flows of instructions but also middlebox states associated with those flows. Loss-less transfer preventing the loss of packets and its state, and order-preserving transfer preserving packet ordering may be provided by a two-step transfer process in which packets are buffered during the transfer and are marked to be processed by a receiving middlebox before processing by that middlebox of ongoing packets for the given flow.

Cloud architecture with state-saving middlebox scaling

Growing community of inventors

Madison, WI, United States of America

Chaithan M Prakash