CA2203671A1 - Controlling elements of a telecommunications network - Google Patents
Controlling elements of a telecommunications networkInfo
- Publication number
- CA2203671A1 CA2203671A1 CA002203671A CA2203671A CA2203671A1 CA 2203671 A1 CA2203671 A1 CA 2203671A1 CA 002203671 A CA002203671 A CA 002203671A CA 2203671 A CA2203671 A CA 2203671A CA 2203671 A1 CA2203671 A1 CA 2203671A1
- Authority
- CA
- Canada
- Prior art keywords
- instruction
- elements
- control
- network
- generic
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Abandoned
Links
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04Q—SELECTING
- H04Q3/00—Selecting arrangements
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04Q—SELECTING
- H04Q3/00—Selecting arrangements
- H04Q3/0016—Arrangements providing connection between exchanges
- H04Q3/0062—Provisions for network management
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04Q—SELECTING
- H04Q3/00—Selecting arrangements
- H04Q3/64—Distributing or queueing
- H04Q3/66—Traffic distributors
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04Q—SELECTING
- H04Q2213/00—Indexing scheme relating to selecting arrangements in general and for multiplex systems
- H04Q2213/13533—Indexing scheme relating to selecting arrangements in general and for multiplex systems multivendor and hybrid, e.g. public/private, networks, inc. international
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04Q—SELECTING
- H04Q2213/00—Indexing scheme relating to selecting arrangements in general and for multiplex systems
- H04Q2213/13566—Indexing scheme relating to selecting arrangements in general and for multiplex systems mediation
Abstract
A plurality of elements (A1, A2, B1, B2, B3, C1) of a system, such as a telecommunications network N are controlled by generating a generic instruction, in generator (14), selecting the elements for which the instruction is directed, in matcher (16) and interface module (19) and transmitting the instruction to the respective elements. By transmitting a generic instruction applicable to all relevant elements the operator (12) of the system can control all the elements with a single instruction. A generic instruction can be translated in translators (15a, 15b, 15c) into separate instructions applicable to each individual element or defined groups of elements.
Description
WO 96/lS635 PCT/GB9S/02617 CONTROLLING Fl FVIENTS OF A TFI FCOMMUNICATIONS NETWORI( This invention concerns controlling elements of a telecommunications network, particularly but not exclusively for traffic management.
Although modern telecommunications networks are highly automated, they still require some monitoring and centralised control in order to deal withunusual circumstances such as overload conditions. A typical instance is a sudden surge in the number of calls made to a given telephone number, perhaps as a result of the number being given out on a television broadcast in an advertisement, 10 during a phone-in show, or if an emergency contact number is given out on a news bulletin reporting a major accident or natural disaster.
The effect of such surges is to overload not only the line directly involved, but also the local exchange (also known as a switch) serving it. This results incalls to and from all subscribers served by that switch failing because all trunk 15 lines serving the switch are busy with call attempts to the one number, most of which will fail.
The concepts of destination volume controls such as call blocking and call-gapping have been developed to overcome this problem. Call blocking arranges that a proportion of calls to a target number are failed by the originating exchange.
20 Call gapping arranges that, after a call attempt is made to a target number, no further call attempts can be made to that number until a predetermined interval has elapsed. Both these systems reduce unnecessary use of the trunk network by failed call attempts.
A problem which arises in applying centralised control to a 25 telecommunications network is that, in a typical network, exchanges are not identical. This is because in a developing network, at any given time, more thanone type of exchange will be in use. Moreover, the different characteristics of the areas served by different exchanges may make different types of exchange appropriate in different locations. Consequently, certain functionality may only be 30 available to certain exchanges or, even where the functionality is universal,individual instructions may be required to operate them. It is therefore necessary to tailor the instructions for each exchange. Furthermore certain services, such as call-gapping and call blocking, may be required only for a selected subset of W O96/15635 PCT/GB95/0261?
exchanges, such as those serving the area in which the number has been broadcast.
It is known, for example from patent specification no. W093/18598 (Nokia), to generate a command for a network element in a generic protocol which5 is translated into the appropriate protocol for the network element concerned.However it is necessary for the user of this system to transmit a command in thegeneric protocol for each element to be controlled. This can be time consuming and problematic, for example if several exchanges are required to co-operate andsome of them do not have the necessary functionality.
According to a first aspect of the invention, there is provided a method of controlling a plurality of elements of a telecommunications network, comprising the steps of generating a generic instruction, selecting the elements for which the instruction is directed, and transmitting the instruction to the respective elements.
According to a second aspect of the invention, there is provided a 15 controller for a telecommunications network having a plurality of functional elements, comprising means for generating a generic instruction, and means for transmitting the instruction to the respective elements, characterised in havingmeans for selecting the elements to which the instruction is directed.
By transmitting a generic instruction applicable to all relevant elements, 20 the operator of the system can control all the elements with a single instruction. A
generic instruction can be translated into separate instructions applicable to each individual element or defined groups of elements.
Certain elements may not have the ability to carry out certain functions, accordingly the method may provide that if one or more of the selected elements is 25 not capable of performing the required instruction no instruction is transmitted to that element or elements. However, the ability of the network as a whole to carry out the desired functions may be dependent on the ability of each individual element to carry out a predetermined function. The method may therefore provide that, if any element is incapable of performing the required instruction, no 30 instruction is transmitted to any of the elements. In other words, no instruction is transmitted to any element unless all the elements required to co-operate can carry out their individual instructions. Alternatively, certain network functions may be performable by parts of the network independently of the ability of other elements , to do so, so the method may provide that if any elements are incapable of performing the instruction, the instruction is sent only to the elements which are capable of performing the instruction.
Different compatibility criteria may be used for different network 5 functions.
In a preferred arrangement instructions may be prepared and stored for onward transmission in response to a predetermined condition. This allows the network to respond automatically and promptly to a condition such as a localisedoverload occurring in the system.
The predetermined condition may be the expiry of a pre-set time interval, allowing advance scheduling of network controls. For regular events, such as weekly or daily 'phone-in' programmes, the time interval may be re-set after each transmission of the instruction. However, for one-off situations such as specialevents the time interval is not re-set.
The instructions to the network elements may be arranged to cause the inhibition of a signalling function. For example, if calls to a single number are overloading the system, and that number is subject to a number translation process (for example converting a toll-free number to an exchange number~, callsto that number can be gapped or blocked by inhibiting call set-up signals being 20 sent to the number translation network element. This prevents abortive call set-up attempts clogging the signalling network, as well as freeing the traffic networkitself.
In a preferred embodiment, the method comprises the steps of generating an instruction in high-level language, a selection pattern output, and an interface 25 type message, converting the high-level instruction into instructions in formats compatible with each of a respective element type; and comparing the selection pattern data with stored information to select the elements to which the instruction is to be sent.
Embodiments of the invention will now be described by way of example, 30 with reference to the figures, in which:-Figure 1 a shows a simple telecommunications network controlled by anetwork manager, illustrating one arrangement according to the invention;
Figure 1 b is a diagram of a telecommunications network having a separate signalling network, illustrating a further arrangement according to the invention;
Figure 2 shows the functional components of a network manager embodying the present invention and their relationship with a number of switching 5 centres;
Figures 3 and 4 show simplified details of the store element 17 of Figure 2;
Figure 5 shows an illustration of a single shot schedule operated according to the invention;
Figure 6 shows an illustration of a multi-shot schedule operated according to the invention; and Figure 7 shows how such scheduled controls can be implemented according to the invention.
Figure 1 a shows a simple telecommunications network having six switches lexchanges) A1, A2, B1, B2, B3, C1 all operating under the centralised control of a network manager M. The switches are interconnected by traffic-carrying links (1, - 2, 3, 4, 5, 6, 7, 8, 9, 10; solid lines) and each switch isconnected to the network manager M by a respective control link (40, 41, 42, 43,44, 45: dotted lines).
Figure 1b shows a variant of Figure 1a. Only three exchanges A1, B2, B3 are shown for simplicity, connected, as in Figure 1 a, by a traffic network 4, 9, 10 and also by a sigrialling network 31, 32, 33 to a signalling element T which includes a number translator Tx. The exchanges A1, B2, B3 and signalling elementT are under the control of the network management centre M, by means of links 40, 42, 45, 46 respectively. Each exchange A1, B2, B3 is connected to a number of user terminals (only one shown in each case, 21, 22, 23 respectively).
The functional companents of the network manager M which embody the invention, and their relationship to the network are illustrated in Figure 2. Itincludes a store 17 which stores various attributes relating to the switches and30 the links between them. Such attributes include the types of equipment installed at each switch (in this example identified as type A, type B and type C which may for example be the System X, AXE 10 and 5ESS types currently in use by British Telecommunications plc) and the geographical location (in this example identified as area X (centres A1, B1, B2), area Y (centres A2, C1) and area Z ~centre B3).
These areas may be defined by any suitable criterion or combination of such criteria. For example, a television coverage area may be appropriate for defining the switches to be controlled for call-gapping purposes when a phone-in number is 5 broadcast, whilst for an enquiry line for a utility service such as transport, power, water etc. call-gapping may be required according to that utility's regionai structure. More than one such geographical overlay may be defined. The data stored in store 17 may also include data on the current state of the elements, updated by input from the network elements.
10The construction of network managers is well known to those skilled in the art. Typically a network manager is embodied by a computer whose software provides the necessary functional components.
The network manager M has three types of input, namely a time indication from a clock 1 1, a human interface 12 and a monitor 13 which receives inputs 15 from the network N and either transmits a message to the operator by means ofthe human interface 12 or generates an automatic response from the network manager. The human interface 12 is associated with a network traffic control library 20 in which may be stored standard input formats.
A generic instruction generator 14 receives inputs from the human 20 interface 12 and the monitor 13. The generic instruction generator 14 provides three outputs: an instruction in high-level language which is passed to a group of translators 15a, 15b, 15c, a selection pattern output which is passed to a data matcher 16, and an interface type message transmitted to an interface module 19.The translators 1 5a, 1 5b, 1 5c are each configured to convert the high-level 25 instructions received from the generic instruction generator 14 into an instruction in a format compatible with a respective switch type A, B or C. The data matcher16 receives selection pattern data from the generic instruction generator 14 andcompares this data with the information stored in store 17 in order to select the switches to which the instruction is to be sent. The data stored in the store 1730 can be updated in response to inputs from the network N through the monitor 13.
Figures 3 and 4 show the organisation of data in the store 17.
Figure 3 shows the data stored for the switches A1, A2, B1, B2, B3, and C; by geographical area and type of switching equipment. As well as these inherent characteristics, the store 17 may also hold data relating to the current condition of the switches.
Figure 4 shows similar inherent data held for each link (1 to 10) in the system. This data includes the termination points and the capacity of each link.An instruction generator 1 8a, 1 8b, 1 8c is provided for each type of switch A, B, C. Each instruction generator 1 8a, 1 8b, 1 8c receives data from the matcher 16, the clock 11 and, via the interface module 19, the respective translator 1 5a, 1 5b or 1 5c, from which instructions are generated for transmission to appropriate elements of the network N.
The instructions may be transmitted by the instruction generators 18a, 1 8b, 1 8c immediately, or at one or more predetermined times under the control of the clock 11. For example, the instructions may be transmitted to the network N
on a regular basis, such as at a predetermined time and day of the week to coincide with the broadcast times of a phone-in television or radio show.
The interface module 19 ensures that a generic instruction which requires the co-operation of two or more switches is compatible with all the switches involved. The interface module 19 controls the operatlon of the instruction generators 18, 18b, 1 8c in the event that the instructlon requlred Is Incompatible with the capabilities- of one or m-ore types of swltch A B o~ C Such an 20 incompatibility would be identified by the respect~ e transla~or '~3 '5b or 15c, which transmits an error message to the Inte~t~e ~a~, e ~ ? snould the instruction not be executable. The generic InStrUSt3~ ~e~ 3~ '~ ttansmlts an interface-type message to the interface module l 9 ~n~c~l contro~s t~e operatlon of the instruction generators 18a, 18b, 18c. The Interface-type message can be one 25 of three types:
i) AND: all switches to which the instruction is addressed must be capable of executing the instruction: if any switch is not so capable the instruction is not carried out at all 30 ii) OR: any switch to which the instruction is addressed and which is capable of executing the instruction does so, even if other switches cannot do so.
iii) CONDITIONAL: an instruction to control routes between switches is executable only in respect of those routes for which all switches controlling that route are compatible with the instruction.
A message is transmitted to the human interface 12 to indicate whether, 5 or to what extent, the instruction can be executed.
The operation of the network manager M will now be described with reference to Figures 1a and 2. In this illustrative example, the function to be controlled is call-gapping, to be initiated at a set time once a week or in response to an overload condition detected by the monitor 13. For the sake of this 10 illustration, it will be assumed that call-gapping is only required for switches in geographical areas X and Y, and that equipment of type A is not capable of providing call-gapping functionality.
The human operator provides an input through the human interface 12 to the generic instruction generator 14. This input identifies the function required 15 (call-gapping), the proportion of calls to be gapped, the geographical area to be covered (in this example zones X and Y), and the time that the function should operate (for example with immediate effect until manually cancelled, or from 1900 to 2030 every Tuesday, or in response to an external stimulus such as an overload detected by the monitor 1 3) .
The generic instruction generated in the generator 14 is transmitted to the bank of translators 1 5a, 1 5b, 1 5c which each translate the instruction into a form which can be handled by a respective switching system type A, B, C. In this casetype A is incapable of performing call-gapping so an error message is generated by the translator 1 5a.
The generic instruction generator 14 has two further outputs. Firstly, it transmits the se!ection criteria to the matcher 16. In this case, the switches to be call-gapped are selected by geographical area. The selection of the set of switches to be selected may be done on the basis of the intrinsic architecture of the r network, e.g. a set may comprise a DMSU (digital main switching unit) and its 30 daughter DLEs (digital local exchanges). Alternatively the set may be manually selected, in order to meet a non-intrinsic criterion such as the coverage area of a television station, or the administrative regions of a utility company. These criteria are compared in the matcher 16 with the stored details held in the store 17, and .. , the identities of the switches which meet the criteria are L~ansi"illed from thematcher 16 to the bank of instruction generators 18a, 18b, 18c. In the present example, the identities of the switches A1 and A2 are transmitted to the instruction generator 18a, the switches B1 and B2 to the instruction generator 5 1 8b, and the switch C 1 to the instruction generator 1 8c. The identity of the switch B3 is not transmitted to instruction generator 18c because it is in zone Z
and therefore does not meet the geographical requirement.
The other output from the generic instruction generator 14 relates to the type of instruction, and is transmitted to the interface module 19. This output 10 identifies to the intefface module 19 whether the operation should be partially executed even if some switches lack the necessary functionality. In the case of call-gapping or call blocking the operation can be partially executed in this way, so the interface module 19 transmits the instructions generated by the translators 1 5b and 1 5c to the respective instruction generators 18b, 18c, but transmits no 15 instruction to the instruction generator 1 8a as only an error message was received from the translator 1 5a.
If the generic instruction cannot be carried out unless all relevant switches can co-operate, the arrival of an error message from any one of the translators 1 5a, 1 5b, 1 5c prevents the interface module 19 from transmitting any instruction 20 to any of the instruction generators 18 a, b, c.
If the generic instruction requires a route to be established between a first switch having the required functionality and a second switch lacking that functionality the route is not established. However, this does not prevent the first switch establishing routes to other switches in accordance with the generic 25 instruction, provlded these other switches have the required functionality.
The instructions generated in the instruction generator 1 8b, are transmitted to the switches B1 and B2, and the instruction generated in the instruction generator 18c is transmitted to the switch C1. The instructions are transmitted under the control of the clock 11, at the times programmed by the 30 generic instruction generator 14.
Thus, by the input of a single instruction by the human operator or automatically through the monitor 13 the required function can be performed by all switching eleménts having suitable functionality within the geographical area WO 96/lS63S PCTIGB95/02617 specified, without the human operator needing to generate separate instructions for each type of switch or to specifically identify the switches to be controlled.
In the arrangement shown in Figure 1b the system is configured so that the signalling network 31, 32, 33 is prevented from overloading with unsuccessful 5 call attempts. Call set-up signals are carried over the signalling network 31, 32, 33 in order to set-up the necessary connections in the traffic network 4, 9, 10 between the exchanges A 1, B2, B3. The user 23 is subject to a number translation service carried out by a number translator Tx in the signalling element T. In other words, the users 21, 22 can call the user 23 using a special number 10 (e.g. a toll-free number) which is translated by the translator Tx to control the signalling element T to set-up a call to the user 23.
If an overload of calls using the special number is observed or predicted, the network manager M can control the switches A 1, B2, B3 to inhibit the transmission over the signalling network 31, 32, 33 of call requests to that 15 number. This releases capacity not only in the traffic network 4, 9, 10, but also in the signalling network 31, 32, 33. If one of the switches (e.g. A1) does not have the capability to inhibit the transmission of such call requests, they can still be inhibited by the network manager M at the signalling element T. This does not prevent unsuccessful call requests appearing on the signalling link 31, between the 20 exchange A1 and the signalling element T, but it does prevent them propagating over the rest of the network.
The normal sequence of operation of the system will now be described. It may be viewed as consisting of three distinct processes: control definition, control scheduling, and control implementation. Firstly, users define pre-planned controls 25 (PPCs) by specifying the type of control (e.g. destination call gapping) and optionally the values of the control parameters and the control target.
Once defined, the PPC may be saved in the network traffic control library 20 for later use or may be scheduled.
The primary function of the library 20 is to provide a repertoire of PPCs 30 which may be quickly retrieved to deal with network problems.
PPCs in the library 20 may be retrieved for control scheduling. Users schedule a PPC by selecting one from the library 20 and specifying the schedule details and if necessary the control target and control parameters may be added (if CA 02203671 1997-04-24 = =
they are not already defined), or changed (if they are defined). The PPC in the library 20 is not affected. Once scheduled, the control is entered onto the list of currently scheduled controls.
Scheduled controls may be positively authorised at any time within N
5 minutes of their due implementation ~where N is a pre-defined parameter), otherwise the control will not be implemented. If authorisation is not given within the pre-defined time period specified by N a report is generated.
Authorised controls are automatically implemented (inserted and removed) according the schedule attached to the PPC. Users can monitor the progress of 10 controls implementation in real-time.
The network traffic control library 20 allows users to build up and maintain a repertoire of PPCs. This allows users to save time by having access to templates to commonly used controls (e.g. to deal with focused overloads) where only the control target is different. It also allows the accurate implementation of a prepared 15 complex sequence of controls. Network problems which require the fast and accurate deployment of a number of controls can be dealt with promptly. The library 20 may also be used as a source from which to build new controls.
There are three types of library entries:
1. basic PPC (with a single exchange/route control target) 2. basic PPC (with an exchange set control target) 3. Iinked PPC
The control targets may be specified, or may be left for the user to select.
A linked PPC consists of a sequence of PPCs. PPCs may be stored with all or only25 some of the control parameters and the control target blank. The network manager will check that a PPC is fully specified when it is selected for scheduling.
A basic PPC with a single exchange/route as a control target is the simplest type of control. A basic PPC with an exchange set as a control target is also referred to as a broadcast control. These two types of basic PPCs are only 30 distinguishable when the control target is specified.
A broadcast control is a control which is applied to a number of exchanges (exchange set). A facility is provided for defining and mainLaini,lg a library of exchange sets.
~WO 96tlS635 PCT/GB95102617 ~ . .
A linked PPC is a composite control and is defined by linking together a number of basic PPCs in a sequence to form a linked PPC. When the linked PPC is implemented, each PPC in the chain is implemented sequentially starting with the first.
Exchanges can be grouped together into exchange sets. Commonly used exchange set definitions may be stored in store 17 and used when defining broadcast controls. These are referred to as static exchange sets.
Exchanges can also be grouped by exchange type into dynamic exchange sets. The following default dynamic exchange sets are provided:-All DMSUs (Digital Main Switching Units: trunk exehanges) All DCCEs (Digital Call Centre Exchange: tandem/junction exchange -intermediate level) ~ll DLEs ~Digi~al LQsal Exsh3~g~s~
15 All DDSCs (Digital Derived Services Switching Centre) All DJSUs (Digital Junction Switching Unit - intermediate level) All dependent level exchanges of DMSU (one set per DMSU) All dependent level exchanges of a DCCE (one set per DCCE) Dependent level exchanges include DLEs, DJSUs and DCCEs.
A traffic control is scheduled to deal with a particular problem on the network. Users have two sources for PPCs when scheduling, namely PPCs stored in the network traffic control library; or by defining a control for the purpose, allowing users to schedule new controls rapidly without following the normal 25 sequence of storing a control definition in the library and then retrieving it. The network manager will perform the same sequence of operations but this will be transparent to the user.
A network traffic control is applied to an exchange in two stages. It is defined using the facilities of the network traffic control library, and the schedule 30 to be applied at specified times. The control could be applied immediately or stored for later application.
Both single-shot and multi-shot (repeating) schedules are provided:
- single-shot where only one insertion (and removal) is involved W 096/15635 r~ll~b951'~26l7 - multi-shot where multiple insertions (and removalsl are involved.
Scheduled controls may be named in such a way as to link them to specific events, e.g. Christmas Day.
A schedule may be specified without a removal time.
The single-shot timing mechanism provides the opportunity to define a period during which the traffic control should be applied. This is achieved in terms of a control insertion time, and a control removal time.
Figure 5 provides an illustration of the type of schedule that may be achieved using a single-shot schedule. The hatched area represents the time over10 which the control is in force. 'A' represents the application time, and 'R' the removal time.
A control may be scheduled without a specified removal time; such a control is effective indefinitely. Facilities are provided to add later a removal time to the schedule; immediate removal is also possible.
The control insertion time is specified as a specific time e.g. 10:30 14 The control removal time is specified in the same format as the insertion time, e.g. 13:1 5 14 NOV 94 or it may be specified as a delta time (i.e. the control duration): e.g. 002 02.45 The delta time in the example means remove the control after an elapsed time of 2 days 2 hours and 45 minutes.
A multi-shot (repeatingl schedule is a single-shot schedule but with the addition of a schedule start and end time and some repeating criteria (e.g. on Monday of every week) The facility of multi-shot schedules provides the opportunity to define a repeating traffic controi application pattern. The application pattern is defined in terms of:
a schedule start time;
a schedule end time;
a control inserting time (within the period specified by the schedule start and end time);
a control removal time (within the period specified by the schedule start and end time); and repeat criteria.
Figure 6 provides an iilustration of the type of schedule that may be achieved using a multi-shot schedule. The hatched area represents the time over which the control is in-force. It is possible for the control in-force period to span a 5 midnight boundary (i.e. control removal occurs on a different day to control insertion). A control is removed when its associated schedule expires.
Note that the control is not applied until Schedule Start Time SST and is removed at Scheduled End Time SET, although these do not necessarily coincide with control insertion and removal times.
The scheduled start time SST, control insertion time A and control removal time R are specified in the same format as for the single shot control above.
The scheduled end time defines a time after which no further applications occur.
The scheduled end time is specified in one of the formats specified for the 15 control removal time above.
The repeating criteria are identified in terms of:
days of the week, or days of the month (but not both), and calendar months of the year in which the above applies.
In the simplest case, a multi-shot schedule specifies a schedule start and 20 end time and the days of the week or days of the month in which the control insertions and controi removals apply within the specified schedule start and end time.
A more specialised repeating pattern based on the above can be defined, by further identifying the months within the specified schedule start and end time 25 in which the control insertions and control removals apply.
It is possible for schedules to expire automatically, or be forced to expire by operator action.
In the case of a single-shot schedule, the schedule automatically expires on removal. For multi-shot schedules, automatic expiry occurs on the schedule 30 end time.
After a control from the network traffic control library 20 is scheduled, the network manager maintains details of the scheduled control and will implement the control as specified in the schedule.
W O96/15635 PCT/GB95/0261?
.14 A facility is provided to allow users to track and monitor the current list of scheduled controls on the network manager and to monitor which of the scheduled controls are in-force lactive). Figure 7 shows how scheduled controls are tracked by the network manager through the scheduled control and active control lists.
In ~he event of a scheduled control application failing, the application is periodicaily retried until it is successful or the end of the scheduling period has been reached. The number of retries and the retry interval are configurable parameters.
A message is sent to the human interface 12 if the network manager fails 10 to implement a scheduled control after the maximum number of retry attempts or the end of the scheduling period has been reached.
The implementation of a scheduled control can fail for several reasons.
Firstly there may be inconsistent scheduled requests or other reasons (failure within network manager~. Secondly there may be communications failure.
There may also be communications failures, maintenance failures (e.g.
failure to process a job request), or exchange failures (e.g. the exchange does not accept a control request from the network manager).
In the first two cases the network manager will continue to apply the retry logic as specified in order to attempt to successfully implement the control.
20 However, in the event of an exchange failure the network manager will stop the retry logic as soon as an exchange fails to accept a control request.
Overlapping schedules can be allowed subject to any traffic control implementation rules defined in the network manager, as described below.
Before a control request is implemented the network manager checks if 25 there is an existing control on the control target, and if so, the actual control requests issued by the network manager are modified. The rules specified below, are general rules to be applied when implementing controls.
The network manager may issue a real-time "control status read" request before applying a control.
For inserting a basic PPC (Single ExchangeiRoute and Exchange Set), the network manager checks for a control of the same type on the target (which may consist of members of an exchange setl. If a control of the same type is already in force, and if the schedule creation date of the scheduled control is earlier than the WO 96tlS635 PCr/GB95/02617 in force control, the scheduled control is not implemented; otherwise the scheduled control is implemented.
- The user is able to suspend scheduled controls, which may be authorised, prior to implementation. Suspended controls can be reinstated at any time, 5 however a control will not be implemented if the scheduled insertion time has been exceeded. Multi-shot controls will be implemented until the next insertion time after the reinstatement.
Before inserting a Basic PPC (Single/Exchange/Route and Exchange Set) control the network manager may issue a request to read the real-time control 1 0 status.
If a control is already in force on the exchange or the exchange resource already exists, but with different parameters to the control to be implemented, then a "change" exchange-specific command is issued; otherwise an "insert"
exchange-spe~ific commaf~is ~ss~.
The network manager may be arranged such that if it discovers a control of the same type and detects that it did not insert the discovered control, the network manager alerts users, updates the controls database and sends a message to the central system mailbox. The scheduled control will then only be applied if agreed by a user with the Control Authorisation access privilege, and otherwise 20 will be removed.
When removing a Basic PPC (Single Exchange/Route and Exchange Set) the network manager checks for a scheduled control of the same type on the target (which may consist of members of an exchange set). If a control of the same type is scheduled and due to be enforce (but not implemented due to the application of the first rule above - see Figure 7) the control is applied using the second rule above.
If no control of the same type is scheduled and due to be in-force, before implementing a remove control request the network manager issues a real-time control status read request.
If a control is already in-force on the exchange or the resource already exists a recover exchange specific command is issued.
For linked pre-planned controls, each PPC in the chain would only be implemented if the implementation of the previous PPC was successful.
WO 96/1563~ PCr/GB95/02617 ~i6 Impiementation of constituent PPCs in the chain would be according to the rules specified above for PPCs. Removal of the PPCs in the chain is in the reverse order to that of insertion.
If one of the PPC constituents fails during implementation, then the effect 5 of all previously implemented constituent PPCs in the chain would be reversed.Scheduled controls which have been authorised are implemented by the network manager at the specified times. At the point of implementation, the network manager maps the generic control to an exchange-specific control if the generic control is a linked control then each individuai control in the linked control 10 is mapped to the exchange-specific format when the individual control is implemented. The network manager then transmits the control request(s) to the appropriate instruction generator 18a, 18b, or 18c for each exchange, and saves the corresponding control response~s) returned by the instruction generator 18.
Finally, the network manager updates the internal control database with the new 15 status of the control.
In general, a control may be inserted, removed, or cancelled. In addition control status read requests may be issued to obtain the status of a network resource prior to inserting or removing a cantrol on it. The cancel request does not result in any control requests to the network communlcatlons manager.
20Control responses are matched with the contro! ~eauests tO form a complete control transaction. Each control transac:~on corres~o~3s to an Insertion or removal of a scheduled control.
Network traffic management controls are Inslructlons sent to an exchange (via a Network Communications Manager) to modlfy exchange resources, with the 25purpose of overcoming problems existing on the network (e.g. by causing traffic to be re-routed).
Each equipment type (e.g. System X Phase 3) manages a different set of resources to perform its swl-tching operations. However the network manager attempts to modify exchange resources on different exchange equipment types 30 with the intention of modifying traffic patterns in similar ways.
In order that the network manager can interwork with a number of exchange equipment types, and allow additional equipment types to be added as .17 the system evolves, without the system growing increasingly complex, a set of exchange-type independent Generic Controls is defined.
Some exchange-specific controls only appear on one particular equipment type or do not fit into the generic set. Facilities to create, schedule and manipulate 5 these non-generic controls can be provided so that specific features offered only by one system, or specifically designed for a special requirement of one installation, are not lost despite not being generic to the system as a whole.
Each generic control stored on the network manager M has a defined set of parameters. The controller sends exchange specific control requests to the 10 network elements when a scheduled control is implemented. The translators 15 convert generic controls stored in the network manager to exchange-specific versions at the point of implementation via a set of mapping rules.
When a user creates a Destination Volume Control such as call blocking, the network manager stores the values for the generic parameters defined for the15 control and not values for the exchange specific parameters. The exchange specific parameters are calculated according to a set of mapping rules at implementation time. A separate set of rules is required for each target equipment type.
Exchange specific parameters which cannot be calculated or denved from 20 the generic parameters are assigned default values cv t?le net~otl~ manager. If however, a user creates the generic instructlon k~-o~lns t~a~ t-~ ta~getls) of the control includes exchanges having additional func~ on3llty t~ values for the exchange-specific parameters, such as traffic cateaorv and call d~sDosltlon, may be specified at control creation time.
Mapping rules are defined for each exchange specific control on each target equipment type supported by the control M.
In mapping the generic set of parameters to the exchange specific set, the mapping process will use the nearest available value for an exchange specific parameter if the required value is not available.
Non-generic controls such as System X Loopback can be stored and manipulated in their exchange specific form in the network manager. At implementation time, no mapping process is performed by the network manager W O96/15635 PCT/GB9S/0261?
and the control details are sent directly to the switches for implementation on the exchange.
Although modern telecommunications networks are highly automated, they still require some monitoring and centralised control in order to deal withunusual circumstances such as overload conditions. A typical instance is a sudden surge in the number of calls made to a given telephone number, perhaps as a result of the number being given out on a television broadcast in an advertisement, 10 during a phone-in show, or if an emergency contact number is given out on a news bulletin reporting a major accident or natural disaster.
The effect of such surges is to overload not only the line directly involved, but also the local exchange (also known as a switch) serving it. This results incalls to and from all subscribers served by that switch failing because all trunk 15 lines serving the switch are busy with call attempts to the one number, most of which will fail.
The concepts of destination volume controls such as call blocking and call-gapping have been developed to overcome this problem. Call blocking arranges that a proportion of calls to a target number are failed by the originating exchange.
20 Call gapping arranges that, after a call attempt is made to a target number, no further call attempts can be made to that number until a predetermined interval has elapsed. Both these systems reduce unnecessary use of the trunk network by failed call attempts.
A problem which arises in applying centralised control to a 25 telecommunications network is that, in a typical network, exchanges are not identical. This is because in a developing network, at any given time, more thanone type of exchange will be in use. Moreover, the different characteristics of the areas served by different exchanges may make different types of exchange appropriate in different locations. Consequently, certain functionality may only be 30 available to certain exchanges or, even where the functionality is universal,individual instructions may be required to operate them. It is therefore necessary to tailor the instructions for each exchange. Furthermore certain services, such as call-gapping and call blocking, may be required only for a selected subset of W O96/15635 PCT/GB95/0261?
exchanges, such as those serving the area in which the number has been broadcast.
It is known, for example from patent specification no. W093/18598 (Nokia), to generate a command for a network element in a generic protocol which5 is translated into the appropriate protocol for the network element concerned.However it is necessary for the user of this system to transmit a command in thegeneric protocol for each element to be controlled. This can be time consuming and problematic, for example if several exchanges are required to co-operate andsome of them do not have the necessary functionality.
According to a first aspect of the invention, there is provided a method of controlling a plurality of elements of a telecommunications network, comprising the steps of generating a generic instruction, selecting the elements for which the instruction is directed, and transmitting the instruction to the respective elements.
According to a second aspect of the invention, there is provided a 15 controller for a telecommunications network having a plurality of functional elements, comprising means for generating a generic instruction, and means for transmitting the instruction to the respective elements, characterised in havingmeans for selecting the elements to which the instruction is directed.
By transmitting a generic instruction applicable to all relevant elements, 20 the operator of the system can control all the elements with a single instruction. A
generic instruction can be translated into separate instructions applicable to each individual element or defined groups of elements.
Certain elements may not have the ability to carry out certain functions, accordingly the method may provide that if one or more of the selected elements is 25 not capable of performing the required instruction no instruction is transmitted to that element or elements. However, the ability of the network as a whole to carry out the desired functions may be dependent on the ability of each individual element to carry out a predetermined function. The method may therefore provide that, if any element is incapable of performing the required instruction, no 30 instruction is transmitted to any of the elements. In other words, no instruction is transmitted to any element unless all the elements required to co-operate can carry out their individual instructions. Alternatively, certain network functions may be performable by parts of the network independently of the ability of other elements , to do so, so the method may provide that if any elements are incapable of performing the instruction, the instruction is sent only to the elements which are capable of performing the instruction.
Different compatibility criteria may be used for different network 5 functions.
In a preferred arrangement instructions may be prepared and stored for onward transmission in response to a predetermined condition. This allows the network to respond automatically and promptly to a condition such as a localisedoverload occurring in the system.
The predetermined condition may be the expiry of a pre-set time interval, allowing advance scheduling of network controls. For regular events, such as weekly or daily 'phone-in' programmes, the time interval may be re-set after each transmission of the instruction. However, for one-off situations such as specialevents the time interval is not re-set.
The instructions to the network elements may be arranged to cause the inhibition of a signalling function. For example, if calls to a single number are overloading the system, and that number is subject to a number translation process (for example converting a toll-free number to an exchange number~, callsto that number can be gapped or blocked by inhibiting call set-up signals being 20 sent to the number translation network element. This prevents abortive call set-up attempts clogging the signalling network, as well as freeing the traffic networkitself.
In a preferred embodiment, the method comprises the steps of generating an instruction in high-level language, a selection pattern output, and an interface 25 type message, converting the high-level instruction into instructions in formats compatible with each of a respective element type; and comparing the selection pattern data with stored information to select the elements to which the instruction is to be sent.
Embodiments of the invention will now be described by way of example, 30 with reference to the figures, in which:-Figure 1 a shows a simple telecommunications network controlled by anetwork manager, illustrating one arrangement according to the invention;
Figure 1 b is a diagram of a telecommunications network having a separate signalling network, illustrating a further arrangement according to the invention;
Figure 2 shows the functional components of a network manager embodying the present invention and their relationship with a number of switching 5 centres;
Figures 3 and 4 show simplified details of the store element 17 of Figure 2;
Figure 5 shows an illustration of a single shot schedule operated according to the invention;
Figure 6 shows an illustration of a multi-shot schedule operated according to the invention; and Figure 7 shows how such scheduled controls can be implemented according to the invention.
Figure 1 a shows a simple telecommunications network having six switches lexchanges) A1, A2, B1, B2, B3, C1 all operating under the centralised control of a network manager M. The switches are interconnected by traffic-carrying links (1, - 2, 3, 4, 5, 6, 7, 8, 9, 10; solid lines) and each switch isconnected to the network manager M by a respective control link (40, 41, 42, 43,44, 45: dotted lines).
Figure 1b shows a variant of Figure 1a. Only three exchanges A1, B2, B3 are shown for simplicity, connected, as in Figure 1 a, by a traffic network 4, 9, 10 and also by a sigrialling network 31, 32, 33 to a signalling element T which includes a number translator Tx. The exchanges A1, B2, B3 and signalling elementT are under the control of the network management centre M, by means of links 40, 42, 45, 46 respectively. Each exchange A1, B2, B3 is connected to a number of user terminals (only one shown in each case, 21, 22, 23 respectively).
The functional companents of the network manager M which embody the invention, and their relationship to the network are illustrated in Figure 2. Itincludes a store 17 which stores various attributes relating to the switches and30 the links between them. Such attributes include the types of equipment installed at each switch (in this example identified as type A, type B and type C which may for example be the System X, AXE 10 and 5ESS types currently in use by British Telecommunications plc) and the geographical location (in this example identified as area X (centres A1, B1, B2), area Y (centres A2, C1) and area Z ~centre B3).
These areas may be defined by any suitable criterion or combination of such criteria. For example, a television coverage area may be appropriate for defining the switches to be controlled for call-gapping purposes when a phone-in number is 5 broadcast, whilst for an enquiry line for a utility service such as transport, power, water etc. call-gapping may be required according to that utility's regionai structure. More than one such geographical overlay may be defined. The data stored in store 17 may also include data on the current state of the elements, updated by input from the network elements.
10The construction of network managers is well known to those skilled in the art. Typically a network manager is embodied by a computer whose software provides the necessary functional components.
The network manager M has three types of input, namely a time indication from a clock 1 1, a human interface 12 and a monitor 13 which receives inputs 15 from the network N and either transmits a message to the operator by means ofthe human interface 12 or generates an automatic response from the network manager. The human interface 12 is associated with a network traffic control library 20 in which may be stored standard input formats.
A generic instruction generator 14 receives inputs from the human 20 interface 12 and the monitor 13. The generic instruction generator 14 provides three outputs: an instruction in high-level language which is passed to a group of translators 15a, 15b, 15c, a selection pattern output which is passed to a data matcher 16, and an interface type message transmitted to an interface module 19.The translators 1 5a, 1 5b, 1 5c are each configured to convert the high-level 25 instructions received from the generic instruction generator 14 into an instruction in a format compatible with a respective switch type A, B or C. The data matcher16 receives selection pattern data from the generic instruction generator 14 andcompares this data with the information stored in store 17 in order to select the switches to which the instruction is to be sent. The data stored in the store 1730 can be updated in response to inputs from the network N through the monitor 13.
Figures 3 and 4 show the organisation of data in the store 17.
Figure 3 shows the data stored for the switches A1, A2, B1, B2, B3, and C; by geographical area and type of switching equipment. As well as these inherent characteristics, the store 17 may also hold data relating to the current condition of the switches.
Figure 4 shows similar inherent data held for each link (1 to 10) in the system. This data includes the termination points and the capacity of each link.An instruction generator 1 8a, 1 8b, 1 8c is provided for each type of switch A, B, C. Each instruction generator 1 8a, 1 8b, 1 8c receives data from the matcher 16, the clock 11 and, via the interface module 19, the respective translator 1 5a, 1 5b or 1 5c, from which instructions are generated for transmission to appropriate elements of the network N.
The instructions may be transmitted by the instruction generators 18a, 1 8b, 1 8c immediately, or at one or more predetermined times under the control of the clock 11. For example, the instructions may be transmitted to the network N
on a regular basis, such as at a predetermined time and day of the week to coincide with the broadcast times of a phone-in television or radio show.
The interface module 19 ensures that a generic instruction which requires the co-operation of two or more switches is compatible with all the switches involved. The interface module 19 controls the operatlon of the instruction generators 18, 18b, 1 8c in the event that the instructlon requlred Is Incompatible with the capabilities- of one or m-ore types of swltch A B o~ C Such an 20 incompatibility would be identified by the respect~ e transla~or '~3 '5b or 15c, which transmits an error message to the Inte~t~e ~a~, e ~ ? snould the instruction not be executable. The generic InStrUSt3~ ~e~ 3~ '~ ttansmlts an interface-type message to the interface module l 9 ~n~c~l contro~s t~e operatlon of the instruction generators 18a, 18b, 18c. The Interface-type message can be one 25 of three types:
i) AND: all switches to which the instruction is addressed must be capable of executing the instruction: if any switch is not so capable the instruction is not carried out at all 30 ii) OR: any switch to which the instruction is addressed and which is capable of executing the instruction does so, even if other switches cannot do so.
iii) CONDITIONAL: an instruction to control routes between switches is executable only in respect of those routes for which all switches controlling that route are compatible with the instruction.
A message is transmitted to the human interface 12 to indicate whether, 5 or to what extent, the instruction can be executed.
The operation of the network manager M will now be described with reference to Figures 1a and 2. In this illustrative example, the function to be controlled is call-gapping, to be initiated at a set time once a week or in response to an overload condition detected by the monitor 13. For the sake of this 10 illustration, it will be assumed that call-gapping is only required for switches in geographical areas X and Y, and that equipment of type A is not capable of providing call-gapping functionality.
The human operator provides an input through the human interface 12 to the generic instruction generator 14. This input identifies the function required 15 (call-gapping), the proportion of calls to be gapped, the geographical area to be covered (in this example zones X and Y), and the time that the function should operate (for example with immediate effect until manually cancelled, or from 1900 to 2030 every Tuesday, or in response to an external stimulus such as an overload detected by the monitor 1 3) .
The generic instruction generated in the generator 14 is transmitted to the bank of translators 1 5a, 1 5b, 1 5c which each translate the instruction into a form which can be handled by a respective switching system type A, B, C. In this casetype A is incapable of performing call-gapping so an error message is generated by the translator 1 5a.
The generic instruction generator 14 has two further outputs. Firstly, it transmits the se!ection criteria to the matcher 16. In this case, the switches to be call-gapped are selected by geographical area. The selection of the set of switches to be selected may be done on the basis of the intrinsic architecture of the r network, e.g. a set may comprise a DMSU (digital main switching unit) and its 30 daughter DLEs (digital local exchanges). Alternatively the set may be manually selected, in order to meet a non-intrinsic criterion such as the coverage area of a television station, or the administrative regions of a utility company. These criteria are compared in the matcher 16 with the stored details held in the store 17, and .. , the identities of the switches which meet the criteria are L~ansi"illed from thematcher 16 to the bank of instruction generators 18a, 18b, 18c. In the present example, the identities of the switches A1 and A2 are transmitted to the instruction generator 18a, the switches B1 and B2 to the instruction generator 5 1 8b, and the switch C 1 to the instruction generator 1 8c. The identity of the switch B3 is not transmitted to instruction generator 18c because it is in zone Z
and therefore does not meet the geographical requirement.
The other output from the generic instruction generator 14 relates to the type of instruction, and is transmitted to the interface module 19. This output 10 identifies to the intefface module 19 whether the operation should be partially executed even if some switches lack the necessary functionality. In the case of call-gapping or call blocking the operation can be partially executed in this way, so the interface module 19 transmits the instructions generated by the translators 1 5b and 1 5c to the respective instruction generators 18b, 18c, but transmits no 15 instruction to the instruction generator 1 8a as only an error message was received from the translator 1 5a.
If the generic instruction cannot be carried out unless all relevant switches can co-operate, the arrival of an error message from any one of the translators 1 5a, 1 5b, 1 5c prevents the interface module 19 from transmitting any instruction 20 to any of the instruction generators 18 a, b, c.
If the generic instruction requires a route to be established between a first switch having the required functionality and a second switch lacking that functionality the route is not established. However, this does not prevent the first switch establishing routes to other switches in accordance with the generic 25 instruction, provlded these other switches have the required functionality.
The instructions generated in the instruction generator 1 8b, are transmitted to the switches B1 and B2, and the instruction generated in the instruction generator 18c is transmitted to the switch C1. The instructions are transmitted under the control of the clock 11, at the times programmed by the 30 generic instruction generator 14.
Thus, by the input of a single instruction by the human operator or automatically through the monitor 13 the required function can be performed by all switching eleménts having suitable functionality within the geographical area WO 96/lS63S PCTIGB95/02617 specified, without the human operator needing to generate separate instructions for each type of switch or to specifically identify the switches to be controlled.
In the arrangement shown in Figure 1b the system is configured so that the signalling network 31, 32, 33 is prevented from overloading with unsuccessful 5 call attempts. Call set-up signals are carried over the signalling network 31, 32, 33 in order to set-up the necessary connections in the traffic network 4, 9, 10 between the exchanges A 1, B2, B3. The user 23 is subject to a number translation service carried out by a number translator Tx in the signalling element T. In other words, the users 21, 22 can call the user 23 using a special number 10 (e.g. a toll-free number) which is translated by the translator Tx to control the signalling element T to set-up a call to the user 23.
If an overload of calls using the special number is observed or predicted, the network manager M can control the switches A 1, B2, B3 to inhibit the transmission over the signalling network 31, 32, 33 of call requests to that 15 number. This releases capacity not only in the traffic network 4, 9, 10, but also in the signalling network 31, 32, 33. If one of the switches (e.g. A1) does not have the capability to inhibit the transmission of such call requests, they can still be inhibited by the network manager M at the signalling element T. This does not prevent unsuccessful call requests appearing on the signalling link 31, between the 20 exchange A1 and the signalling element T, but it does prevent them propagating over the rest of the network.
The normal sequence of operation of the system will now be described. It may be viewed as consisting of three distinct processes: control definition, control scheduling, and control implementation. Firstly, users define pre-planned controls 25 (PPCs) by specifying the type of control (e.g. destination call gapping) and optionally the values of the control parameters and the control target.
Once defined, the PPC may be saved in the network traffic control library 20 for later use or may be scheduled.
The primary function of the library 20 is to provide a repertoire of PPCs 30 which may be quickly retrieved to deal with network problems.
PPCs in the library 20 may be retrieved for control scheduling. Users schedule a PPC by selecting one from the library 20 and specifying the schedule details and if necessary the control target and control parameters may be added (if CA 02203671 1997-04-24 = =
they are not already defined), or changed (if they are defined). The PPC in the library 20 is not affected. Once scheduled, the control is entered onto the list of currently scheduled controls.
Scheduled controls may be positively authorised at any time within N
5 minutes of their due implementation ~where N is a pre-defined parameter), otherwise the control will not be implemented. If authorisation is not given within the pre-defined time period specified by N a report is generated.
Authorised controls are automatically implemented (inserted and removed) according the schedule attached to the PPC. Users can monitor the progress of 10 controls implementation in real-time.
The network traffic control library 20 allows users to build up and maintain a repertoire of PPCs. This allows users to save time by having access to templates to commonly used controls (e.g. to deal with focused overloads) where only the control target is different. It also allows the accurate implementation of a prepared 15 complex sequence of controls. Network problems which require the fast and accurate deployment of a number of controls can be dealt with promptly. The library 20 may also be used as a source from which to build new controls.
There are three types of library entries:
1. basic PPC (with a single exchange/route control target) 2. basic PPC (with an exchange set control target) 3. Iinked PPC
The control targets may be specified, or may be left for the user to select.
A linked PPC consists of a sequence of PPCs. PPCs may be stored with all or only25 some of the control parameters and the control target blank. The network manager will check that a PPC is fully specified when it is selected for scheduling.
A basic PPC with a single exchange/route as a control target is the simplest type of control. A basic PPC with an exchange set as a control target is also referred to as a broadcast control. These two types of basic PPCs are only 30 distinguishable when the control target is specified.
A broadcast control is a control which is applied to a number of exchanges (exchange set). A facility is provided for defining and mainLaini,lg a library of exchange sets.
~WO 96tlS635 PCT/GB95102617 ~ . .
A linked PPC is a composite control and is defined by linking together a number of basic PPCs in a sequence to form a linked PPC. When the linked PPC is implemented, each PPC in the chain is implemented sequentially starting with the first.
Exchanges can be grouped together into exchange sets. Commonly used exchange set definitions may be stored in store 17 and used when defining broadcast controls. These are referred to as static exchange sets.
Exchanges can also be grouped by exchange type into dynamic exchange sets. The following default dynamic exchange sets are provided:-All DMSUs (Digital Main Switching Units: trunk exehanges) All DCCEs (Digital Call Centre Exchange: tandem/junction exchange -intermediate level) ~ll DLEs ~Digi~al LQsal Exsh3~g~s~
15 All DDSCs (Digital Derived Services Switching Centre) All DJSUs (Digital Junction Switching Unit - intermediate level) All dependent level exchanges of DMSU (one set per DMSU) All dependent level exchanges of a DCCE (one set per DCCE) Dependent level exchanges include DLEs, DJSUs and DCCEs.
A traffic control is scheduled to deal with a particular problem on the network. Users have two sources for PPCs when scheduling, namely PPCs stored in the network traffic control library; or by defining a control for the purpose, allowing users to schedule new controls rapidly without following the normal 25 sequence of storing a control definition in the library and then retrieving it. The network manager will perform the same sequence of operations but this will be transparent to the user.
A network traffic control is applied to an exchange in two stages. It is defined using the facilities of the network traffic control library, and the schedule 30 to be applied at specified times. The control could be applied immediately or stored for later application.
Both single-shot and multi-shot (repeating) schedules are provided:
- single-shot where only one insertion (and removal) is involved W 096/15635 r~ll~b951'~26l7 - multi-shot where multiple insertions (and removalsl are involved.
Scheduled controls may be named in such a way as to link them to specific events, e.g. Christmas Day.
A schedule may be specified without a removal time.
The single-shot timing mechanism provides the opportunity to define a period during which the traffic control should be applied. This is achieved in terms of a control insertion time, and a control removal time.
Figure 5 provides an illustration of the type of schedule that may be achieved using a single-shot schedule. The hatched area represents the time over10 which the control is in force. 'A' represents the application time, and 'R' the removal time.
A control may be scheduled without a specified removal time; such a control is effective indefinitely. Facilities are provided to add later a removal time to the schedule; immediate removal is also possible.
The control insertion time is specified as a specific time e.g. 10:30 14 The control removal time is specified in the same format as the insertion time, e.g. 13:1 5 14 NOV 94 or it may be specified as a delta time (i.e. the control duration): e.g. 002 02.45 The delta time in the example means remove the control after an elapsed time of 2 days 2 hours and 45 minutes.
A multi-shot (repeatingl schedule is a single-shot schedule but with the addition of a schedule start and end time and some repeating criteria (e.g. on Monday of every week) The facility of multi-shot schedules provides the opportunity to define a repeating traffic controi application pattern. The application pattern is defined in terms of:
a schedule start time;
a schedule end time;
a control inserting time (within the period specified by the schedule start and end time);
a control removal time (within the period specified by the schedule start and end time); and repeat criteria.
Figure 6 provides an iilustration of the type of schedule that may be achieved using a multi-shot schedule. The hatched area represents the time over which the control is in-force. It is possible for the control in-force period to span a 5 midnight boundary (i.e. control removal occurs on a different day to control insertion). A control is removed when its associated schedule expires.
Note that the control is not applied until Schedule Start Time SST and is removed at Scheduled End Time SET, although these do not necessarily coincide with control insertion and removal times.
The scheduled start time SST, control insertion time A and control removal time R are specified in the same format as for the single shot control above.
The scheduled end time defines a time after which no further applications occur.
The scheduled end time is specified in one of the formats specified for the 15 control removal time above.
The repeating criteria are identified in terms of:
days of the week, or days of the month (but not both), and calendar months of the year in which the above applies.
In the simplest case, a multi-shot schedule specifies a schedule start and 20 end time and the days of the week or days of the month in which the control insertions and controi removals apply within the specified schedule start and end time.
A more specialised repeating pattern based on the above can be defined, by further identifying the months within the specified schedule start and end time 25 in which the control insertions and control removals apply.
It is possible for schedules to expire automatically, or be forced to expire by operator action.
In the case of a single-shot schedule, the schedule automatically expires on removal. For multi-shot schedules, automatic expiry occurs on the schedule 30 end time.
After a control from the network traffic control library 20 is scheduled, the network manager maintains details of the scheduled control and will implement the control as specified in the schedule.
W O96/15635 PCT/GB95/0261?
.14 A facility is provided to allow users to track and monitor the current list of scheduled controls on the network manager and to monitor which of the scheduled controls are in-force lactive). Figure 7 shows how scheduled controls are tracked by the network manager through the scheduled control and active control lists.
In ~he event of a scheduled control application failing, the application is periodicaily retried until it is successful or the end of the scheduling period has been reached. The number of retries and the retry interval are configurable parameters.
A message is sent to the human interface 12 if the network manager fails 10 to implement a scheduled control after the maximum number of retry attempts or the end of the scheduling period has been reached.
The implementation of a scheduled control can fail for several reasons.
Firstly there may be inconsistent scheduled requests or other reasons (failure within network manager~. Secondly there may be communications failure.
There may also be communications failures, maintenance failures (e.g.
failure to process a job request), or exchange failures (e.g. the exchange does not accept a control request from the network manager).
In the first two cases the network manager will continue to apply the retry logic as specified in order to attempt to successfully implement the control.
20 However, in the event of an exchange failure the network manager will stop the retry logic as soon as an exchange fails to accept a control request.
Overlapping schedules can be allowed subject to any traffic control implementation rules defined in the network manager, as described below.
Before a control request is implemented the network manager checks if 25 there is an existing control on the control target, and if so, the actual control requests issued by the network manager are modified. The rules specified below, are general rules to be applied when implementing controls.
The network manager may issue a real-time "control status read" request before applying a control.
For inserting a basic PPC (Single ExchangeiRoute and Exchange Set), the network manager checks for a control of the same type on the target (which may consist of members of an exchange setl. If a control of the same type is already in force, and if the schedule creation date of the scheduled control is earlier than the WO 96tlS635 PCr/GB95/02617 in force control, the scheduled control is not implemented; otherwise the scheduled control is implemented.
- The user is able to suspend scheduled controls, which may be authorised, prior to implementation. Suspended controls can be reinstated at any time, 5 however a control will not be implemented if the scheduled insertion time has been exceeded. Multi-shot controls will be implemented until the next insertion time after the reinstatement.
Before inserting a Basic PPC (Single/Exchange/Route and Exchange Set) control the network manager may issue a request to read the real-time control 1 0 status.
If a control is already in force on the exchange or the exchange resource already exists, but with different parameters to the control to be implemented, then a "change" exchange-specific command is issued; otherwise an "insert"
exchange-spe~ific commaf~is ~ss~.
The network manager may be arranged such that if it discovers a control of the same type and detects that it did not insert the discovered control, the network manager alerts users, updates the controls database and sends a message to the central system mailbox. The scheduled control will then only be applied if agreed by a user with the Control Authorisation access privilege, and otherwise 20 will be removed.
When removing a Basic PPC (Single Exchange/Route and Exchange Set) the network manager checks for a scheduled control of the same type on the target (which may consist of members of an exchange set). If a control of the same type is scheduled and due to be enforce (but not implemented due to the application of the first rule above - see Figure 7) the control is applied using the second rule above.
If no control of the same type is scheduled and due to be in-force, before implementing a remove control request the network manager issues a real-time control status read request.
If a control is already in-force on the exchange or the resource already exists a recover exchange specific command is issued.
For linked pre-planned controls, each PPC in the chain would only be implemented if the implementation of the previous PPC was successful.
WO 96/1563~ PCr/GB95/02617 ~i6 Impiementation of constituent PPCs in the chain would be according to the rules specified above for PPCs. Removal of the PPCs in the chain is in the reverse order to that of insertion.
If one of the PPC constituents fails during implementation, then the effect 5 of all previously implemented constituent PPCs in the chain would be reversed.Scheduled controls which have been authorised are implemented by the network manager at the specified times. At the point of implementation, the network manager maps the generic control to an exchange-specific control if the generic control is a linked control then each individuai control in the linked control 10 is mapped to the exchange-specific format when the individual control is implemented. The network manager then transmits the control request(s) to the appropriate instruction generator 18a, 18b, or 18c for each exchange, and saves the corresponding control response~s) returned by the instruction generator 18.
Finally, the network manager updates the internal control database with the new 15 status of the control.
In general, a control may be inserted, removed, or cancelled. In addition control status read requests may be issued to obtain the status of a network resource prior to inserting or removing a cantrol on it. The cancel request does not result in any control requests to the network communlcatlons manager.
20Control responses are matched with the contro! ~eauests tO form a complete control transaction. Each control transac:~on corres~o~3s to an Insertion or removal of a scheduled control.
Network traffic management controls are Inslructlons sent to an exchange (via a Network Communications Manager) to modlfy exchange resources, with the 25purpose of overcoming problems existing on the network (e.g. by causing traffic to be re-routed).
Each equipment type (e.g. System X Phase 3) manages a different set of resources to perform its swl-tching operations. However the network manager attempts to modify exchange resources on different exchange equipment types 30 with the intention of modifying traffic patterns in similar ways.
In order that the network manager can interwork with a number of exchange equipment types, and allow additional equipment types to be added as .17 the system evolves, without the system growing increasingly complex, a set of exchange-type independent Generic Controls is defined.
Some exchange-specific controls only appear on one particular equipment type or do not fit into the generic set. Facilities to create, schedule and manipulate 5 these non-generic controls can be provided so that specific features offered only by one system, or specifically designed for a special requirement of one installation, are not lost despite not being generic to the system as a whole.
Each generic control stored on the network manager M has a defined set of parameters. The controller sends exchange specific control requests to the 10 network elements when a scheduled control is implemented. The translators 15 convert generic controls stored in the network manager to exchange-specific versions at the point of implementation via a set of mapping rules.
When a user creates a Destination Volume Control such as call blocking, the network manager stores the values for the generic parameters defined for the15 control and not values for the exchange specific parameters. The exchange specific parameters are calculated according to a set of mapping rules at implementation time. A separate set of rules is required for each target equipment type.
Exchange specific parameters which cannot be calculated or denved from 20 the generic parameters are assigned default values cv t?le net~otl~ manager. If however, a user creates the generic instructlon k~-o~lns t~a~ t-~ ta~getls) of the control includes exchanges having additional func~ on3llty t~ values for the exchange-specific parameters, such as traffic cateaorv and call d~sDosltlon, may be specified at control creation time.
Mapping rules are defined for each exchange specific control on each target equipment type supported by the control M.
In mapping the generic set of parameters to the exchange specific set, the mapping process will use the nearest available value for an exchange specific parameter if the required value is not available.
Non-generic controls such as System X Loopback can be stored and manipulated in their exchange specific form in the network manager. At implementation time, no mapping process is performed by the network manager W O96/15635 PCT/GB9S/0261?
and the control details are sent directly to the switches for implementation on the exchange.
Claims (27)
1. A method of controlling a telecommunications network, the network comprising at least two groups of elements, wherein at least some of the elements of at least two of the groups are capable of performing a predetermined function in response to a group-specific instruction, the method comprising the steps of:
generating a generic instruction, for performance by a selected plurality of the elements;
converting the generic instruction to group-specific instructions appropriate to each group of elements in which there are one or more of the selected elements; and transmitting to each selected element the group-specific instructions appropriate to its group.
generating a generic instruction, for performance by a selected plurality of the elements;
converting the generic instruction to group-specific instructions appropriate to each group of elements in which there are one or more of the selected elements; and transmitting to each selected element the group-specific instructions appropriate to its group.
CLAIM 2 CANCELLED
3. A method according to Claim 1 comprising the step of determining which of the selected elements are capable of performing the required instruction, andinhibiting the transmission of the instruction to all of the selected elements if any of the selected elements do not have the required capability.
4. A method according to Claim 1 comprising the step of determining which of the selected elements are capable of performing the required instruction, andtransmitting the instruction only to that element or elements.
5. A method according to any preceding claim, wherein instructions are prepared and stored for onward transmission in response to a predetermined condition.
6. A method according to Claim 5, wherein the predetermined condition is the expiry of a time interval.
7. A method according to Claim 6, wherein the time interval is reset after each transmission.
8. A method according to Claim 6, wherein the time interval is not reset after the transmission.
9. A method according to Claim 5, comprising the steps of:
monitoring the telecommunications system for a predetermined operating condition, and generating the generic instruction if the said predetermined operating condition occurs.
monitoring the telecommunications system for a predetermined operating condition, and generating the generic instruction if the said predetermined operating condition occurs.
10. A method according to Claim 9, wherein the predetermined operating condition is a network overload.
11. A method according to any preceding claim, wherein the instruction causes the inhibition of a signalling function.
12. A method according to any preceding claim comprising the steps of:
generating a generic instruction in a high-level language;
generating a selection pattern, indicative of the elements to be controlled by the instruction;
generating an interface type message, indicative of whether any of the elements selected by the selection pattern are to carry out the instruction if other elements of those selected are incapable of performing the instruction;
converting the high-level instruction into one or more lower-level instructions, each having a format compatible with a respective group of the elements; and comparing the selection pattern output and interface type data with stored information to select the elements in each group to which each low-level instruction is to be transmitted.
generating a generic instruction in a high-level language;
generating a selection pattern, indicative of the elements to be controlled by the instruction;
generating an interface type message, indicative of whether any of the elements selected by the selection pattern are to carry out the instruction if other elements of those selected are incapable of performing the instruction;
converting the high-level instruction into one or more lower-level instructions, each having a format compatible with a respective group of the elements; and comparing the selection pattern output and interface type data with stored information to select the elements in each group to which each low-level instruction is to be transmitted.
13. A method according to claim 12 comprising the additional steps of generating a message indicating whether, if some of the selected elements are unable to execute the instruction, the elements which are able to execute the instruction should do so, and inhibiting or executing the operation of the said elements in response to said message.
14. A controller for a telecommunications network, the network comprising at least two groups of elements, wherein at least some of the elements of at least two of the groups are capable of performing a predetermined function in responseto a group-specific instruction, the controller comprising:
means for selecting a plurality of the elements, to which an instruction to perform the predetermined function is to be transmitted;
means for generating a generic instruction, for performance by the selected plurality of the elements;
means for converting the generic instruction to group-specific instructions appropriate to each group of elements in which there are one or more of the selected elements; and means for transmitting to each selected element the group-specific instructions appropriate to its group.
means for selecting a plurality of the elements, to which an instruction to perform the predetermined function is to be transmitted;
means for generating a generic instruction, for performance by the selected plurality of the elements;
means for converting the generic instruction to group-specific instructions appropriate to each group of elements in which there are one or more of the selected elements; and means for transmitting to each selected element the group-specific instructions appropriate to its group.
CLAIM 15 CANCELLED
16. A controller according to Claim 14, in which the selection means comprises means for determining which of the selected elements are capable of performing the required instruction, and means for inhibiting the transmission of the instruction to all of the selected elements if any of the selected elements do not have the required capability.
17. A controller according to Claim 14, in which the selection means comprises means for determining which of the selected elements are capable of performing the required instruction, and means for transmitting the instruction only to that element or elements.
18. A controller according to any of Claims 14 to 17 including means for preparing and storing instructions, and means for transmitting the stored instructions in response to a predetermined condition.
19. A controller according to Claim 18, comprising a timing means, the transmitting means being arranged to transmit the instructions under the control of the timing means.
20. A controller according to Claim 19, including means for resetting the timing means after each transmission.
21. A controller according to Claim 18, comprising monitoring means for monitoring the telecommunications system for a predetermined operating condition, the transmitting means being responsive to the monitioring means to transmit the stored instructions if the said predetermined operating condition occurs.
22. A controller according to Claim 21, the monitoring means being configured to detect network overloads.
23. A controller according to any of claims 14 to 22 comprising:
a generic instruction generator for generating generic instructions in high-level language and for generating selection pattern data, indicative of the elements to be controlled by the instruction;
a plurality of translators each configured to convert the high-level generic instructions generated by the generic instruction generator into an instruction in a format compatible with a respective element type;
and a data matcher for comparing the selection pattern data generated by the generic instruction generator with information stored in a store, in order to select the switches to which the instruction is to be sent.
a generic instruction generator for generating generic instructions in high-level language and for generating selection pattern data, indicative of the elements to be controlled by the instruction;
a plurality of translators each configured to convert the high-level generic instructions generated by the generic instruction generator into an instruction in a format compatible with a respective element type;
and a data matcher for comparing the selection pattern data generated by the generic instruction generator with information stored in a store, in order to select the switches to which the instruction is to be sent.
24. A controller according to claim 23, the generic instruction generator also having means for generating a message indicating whether, if some of the selected elements are unable to execute the instruction, the elements which are able to execute the instruction should do so, and means for inhibiting or executing the operation of the elements in response to said message.
25. A telecommunications network comprising a controller according to any ofclaims 14 to 24, in combination with one or more network elements, at least someof the network elements having:
means for isolating a network signalling function; and means to activate the isolating means in response to an instruction transmitted from the controller.
means for isolating a network signalling function; and means to activate the isolating means in response to an instruction transmitted from the controller.
26. A method substantially as described with reference to the accompanying drawings.
27. Apparatus substantially as described with reference to the accompanying drawings.
Applications Claiming Priority (2)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| GB94227722.0 | 1994-11-10 | ||
| GB9422722A GB9422722D0 (en) | 1994-11-10 | 1994-11-10 | Traffic management |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CA2203671A1 true CA2203671A1 (en) | 1996-05-23 |
Family
ID=10764194
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CA002203671A Abandoned CA2203671A1 (en) | 1994-11-10 | 1995-11-07 | Controlling elements of a telecommunications network |
Country Status (12)
| Country | Link |
|---|---|
| US (1) | US6377988B1 (en) |
| EP (1) | EP0791275B1 (en) |
| JP (1) | JPH10508991A (en) |
| KR (1) | KR970707689A (en) |
| AU (1) | AU686470B2 (en) |
| CA (1) | CA2203671A1 (en) |
| DE (1) | DE69532452T2 (en) |
| FI (1) | FI971943A (en) |
| GB (1) | GB9422722D0 (en) |
| NO (1) | NO972154L (en) |
| NZ (1) | NZ295205A (en) |
| WO (1) | WO1996015635A1 (en) |
Families Citing this family (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| FI971919A0 (en) | 1997-05-05 | 1997-05-05 | Nokia Telecommunications Oy | Control av naetelement |
| DE10021738A1 (en) * | 2000-05-04 | 2001-11-22 | Siemens Ag | Coordinated network-wide administration of switching centers |
| US7051101B1 (en) * | 2000-09-13 | 2006-05-23 | Emc Corporation | Methods and apparatus for controlling devices within storage network |
| US8326965B2 (en) * | 2001-05-03 | 2012-12-04 | Hewlett-Packard Development Company, L.P. | Method and apparatus to extract the health of a service from a host machine |
| US7003527B1 (en) | 2002-06-27 | 2006-02-21 | Emc Corporation | Methods and apparatus for managing devices within storage area networks |
| US20100280855A1 (en) * | 2009-04-30 | 2010-11-04 | Vinay Gupta | Management of a first stand-alone system used as a subsystem within a second system |
Family Cites Families (11)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US4419667A (en) * | 1979-07-02 | 1983-12-06 | Sangamo Weston, Inc. | System for controlling power distribution to customer loads |
| US4611320A (en) * | 1984-05-21 | 1986-09-09 | Siemens Corporate Research And Support, Inc. | Programmable testing analyzer |
| US5426421A (en) * | 1986-04-21 | 1995-06-20 | Gray; William F. | Method of automatically managing a network or remote function-excecuting apparatus from a programable network control center |
| US5008879B1 (en) * | 1988-11-14 | 2000-05-30 | Datapoint Corp | Lan with interoperative multiple operational capabilities |
| FI83007C (en) * | 1989-10-05 | 1991-05-10 | Nokia Data Systems | Digital data transfer system |
| US5193152A (en) * | 1989-11-03 | 1993-03-09 | Racal-Datacom, Inc. | Network management system with group naming |
| US5182750A (en) * | 1990-12-31 | 1993-01-26 | At&T Bell Laboratories | Transparent remoting of switching network control over a standard interface link |
| US5317742A (en) * | 1991-06-21 | 1994-05-31 | Racal-Datacom, Inc. | Dynamic translation of network management primitives to queries to a database |
| JPH05236138A (en) * | 1992-02-20 | 1993-09-10 | Nec Corp | Electronic exchange |
| FI106418B (en) * | 1992-03-10 | 2001-01-31 | Nokia Networks Oy | The network management system |
| US5583928A (en) * | 1992-06-19 | 1996-12-10 | British Telecommunications Public Limited Company | Detecting local exchange failure and resultant control of a communications network |
-
1994
- 1994-11-10 GB GB9422722A patent/GB9422722D0/en active Pending
-
1995
- 1995-11-07 JP JP8515820A patent/JPH10508991A/en active Pending
- 1995-11-07 NZ NZ295205A patent/NZ295205A/en unknown
- 1995-11-07 CA CA002203671A patent/CA2203671A1/en not_active Abandoned
- 1995-11-07 WO PCT/GB1995/002617 patent/WO1996015635A1/en active IP Right Grant
- 1995-11-07 AU AU38494/95A patent/AU686470B2/en not_active Ceased
- 1995-11-07 DE DE69532452T patent/DE69532452T2/en not_active Expired - Lifetime
- 1995-11-07 EP EP95936636A patent/EP0791275B1/en not_active Expired - Lifetime
- 1995-11-07 US US08/836,301 patent/US6377988B1/en not_active Expired - Lifetime
- 1995-11-07 KR KR1019970703096A patent/KR970707689A/en not_active Application Discontinuation
-
1997
- 1997-05-07 FI FI971943A patent/FI971943A/en unknown
- 1997-05-09 NO NO972154A patent/NO972154L/en not_active Application Discontinuation
Also Published As
| Publication number | Publication date |
|---|---|
| NO972154D0 (en) | 1997-05-09 |
| FI971943A0 (en) | 1997-05-07 |
| MX9703436A (en) | 1997-07-31 |
| NZ295205A (en) | 1997-07-27 |
| FI971943A (en) | 1997-05-07 |
| WO1996015635A1 (en) | 1996-05-23 |
| AU686470B2 (en) | 1998-02-05 |
| DE69532452D1 (en) | 2004-02-19 |
| US6377988B1 (en) | 2002-04-23 |
| EP0791275B1 (en) | 2004-01-14 |
| DE69532452T2 (en) | 2004-11-25 |
| KR970707689A (en) | 1997-12-01 |
| JPH10508991A (en) | 1998-09-02 |
| EP0791275A1 (en) | 1997-08-27 |
| AU3849495A (en) | 1996-06-06 |
| NO972154L (en) | 1997-05-09 |
| GB9422722D0 (en) | 1995-01-04 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US5917898A (en) | Telecommunications network traffic management system | |
| US4979118A (en) | Predictive access-control and routing system for integrated services telecommunication networks | |
| US5848132A (en) | Telecommunications network having resident ability to pre-book scheduled call back services | |
| US6259776B1 (en) | System for controlling telecommunication overload traffic | |
| WO1996015634A2 (en) | Overload prevention in a telecommunications network node | |
| EP0791275B1 (en) | Controlling elements of a telecommunications network | |
| EP0726018B1 (en) | Telecommunications network traffic management system | |
| WO1996015635A9 (en) | Controlling elements of a telecommunications network | |
| EP0655182B1 (en) | Centralized command system for a telecommunications network | |
| US20040131171A1 (en) | Call center apparatus for automatically distributing call through public telephone network and controlling method for call center apparatus | |
| EP1086594B1 (en) | Programming call-processing application in a switching system | |
| US6064726A (en) | Fully flexible routing system | |
| CN112583622B (en) | Method and system for reporting fault event information | |
| WO1996029830A1 (en) | Service provision in a telecommunications network | |
| AU7780298A (en) | Overload prevention in a service control point (scp) | |
| MXPA97003436A (en) | Elements of control of a telecommunication network | |
| US6047385A (en) | Digital cross-connect system restoration technique | |
| US6732169B1 (en) | Network transmission circuit control method and system | |
| CN100446582C (en) | Method for allowing information quantity management | |
| EP0726017B1 (en) | Telecommunications network traffic management system | |
| Hoare | Modernization of the UK army fixed telecommunication system | |
| Williams et al. | Realising effective intelligent network overload controls | |
| Gallagher et al. | Experiences of developing, deploying and operating an automatically switched digital service protection network | |
| JP2000059833A (en) | Emergency command call system | |
| JPH10313474A (en) | Channel setting method for mobile communication network |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| EEER | Examination request | ||
| FZDE | Discontinued |