EP1867100A1 - Procédé de gestion de décisions, procédé de construction d'un arbre de décision, gestionnaire central, gestionnaire intermédiaire, terminal et produits programmes d'ordinateur correspondants - Google Patents
Procédé de gestion de décisions, procédé de construction d'un arbre de décision, gestionnaire central, gestionnaire intermédiaire, terminal et produits programmes d'ordinateur correspondantsInfo
- Publication number
- EP1867100A1 EP1867100A1 EP06725429A EP06725429A EP1867100A1 EP 1867100 A1 EP1867100 A1 EP 1867100A1 EP 06725429 A EP06725429 A EP 06725429A EP 06725429 A EP06725429 A EP 06725429A EP 1867100 A1 EP1867100 A1 EP 1867100A1
- Authority
- EP
- European Patent Office
- Prior art keywords
- rank
- tree
- decision
- manager
- terminal
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Withdrawn
Links
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L41/00—Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
- H04L41/16—Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks using machine learning or artificial intelligence
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L41/00—Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
- H04L41/08—Configuration management of networks or network elements
- H04L41/0893—Assignment of logical groups to network elements
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L41/00—Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
- H04L41/08—Configuration management of networks or network elements
- H04L41/0894—Policy-based network configuration management
Definitions
- Decision management method decision tree construction method, central manager, intermediate manager, terminal and corresponding computer program products.
- the field of the invention is that of decision trees.
- the invention relates to a decision management method between a central manager and at least one terminal within a distributed network architecture and hierarchical N levels, with N> 2. It is assumed that the central manager is understood in a level of rank N and that the terminals are included in a level of rank 1.
- a decision tree is constructed from a set of rules, which define a decision policy, and from a set of variables comprising a subset of explanatory variables (measurable variables) and a subset of target variables (variables to be deduced).
- the invention applies in particular, but not exclusively, to a network architecture in which a network operator wishes to implement a decision policy, such as for example a mobility decision policy, security or even quality of service.
- the object of the invention is to enable a network operator to implement rules based handover policies that the operator defines himself.
- the invention applies in all types of data network and is independent of the access network technology (GPRS ("General Packet Radio Service", ie "general packet radio service") , Universal Mobile Telecommunications System (UMTS), Wireless Local Area Network (WLAN), Ethernet, etc. ).
- GPRS General Packet Radio Service
- UMTS Universal Mobile Telecommunications System
- WLAN Wireless Local Area Network
- Ethernet etc.
- a mobility manager implementing handover control over the network is presented in Y. Khouaja, K, "Hierarchical Mobility Controlled by the Network” (or “Hierarchical Mobility Controlled by the Network” in French). Guillouard, P. Bertin and JM. Bonnin, published in “Multiaccess, Mobility and Teletraffic for Wireless Communications” published in 2002 by Kluwer Academi Publishers.
- This document defines a mobility manager that has the ability to initiate and guide the execution of a handover, based on information transmitted by the operator, the network and the mobile nodes.
- This mobility manager is located in a cellular network and makes it possible to choose target cells according to the radio data (measurements reported by the mobiles), network (load, type of traffic, quality of service) and operator (subscriber profiles, network parameters, trip thresholds, operating status of access points).
- Each mobility manager manages a set of radio cells (i.e., an access point set). The operation of the mobility manager is described below.
- the mobility manager (GM) transmits to the mobile node (mobile terminal), a list of neighboring access points (PA).
- the mobile node (NM) transmits to the mobility manager, the quality measurements of the radio link.
- the mobile node requests the mobility manager to change the access point without specifying the new target access point.
- the mobility manager selects the target access point by consulting its database (BD).
- BD database contains various information that can assist handover decision making.
- the mobility manager manages the access point change, by transmitting the data packets to the mobile node, simultaneously to the two access points involved in the handover, as soon as the mobility manager knows about the access point. imminent execution of handover. This duplication of data limits the loss of data packets.
- the mobility manager described above enables implementation of rule-based mobility management that the network operator defines.
- This known technique has several disadvantages.
- the centralization of a mobility manager has the disadvantage of reassembling information from one or more hierarchical levels to the central point, which increases the implementation time.
- handover decisions are made for all terminals that must move, which makes the implementation time proportional to the number of terminals to be moved.
- the number of terminals is very important and therefore the implementation time too.
- the travel time of a decision tree is proportional to the number of information contained in the tree.
- the number of information to be taken into account is very important.
- the hierarchical structure of the management of the policy influences the writing of the rules of policy (in particular, in case of change of hierarchical structure without change of policy, one must rewrite the rules).
- no decision tree distribution means is described.
- the invention particularly aims to overcome these disadvantages of the state of the art.
- one of the objectives of the present invention is to provide a technique for constructing a decision tree containing a decision policy to be implemented within a distributed and hierarchical architecture, as well as a technique use of this decision tree to execute the decision policy it contains, both of these techniques for optimizing the implementation of the decision policy.
- the invention also aims to provide such techniques that are simple to implement and inexpensive.
- Another objective of the invention in the particular case of a mobility decision policy within a network architecture, is to provide such techniques making it possible to optimize the management of the mobility of the terminals, in particular by decreasing the deadline for making intercellular transfers. 4. Summary of the invention
- a simplified tree may comprise a single leaf.
- the technique of the invention is more efficient than the known technique based on the use of a centralized manager. Indeed, the technique of the invention does not require the reassembly of information from one or more hierarchical levels to a central manager, since each manager of a given rank level processes information available at this rank. given.
- step b) the simplified tree of rank k-1 is reduced to a leaf node
- step c) the intermediate manager of rank k takes a decision and transmits it to the given terminal, so that the given terminal executes it.
- the transmission of a simplified tree of rank j-1 by a manager of rank j, with je ⁇ N ... 2 ⁇ is based on a simplified global tree structure comprising a linked list elementary structures each defining a given node of the simplified tree of rank j-1 and each comprising: a flag indicating whether, for the simplified tree of rank j-1, the given node is a root node, an intermediate node or a decision node; an identifier of the elementary structure; if the given node is a root node, an intermediate node, or a decision node that is not a leaf node:
- the decision tree comprises, when traversed from a root node to leaf nodes, a sequence of N sets of nodes, a set of nodes of rank i, ie ⁇ N ... 1 ⁇ , supporting on explanatory variables available at rank i level.
- the creation by a manager of rank j of a simplified tree of rank j-1 from a tree of rank j, with je ⁇ N ... 2 ⁇ , is carried out taking into account at least one information that the Rank manager j has at least one predictor available at rank level j.
- the rank manager j When he arrives at a node of the set of nodes of rank j-1 by traversing the tree of rank j, the rank manager j passes the hand to a manager of rank j-1 so that the rank manager j- 1 traverses the simplified tree of rank j-1.
- the transmission of a simplified tree of rank j-1 to a manager of rank j-1, with je ⁇ N ... 2 ⁇ , is carried out by the manager of rank j during a preliminary step distribution of all trees of rank j-1 possible between all managers of rank j-1.
- the decision tree comprises, when it is traversed from a root node to leaf nodes, a sequence of N sets of nodes, a set of nodes of rank i, ie ⁇ N ... 1 ⁇ , based on explanatory variables available at rank i level.
- the transmission of a simplified tree of rank j-1 to a manager of rank j-1, with je ⁇ N ... 2 ⁇ , is performed by the manager of rank j only after the rank manager j arrived, by traversing a tree of rank j, on a node of a set of nodes of rank j-1.
- the simplified trees are not distributed a priori but only when necessary during processing, that is to say each time a manager of rank j arrives on a node of rank j-1 ( and at this time sends a simplified tree of rank j-1 to one of the managers of rank j-1
- the decision tree contains a decision policy belonging to the group comprising: mobility decision policies said at least one terminal within the network architecture; QoS decision policies for said at least one terminal within the network architecture; and security decision policies for said at least one terminal within the network architecture.
- the invention relates to the distribution of a decision tree based on a distributed mobility management architecture.
- N 3
- the structure of the tree is decided by the central mobility manager (level 3 manager) and it takes into account the information he has to create simplified trees that he distributes to Access Managers (Tier 2 Managers). They are doing the same job of distributing simplified trees to terminals (Tier 1 level) that will apply the information they possess to implement the final mobility decision. All data included in the mobility policy are taken into account locally and do not need to be reported to the central mobility manager. Only the location information of the mobile terminals goes back to the central mobility manager.
- the invention also relates to a method for constructing a decision tree adapted for implementing the aforementioned method for managing decisions between a central manager and at least one terminal, the decision tree being constructed at from a set of rules defining a decision policy to be implemented within a distributed and hierarchical architecture according to N levels, with N> 2, and a set of variables comprising a subset of explanatory variables, the central manager being included in a level of rank N, said at least one terminal being included in a level of rank 1, the method comprising a step of choosing an explanatory variable so as to create a new node of the tree s relying on said explanatory variable, the selection step being iterated starting from a root node to go to leaf nodes, the choice made at each new iteration being performed among the explanatory variables, called free explanatory variables, not already chosen during a previous iteration.
- an explanatory variable available at the highest rank level is selected from among the ranks of the levels where the free explanatory variables are available, so that the decision tree includes when traversed from the root node to leaf nodes, a sequence of N sets of nodes, a set of nodes of rank i, ie ⁇ N ... 1 ⁇ , based on explanatory variables available at the level of rank i.
- the general principle of the invention therefore consists in automatically transforming all the rules of the decision policy into a distributable decision tree, thanks to an appropriate choice of the explanatory variables on which the nodes of the decision tree are based. . More precisely, based on the fact that each of the explanatory variables is available at one of the levels of the architecture (from the most global level to the most local level), the invention proposes to group the nodes from the decision tree into sets of hierarchical nodes according to the hierarchy of the levels of the architecture. Thus, all the nodes of the same set of nodes are based on explanatory variables available at the same level of the architecture. In addition, the nodes closest to the root node rely on explanatory variables available at the most global level.
- the invention makes it possible to rework the rules so as to obtain a distributable decision tree whereas, a priori, the rules mix the two types of parameters and therefore are not distributed as is.
- the fact that the decision tree is distributable makes it possible to distribute the decision tree during the implementation of the aforementioned decision management method (method of executing a decision policy contained in this tree).
- the decision policy belongs to the group comprising: mobility decision policies of said at least one terminal within the network architecture; quality of service decision policies for said at least one terminal within the network architecture; and security decision policies for said at least one terminal within the network architecture.
- the decision policy is a mobility decision policy of the at least one terminal within the network architecture, and the architecture is hierarchical according to the following three levels: a tier 3 level comprising a core network ; a rank 2 level comprising at least two access networks each forming a part of the level of rank 2; a rank level 1 comprising a plurality of terminals each forming a part of the level of rank 1.
- the subset of explanatory variables comprises: at least one variable available at rank 3 and belonging to the group comprising:
- variable defining the access network to which a terminal is connected at least one variable available at rank 2, for each access network, and belonging to the group comprising:
- variable defining the load of an access point to the access network at least one variable available at rank 1, for each terminal connected to a given access network, and belonging to the group comprising: for each access network, a variable defining the availability of the access network; * a variable defining the quality of service required by the terminal;
- the method of constructing a decision tree according to the invention is implemented in the central manager.
- the invention also relates to a method of partial processing of a decision tree by a central manager, within the framework of decision management between a central manager and at least one terminal within a distributed and hierarchical distributed network architecture.
- N levels with N> 2, the central manager being included in a level of rank N, said at least one terminal being included in a level of rank 1.
- the central manager of the invention performs only part of the complete processing of the decision tree, this complete processing being distributed between the central manager, the terminal and, possibly, one or more intermediate managers.
- This distribution of the complete processing makes it possible to avoid the reassembly of all the information to the central manager.
- the fact that the central manager transmits a simplified tree also simplifies the other parts of the complete processing, performed by the terminal and possibly the intermediate manager or managers.
- the central manager first performs a step of constructing the decision tree from a set of rules defining a decision policy to be implemented within said architecture, and a set of variables comprising a subset of explanatory variables, the constructing step comprising a step of choosing an explanatory variable so as to create a new node of the tree based on said explanatory variable, the selection step being iterated starting with from a root node to go to leaf nodes, the choice made at each new iteration being carried out among the explanatory variables, called free explanatory variables, not already chosen during a previous iteration.
- the central manager chooses an explanatory variable available at the level occupying the highest rank among the ranks of the levels where the free explanatory variables are available, so that the decision tree understands, when it travels from the root node to the leaf nodes, a sequence of N sets of nodes, a set of nodes of rank i, ie ⁇ N ... 1 ⁇ , based on explanatory variables available at rank i.
- the invention also relates to a method of partial processing of a decision tree by an intermediate manager of rank m, with me ⁇ Nl ... 2 ⁇ , within the framework of decision management between a central manager and at least one terminal within a distributed network architecture and hierarchical N levels, with N> 3, the central manager being included in a level of rank N, said at least one terminal being included in a level of rank 1.
- the intermediate manager of the invention performs only part of the complete processing of the decision tree.
- the distribution of the complete processing between the different entities (intermediate manager (s), central manager and terminal) makes it possible to avoid the reassembly of all the information to the central manager.
- the fact that the intermediate manager transmits a simplified tree also simplifies the other parts of the complete processing, performed by the terminal and, possibly, the other intermediate manager (s) of lower rank (s).
- the simplified tree of rank m-1 is reduced to a leaf node, then the intermediate manager makes a decision and transmits it to the given terminal, so that the given terminal executes it.
- the invention also relates to a method for partial processing of a decision tree by a terminal, in the context of managing decisions between a central manager and at least said terminal within a distributed and hierarchical network architecture according to N levels, with N> 2, the central manager being included in a level of rank N, the terminal being included in a level of rank 1.
- the terminal performs the following steps: it receives a simplified tree of rank 1 and he makes a decision from the simplified tree of rank 1 and executes it.
- the terminal of the invention performs only part of the complete processing of the decision tree.
- the distribution of the complete processing between the different entities makes it possible to avoid the reassembly of all the information to the central manager.
- the fact that the terminal receives a simplified tree also simplifies the part of the complete processing performed by the terminal.
- the invention also relates to computer program products, downloadable from a communication network and / or recorded on a computer readable medium and / or executable by a processor, for the execution of each of these methods (partial processing method of a decision tree by a central manager, method of partial processing of a decision tree by a manager intermediary of rank m, method of partial processing of a decision tree by a terminal).
- the invention also relates to a central manager for partial processing of a decision tree in the context of decision management between a central manager and at least one terminal within a distributed network architecture hierarchical according to N levels, with N> 2, the central manager being included in a level of rank N, said at least one terminal being included in a level of rank 1.
- the central manager comprises means for constructing the decision tree from a set of rules defining a decision policy to be implemented within said architecture, and a set of variables comprising a subscript. set of explanatory variables.
- the means of construction comprise means for selecting an explanatory variable so as to create a new node of the tree based on said explanatory variable, the means of choice being used iteratively, starting from a root node to go to leaf nodes, the choice made for each new iteration being carried out among the explanatory variables, called free explanatory variables, not already chosen during a previous iteration.
- the means of choice choose an explanatory variable available at the level occupying the highest rank among the ranks of the levels where the free explanatory variables are available, so that the decision tree understands, when it is traversed since the root node to the leaf nodes, a sequence of N sets of nodes, a set of nodes of rank i, ie ⁇ N ... 1 ⁇ , based on explanatory variables available at rank i.
- the invention also relates to an intermediate manager of rank m, with m e
- the intermediate manager further comprises: decision-making means, activated if the simplified tree of rank m-1 is reduced to a leaf node; and means for transmitting the decision taken at the given terminal, so that the given terminal executes it.
- the invention also relates to a terminal for partial processing of a decision tree in the context of decision management between a central manager and at least said terminal within a distributed network architecture hierarchized according to N levels, with N> 2, the central manager being included in a level of rank N, the terminal being included in a level of rank 1.
- the terminal comprises: means for receiving a simplified tree of rank 1; decision-making means from the simplified tree of rank 1; and means for executing a decision taken.
- FIG. 1 presents a flowchart of a particular embodiment of the method according to the invention of construction of a decision tree
- FIG. 2 shows an exemplary decision tree obtained by implementing the construction method of FIG. 1
- FIG. 3 is a generic representation of an elementary structure defining a node of a decision tree according to the invention, making it possible to see the decision tree as a linked list of such elementary structures and thus to transport it
- FIG. 4 presents a flowchart of a particular embodiment of the method according to the invention of executing a decision policy contained in a decision tree obtained by implementing the construction method of FIG. 1;
- FIG. 1 presents a flowchart of a particular embodiment of the method according to the invention of construction of a decision tree
- FIG. 2 shows an exemplary decision tree obtained by implementing the construction method of FIG. 1
- FIG. 3 is a generic representation of an elementary structure defining a node of a decision tree according to the invention, making it possible to see the decision tree as a linked list of such elementary structures and thus to transport it
- FIG. 5 shows an example of a 3-level distributed architecture for mobility management, within which the invention can be implemented;
- Figure 6 shows an example of a rank level decision tree NI;
- FIG. 7 shows an exemplary N-2 rank level decision tree;
- FIG. 8 shows the structure of a central manager according to the invention;
- FIG. 9 shows the structure of an intermediate manager according to the invention;
- Figure 10 shows the structure of a terminal according to the invention. 6.
- the invention therefore relates to a method for constructing a decision tree from, on the one hand, a set of rules defining a decision policy to be implemented within a distributed and hierarchical architecture according to N levels. , N> 2, the level of rank N being the most global level of the architecture and, on the other hand, a set of variables comprising a subset of explanatory variables.
- the invention also relates to a method for executing a decision policy contained in a decision tree obtained by executing such a construction method.
- This method is also called a decision management method between a central manager and at least one terminal within a distributed network architecture hierarchized according to N levels, with N> 2, the central manager being included in a level of rank N , the terminal being included in a level of rank 1.
- the method of constructing the decision tree is based on the following elements: a set V of variables, each with a finite domain; a set R of rules or constraints on these variables; a rules-based deduction system or a constraint satisfaction system if the rules express themselves as constraints capable of ingesting the rules R; a subset Vi of V, called set of explanatory variables (also called measurable variables or inputs); a subset Vo of V, disjoined from Vi, called set of target variables
- the variables of Vi are those specifying the subscription of the terminal (measurable in the client database), the network where the terminal is currently located, the quality of service it obtains. ..
- the variables of Vo are those specifying whether the handover must be performed or not (required handover worth “true” or “false") and, for each available access network, if this network is a possible candidate for the handover or not (network_candidate [x] worth “true” or "iàlse” (false)).
- the method according to the invention of construction of the tree comprises the steps detailed below.
- step 13 of choosing an explanatory variable v among those of Vi.
- This selection step is iterated starting from a root node to go to leaf nodes.
- a step 14 we create a new node of the tree based on the explanatory variable v.
- the deduction system determines the possible values of the explanatory variable v.
- an arc of the decision tree is created by possible value of the explanatory variable v.
- step 12 When all the explanatory variables of Vi have been processed (positive answer to the question of step 12), proceed to a step 18 of recovery of the decision tree in its current unfinalized form. Then, we go to a step 19 during which, for each arc of the decision tree, the deduction system calculates the possible values of the target variables of Vo, and stores them in a sheet of the decision tree. .
- the end step is referenced 191.
- the decision tree includes, when traversed from the root node to leaf nodes, a sequence of N sets of nodes, a set of nodes of rank i, ie ⁇ N, NI ... 1 ⁇ , based on available explanatory variables at rank level i.
- the choice criterion mentioned above is that (or one of those available at the level ranking highest among the ranks of the levels where the free explanatory variables are available) is for example implemented. as follows.
- Each of the explanatory variables of Vi is associated with a value corresponding to the rank of the level of the architecture where it is available.
- the global variables are associated with the smallest value - 0 - and the local variables at the terminal are associated with the highest value.
- This choice being arbitrary, one can also consider a variant in which the global variables are associated with the highest value.
- Several variables can be associated with the same value (which means that they are available in the same level of the architecture).
- the choice of an explanatory variable v among those of Vi is made taking into account the values associated with the explanatory variables.
- the explanatory variable chosen is that (or one of those) associated with the smallest value among the set of values associated with the explanatory variables.
- the most comprehensive explanatory variables are chosen primarily.
- variable “Subscription” value 0 (rank level 3 architecture), variable available at the heart of the network
- - “Current network” variable value 0 (level 3 of the architecture), variable available at the heart of the network
- variable "AP wlan load” value 1 (level 2 of the architecture), variable available in the WLAN access network
- variable "Availability [umts]” value 2 (level 1 of the architecture), variable available at the terminal
- - variable "Availability [wlan]” value 2 (level 1 of the architecture), variable available at the terminal
- variable “QoS required” value 2 (level 1 of the architecture), variable available at the terminal
- “Current quality” variable value 2 (level 1 of the architecture), variable available at the terminal
- variable "WLAN quality” value 2 (level 1 of the architecture), variable available at the terminal).
- FIG. 2 shows an example of a decision tree obtained by implementing the construction method of FIG. 1, in the particular case of mobility management and with a three-level architecture.
- a sequence of 3 sets of nodes can be seen, comprising: a first set 21 of rank 3 nodes, based on explanatory variables available at level 3 of the architecture (global level); a second set 22 of rank 2 nodes, based on explanatory variables available at level 2 of the architecture (intermediate level); a third set 23 of rank 1 nodes, based on explanatory variables available at level 1 of the architecture (local level).
- NEXT :: OPERATION (TREE DECISION
- EMPTY) OPERATION :: (OPERATOR T1 DOMAIN)
- OPERATOR T2 :: LOWER
- a decision tree can be seen as a linked list of elementary structures each defining a given node of the tree.
- the transport of the tree then simply consists in transmitting all the elementary structures of the linked list.
- Figure 3 is a generic representation of an elementary structure, defining a given node. It comprises a flag 31, an identifier 32 of the elementary structure, at least one variable 33, an operation 34 to be performed on each variable and a field "next elementary structure" 35.
- the identifier 32 of the elementary structure (called “NODE” in the BNF grammar above) is for example obtained by taking the content of the flag and, in the case where the flag indicates "DECISION” or "ELEMENT", a number order for the type of flag concerned. Thus, one obtains for example identifiers such as: ROOT, ELEMENT 2, DECISION 5 ... (see annexes E and F discussed below, in which the first indicated field corresponds to the identifier of the elementary structure; for the sake of simplification, the flag field has not been indicated in these appendices because it is included in the identifier field).
- the variable or variables 32 (called "DATA” in the BNF grammar above) are the parameter (s) that must be considered in this elementary structure.
- an explanatory variable this may be the quality of a radio link, the availability of an interface of a terminal, etc.
- different values can lead to different directions in the decision tree.
- the operation 34 to be performed on each variable is for example defined either with the combination of the fields “OPERATOR T1" 34a and “DOMAIN” 34b, or with the combination of the fields “OPERATOR T2" 34a 'and “DATA” 34b' (DATA 'being another variable, with which the variable considered DATA is compared).
- next elementary structure 35 contains either the identifier of the elementary structure defining the next node of the tree (content 351 called
- the elementary structure comprises an explanatory variable (referenced field 33) and an operation to be performed on the explanatory variable, constituting a test on the value of the explanatory variable (fields referenced 34).
- the referenced field 35 contains the identifier of the elementary structure defining the next node of the simplified tree of rank j-1. This is the case, for example, of the elementary structures "Racine”, “Decision 9", "Decision
- the elementary structure comprises at least one target variable and for each target variable, an operation relating to the target variable, constituting the supply of a value of the target variable.
- the referenced field 35 contains the end indicator "Empty". This is the case, for example, of the elementary structures "Decision 1" to
- FIG. 4 shows a particular embodiment of the method according to the invention of executing, within an architecture, a decision policy contained in a distributable decision tree (obtained by setting implementation of the construction method of Figure 1).
- N 3, that is to say that the architecture is distributed and prioritized according to 3 levels.
- the rank 3 level the most global of the architecture, includes the central manager who builds the complete decision tree, called a rank 3 tree.
- the rank 2 level includes several parts each comprising an intermediate manager (rank 2).
- Rank level 1 includes terminals.
- the method comprises the steps described below.
- the central manager creates a simplified tree of rank 2 from the rank tree of rank 3, then transmits it to an intermediate manager.
- the intermediate manager creates a simplified tree of rank 1 from the simplified tree of rank 2, then transmits it to the terminal.
- the terminal makes a decision from the simplified tree of rank 1 and executes it.
- the architecture is distributed and prioritized according to two levels.
- the central manager directly creates a simplified tree of rank 1 from the complete decision tree, then transmits it directly to the terminal, so that the terminal makes a decision from this simplified tree of rank 1 and the 'executed.
- each intermediate manager of a given rank transmits a simplified tree to the manager of the lower rank, until we reach an intermediate manager of rank 2, who transmits a simplified tree to the terminal.
- FIGS. 5 to 7 show a particular embodiment of the two methods according to the invention (method for constructing a distributable decision tree and corresponding execution method, with distribution of the tree).
- handover the passage of a mobile terminal of an access network to another access network of the same technology or not. This intercell transfer is decided and ordered by the central mobility manager.
- This architecture comprises: a tier 3 level comprising a core network 51 itself comprising a central mobility manager GM; a rank level 2 comprising two access networks 52, 53 (each access network forms part of the level of rank 2).
- Each of the access networks itself comprises an access manager GA1, GA2; and a rank level 1 comprising a plurality of mobile terminals.
- a single mobile terminal TM is shown in FIG.
- the GM central mobility manager includes a PD-GM decision point that updates an R-GM database and builds distributed decision trees based on the information stored in that database.
- the R-GM database of the central mobility manager GM contains all the information necessary for the implementation of the mobility management policy as well as the global or / and static data as defined for example in Appendix A hereof. - after.
- the access managers GA1, GA2 provide the connection to the access networks 52, 53 via the core network 51.
- Each access manager GA1, GA2 comprises a decision point PD-GA1, PD-GA2 which implements the simplified decision trees received from the central mobility manager GM taking into account local information stored in a database R-GA1, R-GA2.
- the database R-GA1, R-GA2 of an access manager GA1, GA2 contains the local information of the access network 52, 53 concerned, as defined for example in Appendix B.
- Access points PA1, PA2 secure the attachment of the mobile terminals TM to an access manager GA1, GA2 and are connected to a router of an access network.
- Each mobile terminal TM contains a PD-TM decision point and an R-TM database.
- the PD-TM decision point of a mobile terminal implements the simplified decision tree received from one of the access managers GA1, GA2 taking into account local information stored in the database R-TM.
- the terminal's R-TM database contains the local terminal information as defined, for example, in Appendix C.
- the central mobility manager GM does not completely make the handover decision for each terminal.
- the GM Central Mobility Manager database does not contain all terminal and access point information belonging to specific access networks.
- the central mobility manager GM has all the knowledge to elaborate the decision trees for the management of handoffs (the algorithm, the rules, the policies for a handover). These trees have been administratively accepted by all member access networks.
- the base of data of the central mobility manager GM contains static information (subscription, preferences ...) and global information of the access networks.
- the main task of the central mobility manager GM is to consult his database to generate decision trees and distribute them to the access managers GA1, GA2 according to the location of the terminals (an access manager receives only the simplified trees corresponding to the terminals that are located in its access network).
- Each access manager has a decision point PD-GA1, PD-GA2 and a database R-GA1, R-GA2.
- the decision point contains the simplified decision trees provided by the central mobility manager GM.
- the database R-GA1, R-GA2 contains the local information of the access network and some information relating to the terminals present in the access network.
- the decision point consults its database and follows the simplified decision trees. The result of this journey is transmitted to the mobile terminals. This result can be either a simplified decision tree or a handover decision.
- Each TM terminal has a PD-TM decision point and an R-TM database.
- the decision point contains the decision tree or decision provided by one of the access managers GA1, GA2.
- the R-TM database contains the local information of the terminal.
- the PD-TM decision point consults its R-TM database and follows the decision tree and executes the handover decision.
- a mobility management policy can be represented by a set of rules chosen for example from those listed in Appendix D. The choice and prioritization of some of these rules (some are exclusive) make it possible to define a global mobility policy.
- a particular implementation implements for example a set of five rules (see rules 1 to 5 below) which are transformed into decision tree by the construction method defined by the invention (and implemented in a software called COP (Compiler and Propositional Optimizer) which integrates its own deduction engine).
- the rule language supported by the COP software has been found to be sufficient for carrying out the invention within the mobility described herein.
- the final decision must whether a handover is required and if so to which access network.
- the access networks are for example a WLAN 52 and a UMTS 53 network.
- Rule 1 an access network is a candidate if it is available
- a WLAN access network is not a candidate if the quality perceived by the terminal to the access point is less than 2 on a scale of 1 to 5.
- Rule 3 Handover is required if the terminal is on a WLAN and the perceived quality on the WLAN is less than 2 on a scale of 1 to 5.
- Rule 4 Handover is required if the terminal is on a network. cellular network and if the quality of service required is a WLAN QoS.
- Rule 5 A handover is necessary if the terminal is on an access network
- WLAN has a non-priority subscription (hereinafter referred to as "Bronze subscription” as opposed to a “Gold subscription” for a priority subscription) and if the access point charge is equal to 2 on a scale of 1 to 5.
- the complete tree (also called N-rank tree) corresponding to these rules, generated by the COP software, has 42 sheets and 124 nodes. It has a maximum depth of
- four simplified trees (also called reduced trees) of rank N1 are obtained: if we have a terminal whose subscription is bronze and whose current access network is the WLAN, we obtain a first reduced tree of rank NI of 18 leaves and 5 deep; - for a bronze subscription and a UMTS current access network, a second reduced tree of rank N1 of 12 sheets and a depth of 4 is obtained; for a gold subscription and a WLAN access network, a third reduced tree of rank N1 of 12 sheets and a depth of 4 is obtained; for a gold subscription and a UMTS current access network, we obtain a fourth reduced-rank tree with a rank of 12 sheets and a depth of 4. It is these reduced trees of rank NI which are transmitted to the access managers GA1, GA2 .
- Figure 6 illustrates this first reduced tree of rank N-I.
- the first reduced tree of rank NI which comprises 35 nodes (of which 1 root node and 18 leaf nodes) is described with only the following 19 elementary structures: an elementary structure (whose identifier is "root” in Annex E) defining a root node referenced R; eight elementary structures (whose identifiers are "Element 1" to "Element 8" in Appendix E) defining intermediate nodes referenced E1 to E8; and ten elementary structures (whose identifiers are "Decision 1" to "Decision
- N-2 trees it is possible to use a limited number of elementary structures (less than the number of nodes to be defined) because several nodes are defined with the same elementary structure. For example, three nodes E3 are defined with the same elementary structure whose identifier is "Element 3".
- the formation of N-2 trees is now presented.
- a parameter explanatory variable
- the access manager GA1 it is the load parameter ("AP load wlan").
- the access manager makes an access network change decision or sends the terminal a reduced tree of rank N-2.
- Appendix F describes the messages which describe, based on the notion of elementary structure described above in relation to FIG. 3, the reduced tree of rank N-2 corresponding to the case where the The variable "AP wlan load" is set to 2.
- FIG. 7 illustrates this reduced rank tree N-2, which corresponds to a portion of the rank tree NI of FIG. 6. This part is referenced 61 in FIG. In this FIG.
- FIG. 8 shows the structure of a central manager according to the invention, which comprises a memory M 81, and a processing unit 80 equipped with a microprocessor ⁇ P, which is controlled by a computer program (or application) Pg 82.
- a decision policy for example a mobility management policy
- FIG. 9 shows the structure of an intermediate manager according to the invention, which comprises a memory M 91, and a processing unit 90 equipped with a microprocessor ⁇ P, which is controlled by a computer program (or application) Pg
- Processing unit 90 receives simplified trees from the manager of higher rank (central manager or other intermediate manager), the microprocessor ⁇ P processes, according to the instructions of the program Pg 92, to generate simplified trees 94, which are transmitted to lower intermediate managers or terminals, depending on the position the intermediate manager considered within the hierarchical architecture.
- FIG. 10 shows the structure of a terminal according to the invention, which comprises a memory M 101, and a processing unit 100 equipped with a microprocessor ⁇ P, which is controlled by a computer program (or application) Pg 102
- the processing unit 100 receives simplified trees from the higher rank manager (central manager or intermediate manager), that the microprocessor ⁇ P processes, according to the instructions of the program Pg 102, to make a decision and execute it. The result of this execution is symbolized by the arrow referenced 104.
- Appendix A Global Data Located in the GM Base
- Appendix B Local Data to Access Networks in GA Bases
- Appendix C Terminal Local Data located in the Terminal Database.
- Appendix D Sample Rules Implemented in a Mobility Management Policy
- Appendix E Messages (Basic Structures) that describe the first reduced-rank tree (bronze subscription and WLAN access network).
- Appendix F messages (elementary structures) describing the reduced tree of rank N-2 corresponding to the case where the variable "load AP wlan" takes the value 2.
Abstract
Description
Claims
Applications Claiming Priority (2)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
FR0503328A FR2883997A1 (fr) | 2005-04-04 | 2005-04-04 | Procede de gestion de decisions, procede de construction d'un arbre de decision, gestionnaire central, gestionnaire intermediaire, terminal et produits programmes d'ordinateur correspondants |
PCT/EP2006/061176 WO2006106067A1 (fr) | 2005-04-04 | 2006-03-30 | Procédé de gestion de décisions, procédé de construction d'un arbre de décision, gestionnaire central, gestionnaire intermédiaire, terminal et produits programmes d'ordinateur correspondants |
Publications (1)
Publication Number | Publication Date |
---|---|
EP1867100A1 true EP1867100A1 (fr) | 2007-12-19 |
Family
ID=35355694
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
EP06725429A Withdrawn EP1867100A1 (fr) | 2005-04-04 | 2006-03-30 | Procédé de gestion de décisions, procédé de construction d'un arbre de décision, gestionnaire central, gestionnaire intermédiaire, terminal et produits programmes d'ordinateur correspondants |
Country Status (4)
Country | Link |
---|---|
US (1) | US7991869B2 (fr) |
EP (1) | EP1867100A1 (fr) |
FR (1) | FR2883997A1 (fr) |
WO (1) | WO2006106067A1 (fr) |
Families Citing this family (19)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
FR2900014A1 (fr) * | 2006-04-18 | 2007-10-19 | France Telecom | Procede de construction dynamique d'un graphe de decision, equipement de communication, produit programme d'ordinateur et signaux correspondants |
CN101193117B (zh) * | 2006-11-28 | 2011-11-02 | 华为技术有限公司 | 终端之间互通的方法、接入网及无线网络 |
EP2243305B1 (fr) * | 2008-02-15 | 2020-01-08 | Telefonaktiebolaget LM Ericsson (publ) | Noeud de contrôle pour un réseau de communication mobile et procédé d'affectation de ressources dans ledit réseau |
US8495074B2 (en) | 2008-12-30 | 2013-07-23 | Apple Inc. | Effects application based on object clustering |
GB2502168A (en) * | 2011-12-14 | 2013-11-20 | Seven Networks Inc | Wireless traffic optimisation defined by hierarchy of global, device dependent and user dependent policies |
US8799460B2 (en) * | 2012-03-20 | 2014-08-05 | Cellco Partnership | Method and system of providing a summary of web application performance monitoring |
US9275334B2 (en) * | 2012-04-06 | 2016-03-01 | Applied Materials, Inc. | Increasing signal to noise ratio for creation of generalized and robust prediction models |
US9542376B2 (en) * | 2013-12-11 | 2017-01-10 | Sehul S. SHAH | System and method for creating, editing, and navigating one or more flowcharts |
US20160366621A1 (en) * | 2015-06-11 | 2016-12-15 | Qualcomm Incorporated | Handling mobility events in a multi subscriber identity module multi standby mobile communication device |
US9888039B2 (en) * | 2015-12-28 | 2018-02-06 | Palantir Technologies Inc. | Network-based permissioning system |
EP3422245B1 (fr) * | 2017-06-28 | 2022-02-16 | NXP USA, Inc. | Procédés, moteurs de traitement et microprocesseurs de classification de données selon des arbres de décision |
US10027551B1 (en) | 2017-06-29 | 2018-07-17 | Palantir Technologies, Inc. | Access controls through node-based effective policy identifiers |
US10592517B2 (en) * | 2017-08-16 | 2020-03-17 | Arm Limited | Ranking items |
US10142349B1 (en) | 2018-02-22 | 2018-11-27 | Palantir Technologies Inc. | Verifying network-based permissioning rights |
US10255415B1 (en) | 2018-04-03 | 2019-04-09 | Palantir Technologies Inc. | Controlling access to computer resources |
CN108989083B (zh) * | 2018-06-01 | 2021-02-09 | 安徽师范大学 | 云环境下基于混合策略的故障检测性能优化方法 |
US11244063B2 (en) | 2018-06-11 | 2022-02-08 | Palantir Technologies Inc. | Row-level and column-level policy service |
US11704441B2 (en) | 2019-09-03 | 2023-07-18 | Palantir Technologies Inc. | Charter-based access controls for managing computer resources |
CN111310933B (zh) * | 2020-02-11 | 2024-02-02 | 深圳前海微众银行股份有限公司 | 特征依赖图计算优化方法、装置、设备及可读存储介质 |
Family Cites Families (8)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US6609205B1 (en) * | 1999-03-18 | 2003-08-19 | Cisco Technology, Inc. | Network intrusion detection signature analysis using decision graphs |
US6996843B1 (en) * | 1999-08-30 | 2006-02-07 | Symantec Corporation | System and method for detecting computer intrusions |
US6591257B1 (en) * | 1999-12-23 | 2003-07-08 | Hewlett-Packard Development Company | Apparatus and method for a compositional decision support reasoning system |
US20020078431A1 (en) * | 2000-02-03 | 2002-06-20 | Reps Thomas W. | Method for representing information in a highly compressed fashion |
US6704719B1 (en) * | 2000-09-27 | 2004-03-09 | Ncr Corporation | Decision tree data structure for use in case-based reasoning |
US7072958B2 (en) * | 2001-07-30 | 2006-07-04 | Intel Corporation | Identifying network management policies |
KR100691537B1 (ko) * | 2001-12-03 | 2007-03-09 | 노키아 코포레이션 | 이동-노드 논리 트리 정보를 검색하기 위한 장치 및관련된 방법 |
CN1160899C (zh) * | 2002-06-11 | 2004-08-04 | 华中科技大学 | 分布式网络动态安全保护系统 |
-
2005
- 2005-04-04 FR FR0503328A patent/FR2883997A1/fr active Pending
-
2006
- 2006-03-30 EP EP06725429A patent/EP1867100A1/fr not_active Withdrawn
- 2006-03-30 WO PCT/EP2006/061176 patent/WO2006106067A1/fr active Application Filing
- 2006-03-30 US US11/910,695 patent/US7991869B2/en not_active Expired - Fee Related
Non-Patent Citations (2)
Title |
---|
None * |
See also references of WO2006106067A1 * |
Also Published As
Publication number | Publication date |
---|---|
WO2006106067A1 (fr) | 2006-10-12 |
US7991869B2 (en) | 2011-08-02 |
US20090119392A1 (en) | 2009-05-07 |
FR2883997A1 (fr) | 2006-10-06 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
EP1867100A1 (fr) | Procédé de gestion de décisions, procédé de construction d'un arbre de décision, gestionnaire central, gestionnaire intermédiaire, terminal et produits programmes d'ordinateur correspondants | |
EP3474619B1 (fr) | Procédé d'allocation de ressources de transmission à apprentissage par renforcement | |
Quang et al. | Multi-domain non-cooperative VNF-FG embedding: A deep reinforcement learning approach | |
FR2983610A1 (fr) | Reseau de communication a trafic de connexion ameliore | |
Kim et al. | Economics of fog computing: interplay among infrastructure and service providers, users, and edge resource owners | |
EP3979717A1 (fr) | Méthode d'association d'équipements d'utilisateurs dans un réseau cellulaire selon une politique d'association transférable | |
EP1387538B1 (fr) | Dispositif et procédé de détermination de chemins de routage dans un réseau de communications, en présence d'attributs de sélection | |
EP2226970A1 (fr) | Procédé dans un environnement de réseaux interconnectés de communication, de sélection d'une chaîne de contrats de service | |
Nguyen et al. | Efficient virtual network embedding with node ranking and intelligent link mapping | |
EP1280305B1 (fr) | Procédé de sélection de chemins de transmission et réseau de communication mettant en oeuvre ce procédé | |
FR2855287A1 (fr) | Procede de calcul du plus court chemin dans un graphe | |
EP3057267B1 (fr) | Procede pour generer des groupes au sein d'un reseau radio ad hoc | |
FR2850472A1 (fr) | Procede permettant de produire des solutions a un probleme concret d'optimisation multicritere | |
EP1624709B1 (fr) | Procédé et système pour l'exploition d'un réseau cellulaire de communications mobiles | |
EP1162799A1 (fr) | Procédé de gestion d'un réseau de télécommunications et unité de gestion de réseau pour la mise en oevre du procédé | |
Asghari et al. | Zero-rating Internet platforms formation: a game theoretic analysis | |
EP1355449B1 (fr) | Procédé et système de détermination des paramètres de fonctionnement d'un réseau de transmission d'informations pour créer, dans ce réseau, un réseau virtuel | |
EP2008489B1 (fr) | Gestion de flux applicatifs dans des réseaux mobiles | |
EP4075758A1 (fr) | Procédé pour optimiser le trafic entre systèmes autonomes | |
CN105610726B (zh) | 一种增强Internet核心网流量稳定性的BT流量优化方法 | |
WO2022208017A1 (fr) | Procede, dispositif et systeme de mise a disposition d'une ressource de communication | |
Zia et al. | A Simulation Study of Social-Networking-Driven Smart Recommendations for IoV | |
Zia et al. | A Simulation Study of Social-Networking-Driven Smart Recommendations for Internet of Vehicles | |
FR2835988A1 (fr) | Procede et systeme pour ajuster des valeurs de parametres de controle d'un reseau de facon optimale | |
FR3129553A1 (fr) | Dispositif et procédé de configuration dynamique de la planification de transmission des flux dans les réseaux déterministes |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
PUAI | Public reference made under article 153(3) epc to a published international application that has entered the european phase |
Free format text: ORIGINAL CODE: 0009012 |
|
17P | Request for examination filed |
Effective date: 20070919 |
|
AK | Designated contracting states |
Kind code of ref document: A1 Designated state(s): AT BE BG CH CY CZ DE DK EE ES FI FR GB GR HU IE IS IT LI LT LU LV MC NL PL PT RO SE SI SK TR |
|
DAX | Request for extension of the european patent (deleted) | ||
17Q | First examination report despatched |
Effective date: 20090727 |
|
RAP1 | Party data changed (applicant data changed or rights of an application transferred) |
Owner name: ORANGE |
|
GRAP | Despatch of communication of intention to grant a patent |
Free format text: ORIGINAL CODE: EPIDOSNIGR1 |
|
INTG | Intention to grant announced |
Effective date: 20171013 |
|
STAA | Information on the status of an ep patent application or granted ep patent |
Free format text: STATUS: THE APPLICATION IS DEEMED TO BE WITHDRAWN |
|
18D | Application deemed to be withdrawn |
Effective date: 20180224 |