CN1251929A - Category filtration: selecting method for managing objects in data tree - Google Patents

Abstract

The invention relates to a new selecting method of managed objects (MO) in the network management system as category layer filtration (CLF). The CLF is performed between the range definition and conventional filter operation, reducing selection of MO in the containing tree of the network management system. The CLF mainly uses category information of MO example to eliminate inappropriate MO from the conventional filter operation, avoiding large resource demand for managed system caused by the conventional filter operation. Moreover, disclosed is a MIT structure with high performance for supporting CLF.

Description

Category filtration: the new system of selection of managed object in the management information tree

The present invention relates to network management system, particularly the choosing of managed object in the network management system of telecommunication management network.

Because the fast development of information and communication technology (ICT), be connected with other communication network and free shared data has become the trend of business.Yet even in the business that the same area is set up, network management platform all has nothing in common with each other because of the standard that depends on enterprise and set up on tissue and communication means.Thereby, need a kind of global network management system of can be effectively and managing various different communication networks collaboratively.

A kind of network management system that the telecommunications management network (tmn) that ITU-T (CCITT) recommends comes to this.The network management system of TMN type provides standard interface for exchange of management information between the communication facilities of the network of different operating system, thereby realizes the unified management to all types communication network.More particularly, TMN system employs object-oriented information modeling technology and supvr/broker concept, this has constituted the basis of Open System Interconnection (OSI) system management.

In the OSI system management, used system operator and agent model, make that the agency can management object.Managed object (MO) generally is will be by the OSI abstract view of the logical OR physical system resource of being managed.The MO class definition attribute particular community collection of object then defined the MO example.The MO example has a lot of relations, and wherein containment relationship is primary relation.Thereby the agency must safeguard contains tree to express the containment relationship between the MO class example.Therefore, contain the starting point of bookkeeping that tree is the agency and the core of MO management.

In the system that TMN managed, all MO examples are all managed in the management information tree of setting up based on containment relationship (MIT).Containment relationship allows a MO example to contain one or more other MO examples, and containing the MO example can be contained by other MO example.Each MO example all uses the unique name based on containment relationship to identify.Manager system specified scope and filter parameter in bookkeeping primitive apply bookkeeping with request to one or more MO examples.

Yet,, need the resource quantity of management increasing because communication network becomes huge and is distributed.Such as, the ATM switch of supporting 60,120 and 240 links in MIT only configuration management just need 7620,15240 and 30480 MO examples approximately respectively.In such MIT, choose the burden that suitable MO example becomes bookkeeping.Yet MIT is the starting point of bookkeeping, and it plays effect when choosing suitable MO.Therefore, the performance of MIT affects network management system greatly.

Especially, MIT requires each MO example an attribute to be arranged as the name attribute.This attribute and institute's assignment thereof constitute relative distinguished name (RDN), and it is unique for all brothers (sibling) MO example.Difference name (DN) is by being connected in sequence from all relative distinguished names of root managed object.So, can carry out single or collectively visit to the MO among the MIT by OO query facility.

As mentioned above, choosing of MO relates to two stages, is respectively scope definition and filtration.Scope definition must identify the managed object that will be filtered.Scope definition is that it will be called basic managed object about a specific MO example appointment.So-called basic managed object is exactly the root of MIT subtree, is the starting point of carrying out scope definition and filtration.

Filtration is one or more set of asserting, it checks whether the property value of the managed object in the confining spectrum exists.Relate to a plurality of asserting if filter, then they are combined with logical operator.If filtrator is tested successfully a given MO, this MO will be selected to manage operation so.Such filtration test is called the MO level and filters (MLF), be conventional filtration, can test equivalence (equality), ordering property (ordering), existence (presence) or the set comparison (set comparison) of property value by it.

