DE19740738A1 - Active alarm list handling in subordinate management level - Google Patents

Abstract

The method involves rearranging a list of active alarms in a subordinate management level of a communications network by storing the alarms appearing in this level, in the sequence of their appearance, and through transmitting the stored alarms to a next higher management level, after a disturbed communication is reinstalled between the subordinate and the next higher management level, to enable the rearrangement of the list of active alarms of the subordinate management level in the next higher management level. The appearing alarms are respectively stored, dependent on the meaning (Critical, Major, Minor, Warning) of the individual alarm on the function of the affected object in memories (QueueCr, QueueMa, QueueMi, QueueWa) of different priority. An appearing alarm of higher meaning (Major), is stored in the memory with the lowest priority (Queuewa), if the memory (QueueMa) associated with the priority of the meaning (Major) of this alarm is full.

Description

The invention relates to a method for rearranging a List of those in a lower management level of a com communication network active alarms according to the generic term of An saying 1.

The principles of the telecommunications management network, the after the English language expression "Telecommunications Ma management network "are also referred to as TMN principles, define several levels for the management of a telecommunication nication network, whereby each level has a double function Has. In the managing system, every level has except for the bottom one, a manager role for those below lying level. Has in the managed system each level except the top one has an agent role for that next higher level.

Fault management is an important one Part of the management of a telecommunications network. Reason The agent also plays the active role here by: Errors of your own management level in good time and exactly him knows and to the manager of the next higher level as spontaneous Events, so-called alarm notifications ("alarm notifica tions ") in a standardized manner, usually under Using the CMIS service M-EVENTREPORT.

Detection is also part of the exact detection of an error the impact of the error on the functionality of the affected open object and the evaluation of the corresponding alarm with this perceived severity.  

The transmission of alarms from the agent to the manager is un critical as long as the communication mechanism between the systems is not disturbed. If the connection between the two management levels, i.e. between agent to manager, is no longer guaranteed for a certain time, the Agent the alarms that occurred during this interval save to ensure that after recovery provide the manager with the opportunity to communicate An overview of the current active alarms (List of active alarms after the English language expression "active alarm list") is provided, and the Ma On the other hand, the alarm history is as complete as possible ("alarm history") both the active and the ended Can build alarms.

A corresponding alarm reordering procedure, the so-called called alarm realignment procedure, can with each new Ver Establishing a connection between managers and agents the.

The main problem with the alarm reordering process is limited storage capacity in the agent for the intermediate storage of the list of active alarms is available. Like this long the interruption of communication between managers and agent is of short duration, the cache becomes the Can handle the amount of active alarms. But if that Connection fails for a long time or during this time extraordinary events occur that a large amount of alarms can reduce the capacity of the intermediate memory is no longer sufficient.

In such a case, over the oldest alarm writing is not an optimal solution because u. U. critical and therefore very important alarms for the manager due to the Ma rodent rather unimportant simple warnings are overwritten could. On the other hand, it would be uneconomical to have a large one  To provide temporary storage, the most unfavorable for everyone Cases is sufficient.

The object of the invention is to provide a method for Rearrange a list of those in a subordinate mana level of a communication network through active alarms Storage of the alarms occurring in this level in the row order of their occurrence and by transmitting the food alarms to a higher management level after a disturbed communication option between the lower ordered and the next higher management level again is to rearrange the list of those in the list below orderly management level active alarms at the next level enable their management level. If due to limited Not all alarms can be provided to ensure that the active alarms correspond according to their importance.

The invention solves this problem by a method with Features of claim 1.

If a communication option between a subordinate ordered and the next higher management level of a communication cations network is disturbed, occurring alarms in the subordinate level according to the invention depending on the importance of the individual alarm on the function of the be hit object in memories of different priority stored, with each meaning level a memory priority activity is assigned. An alarm of higher importance becomes when the memory with the alarms this meaning ordered priority is full, in the memory with the low highest priority saved. After the disturbed communication possibility of cation between the subordinate and the next higher management level is restored, the saved alarms to the next higher management level transmitted.  

By storing alarms of higher importance in the memory The one that is pre-selected for the alarms with the lowest importance is seen to ensure that more important alarms are safe are available and that first the storage space for un more important alarms is restricted.

