Data-type-based network path configuration
AssigneeHewlett-Packard Development Company, L.P.
InventorsAnand Eswaran, Ravindra Guntur
Life of this patent
Estimating the term…
Abstract
Data-type-based spanning tree reconfiguration includes determining volumes for one or more types of data transmitted in information flows in an existing spanning tree in a network. The spanning tree is reconfigured based on one or more of the volumes and the types of data transmitted in the flows.
Claims18
A method of data-type-based spanning tree reconfiguration in a network, the method comprising:
- identifying different types of data transmitted in each of information flows in a spanning tree in the network, wherein at least one of the information flows includes a plurality of different types of data;
- determining, by a processor, a volume for each of the different types of data transmitted in each of the information flow;
- prioritizing the information flows based on the determined volumes of the different types of data in each information flow, wherein higher volume information flows are given a higher priority;
- and
- reconfiguring the spanning tree based on the priorities of the information flows.
A computer program embedded on a non-transitory computer readable storage medium, the computer program including instructions that when executed by a processor implement a method of data-type-based spanning tree reconfiguration in a network, the method comprising:
- determining flow statistics for information flows in an existing spanning tree in the network, the flow statistics including a volume for each type of data transmitted in each of the information flows, wherein at least one of the information flows includes a plurality of different types of data;
- and
- determining optimum paths for a new spanning tree based on the flow statistics, including:
- prioritizing the information flows based on the volumes for the different types of data in each information flow, wherein higher volume information flows are given a higher priority;
- and
- determining the optimum paths for a new spanning tree based on the priorities.
A node in a network comprising:
- memory storing flow statistics for information flows in an existing spanning tree in the network, the flow statistics including a volume for each type of data transmitted in each of the information flows, wherein at least one of the information flows includes a plurality of different types of data;
- and
- a processor determining optimum paths for a new spanning tree based on the flow statistics, wherein the determining includes:
- prioritizing the information flows based on the volumes for the different types of data in each information flow, wherein higher volume information flows are given a higher priority;
- and
- determining the optimum paths for a new spanning tree based on the priorities.
Dependencies are inferred from the claim text.