A RELIABLE TELECOMMUNICATION NETWORK INCLUDING TELEPHONE EXCHANGES AND DATABASES

Abstract: Operation of telephone exchanges requires access to substantial amounts of data that are held on databases on servers. In telecommunication networks, each data base serves several telephone exchanges in a client-server relationship. The data stored on the databases is identical and updated infrequently. The invention is based on the realisation that it is possible to provide the exchanges with more information on the overall system architecture than is possible in conventional client-server relationships because the number of exchanges served by the databases is known and fairly static. The invention provides a telecommunication network including a plurality of telephone exchanges and identical databases. Each telephone exchange is adapted, at a given time, to access one database and has information specifying the address and status for each database in the telecommunication network. For each telephone exchange, the accessed database is selected on a dynamic basis by that exchange.

Description: A RELIABLE TELECOMMUNICATION NETWORK INCLUDING TELEPHONE EXCHANGES AND DATABASES The present invention relates to a telecommunications network incorporating a multiplicity of telephone exchanges and a plurality of identical databases, in which each telephone exchange is adapted to dynamically select which database it shall access, telephone exchanges for use in such a telecommunications network, databases for use in such a telecommunications network and methods of operating such a telecommunications network. In modern telecommunications systems and networks, the operation of telephone exchanges requires that they have access to substantial amounts of data, for example, subscriber profiles, or called profiles. This data is held on databases stored on servers, which may be remote from the telephone exchanges. Λ telecommunications network may include a multiplicity of telephone exchanges, say 270, and a plurality of databases, say 13. Each database (server) must serve several telephone exchanges (clients) in a client-server relationship. Furthermore, the data stored on each database must be identical. At a given time, each telephone exchange accesses one database. The data stored on the databases is updated infrequently, but is vital to the correct operation of the telephone exchanges, e.g. it may be used in call set-up (B-number analysis). This means that each exchange will need to make a large number of short read accesses to its associated database. In an ideal system, or network, each exchange will make roughly the same number of database accesses in a given period of time. It is important that the access load is uniformly distributed over each of the databases. There are a number of problems associated with the operation of telephone networks of this type, for example: a. How and where are decisions relating to the assignment of a database to a given exchange made? b. What happens when a given database goes down? c. How will the loading on each database be managed? d. How will a database that has been off-line be re-integrated into the network? e. How can inconsistencies between the data stored on different databases be avoided, especially when updates are made during the period in which one, or more, databases are down? f. What sort of algorithm/architecture can handle the high database accessibility required by a large number of telephone exchanges? The present invention relates to solutions for these problems. The present invention is, in part, based on the realisation that, in a telephone network, it is possible to provide the clients (telephone exchanges) with more information on the overall system architecture than is possible in a conventional client/server relationship because the number of exchanges served by the plurality of databases is known and fairly static. Most existing database systems, in which there are a plurality of replicated databases, do not handle the problem of redistributing clients when a database fails. In those systems which do address this problem, client redistribution is often handled statically in accordance with a predetermined priority order. Attempts have been made to handle client redistribution dynamically, in an optimal manner, without much success. The primary reason for the failure of optimal dynamic client redistribution is that the problem to be solved is, in reality, a very difficult combinatorial problem. It should be noted that the present invention avoids the use of optimal dynamic solutions and, therefore, the need to solve this combinatorial problem. In fact, the present invention uses a simple re-randomisation of clients over the available databases which provides a good heuristic approximation to the optimisation problem. According to a first aspect of the present invention, there is provided a telecommunications network, including a multiplicity of telephone exchanges, m, and a plurality of identical databases, n, where m is substantially greater than n, in which each telephone exchange is adapted, at a given time, to access one database, characterised in that each telephone exchange has information specifying an address and status for each database in the telecommunications network, and in that the database accessed by that telephone exchange, is selected on a dynamic basis by that telephone exchange. The database that will be accessed, at a given time, by each telephone exchange, may be selected on a random dynamic basis. When a database selected by a telephone exchange fails, or goes down, the telephone exchange may be adapted to select a new database on a random basis. Each telephone exchange may be initially associated with a preferred, or primary, database. Said m telephone exchanges may be associated with preferred databases on a random basis, in such a manner that each database has a sub.stantially similar loading in terms of access transactions addressed thereto. When a database that has failed comes on line, each telephone exchange that has that database designated as its primary database, may be adapted to reselect that database for data access operations. Each telephone exchange may have means for identifying when its primary database is unavailable, means for identifying which databases in the telecommunications network are available, and means for detecting when a database which has been unavailable, becomes available. When said telecommunications network is partitioned into a first and second partition, as a result of a communications failure, such that databases in said first partition cae may have means for enabling that database to determine how many telephone exchanges are able to access the database, and in that means may be provided for inhibiting updates to said database, in said first partition, when only half, or less, of the telephone exchanges in said telecommunications network are able to access the database. If said second partition includes more than half said telephone exchanges, and said second partition is further partitioned, as a result of a communications failure, into third and fourth partitions, and a majority of the telephone exchanges in said second partition are within said third partition, means may be provided for inhibiting updates to databases operating in said fourth partition. Means may be provided to ensure that, when a database that has failed, or has been within an isolated partition of said telecommunications network, is about to return to full operational effectiveness, said database is initialised so that its contents are identical with another database, within said telecommunications network, that is currently fully operational, before any telephone exchange is permitted to access said database. Each telephone exchange in said telecommunications network may carry a record, for each database in said telecommunications network, including, for each database, a name, an address and a status flag, where the name is a logical name for the database and the status flag indicates whether, or not, the database is currently accessible from a given telephone exchange. Said address may be an IP address. Each telephone exchange in said network may be adapted to operate a heart beat process which continuously monitors a heartbeat transmitted by each database in said network and, if there is a change of status for a given database, modifies the status flag in the record for that database. Each telephone exchange in said telecommunications network may be adapted, in the event of a change of status of a database which is a Current_Node for a given telephone exchange, to select a new Current_Node according to the following rule: Current_Node = {N if N.STATUS = UP, else randomly select a new database among all t, where t.STATUS = UP} where N denotes the primary database for the telephone exchange, N.STATUS is the status flag for database N in the record of databases held at the telephone exchange, t denotes a given one of the databases in the telecommunications network, other than N, and t.STATUS denotes the status flag for the record of database t held at the telephone exchange. Said telecommunications system may be adapted to operate a free- number system, and in that said databases may include a concordance record, for each subscriber to said telecommunications network, linking a logical number used by others to initiate calls to a subscriber, and a physical number used by the telecommunications network to identify an access point for that subscriber. According to a second aspect of the present invention, there is provided, a telephone exchange, adapted to operate within a telecommunications network, including a multiplicity of telephone exchanges, m, and a plurality of identical databases, n, where m is substantially greater than n, said telephone exchange being arranged so that, at a given time, it can access a single database, characterised in that said telephone exchange has information specifying an address and status for each database in the telecommunications network, and in that the database that will be accessed by the telephone exchange is selected by the telephone exchange on a dynamic basis. 5 According to a third aspect of the present invention, there is provided a database, adapted to operate within a telecommunications network, including a multiplicity of telephone exchanges, m, and a plurality of identical databases, n, where m is substantially greater than n, said telephone exchanges being arranged so that, at a given time, each telephone exchange can access a single database, 10 characterised in that when said telecommunications network is partitioned into a first and second partition, as a result of a communications failure, such that databases in said first partition cannot be accessed from telephone exchanges in said second partition, said database having means for determining how many telephone exchanges are able to access it, and in that means are provided for inhibiting updates 15 to said database when only half, or less, of the telephone exchanges in said telecommunications network are able to access it. According to a fourth aspect of the present invention, there is provided a method comprising a multiplicity of telephone exchanges, m, and a plurality of • o identical databases, n, where m is substantially greater than n, in which each telephone exchange is adapted, at a given time, to access one database, characterised by providing each telephone exchange with information specifying an address and status for each database in the telecommunications network, and each telephone exchange dynamically selecting the database that it will access. 5 Each telephone exchange may select the database that it will access, at a given time, on a random dynamic basis. A telephone exchange, when a database selected by that telephone 0 exchange fails, or goes down, may select a new database on a random basis. Each telephone exchange may initially be associated with a preferred, or primary, database. Each of said m telephone exchanges may be associated with a preferred database, on a random basis, in such a manner that each database has a substantially similar loading in terms of access transactions addressed thereto. When a database that has failed comes on line, each telephone exchange that has that database designated as its primary database, may reselect that database for data access operations. Each exchange may identify when its primary database is unavailable, identify which databases in the telecommunications network are available, and detect when a database which has been unavailable, becomes available. When said telecommunications network is partitioned into a first and second partition, as a result of a communications failure, such that databases in said first partition cannot be accessed from telephone exchanges in said second partition, each database may determine how many telephone exchanges are able to access it, and updates to said database may be inhibited when only half, or less, of the telephone exchanges in said telecommunications network are able to access the database. If said second partition includes more than half said telephone exchanges, and said second partition is further partitioned, as a result of a communications failure, into third and fourth partitions, and a majority of the telephone exchanges in said second partition are within said third partition, updates to a database may be inhibited. When a database that has failed, or has been within an isolated partition of said telecommunications network, is about to return to full operational effectiveness, said database may be initialised so that its contents are identical with another database within said telecommunications network that is currently fully operational, before any telephone exchange is permitted to access said database. Each telephone exchange in said telecommunications network may carry a record, for each database in said telecommunications network, including, for each database, a name, an address and a status flag, where the name is a logical name for the database and the status flag indicates whether, or not, the database is currently accessible from a given telephone exchange. Each telephone exchange in said network may operate a heart beat process which continuously monitors a heartbeat transmitted by each database in said network and, if there is a change of status for a given database, may modify the status flag in the record for that database. Each telephone exchange in said telecommunications network, in the event of a change of status of a database which is a Current_Nodc for a given telephone exchange, may select a new Current_Node according to the following rule: Current_Node = {N if N.STATUS = UP, else randomly select a new database among all t, where t.STATUS = UP} where N denotes the primary database for the telephone exchange, N.STATUS is the status flag for database N in the record of databases held at the telephone exchange, t denotes a given one of the databases in the telecommunications network, other than N, and t.STATUS denotes the status flag for the record of database t held at the telephone exchange. According to a fifth aspect of the present invention, there is provided a telecommunications system characterised in that it includes a telecommunications network, or a telephone exchange, or a database, or operates in accordance with a method, as set forth in any preceding paragraph. Embodiments of the invention will now be described, by way of example, with reference to the accompanying drawings, in which: 5 Figure 1 illustrates a simplified example of a telecommunications network, according to the present invention, in which all database servers are operational. Figure 2 illustrates the telecommunications network of Figure 1 , after one of o the databases has gone down. Figure 1 shows a simplified telecommunications network comprising twelve telephone exchanges, 2, served by three database servers, I . As will be apparent from the drawing, each exchange, 2, is served by a single database, 1 , and 5 each of the databases can communicate with every other database. If one of the database servers fails, for some reason, as shown in Figure 2, it is necessary to reassign operating databases to the telephone exchanges which were originally served by the failed database server. The assignment of a new database to a telephone exchange, as a result of database server failure, is temporary and needs to be reversed 0 when the failed server becomes operational again. The use of multiple replicated databases provides a degree of redundancy which enhances the accessibility of operationally vital data, by exchanges. The telecommunications network described with reference to Figures 1 5 and 2 is a highly simplified version of a real network. A real telecommunications network may include a very large number of telephone exchanges, e.g. 270, and significantly more database servers than are shown in the drawings, e.g. 13. The precise physical location of the database servers is a matter of convenience, they may be located at network management centres, or in the same buildings as telephone 0 exchanges. The point is that they operate independently of the telephone exchanges and are distinct network elements in their own right. The decision, as to which database a given exchange will be associated with, i.e. which database an exchange will access when it requires data, e.g. for a call set-up operation, is made dynamically by the telephone exchange. This means that, 5 provided there are a significant number of exchanges in the network and the number of exchanges is substantially larger than the number of databases, the distribution of exchanges to databases will be randomised and, on average, each database will carry an approximately equal load. By locating database selection decisions with the client (telephone exchange), a client can select and access a new database if, for any reason, 0 its connection to an initially selected database fails. This meets the requirement that, in the event of a database failure, exchanges associated with the failed database can rapidly acquire access to an operational database. If there are a total of n databases in the telecommunications network, 5 two of which fail, there will be a total n - 2 databases to meet the requirements of all the telephone exchanges in the system, say m, where m » n. To determine a redistribution of n - 2, or fewer, if more than two databases have failed, is a difficult optimisation problem to handle in a mathematically precise manner. () Initially, i.e. when all databases are operational, each exchange has a primary database which it accesses. This may be preassigned, or randomly selected, by each exchange. Suppose that one of the databases in the telecommunications network fails. All the telephone exchanges for which the failed database was the primary database are then distributed at random among the operational databases. 5 This can be considered as the equivalent to each reassigned exchange temporarily taking a new primary database, if its original primary database fails. As databases progressively fail, exchanges proceed to take new primary databases as long as possible. When a database which has failed comes on line again, all exchanges which had that database as their original primary database commence accessing it again, i.e. 0 the newly on-line database is restored as the primary database for those exchanges for which it was initially a primary database. This means that those exchanges whose primary database is still down will remain randomly distributed among databases which are accessible. It should be noted that a newly restored database will not carry any exchanges in addition to those for which it is an initial primary database, i.e. if two databases failed, and one was restored, the restored database will cany its original load while the remaining operational databases will all carry an excess load. This ensures that as the databases start functioning again the original distribution of databases to the exchanges is progressively restored. However, it does mean that a temporary inequality of loads may occur. This will automatically be rectified as either more databases come on-line, or more databases fail. This requires that each exchange: can detect when a database which is, for the time being, its primary database, has become unavailable; - knows which of the other databases in the telecommunications network arc available; and detects when a database, which has become unavailable, becomes available again. Consider two replicated databases, DB1 and DB2, i.e. the two databases are exact copies of each other. Clients, i.e. telephone exchanges, can access either of the databases, i.e. the client load is equally divided between the two databases. The exchanges both read and write to the databases. Updating and "concurrency control" is achieved by the exchange of information between the database servers. The following three failure modes can occur: 1. one of the databases fails; 2. a communication error results in the databases each being able to serve only a given sub-set of the clients, i.e. each database becomes located in a partitioned portion of the telecommunications network; and 3. both databases fail. 5 In case (1), the database remaining in operation should be able to supply data to all clients, including those who originally had access to the failed database. 10 In case (2), it will appear from the viewpoint of DB1, that DB2 has failed, and from the point of view of DB2, that DB 1 has failed, because the two databases will no longer be able to communicate with each other. The problem is: "How does a database decide whether the other database has failed, or there is 5 merely a communications error?" In reality, neither database can decide if the other database has failed, or there is a communications error. In particular, how will database updates be handled when they cannot be made simultaneously on both databases? > In some known database systems an optimistic view of the problem is taken and DB 1 and DB2 are permitted to operate independently of each other. Inconsistencies, if any, that arise in the data, i.e. updates made to the same data elements in each database, are resolved, after communication between the databases 5 is restored, by using an appropriate algorithm, equivalent to an operator studying log files. Other systems define a "master-database" which is always allowed to function, alone if necessary, i.e. updates are only permitted after they have been entered on the master-database. 0 In both cases ( 1 ) and (2), the only real problem is the management of updates. Two other problems associated with this example are: if both databases have failed, case (3), how can start-up be achieved 5 in a controlled manner when both databases are restored? how does a database that has failed know that it has failed and that it must be re-initialised, i.e. its data reconciled with the data held by the database that has remained operational, before clients can be l o permitted to access it? These problems can be overcome by giving clients, i.e. telephone exchanges, information on the way in which the system functions and identifying all clients to the databases. The clients thus know if any of the databases arc 15 inaccessible. If one of the databases, e.g. DBl, has failed, or is temporally located in an inaccessible partition of the network, updates to it are permitted provided that it can communicate with more than half the total number of clients. In this situation the ?0 DBl will be registered with all accessible clients as be "down". This tells clients that they should, if possible, access DB2, because the most current information is available on this database. This methodology avoids any database operating as a master-database 25 in an isolated network partition, thereby eliminating the risk of inconsistencies between databases occurring, while at the same time permitting the database which can be accessed by the larger number of clients to continue full operation. A database which has failed will know that it has failed and that it needs to deny clients access until it has re-aligned itself with the fully operational database. 30 This arrangement also caters for the case in which there are further communications errors, or network partitioning, on the basis of "half the number of half the number" of clients. This will constitute further information on which decisions relating to database access can be managed. When a single database fails, or finds itself located in a network partition that includes less than half the total number of system clients, the database knows that it has been deemed to have failed and then denies all clients access. This means that all exchanges for which it is the primary database will be denied access and will access another database. Any updates will be communicated to the new, temporary, primary database, and thence will be communicated to all other operational databases. When the database comes on line again, it will, before permitting client access, update itself from any convenient one of the remaining databases. Where several databases fail, because they are isolated within a network partition, during the same period, the same procedure can be used. Voting procedures, when a second database failure occurs, are based on at least half the remaining clients, i.e. half of half the clients. The successful operation of this methodology depends on clients always being able to access at least one database which is accessible to all clients. In other words, the telecommunications network may, as a result of a communications failure, be partitioned into first and second partitions. Furthermore, it may not be possible to access databases in the first partition from telephone exchanges in the second partition. Each database in the first partition can determine how many telephone exchanges are able to access it and can inhibit updates to said database, when only half, or less, of the telephone exchanges in the telecommunications network are able to access it. If: the second partition includes more than half the telephone exchanges in the network; the second partition is further partitioned, as a result of a communications failure, into third and fourth partitions; and a majority of the telephone exchanges in said second partition are within said third partition, then the database will inhibit updates, if it operates in the fourth partition. Each client (telephone exchange) holds information on each database in the network in the form of n tuples, t, (there are n databases), which consist of <NAME, ADDRESS, STATUS>. NAME corresponds to a logical name for a given database, ADDRESS may, for example, be the IP-address of the named database, and STATUS is a flag which can be set UP, or DOWN, depending on whether, or not, the named database is judged to be accessible from the telephone exchange. The database, which each telephone exchange accesses as an initial position, i.e. its primary node, is referred to as N. The database to which a telephone exchange currently has access is called the Current_Nodc and in the initial position Currcnt_Node = N. In order to handle database access, two processes are required in the exchange, namely: a heart beat process (HP); and a control process (KP). The heartbeat process continually monitors which databases are available to the exchange and which are not, i.e. it receives and monitors their heartbeats and sets the t.STATUS flags accordingly. The control process continuously watches for the following triggers: - Trigger 1 Event: updating of any t.STATUS to DOWN Condition: t=N, or Currcnt_Nodc Action: select new Current_Node; Trigger 2 - Event: updating of any tSTATUS to UP Condition: - Action: select new Current_Node. If an event occurs in trigger (1), i.e. the heartbeat process detects that a database has gone down, i.e. is no longer accessible, and this has occurred to either the original primary node, N, or a node which is currently the Currcnt_Node. (may lie N), then the telephone exchange will change the database which it accesses. If an event occurs in trigger (2), i.e. the heartbeat process detects that any database has returned to its UP status, then the access of the exchanges must be unconditionally re-distributed on a random basis. The rule which handles selection of a new Currcnt_Node is that: Current_Node = [N if N.STATUS =UP; in other cases select randomly a new database among all t where t.STATUS =UP } . This rule guarantees that as soon as N comes UP it is selected to be the Current_Node, otherwise the telephone exchange randomly selects any other database. When all telephone exchanges randomly select access to databases there is a very small risk of unequal loading of the databases which are UP. One example of the type of data which a telephone exchange needs to access from databases in the telephone network, to which the present invention relates, is data necessary for implementation of "free-number". With "free-number", a subscriber can keep his/her directory number (Knr) when moving, or changing access-form. This requires a separation between a logical number (Knr) and a physical number (Fnr). When a call is set up a telephone exchange uses a free- number database to translate the dialled number, Knr, into a logical number, Fnr, which is used for call routing. A Fnr can be considered to consist of a station prefix (Snr) + Knr, 5 where Snr is used to route the call to the correct telephone exchange. When the Fnr is received at the correct telephone exchange, Knr is translated into the appropriate access point for the called subscriber. Alternatively, an Fnr can be used which uniquely and directly identifies the access point for a given subscriber. In this case, Fnr is entirely separate from Knr and the receiving exchange does not need to 10 perform a further translation in order to connect an incoming call. Many modern telecommunications networks employ user specific data, referred to as "called profiles", stored in the telephone exchange to which the user is connected. Current trends are to store called profiles on databases remote from 15 telephone exchanges, as in the case of the present invention. This means that when a subscriber moves, information held in databases will need to be updated aiul/or the "called profile" for that subscriber must be moved to a new exchange. To avoid inconsistent data, which can result in wrongly connected °π telephone calls while a subscriber is in the process of moving, it is important that updating is performed in a controlled manner. Four different updating procedures are described below. 25 1) Updating Procedure when Called Profile is held at the telephone exchange and the telephone number is of the form Snr + Knr: 1. Copy profile to new exchange and update the concordance of Knr to the appropriate access point in this exchange. 30 Update the concordance Knr = Snr in the free-number database. 3. Remove the information from the old exchange. 2) Updating Procedure when Called Profile is held at the telephone exchange and the telephone number is a unique Fnr: 1. Copy profile to new exchange. 2. Update the concordance Knr = Fnr in the free-number database. 3. Remove the information from the old exchange. 3) Updating Procedure when Called Profile is held on a database external to the telephone exchange and the telephone number is of the form Snr + Knr: 1. Update the concordance of Knr to the access point in the new exchange. 2. Update the concordance Knr = Snr in the free-number database. 3. Remove the information in the old exchange. 4) Updating Procedure when Called Profile is held on a database external to the telephone exchange and the telephone number is a unique Fnr: 1. Update the concordance Knr = Fnr. The invention herein described is concerned with the architecture and operation of a telecommunications network which includes a multiplicity of telephone exchanges and a plurality of identical replicated databases which are accessed by the telephone exchanges. The following inventive features can be identified, among others, in the present invention: the selection of the database which will be accessed by a given telephone exchange is made by that telephone exchange; when the database selected by a telephone exchange is down, an alternative database is selected by that exchange on a random basis; when an exchange's primary database comes on line, after having been down, the exchange reverts to accessing that database; and each exchange in the network maintains a record of all databases in the network, together with the up-down status of those databases.