The memory, of course, not necessarily physika can be run as individual memories be the same size. Usually the size of the one memory assigned to individual levels of meaning, however on the respective probability of occurrence of Alarms of the respective meaning can be dimensioned. At the procedure described it is recommended, however, the Spei lower priority priority than larger than the likelihood of low alarms occurring rigorous level of meaning.

Saving active alarms at the expense of ended alarms can in one embodiment of a Ver by deleting the memory entries of alarms can be reached that are no longer active.

Deleting the memory entries of alarms that are no longer can be active in a different embodiment only if necessary, as soon as one of the spokes cher is full. If necessary, only those cannot more active alarms in the full memory and in the memory with lower priority, so that the Alarm history of alarms with greater importance still to be reconstructed remains structurable.

By marking the oldest stored Alarms of the alarms of every meaning level in the memory with the assigned priority is in one embodiment of a method according to the invention the seniority-dependent transfer average the stored alarms to the next higher management ment level relieved.  

Alarms that occur are of greater importance full memory of the priority assigned to its meaning in the memory with the lowest priority ordered by the Meaning of the alarms saved in this memory chert. This is because the alarms have the same meaning together are stored in the correct way Order of transmission to the higher management level relieved. Entries from alarms are also made less significant due to alarms of higher significance from the Memory is displaced, so the alarms of higher importance are safe saved.

By marking the oldest alarm higher Meaning that is not in memory with the alarms of this loading interpretation assigned priority is stored in the Spei lower priority than continuation alarm The relevant importance is given in a further training according to the method, the priority-dependent transmission of the saved alarms to the next higher management level additionally relieved.

The storage reserves can be developed in a further training exploit the inventive method even better by the Saving an alarm of higher importance in the free space of the memory with the second lowest Priority if both the memory with the alarms of this Meaning assigned priority as well as the memory with lowest priority are full. This will, in particular if the free storage space is used accordingly additional memory, ensures that the available memory is used before active alarms of lower loads interpretation must be deleted.

In case the memory with the meaning of a store priority assigned to the alarms and all memories with low another priority sees full further priority  of a method according to the invention, such an alarm store in the lowest priority memory after the oldest alarm with the least importance of stored alarms has been deleted.

In the event that the memory with the alarms of importance priority assigned to an alarm to be stored and all Lower priority memories are full of alarms not least importance, sees an embodiment of one inventive method before this alarm in the memory with the lowest priority, in which not only alarms with relative to the higher priority alarm to be stored saves are to be saved after the oldest saved Alarm with the lowest meaning of the currently saved Alarms has been cleared. This ensures that the current alarms of greater importance are retained.

If in the latter embodiment of a fiction according to the procedure of the memory with the lowest priority in which not only alarms with relative to the save the alarm of higher importance is stored, not the memory with the alarms with the lowest significance of the current priority is assigned to stored alarms preferably of lower priority than in this memory Continuation alarm of the lowest meaning of the currently ge stored alarms marked alarm, that is the oldest of the alarms of this meaning, in the memory with the alarms priority assigned to this meaning. Thereby it ensures that alarms of greater importance are related can be saved hanging and the alarms of low Most still stored meaning, if necessary so many alarms of this meaning have been cleared as in a memory of a lower priority have been saved, all contiguously in theirs Meaning assigned memory are stored. Through the Measures mentioned is the selection of the alarms to over average to the higher management level after recovery  make communication easier.

This can be improved by the fact that the Kenn Drawing of the oldest stored alarm of a higher name interpretation and labeling of continuation alarms of these Meaning is managed in such a way that the temporal Order in which the alarms of this meaning occurred are reconstructable.

To prevent alarms of the lowest importance or a lower meaning are no longer saved can, because the storage space of the memory with that of their loading priority assigned by alarms with even higher Significance is proven, looks particularly favorable design of a method according to the invention, an alarm of lower importance in this case in the available storage space of the Spei save with the next highest priority.

Four memories are preferably of different priority for the determined meanings "Critical" as highest meaning, "large" (major), "low" (minor) and "Warning" as the lowest meaning of alarms seen since this gradation of meaning in the usual ITU-T X.733 standard is recommended.