When a plurality of MO examples being managed operation, a series of results of being mutually related will return to the manager system.In obtaining this result, scope definition and filter at expressiveness and make the management information exchange amount advantage all be arranged aspect minimizing.Yet conventional scope definition and MLF unnecessary processing may occur and postpone and unnecessary consumption of system resources when carrying out bookkeeping.Concerning MLF, must obtain the property value of MO, and if MO be stored in DB (database) or the file system, when the getattr value, must carry out the operation of DB inquiry or file I/O (I/O).This serious burden that when implementing MLF, the visit of memory device has been become management system.

Such as, a simple MIT as shown in Figure 1 supposes that basic managed object is that { reach is whole subtree (just basic object and all subobjects) for systemId=netjaguar, attrA1=A1}.If there is not the given filter device, all examples that show in this example all will be selected, and any MO not carried out MLF.If the given filter device is attrD2=D22, then all examples in the scope are implemented MLF, and the 4th example is selected to manage operation.In this process, they do not contain the attribute (attrD2) of appointment even first and second examples still will carry out MLF.Thereby this process has comprised unnecessary step when MLF.

One of purpose of the present invention is the problem and shortage that solves correlation technique at least.

One of purpose of the present invention is to improve the performance of network management system.More particularly, one of purpose of the present invention is to improve the speed of MO selection operation in the network management system.

Another object of the present invention is to eliminate unnecessary processing delay and system resources consumption when implementing bookkeeping.More particularly, one of purpose of the present invention is to eliminate unnecessary processing delay and system resources consumption when carrying out the MO selection operation.

Further object of the present invention provides additional filtering to simplify MLF and to provide new MIT structure to support this additional filtering.

Other advantage of the present invention, purpose and characteristic will be set forth in detailed description subsequently, to this, the people with ordinary skill knowledge by to the examination of rear section or from the practice of the present invention study all can be tending towards clear.As specifically noted in the claims, can realize objects and advantages of the present invention.

For achieving the above object, as this place general description, category filtration of the present invention (CLF) is implemented between scope definition and MLF.CLF has utilized the category information of MO to get rid of inappropriate MO example from the MLF operation.For supporting the CLF operation, the present invention also comprises a high performance MIT structure, wherein contains the category information of MO.

The present invention is described in detail below with reference to the accompanying drawings, the object that wherein identical reference number is corresponding identical, wherein:

Fig. 1 is the example of a MIT;

Fig. 2 is the topology example that is used for the category information management;

Fig. 3 A is the example of containment relationship, and Fig. 3 B is the MIT according to containment relationship of the present invention;

Fig. 4 has shown that class according to the present invention concerns example;

Fig. 5 has shown the example of scope definition operation among the present invention;

Fig. 6 has shown the CLF operation example;

Fig. 7 is the CLF module.

As previously mentioned, among the TMN by management interface can with all MO examples be organized into MIT.Consequently the speed that MO is carried out selection operation has influenced the overall performance of network management system greatly.

In the present invention, use category filtration (CLF) to choose MO, it carries out between two stages at scope definition and MLF.Carry out and be not to have replaced MLF in MLF before the CLF.Can think that CLF chooses and additional operation for MO effectively and fast.If specified filtrator, finish at scope definition and to carry out CLF and MLF operation after choosing MO successively.CLF utilizes the filter operation of the category information of MO from routine usually, promptly gets rid of unsuitable MO example among the MLF.

Also comprise a high performance MIT structure among the present invention, in order to support the CLF characteristic.In MIT according to the present invention, the MO example is classified according to its category information.According to the OSI system management, the MO class is defined by several dvielements, such as bag, attribute, operation, notice etc.General, some MO classes may be shared identical dvielement, that is to say that each dvielement can use in a plurality of MO classes.

For administrative class information effectively, category information can be left in the independent structure, be called internal data structure (IDS) (Internal Data Structure), this is for the consideration to dvielement reusability and search time.As shown in Figure 2, the MO category information has been stored the pointer that is included in all bags in this MO class.Equally, in bag, also deposited the pointer of relative all information.Preserved the pointer of " MO category information " (MO class info) among the MIT.Can use this structure to carry out CLF.

