Abstract:
A method is provided of evolving algorithms for network node control in a telecommunications network by genetic programming to (a) generate algorithms (b) determining fitness level of the algorithms based on a model of the telecommunications network and (c) select the algorithm that meet a predetermined fitness level or number of generations of evolution. The model is updated and the steps (a), (b) and (c) are repeated automatically to provide a series of algorithms over time adapted to the changing model of the network for possible implementation in the network.

Description:
FIELD OF THE INVENTION 
       [0001]    The present invention relates to telecommunications, in particular to telecommunications networks. 
       DESCRIPTION OF THE RELATED ART 
       [0002]    Telecommunications networks increasingly incorporate abilities to self-configure, self-organise and self-adapt. As the size and complexity of telecommunications networks increases, there is a drive to implement these so-called “self-x” properties in a decentralised manner, namely where each node can act individually using only local information. 
         [0003]    Accordingly, there is a growing need to develop self-x algorithms, i.e. algorithms for network node self-adaptation, that have to work without global information about the network nor coordinated central control of the network nodes. Some examples of self-x algorithms in wireless networks include algorithms for optimising cell coverage and capacity, and resource scheduling algorithms. Some examples in the field of wireline networks are routing algorithms that operate dependent upon a variety of variables, such as traffic load level, number of hops between nodes along communication paths, and Quality of Service (QoS) requirements. 
         [0004]    A known approach is for self-x algorithms to be designed by skilled engineers. based on specific assumptions about the network that may not be realistic, so there is often a need for the algorithms to be evaluated, revised and refined after they have been implemented in networks. This can be a slow and expensive process. 
         [0005]    Genetic programming is a known evolutionary approach to generating an algorithm, see for example Koza, J. R., Genetic Programming: On the Programming of Computers by Means of Natural Selection 1992: MIT Press, 840. 
         [0006]    Genetic programming is described briefly here to ease the understanding of the reader. 
         [0007]    As shown in  FIG. 1 , genetic programming (GP) involves the following steps:
       (i) Initialise a population of algorithms—a population is the term used for a collection of individual algorithms, the algorithms in the initial population being generated at least somewhat randomly;   (ii) Calculate the fitness of each of the algorithms in the population—fitness being the term used for a measure of the algorithms performance in achieving the task of the algorithm;   (iii) Select algorithms to become “parents” based on their fitness;   (iv) Create new algorithms by applying genetic operators, such as mutation and crossover to the parents selected in the previous step;   (v) Produce the next generation population of algorithms using newly created algorithms and survivors chosen from the previous generation population.   The above steps (ii) to (v) are repeated until a termination condition is met (for example the process has gone through a set number of generations, or a target fitness level is met by an algorithm that has been created).       
 
         [0014]    As shown in  FIG. 2 , a parse tree representation is typically used in genetic programming (GP) in order to encode an algorithm into a form upon which genetic programming operations can be performed. The parse tree can be used to represent various forms of algorithms, such as computer programs. Algorithms can be represented in other forms, such as by state transition diagrams. 
         [0015]      FIG. 3  shows illustrative examples of the crossover and mutation operators mentioned above. Crossover is mixing components from two parent algorithms to produce a next generation (i.e child) algorithm. Mutation is modifying part of an individual parent algorithm to produce a next generation algorithm. 
         [0016]    Use of genetic programming to generate an algorithm for use in a telecommunications network is described in a paper by Lewis T., Fanning N. and Clemo G. entitled “Enhancing IEEE802.11 DCF using Genetic Programming”, IEEE 2006. 
       Summary 
       [0017]    The reader is referred to the appended independent claims. Some preferred features are laid out in the dependent claims. 
         [0018]    An example of the present invention is a method of evolving algorithms for network node control in a telecommunications network by genetic programming to (a) generate algorithms (b) determining fitness level of the algorithms based on a model of the telecommunications network and (c) select the algorithm that meet a predetermined fitness level or number of generations of evolution. The model is updated and the steps (a), (b) and (c) are repeated automatically to provide a series of algorithms over time adapted to the changing model of the network for possible implementation in the network. 
         [0019]    This process may be performed periodically throughout the operation of the network so that algorithms implemented in the network are adapted to the changing network. 
         [0020]    In preferred embodiments, a central network node uses genetic programming to generate new algorithms for use by network nodes, and information of the network is used to update an internal model of the network. For example, the information may be obtained from measurements made by the network or input by engineers. Preferably, the node uses that model along with genetic programming building blocks to create algorithms that meet a target criterion such as of fitness level or number of generations of evolution. Preferably once such an algorithm is provided, it is tested and if deemed acceptable implemented in the network nodes. 
         [0021]    This approach is particularly suitable to changing networks, for example self-configuring networks, for example comprising femtocell base station, and suitable for providing algorithms for implementation that are themselves self-adapting algorithms. 
     
    
     
       BRIEF DESCRIPTION OF THE DRAWINGS 
         [0022]    Embodiments of the present invention will now be described by way of example and with reference to the drawings, in which: 
           [0023]      FIG. 1  is a diagram illustrating schematically a genetic programming process (PRIOR ART), 
           [0024]      FIG. 2  is a diagram illustrating a computer program represented in the form of a parse tree (PRIOR ART), 
           [0025]      FIG. 3  is a diagram illustrating crossover and mutation operations applied in genetic programming to program portions represented as parse trees (PRIOR ART), 
           [0026]      FIG. 4  is a schematic representation of a network for wireless telecommunications according to a first embodiment of the invention including a network genetic programming server, 
           [0027]      FIG. 5  is a diagram illustrating the network genetic programming server shown in  FIG. 4 , 
           [0028]      FIG. 6  is a flow chart illustrating operation of the network genetic programming server, and 
           [0029]      FIG. 7  is an example genetically engineered program for optimising radio cell coverage and provided by the network genetic programming server. 
       
    
    
     DETAILED DESCRIPTION 
       [0030]    When considering a known system, the inventors realised that genetic programming could be applied to telecommunications networks in such a way as to periodically and automatically optimise them. 
         [0031]    An example network will now be described, before focusing in on an example network genetic programming server and its operation. 
         [0032]    In this description we used the term algorithm to mean a set of rules or a method that is used to solve a problem or perform a task. An algorithm may be specified in the form of a mathematical formula having technical application, a computer program, a representation of a system&#39;s behaviour such as a state transition diagram or flowchart. Examples of algorithms in telecommunications networks are a method to automatically adjust the coverage area of a radio cell, and a method of routing traffic through a network. 
       Network 
       [0033]    As shown in  FIG. 4 , the telecommunications network  2  includes a radio access network  4  which includes some interconnected cellular base stations  21 , 22 , 23 , 24 . The cellular base stations  21 , 22 , 23 , 24  have a communication link  6  to a network genetic programming server  10 . The network genetic programming server  10  is also connected via a communication link or links  8  to various network entities in the core network  30 . The various network entities include a network management system  31 , a master switching centre  32  and a database  33  containing network status information. 
         [0034]    The base stations  21 , 22 , 23 , 24  all run an algorithm to perform a predetermined task. 
         [0035]    The network genetic programming server  10  is used to provide new improved versions of the algorithm using genetic programming, as explained in more detail below. 
       Network Genetic Programming Server 
       [0036]    As shown in  FIG. 5 , the network genetic programming server  10  that uses genetic programming to create algorithms used in the base stations includes a function and terminal set  11 , genetic operators  12  and a fitness function  13  as inputs to an evolution processor  15 . The function and terminal set  11  are the building blocks of the algorithms. The genetic operators  12  are operations that manipulate existing algorithms to create new ones, and include operations such as mutation and crossover. The fitness function  13  is a function used to calculate the fitness, in other words performance of the algorithms. The fitness function  13  is predetermined based, for example, on network operator&#39;s requirements. The fitness function  13  is modified repeatedly during the operation of the network genetic programming server  10  as the network operator&#39;s requirements change, for example the network operator may wish to provide greater resources to higher-paying users. 
         [0037]    In use, the evolution processor  15  acts to run simulations of the network using the information of the model  14  of the network and various different generated algorithms and the performance results are used together with the fitness function  13  to calculate the fitness associated with each algorithm. An up-to-date model  14 , of the network is used in these simulations. 
         [0038]    The function and terminal set  11 , genetic operators  12 , a fitness function  13  and the model  14  simulation results from simulator  18  are input to an evolution processor  15 . The evolution processor  15  undertakes genetic programming. 
         [0039]    As previously described, genetic programming (GP) involves the following steps:
       (i) Initialise a population of algorithms—a population is the term used for a collection of individual algorithms, the algorithms in the initial population being generated at least somewhat randomly;   (ii) Calculate the fitness of each of the algorithms in the population—fitness being the term used for a measure of the algorithms performance in achieving the task of the algorithm;   (iii) Select algorithms to become “parents” based on their fitness;   (iv) Create new algorithms by applying genetic operators, such as mutation and crossover to the parents selected in the previous step;   (v) Produce the next generation population of algorithms using newly created algorithms and survivors chosen from the previous generation population.       
 
         [0045]    The above steps (ii) to (v) are repeated until a termination condition is met (for example the process has gone through a set number of generations to provide an algorithm, or a target fitness level is met by an algorithm that has been created). 
         [0046]    It can be considered that the algorithm output from the evolution processor  15  is one that has been selected by the evolution process. This algorithm is output from the evolution processor  15  to an algorithm verification processor  16 . 
         [0047]    The algorithm verification processor  16  pre-tests the algorithm to check suitability for deployment in the network  2 . The tests are done prior to deployment and are intended to ensure that the algorithm is well-behaved and will not cause unwanted behaviours to occur in the network. This testing is particularly important for self-x algorithms (i.e. self-configuring, self-organising etc) for decentralised control of networks, as undesirable and unexpected behaviour may occur. Such undesirable behaviours can cause inefficient operation of the network and in extreme cases can cause cascading failures throughout the network. It should be noted that adverse effects can occur generally in algorithms and are not a specific side effect of being generated by genetic programming. Once the algorithm has been pre-tested and deemed suitable, the algorithm is implemented in the appropriate network nodes, in this example the base stations  21 , 22 , 23 , 24  of the radio access network  20 . 
         [0048]    In the network genetic programming server  10 , there is a model building processor  17  which acts on the model  14  of the network to keep the model  14  up to date by incorporating any significant changes that occur in the real world and may have an impact on the algorithm evolution process, and also to continually refine the model so as to improve its accuracy. Accordingly, the model changes by being updated from time to time, for example periodically. The model building processor  17  uses information on the network that is obtained from the network nodes themselves, appropriate core network entities  30  and other sources (not shown) such as manual input by engineers. 
         [0049]    Accordingly, as explained above, the network genetic programming server  10  generates new and improved algorithms to be used in the network nodes on a periodic and automatic basis. 
         [0050]    A flowchart of the main steps taken in this automated process is shown in  FIG. 6 . 
         [0051]    As shown in  FIG. 6 , in the network genetic programming server, a next generation algorithm is generated and evaluated (step a) as to fitness level. A determination is made (step b) as to whether a generated algorithm meets a predetermined fitness level. Upon the predetermined fitness level being met, the algorithm is deemed good enough for the algorithm verification process to be undertaken. As explained above, the algorithm verification processor  16  pre-tests (step c) the algorithm to check suitability for deployment in the network  2 . A determination is then made (step d) as to whether the tests are failed or passed. If the tests are failed the algorithm is discarded (step e) and a return is made to the generation and fitness evaluation (step a). On the other hand, if the tests are passed, then the algorithm is disseminated (step f) to the network nodes. 
         [0052]    The steps a and b in  FIG. 6  occur in the evolution processor  15  shown in  FIG. 5 . The steps c, d, and e in  FIG. 6  occur in the algorithm verification processor  16  shown in  FIG. 5 . 
       Optimising Radio Coverage 
       [0053]    An example of a type of algorithm that would be subject to genetic programming and selection as explained above is one for optimising radio coverage of a cell in a wireless network, in other words automatically adjusting the radio coverage are of a base station based on measurements made in the network in the environment of the base station. An example of this type of algorithm is represented in  FIG. 7  both in the form of a parse tree and as an equation. The equation is: 
         [0000]    
       
         
           
             
               R 
               
                 t 
                 + 
                 1 
               
             
             = 
             
               
                 ( 
                 
                   
                     R 
                     t 
                   
                   + 
                   
                     1 
                     
                       N 
                       i 
                     
                   
                 
                 ) 
               
               × 
               
                 D 
                 t 
               
             
           
         
       
     
         [0000]    where D t  denotes Number of calls dropped during timeslot t, R t  denotes Cell radius during timeslot t, and N i  denotes Total number of increments performed. 
         [0054]    Example function and terminal sets used as input to the evolution processor in this example are as follows: 
         [0055]    Function set F={+,−,*,/}, is composed of basic mathematical operations. Terminal set T={Dt, Rt, Ct, Ni, 1}, is composed of measurements, node states, and constants as follows: 
         [0000]    D t —Number of calls dropped during timeslot t.
 