In a development of methods according to the invention the transmission of the saved alarms to the next higher one Management level of the oldest saved alarm each level of importance the age rank determined. For this is entered in the memory with the assigned priority Alarm parameter, the time when the alarm occurred indicates checked to the absolute oldest stored alarm to determine. This is the oldest stored alarm transmitted to the next higher management level and that of the space occupied by it is declared free. The next The test stored alarm of this significance level is in the  Memory with the assigned priority saved as the oldest alarm and the procedure is activated by comparing the age rank of the oldest stored again Alarms continue in the manner mentioned.

This ensures in a simple manner that the alarm me in the order of their appearance to the parent Management level.

A correspondingly designed method can usefully se be further developed in that after the transmit the last alarm of a meaning level in the memory the assigned priority if the memory before the over the alarms were full, in the memory with the lowest Priority after a continuation alarm of this importance level is sought to compare this with the age rank take into account, and if the memory with the assigned Priority before the alarms were not full or no continuation alarm of the relevant meaning is saved is, only the age of alarms of the remaining importance compare levels.

Another improvement to the latter method is achieved in that after the transmission of the last fort setting alarm of a meaning level from the memory with the lowest priority in case the memory before the transmit the alarms were full in the memory with the second lowest Priority after a continuation alarm of this importance level is sought to compare this with the age rank take into account, and if no continuation alarm of the concerned meaning is stored, only the age rank of Compare alarms of the other meaning levels.

Methods according to the invention can, for example, in a Mo bilfunknetzes for the interface between the levels Net work element and network element management with one qualification drive and maintenance center as a manager and a base station  onssubsystem can be used as an agent. Besides, they can for the interface between the levels Network Element Ma nagement and network management are used with one Network management center as manager and an operating and Maintenance center as an agent.

The invention will now be described by way of an embodiment game explained with reference to the figures.

Figs. 1 to 15 show a schematic representation of a memory agent and the availability of these memory with alarms of different significance levels. Here, using an exemplary embodiment of a method according to the invention, the change in occupancy of the individual memories is shown depending on boundary conditions.

The process, referring to the figures as Aus example is described, optimizes the realignment Procedure in that the limited memory resources in the Agent are taken into account and optimally used that after Always use the oldest of the entire storage capacity Lowest priority alarms overwritten by new alarms that the cached alarms after recovery connection to the manager at the same time be forwarded in the order in which they originally Lich occurred, and that from the manager's point of view the Realignment procedure like the spontaneous, standard-compliant transfer alarms are carried out, d. that is, there are no additional mechanisms for this in the manager or at the interface between manager and agent.

Fig. 1 shows four QueueCr memory. QueueMa, QueueMi, QueueWa of different priority, in which alarms are stored depending on the importance of Critical, Major, Minor, Warning of the individual alarm for the function of the object concerned. Every meaning Critical, Major, Minor, Warning is one of the QueueCr, memories. QueueMa, Qu eueMi, QueueWa assigned.

The embodiment described with reference to the figures His method is based on the following Regulate:

Is the memory QueueCr ,. QueueMa, QueueMi or QueueWa with the alarm assigned to a new alarm Priority full, then the new alarm in the memory Qu eueWa with the lowest priority, i.e. the storage queue Wa for the alarms with the meaning Warning, continued ben. This is done either by using the free Be lowest priority memory queue or by overwriting the oldest alarms with the lowest meaning Warning. For alarms with the lowest Meaning Warning means these rules that new alarms Warning meaning only older alarms of this importance may overwrite ning as long as there still exist.

If the QueueWa memory with the lowest priority is full, are not alarms with the lowest meaning Warning existing in this, then the latest alarms with the Meaning Warning in the QueueMi memory with the second low highest priority, i.e. the QueueMi memory for alarms meaning minor, saved. This happens either by using the free area or by overwriting of the oldest alarms with the second lowest meaning tung minor. This rule applies mutatis mutandis to the others Storage QueueCr ,. QueueMa, QueueMi for alarms with higher loads interpretation Critical, Major.