Especially, being called the balanced binary search tree and the double linked list of Adelson-Velskii-Landis tree will be as the data structure of storage class element information.For example, to containment relationship as shown in Figure 3A, its MIT structure is shown in Fig. 3 B.Each MO category node all has an Adelson-Velskii-Landis tree to preserve sub-MO node.Adelson-Velskii-Landis tree is used to search for basic MO node, and double linked list then is used to link the brotgher of node.That is to say that the MO category node of bi-directional chaining comes sub-MO node-classification to it according to class.So MIT of the present invention comprises three parts: MO node, MO category node and MO information node.

The MO node is represented the MO example, and the latter must be able to visit from storer, such as the mode by database or file system.The MO node has also comprised the difference name (DN) of MO example.The MO information node has the relative distinguished name (RDN) of each MO example, and it can be used as key value and is used for traveling through Adelson-Velskii-Landis tree to search the MO node with identical RDN.The MO category node is the intermediate node between a father node and the several child node, and each MO category node is represented a MO class and can be visited IDS.

OO method has all been used in design and realization according to MIT of the present invention and CLF.Thereby all in a preferred embodiment tree nodes are all realized with the C++ class form.Relation between the class as shown in Figure 4, wherein, core classes is CT, CTMONode, CTClassNode and MOInfo.Class CT represents MIT itself, and has such example in the management system.It provides a lot of methods to insert, to delete and search the MO example.These interfaces also are available to the other parts of the TMN platform realized.It also provides MO select tool for scope definition and filtration.

Class CTMONode represents the MO example and allows MIT user's (code of the other parts of platform or management system development person just) visit MO example.This MO example has comprised the positional information of MO example in storer.Class CTClassNode represents the MO class, and compiles and manage the MO node that belongs to same MO class.Class CTClassNode has also comprised the IDS interface, uses these interfaces to carry out CLF at this intranodal.Class MOInfo establishes for the node that constitutes Adelson-Velskii-Landis tree, and Adelson-Velskii-Landis tree is under the jurisdiction of each MO category node, and MOInfo contains RND and can be used as key value search for MO in Adelson-Velskii-Landis tree.Class SearchTree and class List have provided the template class of the function of Adelson-Velskii-Landis tree and chained list.

General, when manager's system request has the bookkeeping of scope definition and filtering limit, must be found fundamental node or the basic MO that operates starting point as scope definition by management system.The MO that meets the specified range information of management method, system must be selected comes out.Correspondingly, the search of fundamental node among the MIT is carried out by means of Adelson-Velskii-Landis tree, it has comprised the child node of classifying according to the MO class on each level.As previously mentioned, each MO node all has a name unique in all brotghers of node, i.e. RDN, and it is exactly the key value of Adelson-Velskii-Landis tree.RDN makes MIT user find basic MO node effectively by the traversal Adelson-Velskii-Landis tree.

Scope definition is to carry out on the basis of the range information that the manager system provides.Among the present invention, scope definition is carried out in the MIT of appointment circularly, and the result selects one or more MO nodes, comprising basic MO.Scope definition contains two while circulations, and wherein the interior circulation of outer circulation importing MO category node then imports the MO node among the MIT.According to different wide-styles, the mode of delivery node is also different.Fig. 5 is the example of a scope definition, and wherein wide-style is that " N of basic unit to the layer " (baseToNthLevel), level is 2.

Although the scope definition of MO category node is looked as if unnecessary,, category node is that CLF is necessary, and in fact time of being increased of this scope definition operation is compared and can ignore with adopting the time that CLF shortened.Be the class Pascal code of MIT scope definition algorithm below:

