Analysis of connection patterns in a communication network

• US 10,375,593 B2
• Filed: 11/04/2014
• Issued: 08/06/2019
• Est. Priority Date: 11/04/2014
• Status: Active Grant

• Current Assignee: Telefonaktiebolaget LM Ericsson
• Original Assignee: Telefonaktiebolaget LM Ericsson
• Inventors: Shivashankar, Subramanian, Dauneria, Ankur, Gurukar, Saket, Ranu, Sayan, Ravindran, Balaraman
• Primary Examiner(s): Nawaz, Asad M
• Assistant Examiner(s): Waqas, Saad A.
• Application Number:
  US15/524,214
• Publication Number:
  US 20170339590A1
• Time in Patent Office: 1,736 Days
• CPC Class Codes: H04L 5/0067 Allocation algorithms which involve graph matching
• CPC Class Codes: H04W 24/02 Arrangements for optimising operational condition
• CPC Class Codes: H04W 24/08 Testing, supervising or monitoring using real traffic
• CPC Class Codes: H04W 76/11 Allocation or use of connection identifiers

Abstract

The present disclosure relates to a method performed by a network node (54) in a communication network (50) comprising a plurality of communication devices (51), for finding temporally connected connection patterns of the communication devices in the network. The method comprises identifying signalling between the communication devices during a predefined time duration to form a main communication graph in which the plurality of communication devices are nodes. The method also comprises partitioning the main communication graph for a time period comprised in said time duration to capture temporally connected signalling between some of the communication devices as illustrated in the main communication graph in a partitioned communication graph. The method also comprises forming at least one subgraph from the partitioned communication graph, comprising m nodes corresponding to m communication devices of said some of the communication devices. The method also comprises constructing a binary vector of the subgraph over the time period divided into a plurality of sampling periods corresponding to components in the vector such that, for each component in the vector, the component value is set to “1” if, in accordance with the subgraph, signalling occurs between at least two of the m communication devices during the sampling period corresponding to the element, and the component value is otherwise set to “0”. The method also comprises testing whether the signalling between the different m communication devices used for constructing the binary vector is temporally connected by checking that the number of consecutive “0” element(s), if any, between any two “1” elements is less than a predefined ΔT.

Claims

1. A method performed by a network node in a communication network comprising a plurality of communication devices, for finding temporally connected connection patterns of the communication devices in the network, the method comprising:

identifying signalling between the communication devices during a predefined time duration to form a main communication graph in which the plurality of communication devices are nodes;

partitioning the main communication graph for a time period comprised in said predefined time duration to capture temporally connected signalling between a group of the plurality of communication devices as illustrated in the main communication graph in a partitioned communication graph;

forming at least one subgraph from the partitioned communication graph, said subgraph comprising m nodes corresponding to m communication devices of said group of the plurality of communication devices, where m>

1;

constructing a binary vector of the subgraph over the time period divided into a plurality of sampling periods corresponding to components in the binary vector such that, for each component in the binary vector, a component value of the component is set to “

1”

if, in accordance with the subgraph, signalling occurs between at least two of the m communication devices during the sampling period corresponding to the component, and the component value of the component is otherwise set to “

0”

; and

testing whether the signalling between the different m communication devices used for constructing the binary vector is temporally connected by checking that a number of consecutive “

0”

component values of the components of the binary vector, if any, between any two “

1”

component values of the components of the binary vector is less than a predefined value.

2. The method of claim 1, wherein the temporally connected connection pattern is a recurring pattern observed during a plurality of time durations.

3. The method of claim 1, wherein a plurality of subgraphs are formed from the partitioned communication graph.

4. The method of claim 1, wherein the temporally connected connection patterns are reconnection patterns after, or disconnection patterns due to, an outage in the communication network.

5. The method of claim 4, wherein the outage is due to network connectivity loss, power loss, loss of connection to an application or loss of connection to a service.

6. The method of claim 1, wherein at least two of the plurality of communication devices are machine-to-machine (M2M) devices.

7. The method of claim 1, wherein at least two of the plurality of communication devices are radio devices.

8. The method of claim 1, wherein the network node is comprised in a connectivity service platform, e.g. the Ericsson Device Connection Platform (DCP) or other hosted core network (CN).

9. A computer program product comprising a non-transitory computer readable medium storing computer-executable components for causing a network node to perform the method of claim 1 when the computer-executable components are run on processor circuitry comprised in the network node.

10. A network node for a communication network comprising a plurality of communication devices, configured for finding temporally connected connection patterns of the communication devices in the network, the network node comprising:

processor circuitry; and

a storage unit storing instructions executable by said processor circuitry whereby said network node is operative to;

identify signalling between the communication devices during a predefined time duration to form a main communication graph in which the plurality of communication devices are nodes;

partition the main communication graph for a time period comprised in said predefined time duration to capture temporally connected signalling between a group of the plurality of communication devices as illustrated in the main communication graph in a partitioned communication graph;

form at least one subgraph from the partitioned communication graph, said subgraph comprising m nodes corresponding to m communication devices of said group of the plurality of communication devices, wherein m>

1;

construct a binary vector of the subgraph over the time period divided into a plurality of sampling periods corresponding to components in the binary vector such that, for each component in the binary vector, a component value of the component is set to “

1”

if, in accordance with the subgraph, signalling occurs between at least two of the m communication devices during the sampling period corresponding to the component, and the component value of the component is otherwise set to “

0”

; and

test whether the signalling between the different m communication devices used for constructing the binary vector is temporally connected by checking that a number of consecutive “

0”

component values of the components of the binary vector, if any, between any two “

1”

component values of the components of the binary vector is less than a predefined value.

11. The network node of claim 10, wherein at least two of the plurality of communication devices are machine-to-machine (M2M) devices.

12. The network node of claim 10, wherein at least two of the plurality of communication devices are radio devices.

13. The network node of claim 10, wherein the network node is configured for being comprised in a connectivity service platform, e.g. the Ericsson Device Connection Platform (DCP) or other hosted core network (CN).

14. A computer program product comprising a non-transitory computer readable medium storing a computer program for finding temporally connected connection patterns of communication devices in a communication network, the computer program comprising computer program code which is able to, when run on processor circuitry of a network node in the communication network, cause the network node to:

identify signalling between the communication devices during a predefined time duration to form a main communication graph in which the plurality of communication devices are nodes;

partition the main communication graph for a time period comprised in said predefined time duration to capture temporally connected signalling between a group of the plurality of communication devices as illustrated in the main communication graph in a partitioned communication graph;

form at least one subgraph from the partitioned communication graph, said subgraph comprising m nodes corresponding to m communication devices of said group of the plurality communication devices, where m>

1;

construct a binary vector of the subgraph over the time period divided into a plurality of sampling periods corresponding to components in the binary vector such that, for each component in the binary vector, a component value of the component is set to “

1”

if, in accordance with the subgraph, signalling occurs between at least two of the m communication devices during the sampling period corresponding to the component, and the component value of the component is otherwise set to “

0”

; and

test whether the signalling between the different m communication devices used for constructing the binary vector is temporally connected by checking that a number of consecutive “

0”

component values of the components of the binary vector, if any, between any two “

1”

component values of the components of the binary vector is less than a predefined value.