In every store QueueMa ,. QueueMi, QueueWa which is used as an intermediate buffer for alarms of different meanings, the alarms are stored in descending order of importance Critical, Major, Minor, Warning (see Fig. 12).

For the temporary storage of the active alarms, four memory areas (hereinafter referred to as queues with reference to the figures) are allocated in the agent according to the exemplary embodiment in accordance with the values for the perceived severity defined in the ITU-T X.733 standard:

• - the QueueCr memory, as a buffer for alarms "perceived severity critical",
• - The QueueMa memory, as a buffer for alarms "perceived severity major",
• - The QueueMi memory, as a buffer for alarms "perceived severity minor" and
• - The QueueWa memory, as a buffer for alarms "perceived severity warning".

For the sake of simplicity, the QueueCr, QueueMa, Qu eueMi, QueueWa drawn in the figures as the same length, whether of course they are of different lengths for a different number of alarm notifications applications can be designed. The actual size should depend on the probability the occurrence of alarms of the respective meaning dimensio be kidneyed.

As soon as the connection between manager and agent is broken every alarm is stored in one of the four memories QueueCr, Qu eueMa, QueueMi, QueueWa saved according to its meaning chert. The oldest entry is QueueCr in every memory, QueueMa, QueueMi, QueueWa by a pointer, the start index SCr, SMa, SMi, SWa.

As soon as an alarm is no longer active, the intermediate saved alarm in the corresponding memory QueueCr, Qu eueMa, QueueMi, QueueWa deleted.

If a memory, e.g. For example, if the QueueMa memory is full for the first time and then a new alarm with the same meaning Major occurs, this new entry is entered in the memory of the lowest importance, that is to say the QueueWa memory, at the highest point according to its meaning, as in FIG. 2 shown.

The alarms in the QueueWa memory with the meaning Warning are moved down one place and the pointer SWa increments. The new alarm comes first Place in the QueueWa memory and by a Pointer FMa, a "continuation index" for alarms with the Be interpretation Major, marked. This continuation index FMa indicates here if several alarms with the meaning Ma jor are stored in the QueueWa memory, the oldest of these alarms. The free area in the QueueWa storage is over an entry has become shorter.

After some time the QueueCr memory becomes the first time full and then a new alarm occurs with the meaning Critical on, this new entry is stored in memory rigorous importance, i.e. the QueueWa memory highest place according to its meaning.

As FIG. 3 shows, the alarms with the meaning Warning present in the QueueWa memory are shifted down by one position and the pointer SWa is incremented. The alarms with the meaning major in the QueueWa memory are shifted down by one position and the pointer FMa is incremented. The new alarm is stored first in the QueueWa memory and is identified by a continuation index for alarms with the meaning critical FCr. The free area in the QueueWa memory has been reduced by one entry.

Fig. 4 shows the constellation that results if the QueueWa memory is full after some time.

If a new alarm with the meaning major occurs in this case, this is written into the free area of the memory with the lowest priority, if one exists (see FIG. 5).

The alarms in the QueueMi memory with the meaning tung Major are moved down one place and the pointer SMi increments. The new alarm comes first Position in the QueueMi memory and saved by a Continuation index FMa for alarms with the meaning Major ge indicates. The free area in the QueueMi store is over an entry has become shorter.

If after a while the three memories QueueCr, QueueMa and QueueMi with the highest priorities are full, the constellation shown in FIG. 6 results that there is only one entry with the meaning Warning in the memory QueueWa.

After a new alarm with the meaning Minor occurs, the last entry with the meaning Warning is overwritten from the QueueWa memory, as shown in FIG. 7.

From this point on, no new alarms are sent to the Meaning Warning cached because all alarms in the Save have a higher meaning.

If a new alarm with the meaning Minor occurs now, the oldest alarm with the meaning minor is removed and the new attached. To get that, the oldest (First) entry in the QueueMi memory overwritten. For this all alarms with minor meaning in this memory QueueMi moved up one place. The oldest Alarm with the meaning Minor is changed from the QueueWa memory (corresponding to the FMi pointer) last in the memory saved QueueMi. The QueueWa in the memory those alarms with the meaning minor, i.e. from position FMi + l,  are shifted up one position (FMi remains unchanged changes). The new alarm with the meaning minor is last position in the QueueWa memory.