typeSCOPETYPE＝      {wholesubtree，subtree，baseToNthLevel and nthlevel}；MONODE＝↑CTMONode                {MO node)；CLASSNODE＝↑CTCLASSNODE        {class node}；procedure Scoping (sType SCOPETYPE， sLevel：integer，moNode：MONODE)；var    tmpmonode：MONODE；　　tmpclassnode：CLASSNODE；　　level：static integer；{To maintain the tree depth in recursive calling}begin　　    level：＝1；　　    tmpclassnode：＝Header of class node list contained in moNode；　　    while tmpclassnode is not nil do　　begin　　      tmpmonode：＝First child MO node of tmpclassnode；　　      while tmpmonode is not nil do　　    begin　　         if(level＜sLevel)and(tmpnode has one or more class nodes))then　　         begin　　               level：＝level+1；　　               Scoping(sType，sLevel，tmpmonode)；　　               Visiting tmpmonode；　　               Level：＝level-1　　         end　　         else if(((level＜sLevel)and(tmpnode does not have any class node))or(level＝sLevel))　　         begin　　               Visiting tmpmonode　　          end；　　          tmpmonode：＝tmpmonode↑.next　　     end；  {inter loop}　　     tmpclassnode：＝tmpclassnode↑.next　　end{outer loop}end；{Scoping}

After the scope definition, filter with decision whether the MO example in the scope is implemented bookkeeping with carrying out.If the result is false, then do not carry out bookkeeping.If the selected MO example quantity of scope definition a lot of and/or filtrator very complicated, the time that filter operation so consumed will influence the T.T. of carrying out bookkeeping greatly.Because MIT of the present invention has comprised MO example and MO category information thereof, therefore may from the filter operation of CLF, get rid of the example of unsuitable class.

Fig. 6 has shown the simple case of a CLF.Given filtering information is " (a=1 ORb＞10) AND id=panzee ", if do not contain attribute " a " in certain MO class, then the example of this MO class is not carried out MLF.Just, " (a=1 ORb＞10) AND id=panzee " is reduced to " b＞10 AND id=panzee ".In addition, if do not contain attribute " id " in certain MO class, then filter expression becomes FALSE, does not also just need the example of this MO class is carried out bookkeeping.Consequently, the unnecessary spending to unsuitable MO example execution MLF will significantly reduce.

Especially, CLF has used stack data structure to calculate the value of the logical expression of CMISFilter, the filtration device structure that X.710 CMISFilter is to be recommended.The CLF module is decomposed CMISFilter and expression formula is divided into two groups.One group is the set of filtering item, and they are submitted to property inspector 10, as shown in Figure 7.Filtering item is made up of attribute OID and value thereof.By means of the information of IDS, property inspector 10 checks whether contained attribute belongs to the MO class in the filtering item 20.Another group is the set of logical operator, and such as " and ", " or " or " not ", they are directly deposited in the stack 30.CMISFilter is decomposed after the stack, and CLF uses stack evaluation program 40 to calculate the value of filtrator.Be the class Pascal code of MIT algorithm below:

