WO2014153717A1 - Procédé et nœud de communication pour gérer des abonnés d'événements de communication, programme d'ordinateur et support associé - Google Patents

Procédé et nœud de communication pour gérer des abonnés d'événements de communication, programme d'ordinateur et support associé Download PDF

Info

Publication number
WO2014153717A1
WO2014153717A1 PCT/CN2013/073192 CN2013073192W WO2014153717A1 WO 2014153717 A1 WO2014153717 A1 WO 2014153717A1 CN 2013073192 W CN2013073192 W CN 2013073192W WO 2014153717 A1 WO2014153717 A1 WO 2014153717A1
Authority
WO
WIPO (PCT)
Prior art keywords
ces
event
node
nodes
subscribed
Prior art date
Application number
PCT/CN2013/073192
Other languages
English (en)
Inventor
Jun Wang
Zhiming GUO
Original Assignee
Telefonaktiebolaget L M Ericsson (Publ)
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by Telefonaktiebolaget L M Ericsson (Publ) filed Critical Telefonaktiebolaget L M Ericsson (Publ)
Priority to PCT/CN2013/073192 priority Critical patent/WO2014153717A1/fr
Publication of WO2014153717A1 publication Critical patent/WO2014153717A1/fr

Links

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W8/00—Network data management
    • H04W8/18—Processing of user or subscriber data, e.g. subscribed services, user preferences or user profiles; Transfer of user or subscriber data
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W24/00—Supervisory, monitoring or testing arrangements