If, for example, a new alarm with the meaning major then occurs, the oldest entry with the lowest meaning, in this case minor, is overwritten by the new alarm (see FIG. 8).

The oldest (first) entry in the QueueMi memory is over wrote, d. H. all new alarms meaning minor in this memory are shifted up one place. The oldest new alarm meaning Minor from the Spei cher QueueWa, (according to the pointer Fmi) is the last Location saved in the QueueMi memory. The new alarm will replace the oldest new alarm with the meaning Minor in the QueueWa memory of lowest priority saves. The FMi pointer in the QueueWa memory is incremented animals.

After several alarms with the meaning critical or major have occurred, there are no more alarms in the memory QueueWa Minor (see FIG. 9).

If a new alarm with the meaning Major occurs in this case, the oldest entry with the lowest meaning, in this case Minor, is overwritten by the new alarm. This is achieved by the following procedure (see Fig. 10).

The oldest (first) entry in the QueueMi memory is over wrote, d. H. the pointer FMi is incremented. The new Alarm with the major meaning comes first in the QueueMi memory saved. QueueMi is stored in the memory a new continuation index FMa for alarms with the meaning Major defined.  

If, for example, a new alarm with the meaning Critical then occurs, the oldest alarm with the meaning Minor is overwritten in the memory QueueMi and the pointer Smi is consequently incremented. Since the alarms with the highest significance are at the beginning in each memory, the alarms in the QueueMi memory with the meaning Major (from position FMa) are moved down by 1 position and the pointer FMa is incremented. The new alarm with the meaning Critical is stored in the first place in the memory Qu eueMi. In the QueueMi memory, a new continuation index FCr is defined for alarms with the highest critical importance (see FIG. 11).

A single start index S is managed in each memory for alarms with the meaning corresponding to the priority of the memory. The start index is valid from the time of the first entry in the memory and loses its validity if the memory with the priority corresponding to the alarm meaning is used completely as an intermediate buffer for alarms of higher importance (see Fig. 7, QueueWa memory), or if the memory with the priority corresponding to the alarm meaning and all memories with lower meaning are completely occupied as intermediate buffers for newer alarms of this meaning (see Fig. 14 below).

In any memory, for any meaning that is higher, as the meaning corresponding to the priority of the memory, a continuation index F, which is the beginning of the respective "continuation memory", ie the time of Entry of the oldest alarm of this meaning in this Memory, flags.

Because in an extreme case no start index but several continuations indices in different memories for alarms from egg If there is a certain meaning, the Ent co-managed for each continuation index.  

The continuation index of the oldest memory area is at Forwarding of the alarms to the manager as a pseudo start index redefined to the correct chronological order for over to ensure wear.

In the example shown in FIG. 14, the oldest alarms with the meaning major in the QueueWa memory are in area a and the newest alarms with the meaning major in area e of this memory QueueWa. The oldest alarms in the QueueMa memory with the meaning Major are in area d and the newest alarms in the QueueMa memory with the meaning Major in area b of this memory QueueMa. In the QueueMi memory, only one memory area c is assigned alarms with the meaning major.

The transmission of the stored alarms as an "active alarm list" to the manager is described below with reference to FIG. 15.

Because on the one hand the entire "active alarm list" from four different memories QueueCr ,. QueueMa, QueueMi, QueueWa exists and, on the other hand, the sequence when forwarding must correspond to the original occurrence of the alarms, the transmission of the stored alarms is carried out as follows:

