Abstract: A route finder means and method for finding routes to satisfy a plurality of connection requests in a communications network comprising a plurality of nodes connected by a plurality of links. A cost is assigned to each network link. Arrays of eight shortest paths of links between each pair of nodes in the network are created. Bit strings comprising for example a 3 bit binary number for each point-to-point connection request are generated. Each 3 bit number is an index to one element of the shortest path array for each connection request's source and destination nodes. The bit strings are assembled into population members which are manipulated by genetic algorithms. The fitness of the population members is evaluated by calculating the cost of traversing the routes represented by the bit strings. The route finder means and method has an ability to split traffic over multiple routes, and to handle different traffic types, eg different bit rate traffic types.

Abstract: A route finder for point to multi-point connection requests in a communications network comprising a plurality of nodes connected by a plurality of links. A cost is assigned to each network link. For each connection request a set of all network nodes not included in its source node or its plurality of destination nodes are selected. An array of bits is created with an array element corresponding to a selected node element having a value of 1 if the node is steiner vertex for a steiner tree of nodes not selected, otherwise the array element has a value of 0. Each array is treated as a bit string and considered as population members which are manipulated by genetic algorithms. The fitness of the population members is evaluated by calculating the cost of traversing the routes represented by the bit strings. The method is capable of routing a plurality of multi-point connection requests, and selecting an overall optimum solution.

Abstract: A method of managing a communications network is described which makes use of information about the current state of the network and in addition, information about past and/or future states of the network. Information about the current state of the network is stored in a management information base (MIB) and the information about the past/future states is either stored in this MIB, or separate past/future MIBs are created. The information about the past/future states is stored in a way such that it can be operated on in the same way as the information about the current state of the network. By storing the information in this way management of the network is improved. For example, future states of the network can be tested before being implemented. Also, information about past states can be used to predict future states. Fault management, configuration management, accounting management and performance management can all be improved by using the information about past/future states.