Claims: CLAIMS 1. A telecommunications network, including a multiplicity of telephone 5 exchanges, m, and a plurality of identical databases, n, where m is substantially greater than n, in which each telephone exchange is adapted, at a given time, to access one database, characterised in that each telephone exchange has information specifying an address and status for each database in the telecommunications network, and in that, the database accessed by a telephone exchange, is selected on a 1 o dynamic basis by that telephone exchange. 2. A telecommunications network, as claimed in claim 1 , characterised in that the database that will be accessed, at a given time, by each telephone exchange, is selected on a random dynamic basis. 15 3. A telecommunications network, as claimed in claim 1 , or claim 2, characterised in that when a database selected by a telephone exchange fails, or goes down, the telephone exchange is adapted to select a new database on a random basis. Λ 4. A telecommunications network, as claimed in any previous claim, characterised in that each telephone exchange is initially associated with a preferred, or primary, database. 5. A telecommunications network, as claimed in any previous claim, 5 characterised in that said m telephone exchanges are associated with preferred databases on a random basis, in such a manner that each database has a substantially similar loading in terms of access transactions addressed thereto. 6. A telecommunications network, as claimed in claim 4, or claim 5 when 0 dependent on claim 4, characterised in that when a database that has failed comes on line, each telephone exchange, that has that database designated as its primary database, is adapted to reselect that database for data access operations. 7. A telecommunications network, as claimed in claim 5, or claim 6, characterised in that each telephone exchange has means for identifying when its primary database ietwork are available, and means for detecting when a database which has been unavailable, becomes available. 8. A telecommunications network, as claimed in any previous claim, characterised in that when said telecommunications network is partitioned into a first and second partition, as a result of a communications failure, such that databases in said first partition cannot be accessed from telephone exchanges in said second partition, each database has means for enabling that database to determine how many telephone exchanges are able to access the database, and in that means are provided for inhibiting updates to said database, in said first partition, when only half, or less, of the telephone exchanges in said telecommunications network arc able to access the database. 9. A telecommunications network, as claimed in claim 8, characterised in that if said second partition includes more than half said telephone exchanges, and said second partition is further partitioned, as a result of a communications failure, into third and fourth partitions, and a majority of the telephone exchanges in said second partition arc within said third partition, means arc provided for inhibiting updates to databases operating in said fourth partition. 10. A telecommunications system as claimed in either claim 8, or 9, characterised in that means are provided to ensure that, when a database that has failed, or has been within an isolated partition of said telecommunications network, is about to return to full operational effectiveness, said database is initialised so that its contents are identical with another database, within said telecommunications network, that is currently fully operational, before any telephone exchange is permitted to access said database. 1 1. A telecommunications network, as claimed in any previous claim, characterised in that each telephone exchange in said telecommunications network carries a record, for each database in said telecommunications network, and a status flag, where the name is a logical name for the database and the status flag indicates whether, or not, the database is currently accessible from a given telephone exchange. 12. A telecommunications network, as claimed in claim 1 1, characterised in that said address is an IP address. 13. A telecommunications network, as claimed in either claims 1 1 , or claim 12, characterised in that each telephone exchange in said network is adapted to operate a heart beat process which continuously monitors a heartbeat transmitted by each database in said network and, if there is a change of status for a given database, modifies the status flag in the record for that database. 14. A telecommunications network, as claimed in claim 1 1 , characterised in that each telephone exchange in said telecommunications network is adapted, in the event of a change of status of a database which is a Current_Node for a given telephone exchange, to select a new Current_Node according to the following rule: Current_Node = {N if N.STATUS = UP, else randomly select a new database among all t, where t.STATUS = UP} where N denotes the primary database for the telephone exchange, N.STATUS is the status flag for database N in the record of databases held at the telephone exchange, t denotes a given one of the databases in the telecommunications network, other than N, and tSTATUS denotes the status flag for the record of database t held at the telephone exchange. 15. A telecommunications network, as claimed in any previous claim, characterised in that said telecommunications system is adapted to operate a free- number system, and in that said databases include a concordance record, for each subscriber to said telecommunications network, linking a logical number used by others to initiate calls to a subscriber, and a physical number used by the telecommunications network to identify an access point for that subscriber. 16. A telephone exchange, adapted to operate within a telecommunications network, including a multiplicity of telephone exchanges, m, and a plurality of identical databases, n, where m is substantially greater than n, said telephone exchange being arranged so that, at a given time, it can access a single database, characterised in that said telephone exchange has information specifying an address and status for each database in the telecommunications network, and in that the database that will be accessed by the telephone exchange is selected by the telephone exchange on a dynamic basis. 17. A telephone exchange, as claimed in claim 16, characterised in that the database that will be accessed, at a given time, by said telephone exchange, is selected on a random dynamic basis. 18. A telephone exchange, as claimed in claim 16, or claim 17, characterised in that when a database selected by the telephone exchange fails, or goes down, the telephone exchange is adapted to select a new database on a random basis. 19. A telephone exchange, as claimed in any of claims 16 to 18, characterised in that said telephone exchange is initially associated with a preferred, or primary, database. 20. A telephone exchange, as claimed in claim 19, characterised in that when a database that has failed comes on line, and if that database was designated as the primary database for said telephone exchange, said telephone exchange is adapted to reselect that database for data access operations from said telephone exchange. 21. A telephone exchange, as claimed in claim 19, or 20, characterised in that said exchange has means for identifying when its primary databe telecommunications network are available, and means for detecting when a database which has been unavailable, becomes available. 22. A telephone exchange, as claimed in of claims 16 to 21, characterised in that said telephone exchange carries a record, for each database in said telecommunications network, including, for each database, a name, an address and a status flag, where the name is a logical name for the database and the status flag indicates whether, or not, the database is currently accessible from a given telephone exchange. 23. A telephone exchange, as claimed in claim 22, characterised in that said address is an IP address. 24. A telephone exchange, as claimed in either of claims 22, or claim 23, characterised in that said telephone exchange is adapted to operate a heart beat process which continuously monitors a heartbeat transmitted by each database in said network and, if there is a change of status for a given database, modifies the status flag in the record for that database. 25. A telephone exchange, as claimed in claim 24, characterised in that said telephone exchange is adapted, in the event of a change of status of a database which is a Current_Node for the telephone exchange, to select a new Current_Node according to the following rule: Current_Node = {N if N.STATUS = UP, else randomly select a new database among all t, where t.STATUS = UP} where N denotes the primary database for the telephone exchange, N.STATUS is the status flag for database N in the record of databases held at the telephone exchange, t denotes a given one of the databases in the telecommunications network, other than N, and t.STATUS denotes the status flag for the record of database t held at the telephone exchange. 5 26. A database, adapted to operate within a telecommunications network, including a multiplicity of telephone exchanges, m, and a plurality of identical databases, n, where m is substantially greater than n, said telephone exchanges being arranged so that, at a given time, each telephone exchange can access a single database, characterised in that when said telecommunications network is partitioned into a first and second partition, as a result of a communications failure, such that databases in said first partition cannot be accessed from telephone exchanges in said second partition, said database having means for determining how many telephone exchanges are able to access it, and in that means are provided for inhibiting updates to said database when only half, or less, of the telephone exchanges in said telecommunications network are able to access it. 27. A database, as claimed in claim 26, characterised in that if said second partition includes more than half said telephone exchanges, and said second partition is further partitioned, as a result of a communications failure, into third and fourth Λ partitions, and a majority of the telephone exchanges in said second partition are within said third partition, means are provided for inhibiting updates to said database if it is operating in said fourth partition. 28. A database, as claimed in claim 26, or claim 27, characterised in that means are provided to ensure that, when said database that has failed, or been within an isolated partition of said telecommunications network, and is about to return to full operational effectiveness, said database is initialised so that itsabase, within said telecommunications network, that is currently fully operational, before any telephone exchange is permitted to access said database. 29. A method of operating a telecommunications system comprising a multiplicity of telephone exchanges, m, and a plurality of identical databases, n. where m is substantially greater than n, in which each telephone exchange is adapted, at a given time, to access one database, characterised by providing each telephone exchange with information specifying an address and status for each database in the telecommunications network, and each telephone exchange dynamically selecting the database that it will access. 30. A method as claimed in claim 29, characterised by each telephone exchange selecting the database that it will access, at a given time, on a random dynamic basis. 10 31. A method, as claimed in claim 29, or 30, characterised by a telephone exchange, when a database selected by that telephone exchange fails, or goes down, selecting a new database on a random basis. 5 32. A method, as claimed in any claims 29 to 31, characterised by initially associating each telephone exchange with a preferred, or primary, database. 33. A method, as claimed in any of claim 29 to 32, characterised by associating each of said m telephone exchanges with a preferred database, on a 0 random basis, in such a manner that each database has a substantially similar loading in terms of access transactions addressed thereto. 34. A method, as claimed in claim 32, or claim 33, when dependent on claim 32, characterised in that when a database that has failed comes on line, each 5 telephone exchange that has that database designated as its primary database, reselects that database for data access operations. 35. A method, as claimed in claim 33, or claim 34, characterised by each exchange identifying when its primary database is unavailable, identifying which 0 databases in the telecommunications network are available, and detecting when a database which has been unavailable, becomes available. 36. A method, as claimed in any of claims 29 to 35, characterised partition, as a result of a communications failure, such that databases in said first partition cannot be accessed from telephone exchanges in said second partition, each database 5 determining how many telephone exchanges are able to access it, and inhibiting updates to said database when only half, or less, of the telephone exchanges in said telecommunications network are able to access the database. 37. A method, as claimed in claim 36, characterised by, if said second 0 partition includes more than half said telephone exchanges, and said second partition is further partitioned, as a result of a communications failure, into third and fourth partitions, and a majority of the telephone exchanges in said second partition arc within said third partition, inhibiting updates to a database. 5 38. A method, as claimed in either claim 36, or 37, characterised by ensuring that, when a database that has failed, or has been within an isolated partition of said telecommunications network, is about to return to full operational effectiveness, said database is initialised so that its contents are identical with another database within said telecommunications network that is currently fully operational, '■ before any telephone exchange is permitted to access said database. 39. A method, as claimed in any of claims 29 to 38, characterised by each telephone exchange in said telecommunications network carrying a record, for each database in said telecommunications network, including, for each database, a name, 5 an address and a status flag, where the name is a logical name for the database and the status flag indicates whether, or not, the database is currently accessible from a given telephone exchange. 40. A method, as claimed in claim 39, characterised by said address being 0 an IP address. 41. A method, as claimed in either of claims 39, or 40, characterised by each telephone exchange in said network operating a heart beat process which continuously monitors a heartbeat trais a change of status for a given database, modifying the status flag in the record for that database. 42. A method, in claim 41, characterised by each telephone exchange in said telecommunications network, in the event of a change of status of a database which is a Current_Node for a given telephone exchange, selecting a new Current_Node according to the following rule: Currcnt_Node = {N if N.STATUS = UP, else randomly select a new database among all t, where t.STATUS = UP} where N denotes the primary database for the telephone exchange, N.STATUS is the status flag for database N in the record of databases held at the telephone exchange, t denotes a given one of the databases in the telecommunications network, other than N, and t.STATUS denotes the status flag for the record of database t held at the telephone exchange. 43. A telecommunications system characterised in that it includes a telecommunications network as claimed in any of claims 1 to 15, or includes a telephone exchange as claimed in any of claims 16 to 25, or a database as claimed in of claims 26 to 28, or operates in accordance with a method as claimed in any of claims 29 to 42.

Inventors: ALEXANDERSSON ROBERT, LUNDSTROEM JENS, ALEXANDERSSON, ROBERT, LUNDSTROEM, JENS
Applicants: ALEXANDERSSON ROBERT, LUNDSTROEM JENS, TELIA AB, ALEXANDERSSON, ROBERT, LUNDSTROEM, JENS, TELIA AB (PUBL)
Application year: 1998
Main classification: H04M3
IPC codes: H04M3, H04Q3