POP(var S：FILTERSTACK)             {Delete the top element of stack S}PUSH(s：STACKITEM，var S：FILTERSTACK){Insert the element at the top of stack S}TOP(s：FILTERSTACK)：STACKITEM       {Return the element at the top of stack S}ATTR_CHECKER(attroid：OID，class：↑MO_Class_Info)：boolean　　                                     {Check if class contains attribute(oid)}typeSTACKITEM＝record　　 item：boolean；　　 op：integerend；FILTERSTACK＝record　　 stack：array[1..n]of STACKITEM；<!-- SIPO <DP n="8"> --><dp n="d8"/>　　  top；integerend；procedure ClassLevelFiltering(filter：↑CMISFilter)：boolean；var　　stack：FILTERSTACK；　　a，b；STACKITEM；　　tmpbool；boolean；　　tmpstackitem：STACKITEM；　　level：integer；　　tmpfilter：↑CMISFilter；begin　　   if filter＝nil then　　      return(true)；{If filter is null，then return true}　　   if(filter↑，filter_type＜＞Filter_Item) then begin　　      tmpstackitem.op；＝filter↑.filter_type；　　      PUSH(tmpstackitem，stack)；　　      tmpfilter：＝filter↑.filter_filter；　　      increment level by 1；{Increment filter depth}　　      ClassLevelFiltering(tmpfilter)；{Recursive calling}　　      decrement level by 1；{Decrement filter depth}　　      if(filter↑.filter_type＝And)then begin　　                           {Evaluation‘And’operator}　　            a：＝TOP(stack)；POP(stack)；　　            b：＝TOP(stack)；POP(stack)；　　            tmpbool：＝((a.item＝true)AND(b.item＝true))；　　            while TOP(stack).op＝Filter_Item do being　　                 a＝TOP(stack)；POP(stack)；　　                 tmpbool：＝(tmpbool AND(a：item＝true))　　            end；　　            POP(stack)，{For removing AND from stack}　　            {Push the result of′And′evaluation}　　            tmpstackitem.op：＝Filter_Item；　　            tmpstackitem.item＝tmpbool；　　            PUSH(tmpstackitem，stack)　　      end　　      else if(filter↑.filter_type＝Or)then begin　　                                    {Evaluation′Or′operator}　　             a：＝TOP(stack)；POP(stack)；　　             b：＝TOP(stack)；POP(stack)；　　             tmpbool：＝NOT((a.item＝false)AND(b.item＝false))；　　             if(tmpbool＝false)then begin　　                while TOP(stack).op＝Filter_Item do begin<!-- SIPO <DP n="9"> --><dp n="d9"/>　　                      a：＝TOP(stack)；POP(stack)；　　                      tmpbool：＝((tmpbool＝false)AND(a.itern＝false))　　              end　　            end　　            else begin　　                 while   top.op of stack is Filter_Item　　                         POP(stack)　　            end；　　            {Push the result of′Or′evaluation}　　            POP(stack)；{For removing Or from stack}　　            tmpstackitem.op：＝Filter_Item；　　　          tmpstackitem.item＝tmpbool；　　            PUSH(tmpstackitem，stack)　　      end　　      else if(filter↑.filter_type＝Not)then begin　　            {Push the result of′Not′evaluation}　　            a：＝TOP(stack)；POP(stack)；　　            if(a：item＝true)then begin　　                tmpstackitem.op＝Filter_Item；　　                tmpstackitem.item＝false　　            end　　            else begin　　            {Push the result of′Not′evaluation}　　            PUSH(tmpstackitem，stack)　　      end　　 end　　 else begin　　      tmpstackitem. op＝Filter_Item；　　      {Check that class contains attribute(oid)and return the result}　　      tmpstackitem.item：＝ATTR_CHECKER(filter↑.filter_item↑.attr_oid)；　　      PUSH(tmpstackitem，stack)；　　      if filter↑.filter_next is not nil then begin　　             tmpfilter：＝filter↑.filter_next；　　             ClassLevelFiltering(tmpfilter){Recursive calling}　　      end　　  end；if level is nil then begin　　  {Return the result Of CLF}　　  a：＝TOP(stack)；POP(stack)；　　  return a.itemendend；{End of procedure}

The CLF module can be divided into four parts as shown in Figure 7.Resolver 50 resolves into filtering item 20 and logical operator with CMISFilter, and gives property inspector 10 and stack 30 respectively with them.Property inspector 10 is nucleus modules of CLF, and it utilizes the IDS interface to judge whether the attribute of filtering item 20 belongs to the MO class.Logical operator that transmits by resolver 50 and the boolean results that produces by property inspector 10 have been stored in the stack 30.40 pairs of logical expressions that are stored in the stack 30 of stack evaluation program calculate evaluation.

CLF is the quantity that MLF has significantly reduced the MO node.But CLF is to very the simple filtering device is also improper.So the specific action that CLF can be carried out by the manager system in real time switches.Like this, power to make decision that whether to carry out CLF just is the manager system.The supvr can be switched CLF by carrying out specific action as the case may be.