Definitions

  • the present technology relates to a method for managing communication event subscribers in a radio communication node.
  • the technology also relates to a radio communication node, a computer program and a storage medium.
  • a communication node e.g. eNodeB in a Long Term Evolution access network
  • CES communication event subscribers
  • the different CESs may have subscribed to different events. When a particular event is triggered, it is required to find all the CESs having subscribed to this event efficiently to notify them of the occurrence of the event.
  • the solution for finding all the CESs is to set up a CES list under each event as illustrated in Fig. l . According to this prior art, when an event is triggered, all CESs on the list will be traversed for finding the CESs to which the notification shall be sent.
  • the communication node is typically implemented as an embedded device, which has very limited memory space, thus there is a rigorous memory utilization criteria for applications. In other words, the applications are demanded to utilize the memory as efficiently as possible.
  • a CES usually cares about a large amount of events (even up to a thousand) in the communication node.
  • the instance of the same CES need to be created under each event that it has subscribed to. For example, as shown in Fig. l, two instances for CES S4 are created under event ID 0 and 1.
  • the instance of the same CESs will be repeatedly created in the memory up to thousands of times, which results in the tremendous consumption of the limited memory resources.
  • the CES changes the event subscription, it needs to go through all the events and add/remove the corresponding CES instance to/from the CES list under each event, which cause a high maintenance cost for the CES list.
  • a first aspect of an invention disclosed herein is a method for managing communication event subscribers in a radio communication node.
  • the method comprises: obtaining one or more consecutive ranges of events subscribed to by each of a plurality of CESs; establishing an index structure used for associating the plurality of CESs based on relationship among the one or more subscribed event ranges, the relationships among the ranges may comprise at least one of containing relationship, overlapping relationship and independent relationship; and searching all the CESs that have subscribed to a particular event by using the index structure.
  • a second aspect of the invention is a radio communication node for managing the communication event subscribers.
  • the radio communication node comprises an obtaining unit, an establishing unit and a searching unit.
  • the obtaining unit is adapted to obtain one or more consecutive ranges of events subscribed to by each of a plurality of CESs; and the establishing unit is adapted to establish an index structure used for associating the plurality of CESs based on relationship among the one or more subscribed event ranges, the relationship among the ranges may comprise at least one of containing relationship, overlapping relationship and independent relationship; and the searching unit is adapted to search all the CESs that have subscribed to a particular event by using the index structure.
  • a third aspect of the invention is an apparatus comprising a processor and a memory, the memory comprises instructions which, when executed by the processor, cause the apparatus to obtain one or more consecutive ranges of events subscribed to by each of a plurality of CESs, establish an index structure used for associating the plurality of CESs based on relationship among the one or more subscribed event ranges, and searching all the CESs that have subscribed to a particular event by using the index structure.
  • a fourth aspect of the invention is a computer program comprising instructions which, when running on a radio communication node, cause the radio communication node to perform the steps of the method as described above.
  • a fifth aspect of the invention is a computer readable storage medium storing the instructions which, when running on a radio communication node, cause the radio communication node to perform the steps of the method as described above.
  • the inventor recognizes that it is often that the CESs care about a consecutive range of events (such as the events with ID ranging from 10 to 100). Based on the recognition, an index structure is established to associate the CESs based on the relationships among the ranges of events subscribed by the CESs, thereby searching for the CESs caring about one particular event along the path of the association. In this way, there is no need to create instances of the same CES repeatedly in the memory, without sacrificing the searching efficiency.
  • Fig. 1 illustrates a schematic view of the communication event subscriber managing solution in prior art
  • Fig.2 schematically illustrates a flowchart for managing the communication event subscribers in the communication system in accordance with an embodiment
  • Fig.3a-3d schematically illustrates the associations among the communication event subscribers in accordance with an embodiment
  • Fig.4 schematically illustrates an example index structure used for associating the communication event subscribers in accordance with an embodiment
  • Fig.5 illustrates the definition of the tree node object in accordance with an embodiment
  • Fig.6 is the block diagram of the radio communication node used for managing the communication event subscribers in accordance with another embodiment.
  • Fig.7 is the block diagram of the apparatus used for managing the communication event subscribers in accordance with a further embodiment.
  • the present technology may be embodied in hardware and/or in software (including firmware, resident software, micro-code, etc.).
  • the present technology may take the form of a computer program on a computer-usable or computer-readable storage medium having computer-usable or computer-readable program code embodied in the medium for use by or in connection with an instruction execution system.
  • a computer-usable or computer-readable medium may be any medium that may contain, store and is adapted to communicate the program for use by or in connection with the instruction execution system, apparatus, or device.
  • Radio communication node Although specific terms in some specifications are used here, such as radio communication node, it should be understand that the embodiments are not limited to those specific terms but may be applied to all similar entities, such as Access Point (AP), cell, sector, base station, femto base station, Core Network (CN), NodeB, eNodeB etc.
  • AP Access Point
  • CN Core Network
  • NodeB eNodeB
  • Fig.2 schematically illustrates a flowchart for managing the communication event subscribers (CESs) in the radio communication node in accordance with an embodiment.
  • the radio communication node may operate in the communication system such as, the Long Term Evolution (LTE) system, Time Division Synchronous Code Division Multiple Access (TD-SCDMA) system, Wireless Fidelity (WiFi) system, Bluetooth, Universal Mobile Telecommunications System (UMTS), Worldwide Interoperability for Microwave Access (WiMAX) system, Code Division Multiple Access (CDMA) system, Wideband Code Division Multiple Access High Speed Packet Access (WCDMA-HSPA) system, and the like.
  • LTE Long Term Evolution
  • TD-SCDMA Time Division Synchronous Code Division Multiple Access
  • WiFi Wireless Fidelity
  • Bluetooth Universal Mobile Telecommunications System
  • UMTS Universal Mobile Telecommunications System
  • WiMAX Worldwide Interoperability for Microwave Access
  • CDMA Code Division Multiple Access
  • WCDMA-HSPA Wideband Code Division Multiple Access High Speed Packet Access
  • the communication node may obtain one or more consecutive ranges of events subscribed by each of a plurality of communication event subscribers.
  • the communication event subscribers can be any entity subscribing the event of the communication node, including but not limited to other communication nodes such as AP, base station, NodeB, eNodeB, etc, a User Equipment (UE) such as mobile phone, smart phone, Personal Digital Assistant (PDA), etc.
  • UE User Equipment
  • the communication event subscribers may also comprise the internal software programs running in the radio communication node publishing the events, such as the instantiated object, the function, the procedure, etc.
  • the communication node may publish hundreds, even thousands, of events, each event having a unique event identification (ID). It is often that a CES cares about and subscribes to a consecutive range of events published by the communication node.
  • the events herein indicate different types of communication events that are typical for a radio communication node, such as the configuration change in the communication node, the loss of connection with the network center, and the like.
  • the communication node has published 100 events with event IDs ranging from 0 to 99
  • the CES A may have subscribed to the consecutive events with event ID ranging from 10 to 30
  • the CES B may have subscribed to one set of consecutive events with event IDs ranging from 20 to 40 and another set of consecutive events with event IDs ranging from 45 to 50.
  • the information on the ranges of events subscribed by the CESs has been stored in the local/remote memory of the communication node, thus the communication node can obtain such information by accessing the memory.
  • the communication node may also send the request to the CESs for the event ranges that have been subscribed by the CESs, and then receive the subscribed event range information from the CESs respectively.
  • the communication node may establish an index structure used for associating the plurality of CESs based on the relationships among the one or more subscribed event ranges.
  • the relationships among the subscribed event ranges may comprise containing relationship, overlapping relationship and independent relationship.
  • the subscribed event range with event IDs 20-30 falls within the scope of the subscribed event range with event IDs 10-35, thus the two subscribed event ranges have containing relationship.
  • the subscribed event range with event IDs 20-30 overlaps with the subscribed event range with event IDs 25-40, thus the two subscribed event ranges have overlapping relationship.
  • the subscribed event range with event IDs 20-30 separates from the subscribed event range with event IDs 40-50, thus the two subscribed event ranges have independent relationship.
  • the index structure used for associating the CESs may be implemented by using a tree, such as B+ tree.
  • a tree node may refer to a CES subscribing a particular consecutive event range
  • the association among the CESs may include father-child association and sibling association.
  • the father-child association may represent the father-child relationship between the two CES nodes in the tree.
  • the sibling association may represent the sibling relationship between the two CES nodes in the tree.
  • the tree used for associating the CESs can be established based on the relationships among the corresponding subscribed event ranges as below:
  • the two CESs can be mapped as a father CES node and a child CES node in the tree.
  • the two CESs can be mapped as two sibling nodes in the tree.
  • the two CESs may be mapped as two independent CES nodes in the tree if the two CES nodes have no common father CES node, or otherwise the two CESs may be mapped as two sibling CES nodes having the same father CES node.
  • the linkage among the CES nodes in the tree can be constructed as appropriate, which is known to the skilled in the art.
  • a father CES node may link to all its child CES nodes, alternatively, each child CES node may back link to its father CES node simultaneously.
  • a father CES node may merely link to one of its child CES node, e.g. the child CES node on the left most among the sibling CES nodes, and the sibling CES nodes link together.
  • the sibling CES nodes can be arranged based on their corresponding event ranges. For example, there are three sibling CES nodes, SI , S2 and S3, whose corresponding subscribed event ranges are Rl with event IDs 10-30, R2 with event IDs 20-40, and R3 with event IDs 50-70. It can be regulated that the CES nodes can be arranged in the order of their starting event ID and the CES node with the minimum starting event ID is placed on the left-most side in the tree. In this way, with respect to the three sibling CES nodes, SI is located on the left most side, S2 is located in the middle, and S3 is located on the right most side. Alternatively, the sibling CES nodes also can be placed in the opposite direction in the tree, that is, SI is located on the right most side, S2 is located in the middle, and S3 is located on the left most side.
  • CES nodes may represent the same CES.
  • a CES has subscribed to the event range A with event IDs 10-20 and the event range B with event IDs 50-90.
  • two CES nodes will be created in the tree, each of which corresponds to the CES's event range A and event range B respectively.
  • the index structure used for associating the CESs is embodied as a tree, but it can be understood that the index structure may also be implemented by using other data structures in suitable ways.
  • the communication node may search all the CESs that have subscribed to a particular event by using the index structure, e.g. the tree that is established in the step 220.
  • the communication node may traverse the tree for all the CES nodes that have subscribed to the E30. Generally, the traversing can be performed in the depth first principle or in the breadth first principle. After finding all the wanted CES nodes, the communication node may notify them of the occurrence of the E30 in batch or separately.
  • a particular event e.g. E30
  • the communication node may notify them of the occurrence of the E30 in batch or separately.
  • the traversing can be performed along with various link paths, including child-to-father path, father-to-child path and sibling-to-sibling path.
  • the traversing may begin with a leaf CES node.
  • the traversing may begin with a root CES node. Note that these searching paths can be used in combination or separately.
  • the inventor recognizes that the CESs typically care about a consecutive range of events. Based on the recognition, an index structure, e.g. a B+ tree, is established to associate the CESs based on the relationships among the ranges of events subscribed to by the CESs, thereby searching for the CESs caring about one particular event along the path of the association. In this way, the instance of the same CES does not have to be created repeatedly in the memory, while the searching efficiency can be maintained at a reason level.
  • an index structure e.g. a B+ tree
  • the searching efficiency is degraded to some extent.
  • the searching time complex is 0(M*Log 2 N), where M is the number of CES nodes all having subscribed to the particular event, and N is the total number of CES nodes in the tree.
  • the tree used for associating the CESs can be implemented as a B+ tree to be constructed by the following further rules:
  • Each event indexes the CES node that subscribes the minimum event range containing the event.
  • each event needs to index (or point to) one CES node having subscribed to this event and this CES node has the minimum event range among all the CES nodes having subscribed to this event.
  • this CES node should be a leaf node.
  • the CES node SI subscribes the event range E13-E51
  • the CES node S2 subscribes the event range El l- E53.
  • El 3 and E51 will index the CES node SI
  • El l, E12, E52 and E 53 will index the CES node S2.
  • Rule 3 When a particular event is subscribed to by multiple CES nodes whose subscribed event ranges having overlapping relationship, the particular event indexes the CES node having the minimum starting event ID in the tree among the multiple CES nodes.
  • the CES node SI subscribes the event range E13-E51 and S4 subscribes the event range E49-E52. It is known that the event range of SI overlaps with the event range of S4, meanwhile E51 is subscribed by both SI and S4. In this case, E51 will point to the CES node SI which has the less starting event ID E13 than the CES node S4.
  • the subscribed event range of a particular CES node when the subscribed event range of a particular CES node is contained by subscribed event ranges of multiple overlapping father CES nodes, the particular CES node becomes the child node of the father CES node having the minimum subscribed starting event ID among the multiple overlapping father CES nodes.
  • the event range of S3 is contained by both the event range of SI and the event range of S4.
  • S3 will become the child node of the CES node SI, since SI has the less subscribed starting ID El 3 than S4.
  • S3 may point to SI .
  • the CES node in the B+ tree can be defined as an object including the following parameters: start ID, length, father, brother, child, and next, as illustrated in Fig.5.
  • the parameter "Start ID” indicates the starting event ID in the event range subscribed by the CES node.
  • the parameter “Length” indicates the event range length.
  • the parameter “Father” indicates the pointer to its father CES node in the tree.
  • the parameter “Brother” indicates the pointer to its sibling node in the tree.
  • the parameter “Child” indicates the pointer to one of its child nodes (e.g. its left most child node) in the tree.
  • the parameter "Next” indicates the pointer to the next CES node representing the same CES.
  • the basic CES searching procedures for example, can be described as following:
  • the search begins with the CES node directly indexed by the triggered event, and searching upwards along the child-to-father path.
  • the CES node directly indexed by the triggered event must have subscribed to this event, and its ancestors also must have subscribed to this event.
  • each child CES node points to its father CES node, for example, S9 points to S8 and S8 points to S7.
  • the father CES node points to its left most child CES node, for example, S2 points to S5 and S7 points to S8.
  • the sibling nodes whose event ranges overlap are linked together, for example, S5 points to SI and SI to S4, S2 points to S7.
  • the event E50 should point to the CES node S9.
  • the tree will be searched for all the CESs having subscribed to this event. The searching will begin with the CES node S9, and then the search will go upward to its father CES node S8.
  • S8 also CES of the event E50, as such, the search goes right to S8's sibling CES node S10 along the sibling-to-sibling path, and it is determined that S10 CES of the event E50, then the search will go to SlO's first child CES node Sl l and it is determined that Sl l does not CES the event E50.
  • the search procedure along any searching path can immediately stop as long as it meets the first irrelevant CES, i.e. the first CES that does not subscribes to the triggered event.
  • the first irrelevant CES i.e. the first CES that does not subscribes to the triggered event.
  • all encountered CESs are really the wanted CESs, without duplication or missing. So it can achieve or at least come very close to the searching time complexity O(M) which has been the minimum cost in theory.
  • the tree used for associating the CESs needs to be updated in response to the update of the event subscribing information among the CESs.
  • the updating may include, but not limited to, adding a new CES node, removing an existing CES node, modifying the existing CES node, such as its linkage with other CES nodes.
  • the tree will be traversed to find all the CES nodes corresponding to the existing CES and these CES nodes will be removed from the tree and its child CES nodes will be moved to appropriate position.
  • the basic subscribing procedure can be, for example, described as below:
  • Step 1 From the starting event being subscribed by the new CES, if its internal pointer is empty, just pointing to the this new CES and going to next event within the event range subscribed by the new CES until meeting the first event with non-empty pointer
  • Step 2 If the referred CES is fully contained or overlapped by the new CES, proceeding to go upward until meeting the outmost CES or the outer CES fully contain the new CES.
  • Step 3 Going right along the sibling-to-sibling path to verify each sibling CES. If the new CES is fully contained by one node, then going downward from that node and repeating the same procedure on its children; otherwise proceed to browse the next sibling nodes until meeting the 1 st node with larger starting event ID than that of new added node, step 4
  • Step 4 At this point, the appropriate position is found where the new
  • CES need to be inserted. But it's still not finished yet; it still need move some child nodes of its right sibling nodes, even its right sibling nodes themselves, as its own children. For example, if the subscribed event range of the node at insertion position has is fully contained by that of new CES, then proceeding along the sibling-to-sibling path until meeting the first overlapping CES. The all previous nodes need be moved under the new CES as children nodes. Then go to step 5.
  • Step 5 As mentioned before, when a small event range is contained by two larger ranges, it should belong to the first larger range. Now although the first overlapping node is found as the young brother of the new CES, it may have some children nodes also contained by the new CES. So it still need go downward from that young brother node to find if there exist some child nodes with the smaller ranges fully contained by the event range of the new CES. If so, those child nodes also need be moved under the new CES.
  • Step 6 Going through the event recorder to update their internal pointers by skipping those events already subscribed by new CESs' children's ranges.
  • the whole range covered by the index structure, such as B+ tree. MUST have all events pointing to a node, i.e., no "Hole” is left within the range. So before it meets the "Hole", except for those skipped events, the other events' internal pointers can be directly changed to the new CES.
  • the Step 1 Going through the event recorder to update their internal pointers by skipping those events already subscribed by new CESs' children's ranges.
  • the whole range covered by the index structure such as B+ tree.
  • the CES nodes are distributed in different trees.
  • the CES node S12 separates from all other CES nodes and can be taken as an independent tree.
  • the CES nodes having no father CES node will be the child nodes of the virtual root node.
  • the root node will be the ancestor of all the event CES nodes.
  • all CES nodes will exist in a single tree. Because all the CES nodes will be handled in the single tree, the effort to maintain multiple trees is avoided, moreover the tree updating such as inserting a new CES node can be facilitated.
  • Fig.6 is the block diagram of the radio communication node used to managing the event subscribers in accordance with another embodiment.
  • the radio communication node 600 may comprise the obtaining unit 610, the establishing unit 620 and the searching unit 630.
  • the radio communication node 600 may be implemented as a part of a communication node or separately. Now the functions of the respective units will be described with reference to Fig.6
  • the obtaining unit 610 in the radio communication node 600 may obtain one or more consecutive ranges of events subscribed by each of a plurality of CESs.
  • the communication event subscribers can be any entity subscribing the event of the communication node, including but not limited to other communication nodes such as AP, base station, NodeB, eNodeB, etc, a User Equipment (UE) such as mobile phone, smart phone, Personal Digital Assistant (PDA), etc.
  • UE User Equipment
  • the communication event subscribers may also comprise the internal software programs running in the radio communication node publishing the events, such as the instantiated object, the function, the procedure, etc.
  • the communication node may publish hundreds even thousands of events, each event having a unique event identification (ID). It is often that a CES cares about and subscribes a consecutive range of events published by the communication node.
  • the events herein indicate different types of events that are typical for a radio communication node, such as the configuration change in the communication node, the loss of connection with the network center, and the like.
  • the communication node has published 100 evens with event IDs ranging from 0 to 99
  • the CES A may have subscribed to the consecutive events with event ID ranging from 10 to 30
  • the CES B may have subscribed to one set of consecutive events with event IDs ranging from 20 to 40 and another set of consecutive events with event IDs ranging from 45 to 50.
  • the information on the ranges of events subscribed by the CESs has been stored in the local/remote memory of the communication node, thus the obtaining unit 610 can obtain such information by accessing the memory.
  • the obtaining unit 610 may also send the request to the CESs for the event ranges that have been subscribed by the CESs, and then receive the subscribed event range information from the CESs respectively.
  • the establishing unit 620 may establish an index structure used for associating the plurality of CESs based on the relationships among the one or more subscribed event ranges obtained by the obtaining unit 610.
  • the relationships among the subscribed event ranges may comprise containing relationship, overlapping relationship and independent relationship.
  • the subscribed event range with event IDs 20-30 falls within the scope of the subscribed event range with event IDs 10-35, thus the two subscribed event ranges have containing relationship.
  • the subscribed event range with event IDs 20-30 overlaps with the subscribed event range with event IDs 25-40, thus the two subscribed event ranges have overlapping relationship.
  • the subscribed event range with event IDs 20-30 separates from the subscribed event range with event IDs 40-50, thus the two subscribed event ranges have independent relationship.
  • the index structure used for associating the CESs may be implemented by using a tree, such as B+ tree.
  • a tree node may refer to a CES subscribing a particular consecutive event range
  • the association among the CESs may include father-child association and sibling association.
  • the father-child association may represent the father-child relationship between the two CES nodes in the tree.
  • the sibling association may represent the sibling relationship between the two CES nodes in the tree.
  • the tree used for associating the CESs can be established based on the relationships among the corresponding subscribed event ranges as below:
  • the two CESs can be mapped as a father CES node and a child CES node in the tree.
  • the two CESs can be mapped as two sibling nodes in the tree.
  • the two CESs may be mapped as two independent CES nodes in the tree if the two CES nodes have no common father CES node, or otherwise the two CESs may be mapped as two sibling CES nodes having the same father CES node.
  • the linkage among the CES nodes in the tree can be constructed as appropriate, which is known to the skilled in the art.
  • a father CES node may link to all its child CES nodes, alternatively, each child CES node may back link to its father CES node simultaneously.
  • a father CES node may merely link to one of its child CES node, e.g. the child CES node on the left most among the sibling CES nodes, and the sibling CES nodes link together.
  • the sibling CES nodes can be arranged based on their corresponding event ranges. For example, there are three sibling CES nodes, SI , S2 and S3, whose corresponding subscribed event ranges are Rl with event IDs 10-30, R2 with event IDs 20-40, and R3 with event IDs 50-70. It can be regulated that the CES nodes can be arranged in the order of their starting event ID and the CES node with the minimum starting event ID is placed on the left-most side in the tree. In this way, with respect to the three sibling CES nodes, SI is located on the left most side, S2 is located in the middle, and S3 is located on the right most side. Alternatively, the sibling CES nodes also can be placed in the opposite direction in the tree, that is, SI is located on the right most side, S2 is located in the middle, and S3 is located on the left most side.
  • CES nodes may represent the same CES.
  • a CES has subscribed to the event range A with event IDs 10-20 and the event range B with event IDs 50-90.
  • two CES nodes will be created in the tree, each of which corresponds to the CES's event range A and event range B respectively.
  • the index structure used for associating the CESs is embodied as a tree, but it can be understood that the index structure may also be implemented by using other data structures in suitable ways.
  • the searching unit 630 may search all the CESs that have subscribed to a particular event by using the index structure, e.g. the tree.
  • the establishing unit 620 may traverse the tree for all the CES nodes that have subscribed to the E30. Generally, the traversing can be performed in the depth first principle or in the breadth first principle. After finding all the wanted CES nodes, the establishing unit 620 may notify them of the occurrence of the E30 in batch or separately.
  • the traversing can be performed along with various link paths, including child-to-father path, father-to-child path and sibling-to-sibling path.
  • the traversing may begin with a leaf CES node.
  • the traversing may begin with a root CES node. Note that these searching paths can be used in combination or separately.
  • the inventor recognizes that the CESs typically care about a consecutive range of events. Based on the recognition, an index structure, e.g. a B+ tree, is established to associate the CESs based on the relationships among the ranges of events subscribed by the CESs, thereby searching for the CESs caring about one particular event along the path of the association. In this way, the instance of the same CES does not have to be created repeatedly in the memory, while the searching efficiency can be maintained at a reason level.
  • an index structure e.g. a B+ tree
  • the searching efficiency is degraded to some extent.
  • the searching time complex is 0(M*Log 2 N), where M is the number of CES nodes all having subscribed to the particular event, and N is the total number of CES nodes in the tree.
  • the tree used for associating the CESs can be implemented as a B+ tree to be constructed by the following further rules:
  • Each event indexes the CES node that subscribes the minimum event range containing the event.
  • each event needs to index (or point to) one CES node having subscribed to this event and this CES node has the minimum event range among all the CES nodes having subscribed to this event.
  • this CES node should be a leaf node.
  • the CES node SI subscribes the event range E13-E51
  • the CES node S2 subscribes the event range El l- E53.
  • El 3 and E51 will index the CES node SI
  • El l, E12, E52 and E 53 will index the CES node S2.
  • Rule 3 When a particular event is subscribed to by multiple CES nodes whose subscribed event ranges having overlapping relationship, the particular event indexes the CES node having the minimum starting event ID in the tree among the multiple CES nodes.
  • the CES node SI subscribes the event range E13-E51 and S4 subscribes the event range E49-E52. It is known that the event range of SI overlaps with the event range of S4, meanwhile E51 is subscribed to by both SI and S4. In this case, E51 will point to the CES node SI which has the less starting event ID E13 than the CES node S4.
  • the subscribed event range of a particular CES node when the subscribed event range of a particular CES node is contained by subscribed event ranges of multiple overlapping father CES nodes, the particular CES node becomes the child node of the father CES node having the minimum subscribed starting event ID among the multiple overlapping father CES nodes.
  • the event range of S3 is contained by both the event range of SI and the event range of S4.
  • S3 will become the child node of the CES node SI, since SI has the less subscribed starting ID El 3 than S4.
  • S3 may point to SI .
  • the CES node in the B+ tree can be defined as an object including the following parameters: start ID, length, father, brother, child, and next, as illustrated in Fig.5.
  • the parameter "Start ID” indicates the starting event ID in the event range subscribed by the CES node.
  • the parameter “Length” indicates the event range length.
  • the parameter “Father” indicates the pointer to its father CES node in the tree.
  • the parameter “Brother” indicates the pointer to its sibling node in the tree.
  • the parameter “Child” indicates the pointer to one of its child nodes (e.g. its left most child node) in the tree.
  • the parameter "Next” indicates the pointer to the next CES node representing the same CES.
  • the basic CES searching procedures for example, can be described as following:
  • the search begins with the CES node directly indexed by the triggered event, and the searching unit 630 searches upwards along the child-to-father path.
  • the searching unit 630 searches upwards along the child-to-father path.
  • the searching unit 630 searches right along the sibling-to-sibling path for the CES nodes having subscribed to this event, until encountering the first CES node that does not subscribe this event.
  • the sibling CES nodes is queued in order of their subscribed starting event ID from left to right along the sibling-to-sibling path, if one CES node does not subscribed to this event, then it can be determined that all the CES nodes positioning on the right of the CES node also do not subscribe this event.
  • the searching unit 630 searches its child CES nodes along the father-to-child paths for the CES nodes having subscribed to this event in accordance with the searching principle in the searching procedure 2.
  • each child CES node points to its father CES node, for example, S9 points to S8 and S8 points to S7.
  • the father CES node points to its left most child CES node, for example, S2 points to S5 and S7 points to S8.
  • the sibling nodes whose event ranges overlap are linked together, for example, S5 points to SI and SI to S4, S2 points to S7.
  • the event E50 should point to the CES node S9.
  • the searching unit 630 will search the tree for all the CESs having subscribed to this event. The searching will begin with the CES node S9, then the searching unit 630will search upward to its father CES node S8. Hence S8 also CES the event E50, as such, the searching unit 630searches right to S8's sibling CES node S10 along the sibling-to-sibling path, and it is determined that S10 CES the event E50, then the search will go to SlO's first child CES node SI 1 and it is determined that SI 1 does not CES the event E50.
  • the searching unit 630 will continue searching upward to S8's father CES node S7 and apparently S7 is a subscriber of the event E50, meanwhile S7 is on the right most side among its sibling CES nodes, thus the sibling searching will not be performed, furthermore S7 has no father CES node, therefore the search ends.
  • the search procedure along any searching path can immediately stop as long as it meets the first irrelevant CES, i.e. the first CES that does not subscribes to the triggered event.
  • the first irrelevant CES i.e. the first CES that does not subscribes to the triggered event.
  • all encountered CESs are really the wanted CESs, without duplication or missing. So it can achieve or at least come very close to the searching time complexity O(M) which has been the minimum cost in theory.
  • the radio communication node 600 may further comprise the updating unit (not shown), which is adapted to update the tree used for associating the CESs in response to the update of the event subscribing information among the CESs.
  • the updating may include, but not limited to, adding a new CES node, removing an existing CES node, modifying the existing CES node, such as its linkage with other CES nodes.
  • the updating unit will traverse the tree to find all the CES nodes corresponding to the existing CES and remove these CES nodes from the tree and then move its child CES nodes to appropriate position.
  • the updating unit may take the following actions:
  • the basic subscribing procedure can be, for example, described as below:
  • Step 1 From the starting event being subscribed to by the new CES, if its internal pointer is empty, just pointing to the this new CES and going to next event within the event range subscribed to by the new CES until meeting the first event with non-empty pointer
  • Step 2 If the referred CES is fully contained or overlapped by the new CES, proceeding to go upward until meeting the outmost CES or the outer CES fully contain the new CES.
  • Step 3 Going right along the sibling-to-sibling path to verify each sibling CES. If the new CES is fully contained by one node, then going downward from that node and repeating the same procedure on its children; otherwise proceed to browse the next sibling nodes until meeting the 1 st node with larger starting event ID than that of new added node, step 4
  • Step 4 At this point, the appropriate position is found where the new CES need to be inserted. But it's still not finished yet; it still need move some child nodes of its right sibling nodes, even its right sibling nodes themselves, as its own children. For example, if the subscribed event range of the node at insertion position has is fully contained by that of new CES, then proceeding along the sibling-to-sibling path until meeting the first overlapping CES. The all previous nodes need be moved under the new CES as children nodes. Then go to step 5.
  • Step 5 As mentioned before, when a small event range is contained by two larger ranges, it should belong to the first larger range. Now although the first overlapping node is found as the young brother of the new CES, it may have some children nodes also contained by the new CES. So it still need go downward from that young brother node to find if there exist some child nodes with the smaller ranges fully contained by the event range of the new CES. If so, those child nodes also need be moved under the new CES.
  • Step 6 Going through the event recorder to update their internal pointers by skipping those events already subscribed to by new CESs' children's ranges.
  • the whole range covered by the index structure, such as B+ tree. MUST have all events pointing to a node, i.e., no "Hole” is left within the range. So before it meets the "Hole", except for those skipped events, the other events' internal pointers can be directly changed to the new CES.
  • Step 1 Going through the event recorder to update their internal pointers by skipping those events already subscribed to by new CESs' children's ranges.
  • the whole range covered by the index structure such as B+ tree.
  • the CES nodes are distributed in different trees.
  • the CES node S12 separates from all other CES nodes and can be taken as an independent tree.
  • the CES nodes having no father CES node will be the child nodes of the virtual root node.
  • the root node will be the ancestor of all the event CES nodes.
  • all CES nodes will exist in a single tree. Because all the CES nodes will be handled in the single tree, the effort to maintain multiple trees is avoided, moreover the tree updating such as inserting a new CES node can be facilitated.

