Determining service links in data communication network
AssigneeECI Telecom Ltd.
InventorsShirel Ezra, Efraim Gelman, Inbal Hecht
Life of this patent
Estimating the term…
Abstract
Techniques for satisfying a plurality of service demands in a data communication network are disclosed. Aspects include identifying a first plurality of edges, each of which connects two of a plurality of nodes in the data communication network, wherein each of the first plurality of edges is associated with one of a plurality of unprotected service demands; generating a spanning tree comprising a second plurality of edges selected from the first plurality of edges, wherein the spanning tree connects all of the plurality of nodes that are connected by the first plurality of edges; and creating a set of service links based on the generated spanning tree.
Claims26
A method for determining communication service links in a data communication network, comprising:
- identifying a plurality of edges, each of which connects two of a plurality of nodes in the data communication network, wherein each of the plurality of edges is associated with one of a plurality of unprotected service demands, wherein each of the plurality of unprotected service demands is associated with a volume of data;
- identifying a volume of data associated with each of the plurality of edges;
- partitioning the plurality of edges into a plurality of edge groups, wherein a sum of volumes of data of edges within each of the plurality of edge groups is equal to or less than a maximum service link capacity, and wherein a total number of duplicated nodes is minimal, and a total volume of data of the plurality of unprotected service demands exceeds the maximum service link capacity;
- generating a spanning tree for each of the plurality of edge groups;
- and
- creating a set of communication service links based on the generated spanning trees.
A system for satisfying demands in a data communication network utilizing a set of communication service links, comprising:
- at least one processor;
- and
- at least one memory containing instructions that, when executed by the at least one processor, cause the system to perform operations comprising:
- identifying a plurality of edges, each of which connects two of a plurality of nodes in the data communication network, wherein each of the plurality of edges is associated with one of a plurality of unprotected service demands, wherein each of the plurality of unprotected service demands is associated with a volume of data;
- identifying a volume of data associated with each of the plurality of edges;
- partitioning the plurality of edges into a plurality of edge groups, wherein a sum of volumes of data of edges within each of the plurality of edge groups is equal to or less than a maximum service link capacity, wherein a total number of duplicated nodes is minimal, and wherein a total volume of data of the plurality of unprotected service demands exceeds the maximum service link capacity;
- generating a spanning tree for each of the plurality of edge groups;
- and
- creating a set of communication service links based on generated spanning trees.
A method for determining communication service links in a data communication network, comprising:
- identifying a first plurality of edges, each of which connects two of a plurality of nodes in the data communication network, wherein each of the first plurality of edges is associated with one of a plurality of unprotected service demands, wherein each of the plurality of unprotected service demands is associated with a volume of data;
- generating a spanning tree comprising a second plurality of edges selected from the first plurality of edges,
- wherein the spanning tree connects all of the plurality of nodes that are connected by the first plurality of edges;
- and
- creating a set of communication service links based on the generated spanning tree, wherein a capacity of each of the set of communication service links is greater than or equal to a total volume of data of the plurality of unprotected service demands.
A system for determining communication service links in a data communication network, comprising:
- at least one processor;
- and
- at least one memory containing instructions that, when executed by the at least one processor, cause the system to perform operations comprising:
- identifying a first plurality of edges, each of which connects two of a plurality of nodes in the data communication network, wherein each of the first plurality of edges is associated with one of a plurality of unprotected service demands, wherein each of the plurality of unprotected service demands is associated with a volume of data;
- generating a spanning tree comprising a second plurality of edges selected from the first plurality of edges,
- wherein the spanning tree connects all of the plurality of nodes that are connected by the first plurality of edges;
- and
- creating a set of communication service links based on the generated spanning tree, wherein a capacity of each of the set of communication service links is greater than or equal to a total volume of data of the plurality of unprotected service demands.
Dependencies are inferred from the claim text.