If there is a plurality of manager system to be connected to one by management system, each manager can independently determine switching characteristic in real time so.For supporting this ability, be that each manager system preserves handover information by management system, the manager system is distinguished mutually according to the contact descriptor, and the contact descriptor is to obtain from the ACSE stack when contact is set up.Whenever the management operation instruction of receiving from certain manager system, just checked by management system whether contact descriptor and decision carry out CLF.

Generally speaking, CLF compares with MLF and need not extract property value.CLF uses the information that resides in the MO class in the primary memory.Because whether CLF just checks attribute simply and exists and need not extract property value, so it can be finished in a short period of time.It does not also need DB (database) or file access.Therefore, CLF allows effective bookkeeping, thereby has improved the efficient of network management system.

The above embodiments only are demonstrations, can not think doctrine that the present invention only is confined to this.Present technique can be applied on the equipment of other type easily.Description of this invention purpose is explanation, rather than in order to limit the scope of claim.Obviously, can also carry out many replacements, transformation and distortion.Conclusion is that the speed of MO selection operation has influenced the overall performance of network management system greatly to one skilled in the art.

Claims (19)

1. choose the method for managed object during the containing in network management system is set, may further comprise the steps:

Carry out scope definition with the identification managed object based on the range information that the manager system provides;

Category information based on Managed Object Instance carries out category filtration to get rid of unsuitable Managed Object Instance to the managed object in the scope.

2. method as claimed in claim 1, wherein scope definition comprises the basic managed object that identifies as the subtree root that contains tree, it is the starting point of scope definition and category filtration.

3. method as claimed in claim 1 also comprises:

Carry out the managed object layer and filter with decision whether the resulting managed object of category filtration is managed operation.

4. method as claimed in claim 3, wherein the managed object layer filters and comprises whether the property value of judging in the resulting managed object of category filtration satisfies the given filtering information of manager system.

5. method as claimed in claim 1 also comprises:

Storage Managed Object Instance and category information thereof in containing tree.

6. method as claimed in claim 5 wherein adopts the balanced binary search tree to store the category information of Managed Object Instance.

7. method as claimed in claim 6, wherein scope definition comprises the basic managed object that uses the balanced binary search tree to identify the subtree root of setting as containing, it is the starting point of scope definition and category filtration.

8. method as claimed in claim 5 also is included in to contain in the tree and connects fraternal Managed Object Instance with double linked list.

9. method as claimed in claim 5, the node that wherein contains tree is realized with C++ class.

10. method as claimed in claim 1 also comprises:

The category information separate storage of Managed Object Instance uses IDS to carry out category filtration in IDS.

11. method as claimed in claim 1, wherein category filtration is by the supvr of manager system switch in real time.

12. the management information tree construction of a network communicating system comprises:

Managed Object Instance, and

The category information of Managed Object Instance.

13. as the management information tree construction of claim 12, wherein:

The managed object node is represented Managed Object Instance and is contained the difference name of Managed Object Instance;

The managed object information node contains the relative distinguished name of each Managed Object Instance;

Have at least a managed object category node to represent Managed Object Class.

14. as the management information tree construction of claim 13, wherein managed object information node formation can be in order to search for the balanced binary search tree of basic managed object.

15. as the management information tree construction of claim 13, wherein the managed object category node is the intermediate node between father's managed object node and its a plurality of sub-managed object node.

16., be bi-directional chaining between the wherein fraternal managed object node as the management information tree construction of claim 13.

17., be bi-directional chaining between the wherein fraternal managed object category node as the management information tree construction of claim 13.

18. a category filtration module comprises:

Resolver is decomposed into filtering item and logical operator with filtration device structure;

Property inspector, whether receiving filtration item and the attribute of examining filtering item belong to Managed Object Class;

Stack receive and store the logical operator from resolver, and storage is from the result of property inspector;

The stack evaluation program is calculated the value that is stored in the logical expression in the stack.

19. as the category filtration module of claim 18, wherein filtration device structure is CMTSFilter.

Images