R t —Cell radius during timeslot t.
 
C—Coverage overlap.
 
N i —Total number of increments performed.
 
         [0056]    In this example it is envisaged that the network include a centralised controlling entity namely a network genetic programming server. In an alternative embodiment, the network genetic programming server function may be spread in a decentralised way among the network nodes, for example spread across multiple base stations or base station controllers. 
         [0057]    The approach above has been focused on use of genetic programming to generate self-x, i.e. self-configuring, self-adapting algorithms. In some other embodiments, the approach is used to provide algorithms for implementation that are not self-x algorithms. 
       General 
       [0058]    The present invention may be embodied in other specific forms without departing from its essential characteristics. The described embodiments are to be considered in all respects only as illustrative and not restrictive. The scope of the invention is, therefore, indicated by the appended claims rather than by the foregoing description. All changes that come within the meaning and range of equivalency of the claims are to be embraced within their scope. 
         [0059]    A person skilled in the art would readily recognize that steps of various above-described methods can be performed by programmed computers. Some embodiments relate to program storage devices, e.g., digital data storage media, which are machine or computer readable and encode machine-executable or computer-executable programs of instructions, wherein said instructions perform some or all of the steps of said above-described methods. The program storage devices may be, e.g., digital memories, magnetic storage media such as a magnetic disks and magnetic tapes, hard drives, or optically readable digital data storage media. Some embodiments involve computers programmed to perform said steps of the above-described methods.