Hewlett Packard Enterprise Development LP

Yadi Ma

Puneet Sharma

Sujata Banerjee

Yoshio Frank Turner

Junggun Lee

Charles F Clark

Alvin AuYoung

Joon-Myung Kang

Chaithan M Prakash

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

Example implementations disclosed herein can be used to allocate network resources in a software defined network (SDN). In one example implementation, a method can include receiving a plurality of resource allocation proposals from a plurality of controller modules, instructing the controller modules to generate votes for the plurality of resource allocation proposals, and selecting one of the plurality of resource allocation proposals based on the votes to instantiate the selected resource allocation proposal in the SDN.

Network resource allocation proposals

Growing community of inventors

Palo Alto, CA, United States of America

Yadi Ma