• a) The parameter values of the type "Event time" from the respective oldest entry of each memory (corresponding to the pointer SCr, SMa, SMi and SWa) are compared.
• b) The oldest alarm is sent to the manager as M-EVENT-REPORT sent and the storage space occupied by him as a free allowance richly defined.
• c) The corresponding index SCr, SMa, SMi or SWa becomes incorrect mented and the process is continued with a).  
• d) If the current index reaches the free area limit in the memory then all alarms with priority of the memory chers corresponding meaning transmitted. The procedure is continued by only the parameter values "Event time "from the oldest entry from the other three dishes QueueCr, QueueMa, QueueMi or QueueWa compared the.
• e) If the index currently to be incremented, e.g. B. SMa the (logical) end of memory, then more on this meaning Major from the oldest continuation memory area in the QueueWa memory with the lowest priority used to compare age ranks. The index SMa is therefore preceded by the FMa value from the QueueWa memory busy.
• f) Does the currently processed index SMa or FMa achieve this (logical) end of the current continuation memory, at for example for alarms with the meaning Major in the queue Wa, then more entries of this importance become major the second oldest continuation memory area in memory Qu eueMi, whose priority is the next higher meaning minor is ordered, used for comparison. The SMa index will thus pre-assigned the value FMa from the QueueMi memory.
• g) The realignment procedure ends when the latest two cached alarm notification sent to the manager and all stores QueueCr, QueueMa, QueueMi, QueueWa are empty.

Of course, the four memories defined here must be QueueCr, QueueMa, QueueMi, QueueWa not as physical separate areas are implemented. A continuous Memory area can also be queuecr in four logical memories, QueueMa, QueueMi, QueueWa can be divided and managed.

The process allows a high degree of flexibility with regard to the "Alarm Reporting Control" functionality at the interface  between manager and agent. Are z. B. Alarms with the low Rigorous meaning Warning by a manager managed EFD filtered out in the agent, then the entire area is the QueueWa memory as a continuation memory for high alarms available meaning.

As long as the managed system with agent function power failure le with the help of its own battery, would be the implementation of this procedure as a "dynamic list" of great advantage in terms of timing behavior and Flexibility. In such a case, the shift means of entries within a memory or copying alarm entry from one memory to another only the Redefine pointers or just remove and append a list item.

The procedure above was for caching the List of current alarms is described, but is basically also for caching the information for the Alarm history can be used.

Claims (16)

