Patent ID: 8126004

Claim:
Method for optimising the sharing of a plurality of network resources between a plurality of data flows generated by a plurality of applications, said flows being able to take a number n of paths [ABi], i=1 to n, linking at least one site A and at least one site B in a telecommunications network ( 6 ), method characterised in that it comprises: a first phase consisting in determining at each instant t for each flow a value U(t) representing the use by said flow of at least one network resource from among the plurality of network resources available, a value D(t) representing the demand of network resources required and sufficient in order for the flow to satisfy a pre-established performance objective for said application, and a value C(t) representing a constraint limiting the network resource that can be attributed to the flow in question, a second phase consisting in: calculating, according to said values U(t), D(t) and C(t), a value DE(t) representing the quantity of network resources effectively required at an instant t in order to satisfy the performance objective of said flow according to the Constraint C(t), the type of application generating said flow and the type of use of said application, and in calculating according to the different values DE(t), and for each transmission path [ABi], i=1 to n, a value DDE i (t) representing the Effective Demand Density on said path by taking into account all of the flows exchanged between the sites A and B, a third phase consisting in dynamically distributing the flows generated by the different applications between the different paths [ABi], i=1 to n, according to the Effective Demand Densities DDE i (t) on the paths [ABi], i=1 to n.