WO1999048306A1 - Simulator zur simulation eines intelligenten netzwerks - Google Patents
Simulator zur simulation eines intelligenten netzwerks Download PDFInfo
- Publication number
- WO1999048306A1 WO1999048306A1 PCT/EP1999/001141 EP9901141W WO9948306A1 WO 1999048306 A1 WO1999048306 A1 WO 1999048306A1 EP 9901141 W EP9901141 W EP 9901141W WO 9948306 A1 WO9948306 A1 WO 9948306A1
- Authority
- WO
- WIPO (PCT)
- Prior art keywords
- simulator
- scp
- event
- simulation
- time
- Prior art date
Links
Classifications
-
- 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
- H04Q3/0091—Congestion or overload control
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04M—TELEPHONIC COMMUNICATION
- H04M3/00—Automatic or semi-automatic exchanges
- H04M3/22—Arrangements for supervision, monitoring or testing
- H04M3/36—Statistical metering, e.g. recording occasions when traffic exceeds capacity of trunks
- H04M3/362—Traffic simulation
Definitions
- the invention relates to a simulator for simulating an intelligent network, in particular for finding and analyzing weak points, for testing network configurations and / or control mechanisms, and for finding possibilities for increasing the performance of the network.
- intelligent network stands worldwide for the concept of a network architecture valid for all telecommunication networks.
- the core element of this concept is a software-defined, individual communication profile for customers of telecommunications services.
- Important functions and data are centralized in the IN and are only provided in one or a few nodes. These functions and data relate, for example, to information on how a call with an IN-specific number should be handled depending on its place of origin, the dialed number, the time of day and / or other parameters, e.g. whether and to which network subscriber a call is transferred, whether and to which announcements a call should be switched or whether a call is only counted.
- intelligent, branched database access from a plurality of service access points (SSP) to data and functions stored in one or a few central nodes (service control point, SCP) for service control is implemented.
- SSP service access points
- SCP central nodes
- the intelligent network is a centralized network over the telephone network and provides intelligence for setting up and clearing down connections via the telephone network.
- the interface between the telephone network and the intelligent network is formed by the SSPs, in which calls are received with IN-specific phone numbers and, after receiving the processing information, are processed further by the SCP in accordance with these instructions, for example are forwarded to a phone number communicated by the SCP.
- the individual functional complexes are implemented in separate system levels. IN transport and switching functions are implemented in the SSP level (Service Switching Point), service control functions and administration of the service data in the SCP level (Service Control Point) and service management in the service
- SMS Session Management system
- SS7 system signaling system no. 7
- STP or SRP service transfer or relay point
- the STP or SRP is used for the switching and distribution (routing) of the messages in the central signaling channel between the SCP and the SSP.
- STP or SRP can also serve as a gateway for messages that relate to the IN services of another network operator and must be processed by the SCP of another IN.
- the routing criterion for an IN message is its global title; the STP / SRP level implements Global Title Translation (GTT).
- GTT Global Title Translation
- the SSP level has options for recognizing IN connections, e.g. based on the phone number, and to support. With these connections, information must be requested from an SCP for further connection establishment.
- the SCP contains programs and the associated data for controlling the services. Furthermore, the SCP collects data on charging and statistical evaluations. Multiple SSPs access a central SCP.
- the Service Management System which contains the administration of the IN services and IN components, is superior to the SCP.
- Televotum The Televotum service enables the service subscriber to register the number of calls under his Televotum number.
- a request is made to the SCP for every call, in a further variant the calls in the SSP are counted, with a request to the SCP for every kth call.
- every TV call arriving in the IN system is registered.
- 3 Every nth call is treated specially, for example after the registration is forwarded to a destination specified by the service subscriber. After registration, all other calls lead to an announcement that was also specified in the traffic management program by the service subscriber.
- Freephone The Freephone service gives service users the opportunity to call the "service subscriber" free of charge. The entire fee is borne by the service subscriber.
- Universal call number With the service universal call number it is possible that a service subscriber can be reached anywhere under a uniform, network-independent call number. Depending on the definition of the service subscriber, the charges for such connections can be raised by the caller alone or divided between the calling and called parties.
- Tele-Info-Service enables callers to access the information offered by the service subscriber via their announcement devices or in direct dialogue.
- the charges are charged to the caller and can be based on the connection-related
- mobile radio networks are also intelligent networks.
- the service subscriber has the possibility of specifying his service on the basis of further service features, e.g.
- Call redirection If the selected subscriber does not answer or the number is busy, the call is either transferred to an announcement or to another number. This process can be repeated up to a specified number of attempts, otherwise the call is rejected.
- Call restriction If the number of calls to a pull call number exceeds the one specified by the service subscriber within a period of time 4 Limitation, the excess calls are made to defined alternative destination numbers or announcements.
- Time-dependent destination control The time of the call is checked against the periodic and / or temporary time windows. If no valid time window is found, the SCP leads the IN call to a standard message, otherwise the call branches or to the next service feature.
- Origin-dependent destination control The network origin information is compared with the origin information stored in the traffic management program. If no match is found, the SCP leads the call to a standard advisory announcement, otherwise the system branches to the call destination or the next service feature.
- the call distribution service feature allows the definition of individual quotas, according to which calls are distributed to different destinations.
- the SSP acts as a fictitious communication participant.
- the SSP supports network performance-related standard announcements and announcements that can be controlled as a call destination.
- the individual announcements have a limited number of query places. The excess calls are rejected if all of the query places are occupied.
- Each announcement is limited by a maximum listening time and number of repetitions.
- the task of the intelligent network is to change the selected IN number depending on the service parameters defined in the
- the first digits of the dialed telephone number are evaluated in the SSP and the IN service is recognized.
- the SSP sends a request for further call handling to the SCP with the message PROVTDE INSTRUCTION.
- the message contains the IN- selected by the service user as a parameter. 5 subscriber numbers (CALLED-PARTY-ADDRESS) and the call number of the call (CALLING-PARTY-ADDRESS).
- Service logic program addressed for the corresponding IN service The subscriber-specific traffic management program addressed via CALLED-PARTY-ADDRESS is activated.
- a destination for establishing the connection is determined, which can be a telephone number or an announcement.
- the traffic management program may result in requirements for connection monitoring, such as monitoring "subscriber busy" and "subscriber not answering”.
- the SCP saves the results in the connection-specific context and sends the CREATE-JOIN and MONITOR messages to the SSP.
- the message contains as parameters CALLED-PARTY-ADDRESS and EVENTLISTE, which specifies the events to be monitored.
- the SSP monitors the connection establishment to the B subscriber if this has been specified in the EVENT LIST. If the B-subscriber does not respond, the connection towards the B-subscriber is triggered after a timeout and the SCP is informed of the event with the EVENT message.
- An alternative destination is determined from the traffic management program (rerouting) and a message CREATE-JOIN and MONITOR with corresponding parameters is sent to the SSP.
- the SSP uses the telephone network to establish a connection to the B subscriber to the destination number transferred with CREATE-JOIN, or to an announcement. After the B participant reports, the connection is switched through.
- EVENT (CALL-END) transferred.
- the confirmation of this message by the SCP is monitored with a timer. If no confirmation has been received by the end of the timer, the EVENT (CALL-END) message is repeated. 8.
- the SCP sends a message to end the TCAP dialog.
- the connection-specific context is reactivated in the SCP.
- the received timestamps are saved together with the data stored in the context (CallTickets). They will later be transferred to the SMS for further processing. Counters kept in the SCP (e.g. for successful calls) are counted up (counter tickets).
- Points 4, 5 and 6 in this process only occur when rerouting.
- overload protection mechanisms are provided within the IN.
- Overload protection means that the SSP rejects IN calls without requesting the SCP according to certain specifications.
- overload protection mechanisms are AUTOMATIC-CALL-GAPPING (ACG) or the LEAKY-BUCKET method. A service and / or target-dependent overload protection is possible.
- a service control point is usually a multi-layer system with a hardware foundation and several, usually three layers of software.
- the hardware foundation consists of a computer with one or more processors processing in parallel with connecting cables, hard drives, magnetic tapes, terminals and printers.
- the first software layer contains the system software.
- the second software layer (NODE software) contains general functions for the service application.
- the third software layer consists of the application, which supports the call processing services.
- a parallel processing architecture of the SCP it has a plurality of processors, each of which is an autonomous unit with CPU, main memory, power supply and input / output processor and which are connected to one another with a bus system.
- the various SCP software layers do not contain any 7 processes belonging to the operating system, eg for communication between the processes or for effective management of the local cache, application processes that are required for processing an IN message.
- An IN message arriving at the SCP thus runs through a sequence of processes in different layers of the SCP, which results in the generation of an IN message from the SCP to the SSP in response to its request for call handling.
- the processes can be service and / or service subscriber dependent or can be used independently of all IN messages.
- the processes are implemented in one or more incarnations on all or selected processors of an SCP.
- the processing of an IN message in the SCP is usually carried out according to the following scheme, implemented by calling a predetermined chain of individual processes:
- a message from the SSP is received and forwarded to the SCP computer.
- the SCP computer receives the message, memory is made available by and the message is checked for its scope.
- the context for call handling is created.
- a routing tree is loaded from memory or from the hard disk.
- the call number to be dialed is determined from the routing tree.
- the context of the call is saved and a response to the SSP is created.
- the reply is sent to the SSP as a new IN message.
- connection end treatment after the connection from the exchange to the SSP has been triggered by the caller is processed analogously to the connection establishment treatment described above by a corresponding process chain.
- An IN message in the STP / SRP is also processed by processing a predetermined chain of successive processes.
- overload protection Another critical element in the operation of an intelligent network is overload protection, which is intended to stabilize the system as close as possible to its performance limit. The determination of appropriate overload protection parameters is difficult in practice, so that 9 There is a need to determine the optimal settings for overload protection depending on other network configurations regardless of network operation and to transfer them to the real network.
- the invention is therefore based on the object of a tool for
- the user should be able to specify and change the network configuration and the type of call handling within the network components within a wide range, so the simulation should be independent of the IN platform selected.
- Statistical data on the performance of the network are to be generated, which allow a comparison of data measured with real IN components, but also those data are to be made available to which no access is possible in real networks, such as specific logging of calls Processing times when running through the intelligent network.
- the problem is solved in a simulator for simulating the performance of an intelligent network (IN), which has the following components:
- a module for the simulation of IN typical event sequences (traffic simulator) according to the rules of traffic theory; 2. a module for event-oriented simulation of the service control point (SCP simulator) using process models;
- the modeling of the SCP forms the core of the simulator. Using queue models / process models, a detailed modeling of the software structure of the SCP can be realized. Another module that 10 Traffic simulator, is required in the IN simulator to generate IN-specific loads and to generate realistic input for the SCP simulator.
- the core of the simulator is a computer program. When starting or during simulation, this program accesses files in which parameters for configuring the network or network components, for specifying communication services, i.e. Type and sequence of call handling, as well as other parameters relating to the simulation sequence, e.g. Information about the traffic volume is stored. These files can be written on and changed by the user in a known manner.
- the simulation parameters are preferably entered using a computer screen and keyboard. The simulation parameters are saved and can be changed individually or in their entirety before a new simulation is run, so that the influence of individual parameters on the simulated IN performance must be analyzed.
- the type of simulation used corresponds to the so-called event-controlled simulation.
- IN-specific events are generated which run through the individual components of the simulator for processing.
- the processing times in the individual simulation modules, possibly also in sub-components of the simulation modules, are also recorded.
- the IN simulator preferably has a module for event-oriented simulation of signaling system No. 7.
- This SS7 simulator works on the basis of queue models, as far as functionalities in the SS7 integrated processors are to be simulated, and / or only imparts a constant delay time to a message, which takes into account the finite running time in the signaling channels between SSP and SCP.
- the components to be simulated within the SS7 simulator are the processors / process chains in the SSP level, the STP / SRP level and, depending on the network configuration of the SCP level, e.g. an SCP input processor (FRONT END SYSTEM), which is the interface of the SCP forms the signaling system.
- FRONT END SYSTEM an SCP input processor
- a module for simulating overload protection mechanisms modifies the number of events processed by at least one of the other simulation modules as a function of the load on one or more simulation modules, for example as a function of the queue length, and / or of user-definable parameters.
- the user-definable parameters are, for example, load limits which, when exceeded, activate the overload protection. Instead of firmly defined limits, a "fuzzy" decision can also be provided, for example by means of fuzzy logic.
- An overload protection simulator which receives its control parameters from the SCP simulator, accesses the traffic simulator and regulates the amount of IN events generated or passed on by the traffic simulator depending on the control parameters, is most appropriate to real conditions.
- the overload protection simulator preferably emulates the automatic call gapping (ACG) mechanism. All calls / events going beyond a certain number are rejected within a certain time interval.
- ACG automatic call gapping
- the modules traffic simulator, SCP simulator and possibly SS7 simulator and overload protection simulator represent independent simulators of the corresponding network components. Internally, their functions are either linked via files (file mode) or preferably integrated via an organization program (online mode) that executes the processing of the individual IN events is guaranteed across all components of the IN simulator.
- Simulation modules in the form of write or read access to files in which data relating to the configuration of the network or the 12 simulating network components and possibly the data generated by one of the simulation modules are stored.
- a simulation run begins with the generation of traffic at the IN by the traffic simulator.
- the generated messages PROVIDE INSTRUCTION with their generation time t1 are stored in EVENT or CALL END) in a first transfer file and read in by the simulation module to be subsequently called up. It continues to be everyone
- this second simulation module is the SCP simulator. If the SS7 is taken into account, however, the first file is transferred to the SS7 simulator. In this case, the messages are written to a second transfer file after passing through the SS7 simulator, supplemented by the SS 7 exit time t2, which the SCP simulator accesses.
- the SCP simulator generates a CREATE-JOIN or CALL END message for each entry in the file transferred to it and writes it to a third file with the exit time t3. Before the message arrives in SSP, the SS7 simulator may be run through again, with the SS7 exit time t4 being logged.
- File operation is very well suited to investigate the behavior of individual network components separately from the network, i.e. without feedback.
- the behavior of the individual components can be quickly and directly, for example, by modifying the corresponding simulation parameters 13 determine.
- Individual IN components can be modified and analyzed separately.
- the file mode also makes it easy to track individual EVENTS between the components.
- the stationary behavior of the overall system can only be determined iteratively with suitable initial conditions in file mode.
- an organizational program ensures that the partial simulations run quasi-parallel.
- the simulator is thus able to simulate the network as a whole and, in particular, also takes feedback into account directly between the components.
- the implementation of the parallel processing of messages in the network components into a sequential or quasi-parallel processing of the IN events in the simulation modules is implemented with the help of event calendars.
- An event calendar is a list of all events to be processed by an element, e.g. the simulator, a simulation module or a sub-component of a module, e.g. IN messages or individual processes that are entered in this list in chronological order.
- the online simulator determines which event is to be processed next (event-oriented simulation).
- the starting time of the next event is additive from the starting time and the duration of the previous event.
- the global event calendar which contains the events to be processed by the entirety of the simulation modules in chronological order, plays a central role in realizing the quasi-parallel operation of the simulation modules.
- the simulator uses the global event calendar to determine which partial simulation is to be called up at which simulation time.
- Internal events are references to the local calendar of the corresponding simulation modules. They relate to advancing a simulation module by a single simulation step.
- External events represent the input of an IN message in a partial simulation, they stand for messages between the 14 simulation components are sent and serve the communication of the ul ulation components with each other.
- Call-independent events In a further development of the invention, those events are also entered in the global calendar that are independent of IN events and e.g. belong to the simulation of the operating systems in the sub-components.
- All events generally cause the respective simulation module to generate a subsequent event, which in turn is entered in the global and possibly also in the local event calendar. Some events cause logging after processing, which can be used to track how quickly a message was processed by the respective simulation module.
- the functionality of the IN simulator is preferably accessible to the user via a user interface.
- This interface takes over the management of one or more simulations by providing input masks for entering the simulation parameters of the individual simulation modules, storing the entered data in corresponding files and storing them in relation to the simulation.
- the generation of a new simulation is made possible by the user copying and modifying selected parameters.
- the user interface includes a largely independent file management of the system of configuration and result files belonging to each simulation.
- the user has the option of having all the simulated data displayed.
- the "measurands" selected by the user e.g. Utilization of the SCP, queue length in the SCP, traffic volume in the IN, are prepared with the help of a graphics program and can be displayed as graphics on the screen of a computer.
- the simulation results of both a simulation and different simulations can preferably be displayed together on a screen.
- the creation of output files for further processing in other programs is preferably possible via file filters.
- Figure 1 The topology of an intelligent network 15 Figures 2 and 3 The structure of a simulator according to the invention, operated in file mode
- Figure 4 The structure of a simulator according to the invention, which can be operated in file and online mode
- FIG. 14 A schematic, object-oriented model of an SCP
- FIG. 15 arrangement of the SS7 layers F Fiigguurr 1166 modeling of the MTP3 level of the SRP
- FIG. 19 shows the implementation of the overload protection simulator in the IN simulator in online mode.
- FIG. 20 shows the implementation of the overload protection simulator in the IN simulator in file mode.
- FIGS. 21, 22, 23 examples of examples determined with the IN simulator
- FIG. 1 shows the topology of an intelligent network to represent the simulation concept.
- An intelligent network essentially has three logical components, the Service Control Point (SCP) 109, the Service Switching Point (SSP) 102 and the Signal Transfer Point or Signal Relay Point (STP or SRP) 103.
- SCP Service Control Point
- SSP Service Switching Point
- STP or SRP Signal Transfer Point or Signal Relay Point
- the SSP level accepts signing requests from customer devices considered external 16 one of the exchanges 101 of the telephone network and operates the connection establishment for such IN-specific connections.
- the SCP level contains procedures and databases for call evaluation and connection management. This information is used to find the way to connect through the telephone network.
- the SCP or SRP takes on switching functions between SCPs and SSPs. Communication between the components SSP, SCP and STP / SRP follows via signaling system No. 7 (SS 7). For this purpose, there are usually a large number of signaling channels 106, 107, 108 between STP / SRP and SSP or STP.
- the three logical components SSP, SCP and STP / SRP can be integrated in one physical device, e.g. in an exchange.
- a call with an IN-specific call number is initially transferred to an SSP, which, after receiving the further processing information from SCP, transfers the connection to the respective destination.
- the SSP thus represents the interface between the telephone network and the intelligent network.
- SSP functionalities can also be integrated directly into a switching center.
- the IN traffic coming from the SSPs into the intelligent network is simulated with the traffic simulator, the function of the SCP is modeled with the SCP simulator, the SS7 simulator models the functions of the SSPs, the STPs / SRPs , the SCP input processors 104 and the connecting lines between these components.
- the user of the simulator has the option of freely selecting the network topology within the framework of the entries for the network configuration and thus adapting the structure of the simulated network to correct specifications.
- User-definable simulation parameters include the number of SSPs 102, the number of STPs / SRPs 103, and the number of SCP input processors 17 104 the number of character channels between an STP / SRP and an SCP or an SSP, and possibly also the number of SCPs.
- FIG. 2 shows the structure of an IN simulator according to the invention, operated in file mode, the simulation modules traffic simulator 201 and SCP simulator 202.
- the traffic simulator 201 generates according to the user information, which are in input files 208, 209, 210, 211, 212 are stored, taking into account the data possibly stored in the transfer file 204, an IN-specific traffic volume, ie a sequence of events that represent IN messages from one or more SSPs to the SCP.
- the input files 208 to 212 are preferably accessible to the user via a common user interface and are read in by the traffic simulator 201 at the start of the simulation.
- the input files 208 to 212 contain parameters which each relate to different aspects of the simulation, e.g.
- Redirection probability 1 information on the average number of calls per time unit and service for one or more consecutive time intervals. It goes without saying that the number of input files 208 to 212 is arbitrary and, for example, all user information, including those relating to other simulation modules, can be stored in a fixed number of files, including a single one.
- the SCP simulator 202 has an SCP input file 207, in which user information relating to the SCP configuration is stored and which the SCP simulator 202 reads in at the start of the simulation.
- the traffic simulator 201 and SCP simulator 202 modules are operated in succession.
- the sequence of events generated by the traffic simulator is written into a first transfer file 203 which contains the sequence of events now to be processed by the SCP simulator 202.
- the SCP simulator reads in this transfer file 203 and processes the events stored therein.
- the processed ones 18 events are entered by the SCP simulator 202 in a second transfer file 204. This is passed on again to the traffic simulator 201 while the simulation is running, but like the first transfer file 203 can also be fed directly to the evaluation.
- the transfer files represent the event calendars of the respective receiving module.
- the data generated by the traffic simulator 201 or by the SCP simulator 202 are stored as a data record, each of which has at least one time stamp that indicates the generation time of the corresponding message indicates on the traffic simulator or on the SCP simulator, and contains an identification number which allows the assignment of two or more messages as belonging to a call.
- the difference between the two time stamps indicates the processing time of a message in the SCP.
- the simulator outlined in FIG. 2 can thus directly simulate the reaction of the SCP to a given traffic volume. Signaling system No. 7 is not taken into account.
- the simulation modules 201, 202 also store statistical data, e.g. with regard to the processor load in the SCP, the queue length in the SCP or the line load from and to the SSP, in output files 205, 206. The data recorded there are also available for further evaluation of the simulation results.
- FIG. 3 shows the structure of a simulator according to the invention operated in file mode with the simulation modules traffic simulator 301, SS7 simulator 303 and SCP simulator 302.
- the simulator shown in FIG. 3 is only around the module SS 7- Simulator 303 extended. The result of this is that four transfer files 304, 305, 306, 307 are now transferred between the modules during the sequential processing of the partial simulations.
- the simulation of the intelligent network begins with the generation of an IN-specific traffic volume.
- the traffic simulator 301 receives the input files 312 to 316, which correspond to the files 208 to 212 from FIG. 2, if present, the transfer file 307 is also read.
- the sequence of events generated by the traffic simulator 301 is stored in the first transfer file 304.
- the SS7 simulator 303 first has the SS7 input file 317 in which, for example, data relating to the configuration of the SS7 system are stored.
- the SS7 simulator 303 stores the event sequences it has processed in a second transfer file 305 which is read in by the SCP simulator 302 when it is called.
- the sequences of events processed by the SCP simulator 302 are then entered in a transfer file 306.
- the SS7 simulator 303 is reactivated and processes the sequence of events stored in the third transfer file 306, the results being stored in the fourth transfer file 307.
- the traffic simulator 301 is now activated again and the cycle SS7 simulator, SCP simulator, SS7 simulator is run through again in order to simulate feedback between the network components. The iteration is carried out until the changes in the traffic data in one or more of the transfer files 304 to 307 (or above 203, 204) have fallen below an acceptable level for the user and the system has thus reached a steady state.
- Statistics data relating to the individual simulation modules 301, 302, 303 are written in output files 309, 308 and 310, respectively.
- these are, for example, the utilization of the SRP processors or the number of occupied connections from the SRP to the SCP or to the SSPs.
- the data stored in the transfer files are call-specific data records, each of which contains at least one time stamp. This timestamp results from the current simulation time when generating or processing the associated message in the corresponding simulation modules. The processing times in the respective simulated network components can thus be calculated by forming the difference.
- FIG. 4 shows the structure of a simulator according to the invention which can be operated in the file and online modes.
- the simulator has the simulation modules traffic simulator 401, SS7 simulator 403 and SCP simulator 402 already shown and described in FIG. 3. As shown above, these communicate via transfer files 406, 407, 408, 409. 20th
- the simulator shown here additionally contains a module for simulating the overload protection 404. This regulates the event sequences generated or passed on by the traffic simulator 401 depending on certain user-defined parameters, stored in file 424, and on the load on the others Simulation modules.
- the simulation modules 401, 402, 403, 404 are linked by a common organizational program, the online simulator 405.
- Output files of the online simulator 405) via which the modules can be configured and system data determined can be read out.
- the dashed arrows in Figure 4 symbolize file operations, as in Figures 2 and 3, while the solid arrows describe direct communication, e.g. by linking through a common organizational program.
- An arrow begins with the component that passes parameters or messages to another simulation part.
- the simulator shown in Figure 4 allows both file operation with sequential calling of the individual simulation modules as well as
- the user interface is available with the traffic SS7 and. SCP simulator in connection; the respective simulation is transferred from the user interface with the corresponding
- the bidirectional connection between user interface 410 and online simulator 405 allows on the one hand the simulation to start with the corresponding parameter transfer and on the other hand the return of "measurement data" for graphical output during runtime (online mode). Furthermore it is 21 allows the user to temporarily interrupt the simulation process or to end it prematurely.
- the simulation modules 401, 402, 403 and 404 are programmed in the online simulator 405, which controls the quasi-parallel sequence of the partial simulations by sending and receiving messages, which are managed in the global event calendar.
- the online simulator 405 controls the quasi-parallel sequence of the partial simulations by sending and receiving messages, which are managed in the global event calendar.
- all communication processes between the modules traffic simulator 401, SS7 simulator 403 and SCP simulator 402 thus take place via the online simulator 405.
- the transfer files 406 to 409 are in the
- the online simulator 405 causes the entry of predeterminable protocol sizes, e.g. the time stamps tl to t4 described above, the SCP load, data on the network load or the number of lines used, in log files 417, 418, 419, 420.
- the data stored there can be output and visualized in a known manner on the user interface.
- overload protection mechanisms can only be sensibly implemented in online mode.
- the overload protection module 404 therefore has no direct connection to the SCP simulator 402, on the basis of which the overload protection simulator 404 regulates the number of events generated by the traffic simulator 401.
- a connection between the SCP simulator 402 and the overload protection simulator 404 only exists in online mode indirectly via the online simulator 405.
- FIG. 5 shows the basic sequence of an IN simulation from the point of view of the user.
- the simulation modules themselves are not shown, but are processed within the black box 501.
- the overload protection simulator 502 and or the SS7 simulator 503 can be switched on or off, symbolized by switches in FIG. 5.
- the user can choose between file and online mode, also symbolized by a switch. 22
- the user has the option of defining the actual simulation parameters, i.e. the network configuration to be simulated, the traffic volume, etc.
- the simulation modules i.e. the network configuration to be simulated, the traffic volume, etc.
- the simulator 501 determines the predetermined output data based on the previously determined or called simulation parameters, e.g. Traffic, CPU usage, queue length as a function of simulation time, and writes them to files.
- the data can now be displayed on the screen or, stored on data media, can be used for further processing.
- FIG. 6 shows an example of configuration parameters of the traffic simulator as well as numerical values for these.
- the parameters shown in the table in FIG. 6 can be broken down into service-specific parameters that can be set separately for all services to be simulated, televotum parameters that relate to the service
- the service-specific parameters can be set for the following IN services: Freephone (FPH), Tele-Info-Service (TIS), UniverseUe phone number (UNU), the in-service FPHL and Televotum (TVS). Not all of the parameters that can be set for the other services are useful for the Televotum service; these are therefore marked with an X in the corresponding column.
- normal telephone traffic NVK
- NVK normal telephone traffic
- the service-specific parameters are the average call duration, average announcement duration, maximum announcement duration, the number of announcement locations, such as announcement and diversion probability, as well as for the probability of 23 Redirection by "subscriber busy”. These parameters are required to determine the probability of generating a follow-up event at every simulation time, i.e. the probability of generating an event EVENT or EVENT (CALL END).
- the Televotum parameters can be specified separately for each Televotum service subscriber TV1, TV2 etc. In the example shown here, only two service subscribers are active.
- the parameters that can be set are: target value SSPl or SSP2, number of target values up to connection, start time, end time and end time for subsequent calls.
- the "Target value” parameter specifies the number of televotum calls that must be received by the specified SSP so that a message to the SCP is generated. If this parameter is set to 1, the option is Televotum without counting, if the value is greater than 1, it is Televotum with counting in the SSP.
- the following parameter "Number of target values to connection" specifies whether and how many calls a connection to the service subscriber is established.
- the Televotum service Since the Televotum service is usually offered within tight time limits, the start and end times of the service are provided.
- the "End time for follow-up calls" parameter specifies the point in time at which incoming TV calls are directed to an informative, possibly service subscriber-specific announcement.
- the Televotum parameters indicate the conditions under which a TV call initially generated by the traffic generator triggers an IN first event.
- the following general configuration parameters can also be set:
- the "Time to timeout” parameter specifies the time after which an SSP rejects a call after sending an IN message to the SCP and without receiving a response from the SCP.
- the "Time delay for redirection” parameter specifies the delay in a call rerouting.
- the number of lines for the Freephone service can also be specified.
- the parameter "average waiting time of the A subscriber" specifies the average time interval after which the calling party 24 participants hang up if no connection has been established by then.
- the following two parameters indicate the probability of a follow-up call following an unsuccessful connection and the maximum number of follow-up calls that can be generated.
- each step or time interval preferably having the same time length.
- the number of intervals and the interval lengths can be specified.
- the probability that a call with a special service or service subscriber identification arrives at an SSP is determined for each simulation time or for each simulation time interval.
- the length of the simulation time intervals is preferably substantially below the length of the IntervaUe for which an average traffic volume has been specified by the user.
- the length of the simulation intervals is preferably in the nanosecond range, while the traffic volume changes on the time scale of seconds, for example 10-100 s.
- the length of the simulation time interval is preferably too long Select 25 that a maximum of one call is generated per interval and that all calls generated can be listed in chronological order.
- the respective current probability is calculated assuming a given probability increase and the predetermined current average traffic volume for the service treated, service subscriber or SSP.
- the probability distribution used is preferably a Poisson distribution, since this describes the statistical arrival of mutually independent events and thus best reflects the statistical fluctuations in telephone traffic.
- a timely sequence of events is thus generated for each service, service subscriber and / or SSP, the number of calls per unit of time statistically fluctuating around the previously specified instantaneous average.
- each generated call becomes a IN-specific event that contributes to the utilization of the intelligent network and is therefore relevant to simulating the performance of the IN, in particular the SCP.
- the traffic generator generates follow-up events associated with an IN call or first event, taking into account the probabilities entered in the configuration file, which relate to the further fate of an IN event. If, for example, the IN connection to a real subscriber or the switching to an announcement location is properly established by the SCP in the simulation based on the connection handling information (CREATE-JOIN), the call is ended after the specified average call or announcement duration by the 26
- Traffic generator generates the follow-up event EVENT (CALL END) and enters it in the transfer file or in the global event calendar. If the IN connection does not come about in the simulation with the real participant who is also involved in the SCP, which is determined by the traffic generator taking into account the probabilities specified for this, the traffic generator generates the IN message EVENT as a subsequent event, with which, for example, rerouting -Information is requested from the SCP. In this way, the traffic generator is able to generate IN-typical event sequences that largely correspond to real traffic volumes in the IN.
- the following parameters are stored for each IN event: the identification number of the call, the time t1 at which the message is sent by the SSP, the identification number of the message, e.g. 1 for PROVTDE INSTRUCTION, 2 for EVENT, 3 for EVENT (CALL
- a code number for the global title is also generated as a routing criterion and stored as a parameter of the IN event.
- the GT class is also generated using a predefined probability distribution.
- the STP / SRP simulator then preferably initiates GT-specific process chains which simulate the routing functions at the STP / SRP level, that is to say, for example, the transfer of the call to the network of another network provider.
- the assignment of the events generated by the traffic simulator to useful and load classes is also advantageous. Call-related IN events are assigned to a user class, while management traffic between the IN levels can be simulated by events of a load class, for example. For each event generated by the traffic simulator, a corresponding class code is generated and saved, which is recognized by the other simulation modules and, if necessary, also determines the further processing of the event. 27 In online mode, the subsequent events are generated by the traffic generator during simulation operation with the given probabilities, after the associated first event has run through the simulation modules SCP simulator and, if applicable, SS7 simulator, i.e.
- the IN-specific first events are generated during the course of the overall simulation, i.e. for everyone
- Time of simulation e.g. at ns intervals.
- an intervention by the overload protection against a current overload of the other simulation modules can be simulated and a call rejected before the generation or forwarding of a corresponding IN event.
- a sequence of the calls arriving at the SSP or the SSPs which as a rule result in an IN event, can be generated before the start of the simulation according to the traffic theory methods defied above and processed during the simulation, i.e. passed on as an IN event or dropped due to overload protection.
- the utilization of the drawing channels in the intelligent network can be used for each simulation time 28 can be determined. Based on the user-defined probabilities of the further fate of the call (e.g. conversation or announcement of a certain medium duration), the number of busy voice connections to and from the SSPs and / or the number of busy customer lines for subscribers to the Freephone service can also be logged and output as a function of time become. Furthermore, as a function of the simulation time, it is possible to output how many calls were rejected in different stages, for example immediately after generation due to overload, after the timeout in the event of the SCP not responding or because all announcement locations have been occupied.
- the simulation time it is possible to output how many calls were rejected in different stages, for example immediately after generation due to overload, after the timeout in the event of the SCP not responding or because all announcement locations have been occupied.
- Figure 7 shows the principle simulation in file mode. After starting the simulator, the input files of the individual simulation modules are read.
- the traffic simulator determines whether a file with messages from the SCP already exists (transfer file 204 from FIG. 2 or 307 from FIG. 3). If yes, this data is analyzed with regard to the SCP response times and taken into account in the generation of the event sequences by the traffic simulator. If not, the next step is taken without analysis and a default value is used for the SCP response times.
- the initialization of the counters includes setting an internal simulation clock to zero and initializing the status variables and statistical counters with initial values.
- a start event is generated, i.e. a first PROVTDE INSTRUCTION message, and entered in the event calendar.
- the event calendar also contains events to be processed during the simulation, sorted according to their start time.
- the actual simulation begins within a loop.
- the abort condition is then queried, the simulation being aborted when the current simulation time t is greater than a predetermined simulation duration.
- the next event is first carried out from the calendar within the loop and the simulation clock is switched to the time of the following event. When the simulation starts, this next event is the first event generated after the simulation.
- the event type of the event to be processed is determined and the associated event routine is then processed. 29
- the first event entered in the calendar is usually a new call (NEWCALL).
- the associated event routine causes the traffic generator to generate the next call and to simulate the connection setup to the SSP.
- the NEWCALL event routine simulates the sending of an IN message
- PROVTDE INSTRUCTION from the SSP to the SCP by generating a corresponding event and entering it in the event calendar or in the transfer file.
- the SCP then sends the CREATE-JOIN message to the SSP;
- the receipt of the CREATE-JOIN from the SCP is entered in the event calendar as an event at the time of the current simulation time plus the SCP response time.
- the simulation clock is pre-set at the next event, this event is read from the calendar and processed if the simulation time has not already expired. The time between two events is skipped.
- next event is the receipt of the CREATE-JOIN message from the SCP.
- the continuation of the connection establishment by the SSP is simulated with the event routine (CONNECTSSPCON).
- CONNECTSSPCON the event routine
- the probabilities discussed above are used to determine whether a connection to the B subscriber is successful (follow-up event CONNECTB), where the B subscriber can be a real subscriber or an announcement, or whether a call for previously unsuccessful attempts
- the loop calling an event from the event calendar, going through the corresponding event routine, possibly generating a subsequent event and entering it in the event calendar, setting the simulation time to the time of the next event entered in the event calendar, and calling it up will continue until the previous one set simulation time is reached, or until an event occurs that marks the end of the simulation.
- the data entered in the event calendar or in protoco files, generated and processed by the simulator is available for evaluating the performance of the intelligent network or individual components.
- Figure 8 shows the basic simulation sequence in online mode. First, the configuration is determined by the user, with the corresponding
- Configuration files can be read from the simulation modules.
- the traffic, SS7, SCP and overload protection (ACG simulator) are active and are managed by the common organizational program, the online simulator.
- ACG simulator overload protection
- a start event is first generated by the traffic simulator.
- the events entered in the global event calendar are called up in a loop in chronological order, the associated event routines are processed, and any subsequent events generated are entered in the global calendar.
- Each time an event routine ends, the simulation time is set to the time of the next event and processed.
- a predetermined maximum simulation time which is compared with the current simulation time each time the loop is run, is again used as the termination condition for the loop.
- the sub-simulations are ended by releasing the dynamic memory. If the end of the simulation is not reached, the 31 Community memory, which the user interface accesses during the simulation, is updated so that the current system data can be displayed to the user immediately. The system data for the overload protection simulation are also updated. Finally, the measured data determined, that is to say SCP utilization, queue length, etc., are logged at constant time intervals and entered in the corresponding log files and / or visualized for the user. Then the next event in the calendar is processed.
- the internal events are routines that affect the state of only a single simulation module.
- Each simulation module is an independent event-oriented program with a large number of events and its own local calendar for managing them. From the point of view of the sequential control of the overall simulator, there are three global internal events TRAFIC INTERN, SS7 INTERN and SCP INTERN in this example, each of which represents references to the local event calendar.
- Figure 9 shows schematically the processing of such an internal event from the point of view of the online simulation.
- the next internal and possibly the next external event is generated depending on the internal program sequence and entered in the local calendar of the simulation module.
- all required parameters of the event are transferred to the sequential control system in order to be sorted into the global calendar of the overall simulation.
- the other events of the simulation process shown in FIG. 8 are external events which serve for communication between the simulation modules. They correspond to those sent from one component to another in a real intelligent network
- Messages e.g. PROVIDE INSTRUCTION, CREATE-JOIN, EVENT.
- the external events occurring here are: PROINST TO SS7, EVENT TO SS7 and SSP CALLEND TO SS7, which are the PROVIDE messages 32 INSTRUCTION, EVENT or EVENT (CALL END) of the SSP correspond to the SCP.
- the internal events mentioned are generated by the traffic simulator (routine: TRAFFIC INTERN) and find their correspondence in the file mode in the events which are entered in the first transfer file 304 (FIG. 3).
- the external events PROVTNST TO SCP, EVENT TO SCP and CALL END TO SCP stand for the messages PROVIDE INSTRUCTION, EVENT or EVENT (CALL END), which are transferred from the SS7 system or from the SRP / STP to the SCP. These events thus correspond to the events entered in the second transfer file 305 (FIG. 3).
- the SCP's response is to SCP CALL END TO SS7 and CREATE-JOIN TO SS7.
- the first event confirms the connection initiation, the second simulates the transmission of
- Connection establishment information correspond to the events entered in the third transfer file 306. They are generated by the SCP simulator and are aimed at the SS7 simulator.
- the external events CALL END TO SSP and CREATE-JOIN TO SSP are generated by the SS7 simulator and are used to forward a message from the SCP to an SSP through the SS7 system.
- the corresponding events are stored in the fourth transfer file 307 in file mode.
- the message CALL END TO SSP is only required in the case of an inactive SS7.
- An external event within the sequential control system is processed by entering the corresponding message in one of the simulation components. It is possible that the component is caused by the message to generate a new internal event, which is then passed on to the online simulation and entered in the global calendar. After an event routine has been processed, the next event is carried out from the global calendar and the simulation clock is updated, ie set to the start time of this subsequent event. 33
- the traffic simulator is called up and generates a new call. Based on the current load on the other simulation modules, it is decided whether this new call is rejected by the overload protection (ACG). If the call was rejected by the overload protection, this fact is logged and the event routine is ended. If the new call was not rejected, it is included in the simulation, ie the corresponding PROVINST TO SS7 event is entered in the global event calendar. A new element is inserted in a log file for the generated call, the following data being saved: The
- Identification number of the respective call which is generated by the traffic simulator when it is generated, the service identification numbers of the call, the number of the SSP to which the call arrives, the message identification number, i.e. whether the message PROVTDE INSTRUCTION or EVENT is present, and the time t1 at which the corresponding message PROVIDE INSTRUCTION or EVENT was generated for the current call.
- this log view is supplemented by further time stamps, namely after the routine PROVINST TO SCP or EVENT TO SCP has been processed by the SS7 simulator (time stamp t2), after the routine CREATE-JOIN SS7 has been processed by the SCP simulator (time stamp t3) and after the routine CREATE-JOIN TO SSP has been processed by the SS7 simulator (time stamp t4).
- the second and third time components only contain valid values if the SS7 simulator was active during the simulation.
- t2-tl delay of a message in SS 7 on the way to the SCP
- t3 - 12 delay of a message in the SCP
- t4 - 13 delay of a message in SS7 on the way to the SCP
- t4 - tl total delay of a message in the IN.
- the network load is saved in constant time intervals during the simulation process. No call-specific information is saved, but rather global statistical network data.
- the following variables are preferably logged: the time of the current measurement, the number of calls to the IN per second, the number of messages currently being processed in SS7 on the way to the SCP, the number of messages in the SCP as well as the number of messages in SS 7 on the way to the SSP.
- the utilization, the queue length and the number of processed messages (dispatches) are determined for each processor and saved in a log file.
- the online simulator accesses this data and writes the values determined via external CPUs to a file.
- the data can be displayed through the user interface during online simulation.
- the number of lines used to and from the SSPs is determined on the basis of the traffic data and logged as a function of the simulation time.
- Figure 8.a shows the relationship between the events used to supplement Figure 8.
- the simulator from FIG. 8 was supplemented by a separate module for simulating the SRP, which can also be part of the SS7 simulator, which is why events of the type SRP_INTERN also occur here.
- the four internal events TRAFFIC NTERN, SS7JNTERN, SRP NTERN and SCP_INTERN cause a simulation module to be called up to process an event. Other external events serve to transition from one simulation module to the next.
- the start event in the overall simulation is always a TRAFFIC_INTERN event, since the traffic simulator is the queue of the IN calls. 35
- each simulation module can generate a follow-up event for processing by the same simulation module.
- one of the external events identified by an outgoing arrow can be generated.
- the online simulator receives this information from the respective simulation module.
- the call of an external event corresponds to the sending of a message to the respective other node of the IN.
- macn distinguishes three messages. These can be found in three different transitions from the traffic generator to the SCP simulator.
- a TRAFFIC_INTERN event is called, which generates this message and assigns a unique number (CaUID) for this call within the simulation. This is followed by a PROINST-TO-SS7, EVENT-TO-SS7 or SSP-CALLEND-TO-SS7 event and another TRAFFIC_INTERN event, according to the message, so even more traffic may be generated.
- the external event is then processed and results in an SS7 INTERN event.
- the SCP simulator After processing an SCP-INTERN event several times, the SCP simulator requests the online simulator to send a message to the SSP simulator.
- CREATE-JOIN From there only events of the type CREATE-JOIN lead to a TRAFFIC-INTERN event; Events of the type CALLEND do not cause the traffic generator to generate associated follow-up events.
- Figure 10 shows schematically the principle of SCP simulation. Again, it is an event-controlled simulation, whereby only discrete event times are considered and state changes can occur at each event time.
- the SCP simulator has a local event calendar in which all events to be processed by the SCP simulator are entered in chronological order.
- Messages represent requests from the SSP or SS7 to the SCP for call handling, the arrival of a message in the SCP or in the SCP simulator starting a service processing program consisting of a predeterminable process sequence.
- a message corresponds to a global external event.
- (Local) internal event A local internal event leads to the termination of a process or event and generation of a new process or corresponding event, the type and properties of which result from the process chain defined in the service processing program.
- (Local) external event A local external event is generated when a service processing program has ended, i.e. after .working of the last process specified in the process chain. An external event leads to the sending of a message to the SSP or SS7 and thus to the generation of a global external event and its entry in the global event calendar. 37
- Figure 11 shows an example of configuration parameters of the SCP simulator.
- the upper part of the TabeUe contains a list of all processes to be simulated, which can be carried out by the SCP and which are involved in establishing or clearing the connection.
- the individual processes are identified by a process identification number (process ID);
- process ID process identification number
- the specification of the process name only serves to simplify the adaptation of the configuration to the function of a real SCP.
- Each process is assigned a process duration, which is specified here in milliseconds, and a priority.
- the information is user-definable, so that, for example, the
- a process sequence is assigned to each service, identified here by the service identification number, and service-specifically to each message PROVIDE INSTRUCTION, EVENT or EVENT (CALL END), identified by the message identification number.
- the process sequence or the service processing program is defined by successive statements of the process IDs of the processes suspended above.
- each message is assigned service-specifically to a CPU on which the process sequence is processed. All messages can also be processed on all available CPUs.
- the delay of the ST2000 front end system which in some network topologies provides the interface between the SCP and the SS7 system, and the maximum counter reading for the Televotum service can be specified as parameters.
- FIG. 12 shows a ModeU of the process management of a CPU 1201 on the basis of the SCP simulation within an SCP.
- every mode of such process management can be adopted in the SCP simulator by defining the queues or event calendar accordingly.
- the process management only determines the number and type of linking of the SCP queues or the local event calendar within the SCP simulator and thus how a message or the resulting individual processes are processed within the simulator.
- the simulator can be adapted to user specifications within wide limits, so that remedial realities can be simulated. No specific hardware and / or software structure is specified, but remedial configurations can be modeled.
- the CPU 1201 is connected to the SS7 by means of two local area networks (LAN) 1202, 1203, for example using two token bus LANs via the front end system ST2000.
- LAN local area networks
- a process receives the desired message, it joins the queue of the activated processes.
- the activated processes are arranged according to priorities, while the events entered in the service-specific queues 1204 to 1207 are arranged chronologically.
- the process with the highest priority within the priority queue 1210 receives the CPU and is processed there. For example, if a process cannot be processed by the CPU because incarnations of the process to be called are occupied, this non-executable process is managed in an additional queue 1209 until a process incarnation is available again and the process changes to the executable state; then it is enlisted in priority queue 1210.
- FIG. 13 shows a further mode of process management of a CPU for simulating the SCP functions.
- Messages arriving at a CPU 1301 are converted into a process sequence according to the service processing program.
- the first of these processes is entered into a process-specific queue 1302, 1303, 1304, 1305 in order to be processed by the assigned process routine 1307, 1308, 1309, 1310.
- the incoming processes are arranged in chronological order in the process-specific queues 1302 to 1305.
- Each process routine 1307, 1308, 1309, 1310 is also assigned a specific priority P1 to Pn. Configurations are also conceivable in which the queues 1302, 1303, 1304, 1305 are only priority specific, i.e. Also, different processes have a certain priority, which are then processed in chronological order.
- the process routines can exist in several incarnations for the same process, for example one copy per service.
- the process-specific queues 1302 to 1305 are also service-specific. If a process routine 1307 to 1310 is ready, the next process is called from the corresponding queue 1302 to 1305; the process is then ready. If the CPU 1301 is also free, the process is processed. After a process has been processed, the CPU 1301 generates the process that follows the processed process in the process chain and enters it in the corresponding queue. Non-executable processes are maintained in an additional queue 1306 until they return to the executable state. Interrupted but executable processes are placed at the beginning of their queue and will be processed next if their priority allows.
- FIG. 14 shows a schematic, object-oriented mode of an SCP simulator.
- the simulator has a plurality of subunits, each of which simulates the function of a CPU 1401, 1402, 1403, 1404. These subunits can be assembled modularly to form the SCP simulator.
- An incoming message is received by the front end system ST2000, reference number 1405, and, depending on the predetermined CPU selection criteria, passed on to a CPU 1401 to 1404 for complete processing.
- the front end system 1405 is simulated with a constant delay time. It can also have its own queue within the SCP simulator.
- a follow-up event e.g. the EVENT or EVENT (CALL END) message is automatically processed on the CPU on which the first event was already handled, since in reality the context for the call is only stored there.
- the allocation of a first event (PROVIDE INSTRUCTION) to a CPU can be done according to various criteria:
- statistical data of the SCP simulator can be used, e.g. the utilization of the respective CPU, the number of messages for processing in the CPU together with the current status of the CPU (active or inactive), the sum of the remaining waiting times other than processes running or waiting on the CPU.
- this requires computing time during the ongoing simulation to determine the statistical data and the corresponding decision-making.
- the independent recording of messages by the CPUs is provided: all first events (corresponding to the messages PROVIDE INSTRUCTION) are written into a queue common to the CPUs; the subsequent events (corresponding to the EVENT or EVENT (CALL END) messages) are entered in CPU-specific, possibly also CPU and message-specific queues. If the processor of a CPU is free, the next message can be read automatically from a CPU-specific or from the common queue.
- each process of the process sequence can also break up into a plurality of dew processes, whereby other processes can take place between the dew processes.
- At least one process routine 1408, 1409, 1413 exists on the CPU for each process 41 .s 1416, with which the processes entered in the process queue 1410, 1411 are processed when it is their turn.
- a process routine can also be present in several incarnations on the CPU, for example the assignment of an event to one of the process routines is service-specific. This is symbolized in FIG. 14 by two blocks of process routines 1408, 1409, 1413 or 1414 to 1416, each with a process queue 1410 or 1411.
- An incoming event is processed as follows: The event is first entered in the process queue 1410 or 1411 and waits for the corresponding process routine of the process to be called to become free. When the process is ready, the event is placed in the priority queue.
- the events entered in the priority queue 1407 are processed in sequence by the CPU 1401. Wait events can occur during the execution of a process by the CPU, e.g. Simulate access to the hard disk. These wait events are generated randomly or also due to the process and entered in a queue 1412. These events have higher priority and interrupt a process running on the CPU 1401.
- service-dependent counter events generated by a counter 1406 can be requested. Inquiries from external CPUs can arrive in this counter 1406 and block each other. This leads to an extension of the process processing times, although this does not burden the calling CPU.
- the CPU utilization is determined by the SCP simulator to obtain SCP statistical data as follows: At every point in time specified by the user, e.g. Except for simulation seconds, the percentage of time within the previous, user-defined time interval ⁇ t that the CPU was active is calculated, i.e. All times of the individual processes run within the last time interval ⁇ t are added and their percentage of the time interval ⁇ t calculated.
- the queue length as a further criterion for the SCP load results directly from the length of the respective queues or local event calendar.
- FIG. 15 shows the arrangement of the SS7 layers which are involved in the dialog between the SSP and SCP and are therefore simulated with the SS7 simulator.
- the top layer 1501 represents the layer of the SS7 users, that is to say represents the connection of the SSP or SCP to the SS7. From here, messages are sent or received in the intelligent network or the SS 7. Among them are the TCAP layer 1502, the SCCP layer 1503 and the MTP layers 1504 (levels 3 to 1) in the following order, each of which realizes certain SS7 functions with its own processors. The message flow from the SSP to the SCP takes place in the right
- the SS7 levels 1502 to 1504 i.e. TCAP, SCCP, MTP 1-3, are modeled separately.
- the individual processes on one level are replicated by delay times.
- a queue mode U is used.
- MTP3 level 1008 of the SRP within the SS7 simulator is shown in FIG.
- the three processes occurring at this level are MESSAGE DISTRIBUTION (HMDT), MESSAGE DISCRIMINATION (HMDC) and MESSAGE ROUTING (HMRT).
- HMDT MESSAGE DISTRIBUTION
- HMDC MESSAGE DISCRIMINATION
- HMRT MESSAGE ROUTING
- FIG. 16a The behavior of the processes among one another and with the adjacent layers SCCP 1607 or MTP2 1609 is shown in FIG. 16a as a flow chart and in FIG. 16b as a flow chart with local process queues 1601, 1602, 1603.
- Process HMDC 1604 receives signaling messages from level MTP2 and distributes them depending on the destination node of the messages.
- the messages are placed in the associated process queue 1603.
- Messages intended for the own node that is to say for the SRP, which is assigned to the MTP layer 1608, are forwarded to the process HMDT 1605. They are sorted into the corresponding process queue 1601 and transferred to the SCCP 1007 after processing by the HMDT process. If a message is destined for another node, it is passed from process HMDC 1604 to process HMRT 1606. This gives the message 43 Processing, that is after calling from the corresponding process queue 1602, to the MTP 2 1609 level. The same is good for messages that the MTP3 1608 level receives from the SCCP 1607.
- the FIFO queues 1601, 1602, 1603 used in FIG. 16b are able to receive several signaling messages and to process them one after the other.
- the order of execution is determined by the respective delay time and is entered in the local event calendar of the SRP or SS7 simulator.
- FIG. 17 shows the modeling of the TCAP layer of the SS7 as a further example.
- the TCAP layer 1702 is arranged between the layer of the SS7-USER 1701 and the SCCP layer 1703.
- the message flows between the layers as well as within the TCAP layer 1702 are indicated by Pfeüe.
- four processes are simulated in the TCAP layer 1702, the processes INVOCATION STATE MACHINE 1704, COMPONENT COORDINATOR 1705, DIALOG HANDLING 1706 and TRANSACTION SUB-LAYER 1707.
- a process queue 1708 to 1711 is assigned to each of these processes.
- a follow-up process of the same layer is called in accordance with the message flow shown here, or the message is forwarded to the SS7 layer above or below it.
- the process sequences are user-definable and can be flexibly adapted to the real process flow within a TCAP layer.
- Figure 18 shows an example of configuration parameters of the SS7 simulator.
- the process times for the processes involved in the communication between SSP and SCP can initially be specified for the individual SS7 layers.
- the process sequence in the SS7 layers, as with the SCP simulation, the service processing program can be defined by the user and can thus be flexibly adapted to the real conditions. A certain priority can also be assigned to the individual processes, which is not shown here. 44
- the user-definable parameters relate to the topology of the intelligent network in the area of the SS 7, e.g. the number of SCPs, the number of character channels between SSP and STP and between STP and SCP, the delay due to the delay of a message between STP and SSP or SCP and the delay between the processors.
- the message length can also be specified.
- FIG. 19 shows the implementation of the overload protection simulator 1903 in the IN simulator in online operation and its principle of operation.
- the overload protection simulator 1903 regulates the amount of traffic generated or passed on by the traffic simulator 1902 on the basis of system data that allow a statement about the current load situation, in particular of the SCP simulator, managed by the online simulator 1901 and the overload protection simulator 1903 be transferred via the online interface.
- the overload protection simulator 1903 regulates the amount of traffic generated or passed on by the traffic simulator 1902 according to the principle of automatic ca gapping (ACG): Within a time interval ⁇ tl (gap time), for example, only one call is made, possibly with predetermined properties , passed from the SSP to the SCP. The time interval ⁇ t2 (gap duration) indicates how long such a reduction measure lasts.
- ACG automatic ca gapping
- the overload protection simulator 1903 (overload process) is called by the traffic simulator 1902. He transfers a call with the corresponding parameters, such as service, message, SSP identification number, time. In addition to this data, the overload process receives the current system data, such as CPU utilization, response times and queue length, from online simulator 1901.
- the overload process which has been initialized, is controlled with the aid of its own counters and the transferred system data. There can be a separate counter for each SSP, service and / or service class. After the call has been recorded in the corresponding counter, the overload protection 45 Simulator the current overload level using the system data. Then the gap parameters for the current overload level are read from the initiation table.
- the initialization table Ue is stored in the initiation file which is called up when the overload protection simulator 1903 is started.
- the gap parameters are, for example, the time interval ⁇ tl (gap time), within which only one call, possibly with certain properties, is passed from the SSP to the SCP, and the time interval ⁇ t2 (gap duration), which indicates how long such a time Reduction measure continues.
- calls are counted within a predeterminable time window and, if necessary, time-weighted.
- the weighting preferably depends exponentially on the age of the call, with a younger call being weighted more than a previous call.
- the load is also increased on the SSPs or on the services in order to be able to simulate service and / or SSP-dependent overload protection, in which calls with certain properties are selectively suppressed.
- Different overload levels can be defined by the user, to which user-defined gap parameters are assigned.
- the gap measures are updated accordingly, e.g. adjusted the length of the time interval ⁇ tl or ⁇ t2. It is then checked whether the current call is such
- the process to be called is then passed the return value TRUE or another identifier, otherwise the value FALSE or another identifier assigned to it.
- FIG. 20 shows the implementation of the overload protection simulator 2002 in the IN simulator in file mode.
- file mode the calls are generated beforehand with the traffic simulator and stored in a transfer file 2001. Since no current system data can be transferred to the overload protection simulator 2002 in file mode, it itself measures the current load in the form of calls per unit of time. The current load is compared to a predetermined value for the maximum number of calls made by the traffic simulator; this is stored, for example, in the initiation file. The current overload level is calculated from the current incoming load and the maximum outgoing load.
- the new defense parameters are then read from the initiation table and the defense measures updated.
- FIG. 21 shows an example of those determined with the IN simulator
- Simulation data It was based on the configuration that results from the configuration files shown there according to FIGS. 6, 11 and 18.
- the SS7 simulator is active while the overload protection simulator is switched off.
- Telephone traffic of 30 calls per second was specified in the time interval 0 to 500 seconds.
- Figures 21.a to c show the data on network statistics determined by the simulator.
- the preselected average telephone traffic and the telephone traffic generated by the traffic simulator are each represented as a function of the simulation time.
- the configured telephone traffic is shown in dashed lines and corresponds to the above-mentioned specifications, i.e. in the interval 0 to 500 seconds is a constant 30 calls per second, then 0 calls per second.
- Figure 21.b shows the SCP response time in seconds as a function of the simulation time. With constant telephone traffic of approx. 30 calls per second, the simulation results in a steady state, ie the SCP processes the requests directed to it with a response time of 0.4 to 0.7 seconds.
- Figure 21.c shows the number of messages that are in the SCP simulator for processing as a function of the simulation time. As expected, the number of calls in the SCP and the response time of the SCP are strongly correlated.
- Figures 2 l.d-f show SCP statistical data as a function of time, namely the utilization of the CPUs in%, the number of messages in a CPU queue and the number of processes processed by one CPU per unit of time. The maximum, minimum and average CPU utilization, queue length and number of dispatches are shown.
- the number of messages that are currently being processed in the SCP varies according to FIG. 21. c on average between 20 and 60, while there are only an average of 6 messages in the queue, FIG. 21.e. From these values, as well as from the average CPU utilization of 80%, it can be seen that the SCP can handle a traffic volume of 30 calls per second without problems with the selected configuration.
- Figures 21.g-i show SS7 statistics.
- Figure 2 g corresponds to 2 a and shows the bagged or generated telephone traffic as a function of
- Figure 21.h shows the delay of a message in the SS7 simulator on the way from the SSP to the SCP (dashed) as a function of time, and the delay of a message on the way from the SCP to the SSP (dotted).
- Figure 21i shows the number of messages in the SS7 in the direction of SCP (dashed) or in the direction of SSP (dotted) as a function of
- Figure 2l.j shows the SSP statistics as a function of time, i.e. the number of lines to and from SSP1 or SSP2 (left or right
- FIG. 22 shows a further example of simulation data determined with the IN simulator, here in the case of a strongly changing traffic volume. Traffic was changed every 100 seconds by 48 40 on 20, on 80, on 10, on 50 and on 5 calls per second. The SS7 simulator is active while the overload protection is inactive. The assignment of the curves to the simulated variables corresponds to that in FIG. 21.
- the simulation shown in FIG. 22 leads to sharp increases in the SCP response time as soon as the limit of 30 calls per second is exceeded.
- the number of calls in the SCP and the SCP queue length are also increasing rapidly.
- the SCP is able to process the waiting messages, so that the delay time and also the length of the queue decrease.
- the processing time of the messages in the central signaling system fluctuates by only 0.02 seconds despite the different traffic volumes.
- FIG. 23 shows a simulation with the same congested traffic volume as in FIG. 22, but here with an overload protection simulator activated.
- the overload protection simulator was given a maximum traffic volume of 30 calls per second.
- the limitation of the generated traffic volume to these average 30 calls per second is visible in FIG.
- the response time of the SCP, FIG. 23b is therefore reduced to a value of approximately 0.4 to 0.5 seconds, which corresponds to the SCP response times determined in the example of FIG. 21 for a constant traffic volume of 30 calls per second.
- the response times are therefore a factor 100 shorter than in the example in FIG. 22.
- the IN simulator according to the invention is a useful tool in all stages of planning and the operation of an intelligent communication network to test the performance of the network, to adapt it to specific requirements and to detect weaknesses. Due to the great flexibility of the simulation modules, it is easy to adapt to existing as well as future realities. By comparing with simulated values and the parameters on which the simulation is based, it is possible to choose the configuration of the real intelligent network in such a way that the best possible efficiency of the IN is achieved under the given boundary conditions. This leads to considerable cost savings in the operation and planning of intelligent networks, since with the help of the EN simulation, the optimal configuration of the intelligent network and its components can be determined and implemented directly in reality without the need for expensive experimentation times at the real IN.
- the IN simulator is a suitable tool for determining management parameters, which can, for example, provide a stable basis for problematic overload protection.
- the results of the simulation also enable the development and review of general global or network node-related management functions that can be reacted and used more effectively than the previously used overload protection mechanisms.
- SCP input processor 104 telephone user channels 105 SS7 channels 106,107,108 SCP 109 traffic simulator 201,301,401, 1902 SCP simulator 202,302,402 SS7 simulator 303,403,503 transfer files 203,204,304,305,306,307,
- Protocol files 417-420 File name file 421
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
- Telephonic Communication Services (AREA)
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
Abstract
Description
Claims
Priority Applications (5)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
EP99939863A EP1013109A1 (de) | 1998-03-16 | 1999-02-23 | Simulator zur simulation eines intelligenten netzwerks |
US09/423,954 US6650731B1 (en) | 1998-03-16 | 1999-02-23 | Simulator for simulating an intelligent network |
HU0400884A HUP0400884A2 (en) | 1998-03-16 | 1999-02-23 | Simulator for simulating an intelligent network |
CA002289515A CA2289515A1 (en) | 1998-03-16 | 1999-02-23 | Simulator for simulating an intelligent network |
JP54644799A JP2001526876A (ja) | 1998-03-16 | 1999-02-23 | インテリジェントネットワークをシミュレーションするためのシミュレータ |
Applications Claiming Priority (2)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
DE19811097A DE19811097A1 (de) | 1998-03-16 | 1998-03-16 | Simulator zur Simulation eines intelliegenten Netzwerks |
DE19811097.9 | 1998-03-16 |
Publications (1)
Publication Number | Publication Date |
---|---|
WO1999048306A1 true WO1999048306A1 (de) | 1999-09-23 |
Family
ID=7860887
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
PCT/EP1999/001141 WO1999048306A1 (de) | 1998-03-16 | 1999-02-23 | Simulator zur simulation eines intelligenten netzwerks |
Country Status (8)
Country | Link |
---|---|
US (1) | US6650731B1 (de) |
EP (1) | EP1013109A1 (de) |
JP (1) | JP2001526876A (de) |
CN (1) | CN1258418A (de) |
CA (1) | CA2289515A1 (de) |
DE (1) | DE19811097A1 (de) |
HU (1) | HUP0400884A2 (de) |
WO (1) | WO1999048306A1 (de) |
Cited By (4)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN1311663C (zh) * | 2003-07-21 | 2007-04-18 | 华为技术有限公司 | 一种判断智能业务测试覆盖率高低的方法 |
GB2469509A (en) * | 2009-04-16 | 2010-10-20 | Aircom Internat | Network modelling method |
US9198110B2 (en) | 2009-04-16 | 2015-11-24 | Aircom Internatioal Ltd. | Modelling apparatus and method |
US10291481B2 (en) | 2009-04-16 | 2019-05-14 | Teoco Corporation | Modelling apparatus and method |
Families Citing this family (31)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US20010051862A1 (en) * | 2000-06-09 | 2001-12-13 | Fujitsu Limited | Simulator, simulation method, and a computer product |
ITTO20010180A1 (it) * | 2001-03-01 | 2002-09-01 | Cselt Centro Studi Lab Telecom | Procedimento e sistema per il controllo della configurazione dei nodidi una rete per telecomunicazione. |
US7158627B1 (en) * | 2001-03-29 | 2007-01-02 | Sonus Networks, Inc. | Method and system for inhibiting softswitch overload |
US20020188433A1 (en) * | 2001-06-06 | 2002-12-12 | Honeywell International Inc. | Generic device simulator for process control |
GB2379125B (en) * | 2001-06-21 | 2003-11-12 | Toshiba Kk | Communication apparatus private branch exchange apparatus maintenance terminal apparatus and simulation method |
US7774440B1 (en) * | 2001-07-25 | 2010-08-10 | Scalable Network Technologies, Inc. | Method and system for enhancing performance of a physical network under real-time control using simulation of a reference model |
DE10307408B3 (de) * | 2003-02-20 | 2004-09-02 | Radioplan Gmbh | Verfahren zur Ablaufsteuerung von sequentiellen objektorientierten Systemsimulationen der Kommunikation in Mobilfunknetzen |
AU2003292534A1 (en) * | 2003-11-21 | 2005-06-08 | Telecom Italia S.P.A. | Method and system for simulating communications networks, object and computer program product therefor |
JP4610240B2 (ja) * | 2004-06-24 | 2011-01-12 | 富士通株式会社 | 分析プログラム、分析方法及び分析装置 |
DE102004043028A1 (de) * | 2004-09-06 | 2006-03-30 | Siemens Ag | Verfahren zur Beschränkung des Zugangs zu einem Televoting-Dienst auf Basis der Rufnummer eines Teilnehmers |
US7369977B1 (en) * | 2004-09-20 | 2008-05-06 | The Mathworks, Inc. | System and method for modeling timeouts in discrete event execution |
US9197533B1 (en) | 2005-05-09 | 2015-11-24 | Cisco Technology, Inc. | Technique for maintaining and enforcing relative policies with thresholds |
US20070067296A1 (en) * | 2005-08-19 | 2007-03-22 | Malloy Patrick J | Network capacity planning |
US20070271079A1 (en) * | 2006-05-17 | 2007-11-22 | Kentaro Oguchi | Simulator for Vehicle Radio Propagation Including Shadowing Effects |
US20090099827A1 (en) * | 2007-10-16 | 2009-04-16 | Sony Corporation | System and method for effectively performing a network simulation procedure |
US8793117B1 (en) * | 2008-04-16 | 2014-07-29 | Scalable Network Technologies, Inc. | System and method for virtualization of networking system software via emulation |
US8326977B2 (en) * | 2008-07-16 | 2012-12-04 | Fujitsu Limited | Recording medium storing system analyzing program, system analyzing apparatus, and system analyzing method |
US20100017486A1 (en) * | 2008-07-16 | 2010-01-21 | Fujitsu Limited | System analyzing program, system analyzing apparatus, and system analyzing method |
JP5169614B2 (ja) * | 2008-08-19 | 2013-03-27 | 富士通株式会社 | システム分析プログラム、システム分析装置、システム分析方法 |
US20100066731A1 (en) * | 2008-09-16 | 2010-03-18 | James Calvin Vecore | Configurator Process and System |
US9210050B2 (en) * | 2009-07-09 | 2015-12-08 | Centurylink Intellectual Property Llc | System and method for a testing vector and associated performance map |
US8885636B2 (en) * | 2009-09-01 | 2014-11-11 | International Business Machines Corporation | Method and system for platform-independent VoIP dial plan design, validation, and deployment |
US20120084110A1 (en) * | 2010-10-05 | 2012-04-05 | M3 Technology, Inc. | System and method for smart oil, gas and chemical process scheduling |
US9065916B2 (en) * | 2012-06-01 | 2015-06-23 | Callpromise, Llc | System and method for virtual queuing of calls |
US9958843B2 (en) * | 2012-11-07 | 2018-05-01 | Hitachi, Ltd. | System and program for managing management target system |
WO2015002714A1 (en) * | 2013-07-02 | 2015-01-08 | Seven Networks, Inc. | Modeling network signaling in a mobile network |
CN103517311B (zh) * | 2013-09-11 | 2017-02-22 | 百度在线网络技术(北京)有限公司 | 一种模拟无线网络的方法与装置 |
DE102015002367A1 (de) | 2014-03-02 | 2015-09-03 | Gabriele Trinkel | Sichere Übertragung von Daten und Skalierung, Regelung zur Überlastabwehr in der Cloud und Cloud Computing |
EP3217713B1 (de) | 2014-11-28 | 2020-09-30 | Huawei Technologies Co., Ltd. | Verfahren und vorrichtung zur erfassung einer dienstverteilung |
US10282062B2 (en) | 2016-10-03 | 2019-05-07 | Sas Institute Inc. | Techniques for repairable system simulations |
US10534588B2 (en) * | 2018-06-08 | 2020-01-14 | Sap Se | Data processing simulator with simulator module and data elements |
Citations (3)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US5359649A (en) * | 1991-10-02 | 1994-10-25 | Telefonaktiebolaget L M Ericsson | Congestion tuning of telecommunications networks |
US5621670A (en) * | 1991-08-01 | 1997-04-15 | Fujitsu Limited | Communication service simulator and a communication service specification verifying method |
EP0781020A2 (de) * | 1995-12-21 | 1997-06-25 | Ericsson Inc. | Testvorrichtungen in einem intelligenten Netzwerksystem |
Family Cites Families (6)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US5594782A (en) * | 1994-02-24 | 1997-01-14 | Gte Mobile Communications Service Corporation | Multiple mode personal wireless communications system |
US5805570A (en) * | 1995-05-02 | 1998-09-08 | Merge Technologies Group, Inc. | Method of simulating an ISDN-BRI central office switch using a single microcomputer |
US5787147A (en) * | 1995-12-21 | 1998-07-28 | Ericsson Inc. | Test message generator in a telecommunications network |
JPH09321869A (ja) * | 1996-05-31 | 1997-12-12 | Nec Corp | 呼情報試験方法とその装置 |
US5940472A (en) * | 1996-12-16 | 1999-08-17 | Mci Communications Corporation | Intelligent services network test system |
US5982852A (en) * | 1997-01-31 | 1999-11-09 | 3Com Corporation | Line performance test system |
-
1998
- 1998-03-16 DE DE19811097A patent/DE19811097A1/de not_active Ceased
-
1999
- 1999-02-23 HU HU0400884A patent/HUP0400884A2/hu unknown
- 1999-02-23 CN CN99800294A patent/CN1258418A/zh active Pending
- 1999-02-23 JP JP54644799A patent/JP2001526876A/ja active Pending
- 1999-02-23 CA CA002289515A patent/CA2289515A1/en not_active Abandoned
- 1999-02-23 WO PCT/EP1999/001141 patent/WO1999048306A1/de not_active Application Discontinuation
- 1999-02-23 EP EP99939863A patent/EP1013109A1/de not_active Withdrawn
- 1999-02-23 US US09/423,954 patent/US6650731B1/en not_active Expired - Fee Related
Patent Citations (3)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US5621670A (en) * | 1991-08-01 | 1997-04-15 | Fujitsu Limited | Communication service simulator and a communication service specification verifying method |
US5359649A (en) * | 1991-10-02 | 1994-10-25 | Telefonaktiebolaget L M Ericsson | Congestion tuning of telecommunications networks |
EP0781020A2 (de) * | 1995-12-21 | 1997-06-25 | Ericsson Inc. | Testvorrichtungen in einem intelligenten Netzwerksystem |
Non-Patent Citations (1)
Title |
---|
SMITH D E: "ENSURING ROBUST CALL THROUGHPUT AND FAIRNESS FOR SCP OVERLOAD CONTROLS", IEEE / ACM TRANSACTIONS ON NETWORKING, vol. 3, no. 5, 1 October 1995 (1995-10-01), pages 538 - 548, XP000543255 * |
Cited By (6)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN1311663C (zh) * | 2003-07-21 | 2007-04-18 | 华为技术有限公司 | 一种判断智能业务测试覆盖率高低的方法 |
GB2469509A (en) * | 2009-04-16 | 2010-10-20 | Aircom Internat | Network modelling method |
GB2469509B (en) * | 2009-04-16 | 2011-06-29 | Aircom Internat Ltd | Modelling apparatus and method |
US8654676B2 (en) | 2009-04-16 | 2014-02-18 | Teoco Corporation | Modelling apparatus and method |
US9198110B2 (en) | 2009-04-16 | 2015-11-24 | Aircom Internatioal Ltd. | Modelling apparatus and method |
US10291481B2 (en) | 2009-04-16 | 2019-05-14 | Teoco Corporation | Modelling apparatus and method |
Also Published As
Publication number | Publication date |
---|---|
CA2289515A1 (en) | 1999-09-23 |
EP1013109A1 (de) | 2000-06-28 |
US6650731B1 (en) | 2003-11-18 |
JP2001526876A (ja) | 2001-12-18 |
DE19811097A1 (de) | 1999-09-23 |
CN1258418A (zh) | 2000-06-28 |
HUP0400884A2 (en) | 2004-08-30 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
EP1013109A1 (de) | Simulator zur simulation eines intelligenten netzwerks | |
DE69829165T2 (de) | Überlastregelung in einem kommunikationsnetzwerk | |
DE69233618T2 (de) | Verarbeitungssystem zur Leitweglenkung für Teilnehmeranrufe | |
DE69631373T2 (de) | Abrechnungsverwaltung für telekommunikationsbenutzung | |
DE69632888T2 (de) | Dienst- und Informationsverwaltungssystem für ein Telekommunikationsnetzwerk | |
DE69837010T2 (de) | System und verfahren zum steuern des zugriffs auf eine vermittlungsdatenbank | |
DE602004004321T2 (de) | Vorrichtung und Verfahren zur Echtzeitbeurteilung einer Netzverwaltungsregel | |
DE69733543T2 (de) | Verfahren zum Anbieten von wenigstens einem Dienst an Fernmeldenetzbenutzern | |
DE69732221T2 (de) | Verfahren zum Anbieten von einem Dienst an Fernmeldenetzbenutzern | |
DE102006002247A1 (de) | Verfahren und System zum Aktualisieren von Echtzeitdaten zwischen Intervallen | |
DE69332927T2 (de) | Gerät zur Verwaltung eines Elementverwalters für ein Fernmeldevermittlungssystem | |
DE69731182T2 (de) | Nachrichtenverfahren zwischen einer Dienstvermittlungsstelle und einer Dienstkontrolleinrichtung in einem Fernmeldenetz | |
DE19919976A1 (de) | Verfahren und Vorrichtung zum Übertragen eines eingebetteten Nebenstellensystems auf einen Personalcomputer | |
DE69825560T2 (de) | Intelligentes netzwerk mit einer verteilten dienststeuerungsfunktion | |
DE60308776T2 (de) | Beherrschen von Abhängigkeiten von individualisierten Leistungsmerkmalen in der IP Telephonie mittels deontischen Befehlsbäumen und Ablaufsoperatoren | |
DE69830421T2 (de) | Vorverarbeitung von ereignissen zur zusammenstellung eines berichtes | |
DE69836347T2 (de) | Dienstinteraktion in einem intelligenten netzwerk | |
DE60318263T2 (de) | Kommunikationsanfrageverarbeitungssystem und -verfahren | |
DE19720274C2 (de) | Kommunikationssystem, Verfahren und Verarbeitungseinrichtung zum Vermitteln von Anrufen über ein zwischen zwei lokalen Netzen angeordnetes Übertragungsnetz | |
EP1371236B1 (de) | Verfahren zur selektiven und gesammelten weiterleitung von meldungen in einem tmn-netzwerk | |
EP0850545A1 (de) | Ablaufumgebungssystem für service-applikationen eines kommunikationsnetzes | |
DE69828694T2 (de) | Intelligente periphere diensteinheit | |
EP1317150B1 (de) | Verfahren zum Übermitteln eines Kennzeichendatums einer Netzknoteneinheit, zugehörige Vorrichtung und zugehöriges Programm | |
EP0967776A2 (de) | Verbindungsaufbauverfahren Dienststeuereinheit und Kommunikationsnetz | |
DE10023624A1 (de) | Dienst-Einheit |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
WWE | Wipo information: entry into national phase |
Ref document number: 99800294.1 Country of ref document: CN |
|
WWE | Wipo information: entry into national phase |
Ref document number: 1999939863 Country of ref document: EP |
|
AK | Designated states |
Kind code of ref document: A1 Designated state(s): CA CN HU JP US |
|
AL | Designated countries for regional patents |
Kind code of ref document: A1 Designated state(s): AT BE CH CY DE DK ES FI FR GB GR IE IT LU MC NL PT SE |
|
ENP | Entry into the national phase |
Ref document number: 2289515 Country of ref document: CA Ref document number: 2289515 Country of ref document: CA Kind code of ref document: A Ref document number: 1999 546447 Country of ref document: JP Kind code of ref document: A |
|
121 | Ep: the epo has been informed by wipo that ep was designated in this application | ||
WWE | Wipo information: entry into national phase |
Ref document number: 09423954 Country of ref document: US |
|
WWP | Wipo information: published in national office |
Ref document number: 1999939863 Country of ref document: EP |
|
WWW | Wipo information: withdrawn in national office |
Ref document number: 1999939863 Country of ref document: EP |