Network management system, network, method and computer program product
View Patent ↗Known network management systems for managing traffic signals in a network store node/link parameter signals and traffic parameter signals and calculate solutions defining intermediate nodes/links situated between sources and destinations for transporting said traffic signals from said sources to said destinations via said intermediate nodes/links and calculate route information per solution. By storing node/link parameter signals and traffic parameter signals for several situations (like several predictions in the future) and calculating solutions for each situation and then selecting a solution per situation, the network management system will manage the network more advantageously, especially when solutions are compared with each other, and when a solution is selected per situation in dependence of comparison results (comprising similarities/differences between solutions of different situations). Said route information may comprise link load parameters and/or resource consumption parameters and/or fairness parameters and/or throughput parameters.
1. A network management system for managing traffic signals in a network comprising nodes/links, said network management system comprising:
a memory for storing node/link parameter signals defining nodes/links and for storing traffic parameter signals defining said traffic signals to be transported via nodes/links;
a calculator coupled to said memory for calculating solutions defining intermediate nodes/links situated between sources and destinations for transporting said traffic signals from said sources to said destinations via said intermediate nodes/links and for calculating route information per solution;
a comparator coupled to said calculator for:
comparing solutions of a same situation with each other, wherein comparing includes determining an amount of path amendments between one or more pairs of solutions; and
comparing solutions of different situations with each other, wherein comparing includes determining an amount of path amendments between one or more pairs of solutions related to different situations; and
a selector coupled to said comparator for selecting a solution per situation based on at least one comparison result of the comparing solutions of the same situation and at least one comparison result of the comparing solutions of different situations,
wherein said memory comprising node/link parameter signals and traffic parameter signals for several situations and said calculator calculates respective solutions for each situation,
wherein each of said several situations corresponds with a prediction in the future related to said traffic signals being transported from at least one node to at least one other node, and
wherein the route information comprises at least link load data and resource consumption data.
2. The network management system according to claim 1 , wherein the at least one comparison result comprises similarities/differences between solutions of different situations.
3. The network management system according to claim 1 , wherein said network management system comprises a processor which comprises at least one of said calculator, selector and comparator.
4. The network management system according to claim 1 , wherein said route information comprises at least one of link load parameters, resource consumption parameters, fairness parameters and throughput parameters.
5. A network comprising nodes/links and at least one network management system for managing traffic signals in said network, said network management system comprising:
a memory for storing node/link parameter signals defining nodes/links and for storing traffic parameter signals defining said traffic signals to be transported via nodes/links;
a calculator coupled to said memory for calculating solutions defining intermediate nodes/links situated between sources and destinations for transporting said traffic signals from said sources to said destinations via said intermediate nodes/links and for calculating route information per solution;
a comparator coupled to said calculator for:
comparing solutions of a same situation with each other, wherein comparing includes determining an amount of path amendments between one or more pairs of solutions; and
comparing solutions of different situations with each other, wherein comparing includes determining an amount of path amendments between one or more pairs of solutions related to different situations; and
a selector coupled to said comparator for selecting a solution per situation based on at least one comparison result of the comparing solutions of the same situation and at least one comparison result of the comparing solutions of different situations,
wherein said memory comprises node/link parameter signals and traffic parameter signals for several situations, and said calculator calculates respective solutions for each situation,
wherein each of said several situations corresponds with a prediction in the future related to said traffic signals being transported from at least one node to at least one other node, and
wherein the route information comprises at least link load data and resource consumption data.
6. A method for managing traffic signals in a network comprising nodes/links, said method comprises:
calculating solutions defining intermediate nodes/links situated between sources and destinations for transporting said traffic signals from said sources to said destinations via said intermediate nodes/links;
calculating route information per solution, with node/link parameter signals defining the nodes/links and traffic parameter signals defining said traffic signals to be transported via nodes/links being stored in a memory;
comparing solutions of a same situation with each other, wherein comparing includes determining an amount of path amendments between one or more pairs of solutions;
comparing solutions of different situations with each other, wherein comparing includes determining an amount of path amendments between one or more pairs of solutions related to different situations; and
selecting a solution per situation based on at least one comparison result of the comparing solutions of the same situation and at least one comparison result of the comparing solutions of different situations,
wherein said memory comprises the node/link parameter signals and traffic parameter signals for several situations, and respective solutions being calculated for each situation,
wherein each of said several situations corresponds with a prediction in the future related to said traffic signals being transported from at least one node to at least one other node, and
wherein the route information comprises at least link load data and resource consumption data.
7. A non-transitory computer-readable medium having computer program instructions stored thereon for managing traffic signals in a network comprising nodes/links, which when executed by a processor coupled to a memory for storing node/link parameter signals defining nodes/links and for storing traffic parameter signals defining said traffic signals to be transported via nodes/links, cause the processor to perform a method comprising:
calculating solutions defining intermediate nodes/links situated between sources and destinations for transporting said
traffic signals from said sources to said destinations via said intermediate nodes/links;
calculating route information per solution;
comparing solutions of a same situation with each other, wherein comparing includes determining an amount of path amendments between one or more pairs of solutions;
comparing solutions of different situations with each other, wherein comparing includes determining an amount of path amendments between one or more pairs of solutions related to different situations; and
selecting a solution per situation based on at least one comparison result of the comparing solutions of the same situation and at least one comparison result of the comparing solutions of different situations,
wherein said memory comprises node/link parameter signals and traffic parameter signals for several situations, such that respective solutions are calculated for each situation,
wherein each of said several situations corresponds with a prediction in the future related to said traffic signals being transported from at least one node to at least one other node, and
wherein the route information comprises at least link load data and resource consumption data.
8. The network management system according to claim 1 , wherein said prediction in the future relates to a point in time in the future.
9. The network according to claim 5 , wherein said prediction in the future relates to a point of time in the future.
10. The method according to claim 6 , wherein said prediction in the future relates to a point of time in the future.
11. The non-transitory computer-readable medium according to claim 7 , wherein said prediction in the future relates to a point of time in the future.
12. The network management system according to claim 1 , wherein said selector selects said solution per said respective situation based on a number of path amendments required to transition from one situation to another situation.
13. The network according to claim 5 , wherein said selector selects said solution per said respective situation based on a number of path amendments required to transition from one situation to another situation.
14. The method according to claim 6 , wherein said selector selects said solution per said respective situation based on a number of path amendments required to transition from one situation to another situation.
15. The non-transitory computer-readable medium according to claim 7 , wherein said selector selects said solution per said respective situation based on a number of path amendments required to transition from one situation to another situation.