Method for configuring a network by defining clusters

• US 20040117226A1
• Filed: 09/25/2003
• Published: 06/17/2004
• Est. Priority Date: 03/30/2001
• Status: Abandoned Application

• Current Assignee: Nokia Corporation
• Original Assignee: Nokia Corporation
• Inventors: Raivio, Kimmo, Henriksson, Jukka, Hamalainen, Ari, Hoglund, Albert, Hatonen, Kimmo, Laiho, Jaana
• Application Number:
  US10/472,824
• Publication Number:
  US 20040117226A1
• Time in Patent Office: Days
• US Class Current: 705/7
• CPC Class Codes: G06Q 10/06393 Score-carding, benchmarking or key performance indicator [KPI] analysis
• CPC Class Codes: H04L 41/0816 the condition being an adaptation, e.g. in response to network events
• CPC Class Codes: H04L 41/0893 Assignment of logical groups to network elements
• CPC Class Codes: H04L 41/142 using statistical or mathematical methods
• CPC Class Codes: H04L 41/16 using machine learning or artificial intelligence
• CPC Class Codes: H04L 43/00 Arrangements for monitoring or testing data switching networks
• CPC Class Codes: H04L 43/0847 Transmission error
• CPC Class Codes: H04W 24/02 Arrangements for optimising operational condition
• CPC Class Codes: H04W 28/06 Optimizing the usage of the radio link, e.g. header compression, information sizing , discarding information system modifying transmission characteristic according to link quality by modifying frame length H04L1/0007; dynamic adaptation of the packet size for flow control or congestion control H04L47/365
• CPC Class Codes: H04W 84/00 Network topologies

Abstract

The invention proposes a method for configuring a network, wherein the network comprises a plurality of network sections, the method comprising the steps of accessing (S2) data from network sections; forming (S3) groups of network sections using a clustering method by using at least part of the accessed data as input data; and processing (S4) parameter on network section group level. By this method, the operation load during optimising a network consisting of a large number of cells can be greatly reduced. The invention also proposes a corresponding network optimising system.

Claims

1. A method for configuring a network, wherein the network comprises a plurality of network sections (C1 to C32), the method comprising the steps of accessing (S2) data from network sections;

forming (S3) groups of network sections by using at least part of the accessed data as input data; and

adjusting (S4) parameters of all network sections in one grroup in common, characterized in that in the group forming step (S3), a neural clustering method is used, and the groups of network sections are clusters formed by the neural clustering method.

2. The method according to claim 1, wherein the clustering method is a Self Organizing Map (SOM) algorithm.

3. The method according to claim 1, wherein the clustering method is a K-means algorithm.

4. The method according to claim 1, wherein a vector is defined having as element one or more data of a particular network section.

5. The method according to claim 4, further comprising the step of obtaining the state of a particular network section by determining the best-matching unit (BMU) of [data]vectors of the network section[s].

6. The method according to claim 5, further comprising the step of obtaining a sequence of states and forming a histogram, wherein network sections having similar histograms are classified to same groups.

7. The method according to claim 1, wherein a vector is defined which comprises as elements a particular data of a plurality of network sections.

8. The method according to claim 7, further comprising the step of providing a covariance matrix of a plurality of component planes of a plurality of vectors.

9. The method according to claim 1, wherein clusters are identified by using Unified distance matrix algorithm.

10. The method according to claim 1, wherein clusters are identified by using Davies-Bouldin index algorithm.

11. The method according to claim 4 or 7, wherein a best matching unit (BMU) is determined by using an Euclidian distance.

12. The method according to claim 4 or 7, wherein a best matching unit (BMU) is determined by using an KullbackLeibler distance.

13. The method according to claim 1, wherein a network section is a single network element.

14. The method according to claim 1, wherein the network is a cellular network and the network sections are cells.

15. The method according to claim 1, wherein the network sections are grouped based on quality measurements.

16. The method according to claim 1, wherein the network sections are grouped based on traffic profiles in the network sections.

17. A network configuration system which is adapted to configure a network comprising a plurality of network sections (C1 to C32), comprising a configuration device (2) which is adapted to have access to data in the using at least part of the accessed data as input data and to adjust parameters of all network sections in one group in common characterized in that the configuration device (2) is adapted to form the groups of network sections according to a neural clustering method.

18. The system according to claim 17, wherein the clustering method is a Self Organizing Map (SIM) algorithm.

19. The system according to claim 17, wherein the clustering method is a K-means algorithm.

20. The system according to claim 17, wherein the configuration device (2) is adapted to define a vector having as element one or more data of a particular network section.

21. The system according to claim 20, wherein the configuration device (2) is adapted to obtain the state of a particular network section by determining the best-matching unit (BMO) of vectors of the network sections.

22. The system according to claim 21, wherein the configuration device (2) is adapted to obtain a sequence of states and to form a histogram, wherein network sections having similar histograms are classified to same clusters.

23. The system according to claim 17, wherein the configuration device (2) is adapted to define a vector which comprises as elements a particular data of a plurality of network sections.

24. The system according to claim 23, wherein the configuration device (2) is adapted to provide a covariance matrix of a plurality of component planes of a plurality of vectors.

25. The system according to claim 17, wherein the configuration device (2) is adapted to identify clusters by using the Unified distance matrix (U-matrix) algorithm.

26. The system according to claim 17, wherein the configuration device (2) is adapted to identify clusters by using the Davies-Bouldin index algorithm.

27. The system according to claim 20 or 23, wherein the configuration device (2) is adapted to determine a best matching unit (BMU) by using an Euclidian distance.

28. The system according to claim 20 or 23, wherein the configuration device (2) is adapted to determine a best matching unit (BMU) by using a Kull-Leibler distance.

29. The system according to claim 17, wherein a network section is a single network element.

30. The system according to claim 17, wherein the network is a cellular network and the network sections are cells.

31. The system according to claim 17, wherein the configuration device (2) is adapted to group network sections based on quality measurements.

32. The system according to claim 17, wherein the configuration device (2) is adapted to group network sections based on traffic profiles in the network sections.

33. The system according to claim 17, further comprising a data collecting device (1) which is adapted to collect data from the network sections and to provide it to the configuration device (2).

34. The system according to claim 17, further comprising a network managing device (3) which is adapted to manage actual network configuration data.