Landscapes

  • Engineering & Computer Science (AREA)
  • Databases & Information Systems (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Mobile Radio Communication Systems (AREA)

Abstract

Les modes de réalisation de l'invention concernent un procédé pour gérer des abonnés d'événements de communication (CES) dans un système de communication. Le procédé consiste à : obtenir une ou plusieurs plages d'événements consécutives auxquelles chaque CES d'une pluralité de CES s'est abonné; établir une structure d'index servant à associer la pluralité de CES d'après la relation existant parmi lesdites une ou plusieurs plages d'événements auxquelles il y a eu abonnement, les relations parmi les plages pouvant comprendre au moins une relation parmi une relation d'inclusion, une relation de chevauchement et une relation indépendante; et rechercher tous les CES qui se sont abonnés à un événement particulier en utilisant la structure d'index. (Figure 2)
PCT/CN2013/073192 2013-03-26 2013-03-26 Procédé et nœud de communication pour gérer des abonnés d'événements de communication, programme d'ordinateur et support associé WO2014153717A1 (fr)

Priority Applications (1)

Application Number Priority Date Filing Date Title
PCT/CN2013/073192 WO2014153717A1 (fr) 2013-03-26 2013-03-26 Procédé et nœud de communication pour gérer des abonnés d'événements de communication, programme d'ordinateur et support associé

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
PCT/CN2013/073192 WO2014153717A1 (fr) 2013-03-26 2013-03-26 Procédé et nœud de communication pour gérer des abonnés d'événements de communication, programme d'ordinateur et support associé

Publications (1)

Publication Number Publication Date
WO2014153717A1 true WO2014153717A1 (fr) 2014-10-02

Family

ID=51622357

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2013/073192 WO2014153717A1 (fr) 2013-03-26 2013-03-26 Procédé et nœud de communication pour gérer des abonnés d'événements de communication, programme d'ordinateur et support associé

Country Status (1)

Country Link
WO (1) WO2014153717A1 (fr)

Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102004798A (zh) * 2010-12-27 2011-04-06 东北大学 一种基于复数单维索引的对称发布订阅系统匹配方法
US20110208559A1 (en) * 2010-02-24 2011-08-25 Marcus Fontoura Automatic Management of Networked Publisher-Subscriber Relationships
WO2011155900A1 (fr) * 2010-06-09 2011-12-15 Smart Hub Pte. Ltd. Système et procédé pour la fourniture d'un contenu à un abonné

Patent Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20110208559A1 (en) * 2010-02-24 2011-08-25 Marcus Fontoura Automatic Management of Networked Publisher-Subscriber Relationships
WO2011155900A1 (fr) * 2010-06-09 2011-12-15 Smart Hub Pte. Ltd. Système et procédé pour la fourniture d'un contenu à un abonné
CN102004798A (zh) * 2010-12-27 2011-04-06 东北大学 一种基于复数单维索引的对称发布订阅系统匹配方法

Similar Documents

Publication Publication Date Title
CN111328110B (zh) 网络切片选择的方法、设备及系统
US11140231B2 (en) Mechanisms for enabling negotiation of API versions and supported features
CN108476406A (zh) 用于包括网络分片的网络中的接入控制
US9104728B2 (en) Query language to traverse a path in a graph
JP6201243B2 (ja) マシン・ツー・マシン通信のための動作トリガ方法および装置
CN114827982A (zh) 一种配置ue的策略的方法、装置和系统
CN111565385B (zh) 一种策略提供方法、装置和系统
US20170329828A1 (en) Metadata tables for time-series data management
CN102187715A (zh) 用于多模无线设备中的系统选择的方法和装置
CN110831088B (zh) 策略控制方法、设备及系统
US20230388389A1 (en) Communication method and communication apparatus
US11481441B2 (en) Graph database query pagination
CN110505663B (zh) 一种策略控制方法、装置及系统
CN115514707A (zh) 一种报文匹配方法、装置、存储介质及电子装置
WO2022088644A1 (fr) Procédé et système de mise à jour de politique d'accès et de mobilité
CN108536447B (zh) 运维管理方法
EP2887581B1 (fr) Procédé, système et dispositif d'actualisation de données
CN107548121B (zh) 确定接入网络的方法及装置
CN108616385B (zh) 简单网管协议代理的查询方法、mib树的遍历方法及系统
WO2014153717A1 (fr) Procédé et nœud de communication pour gérer des abonnés d'événements de communication, programme d'ordinateur et support associé
KR101743731B1 (ko) 분산된 데이터를 통합하여 생성한 온톨로지를 기반으로 쿼리를 처리하는 방법 및 장치
KR20130068248A (ko) 군집 로봇의 네트워크 토폴로지 구성 방법과 라우팅 방법
US20140122499A1 (en) Optimized queries for file path indexing in a content repository
US10289710B2 (en) Method for modifying root node, and modification apparatus
CN104537078B (zh) 一种基于滑块的目录索引优化方法

Legal Events

Date Code Title Description
121 Ep: the epo has been informed by wipo that ep was designated in this application

Ref document number: 13880109

Country of ref document: EP

Kind code of ref document: A1

NENP Non-entry into the national phase

Ref country code: DE

122 Ep: pct application non-entry in european phase

Ref document number: 13880109

Country of ref document: EP

Kind code of ref document: A1