1. A method for rearranging a list of the alarms active in a subordinate management level of a communication network by storing the alarms occurring in this level in the order in which they occur and by transmitting the stored alarms to a next higher management level after a faulty communication option between of the subordinate and the next higher management level is restored in order to enable the rearrangement of the list of alarms active in the subordinate management level in the next higher management level, characterized by storing the occurring alarms depending on the meaning (critical, major, minor , Warning) of the individual alarm on the function of the affected object in memories (QueueCr, QueueMa, QueueMi, QueueWa) with different priorities and storing an alarm of higher importance (Major) if the memory (QueueMa) contains the alarms of this B significance (major) assigned priority is full, in the memory with the lowest priority (QueueWa). 2. The method according to claim 1, characterized by the Lö erase the memory entries of alarms that are no longer active are. 3. The method according to claim 1, characterized by the Lö erase the memory entries of alarms that are no longer active as soon as a memory (QueueCr, QueueMa, QueueMi, Queue Wa) is full. 4. The method according to any one of the preceding claims, characterized characterized by the respective identification of the oldest ge saved alarms (SCr, SMa, SMi, SWa) of the alarms of each load level of interpretation (critical, major, minor, warning) in the memory cher (QueueCr, QueueMa, QueueMi, QueueWa) with the assigned priority.   5. The method according to any one of the preceding claims, characterized records higher by saving the occurring alarm Significance (major) with full memory (QueueMa) with the alarm Priority assigned to this meaning (major), in the Ordered memory (QueueWa) with the lowest priority according to the meaning of the data stored in this memory (QueueWa) alarms. 6. The method according to any one of the preceding claims, characterized records by identifying the oldest alarm higher meaning (major) that is not in memory (QueueMa) with the priori associated with the alarms of this importance (major) is stored in the memory (QueueWa) with low Priority as continuation alarm (FMa) corresponding to Be interpretation (major). 7. The method according to any one of the preceding claims, characterized records altitude by saving an occurring alarm rer meaning (major) if the memory (QueueMa) with the Priorities and alarms assigned to this meaning (major) the memory with the lowest priority (QueueWa) is full are in the free storage space of the store with the second low highest priority (QueueMi). 8. The method according to any one of the preceding claims, characterized records altitude by saving an occurring alarm rer meaning (major) if the memory (QueueMa) with the Priorities and alarms assigned to this meaning (major) all memories with lower priority (QueueMi, QueueWa) are full, in the memory with the lowest priority (QueueWa), after deleting the oldest alarm with the ge least importance (warning or minor) of the stored Alarms. 9. The method according to any one of claims 6 to 8, characterized by storing an occurring alarm of higher importance  tung (Major) when the memory (QueueMa) with the alarms priority assigned to this meaning (major) and all Memory with lower priority (QueueMi, QueueWa) full are not of the lowest importance with alarms (critical, Major, Minor), in the lowest priority memory (QueueWa or QueueMi), in which not only alarms with relative saved to the higher priority alarm to be saved after deleting the oldest saved alarm (SMi) with the lowest meaning (minor) of the currently ge saved alarms. 10. The method according to claim 9, characterized in that, if the memory (QueueWa) with the lowest priority (QueueWa or QueueMi), in which not only alarms with relative saved to the alarm of higher importance to be saved are not the memory (QueueMi) with the alarms with the lowest meaning (minor) of the currently saved alarm me assigned priority is that in this memory (QueueWa) lower priority than continuation alarm (FMi) the lowest meaning (minor) of the currently saved Alarms marked alarm in the memory (QueueMi) with priority assigned to the alarms of this importance (minor) is transmitted. 11. The method according to any one of claims 6 to 10, characterized ge indicates the identification of the oldest stored Alarms (SCr, SMa, SMi) of higher importance (Critical, Ma jor, minor) and the marking of continuation alarms (FMa) of this meaning (Critical, Major, Minor) so ver that the chronological order in which the Alarms of this importance (critical, major, minor) have occurred are reconstructable. 12. The method according to any one of the preceding claims, ge indicates by saving an occurring alarm of lower importance (warning) if the memory (QueueWa) with the priority assigned to the alarms of this meaning (warning)  is full, in the free space of the memory with the next higher priority (QueueMi). 13. The method according to any one of the preceding claims, ge characterized by four memories (QueueCr, QueueMa, QueueMi, QueueWa) different priority for the identified Meanings "critical" as the highest meaning, "Large", "Minor" and "Warning" as lowest meaning of alarms. 14. The method according to any one of the preceding claims characterized in that before transmitting the stored alarms to the next higher management level from the elder Most saved alarms (SCr, SMa, SMi, SWa) any meaning level (critical, major, minor, warning) in the memory (QueueCr, QueueMa, QueueMi, QueueWa) with the assigned Priority an alarm parameter that indicates the time of occurrence tens of the alarm indicates being checked to be the absolute oldest stored alarm to determine that this is absolutely the oldest saved alarm to the next higher management level is averaged, the storage space occupied by him as free de it is clarified that a marking of the next oldest ge saved alarms (SCr, SMa, SMi, SWa) of this significance fe in the memory (QueueCr, QueueMa, QueueMi, QueueWa) with the assigned priority is made, and that the Ver drive by comparing the ages of the elderly again Most saved alarms continue in the manner mentioned becomes. 15. The method according to claim 12, characterized in that after sending the last alarm of a meaning level (Critical, Major, Minor or Warning) in the memory (QueueCr, QueueMa, QueueMi or QueueWa) with the assigned Priority if the memory before transmitting the alarms was full, in memory (QueueWa) with the lowest priority after a continuation alarm (FCr, FMa, FMi) this meaning level (critical, major, minor or warning) wanted  to take this into account when comparing the age rank view, and if the memory with the assigned priority was not full before the alarms were transmitted or none Continuation alarm of the relevant meaning is stored, only the age rank of alarms of the other meaning levels (critical, major, minor or warning). 16. The method according to claim 13, characterized in that after transmitting the last continuation alarm of a Be Interpretation level (critical, major, minor) in memory (QueueWa) with the lowest priority if the memory before the Transmission of the alarms was full in the memory (QueueMi) with the second lowest priority after a continuation a larm of this level of meaning (critical, major) is sought, to take this into account when comparing the age rank conditions, and if no continuation alarm of the relevant meaning only the age of alarms is saved other levels of meaning (critical, major, minor or war ning) to compare.