KR100246607B1 - Unique identifier creation method for telecommunication system - Google Patents

Abstract

1. TECHNICAL FIELD OF THE INVENTION

The present invention relates to a method of generating a unique identifier at a particular point in time for a communication system.

2. The technical problem to be solved by the invention

SUMMARY OF THE INVENTION The present invention seeks to provide a unique identifier generation method at a specific time for a communication system in which each function is performed online and dynamically performed according to the user's use of the system, so that the function can be performed in a totally balanced time. box.

3. Summary of Solution to Invention

The present invention eliminates the initial preparation time for generating an identifier, the time for generating a new identifier, the time required to find out which identifier is currently being used, the time for destroying the used identifier, and the function for generating the identifier. In this case, the identifiers are generated at a specific point in time as soon as possible within a realistic range.

4. Important uses of the invention

The present invention is used to generate an identifier of a communication network system.

Description

Unique identifier generation method at specific time for communication system

The present invention relates to a method of generating an unique identifier at a particular time in which an identifier is efficiently generated for use as a identifier in a call management system and a communication network management system.

In general, network management system software or switching system software requires an identifier that is uniquely defined at a particular time. That is, such an identifier is used to identify currently connected calls in the switching system, and there is a need for a method capable of generating and managing a uniquely defined identifier at a specific time in order to represent connected calls as managed objects in the network management system software.

The management of these identifiers requires requirements to improve system efficiency. These requirements include the initial preparation time for creating an identifier, the time to create a new identifier, the time it takes to find out which identifier is currently in use, the time to destroy an identifier that has been used, and the ability to create an identifier. The time to extinguish the signal must be feasible as soon as possible within a realistic range.

1 is an explanatory diagram showing a data structure for a conventional simple identifier generation method.

First, in the conventional identifier generation method, a table having N elements is generated as a preliminary preparation process for identifier management, and an unused mark is displayed for each. Here, N represents the maximum number of identifiers, and n represents the number of identifiers being used.

After that, the entire table created to generate the identifier is searched for, and the unused one is marked as used and the corresponding position is written as an identifier.

Then, it is checked whether the table is used or unused at the position of the generated table to check whether the identifier is used, and the corresponding position of the generated table is marked as unused to destroy the identifier.

Next, delete the table to destroy the identifier management function.

The time required for the conventional identifier generation method as described above is as follows.

The initial preparation time for generating an identifier is O (N), the time required for generating a new identifier is O (N), the time required for checking whether an identifier is currently used is O (1), and the completed identifier The time required to extinguish is O (1), and the time required to extinguish the function of generating the identifier is O (1). Here, O (1) indicates that it can be performed with a constant time, and O (N) indicates time required in proportion to N.

Therefore, the conventional identifier management method has a problem that the user may feel uncomfortable during initial preparation for generating an identifier and generation of a new identifier by implementing only a function without considering time.

2 is an explanatory diagram showing a data structure for a conventional identifier generation method.

Conventional identifier generation methods use a linked list to indicate an identifier that is currently in use and an identifier that is not in use, indicating the beginning of the used identifier in the odd-numbered item and the beginning of the unused identifier in the even-numbered item. That is, 1 to i-1 represent unused identifiers, and i to j-1 represent used identifiers.

First, the conventional identifier generation method creates a list of three elements in initial preparation for generating an identifier, and records 0, 1, and N + 1, respectively. Here, N represents the maximum number of identifiers.

Then, use the second item value of the linked list as an identifier to create a new identifier. Here, if the second item is i and the third item is j, if i + 1 is j, the second and third items are deleted. If i + 1 is less than j, the second item is changed to i + 1.

Then, to find out which identifier is currently used, the list is searched to find out whether it is an even numbered item or an odd numbered item.

Next, the list is searched to find an interval i including the identifier j by searching the list to destroy the used identifier. Here, if the interval i including the identifier j is odd, it is an abnormal case that is not in use. If the interval i including the identifier j is the even number, it is appropriately adjusted.

If it is adjacent to the next item, the current item and the next item are deleted. If it is not adjacent to the next item, the item having i is divided into three items and i, j, and j + 1 are recorded in each of them.

Finally, to eliminate the ability to generate identifiers, delete the list one by one from the beginning.

Looking at the time required for the conventional identifier generation method as described above, the initial preparation time for generating the identifier and the time required for generating a new identifier are O (1), the time required to confirm the use of the identifier, the used identifier The time required to extinguish, and the time required to extinguish the function of generating the identifier is O (n). Here, O (n) represents a time requirement proportional to n.

The conventional identifier generation method as described above has a problem that it takes too long for each process to perform a specific function by achieving the desired purpose only by the function without considering the time by configuring the elements for each used section. .

The present invention devised to solve the above problems is specific for a communication system that allows each function to be performed online and dynamically performed according to the user's use of the system, so that it can be performed in an even and fast time as a whole. The purpose is to provide a unique identifier generation method at the time.

1 is an explanatory diagram showing a data structure for a conventional simple identifier generation method.

2 is an explanatory diagram showing a data structure for a conventional identifier generation method.

Figure 3 is an embodiment explanatory diagram showing a data structure used in the present invention.

4A-4E are flow diagrams of one embodiment of an identifier generation procedure in accordance with the present invention.

According to an aspect of the present invention, there is provided a method of generating a unique identifier at a specific point in time for a communication system, the method comprising: generating a search tree to generate an identifier and adding unused data to the search tree; Creating a new identifier and adding it to the previous item; A third step of searching for an identifier for checking whether to use the search tree in the search tree and checking whether the stored data value is used; A fourth step of searching the search tree for deleting the used identifier, deleting the previous item, and adding and inserting the identifier; And a fifth step of sequentially deleting from the first item to the last item of the search tree.

Hereinafter, with reference to the accompanying drawings will be described an embodiment according to the present invention;

3 is a data structure diagram used in the present invention, which is an embodiment of a data structure for generating an identifier using a search algorithm.

Search the interval using the search key by comparing the first element. That is, a search tree is constructed by using the interval between the identifier in use and the identifier not in use as one element and using it as a key.

4A through 4E are flowcharts of one embodiment of an identifier generation procedure according to the present invention.

The method in which the identifier is used in the network management system requires an identifier to represent a connection when an object representing one exchange area is created, and the identifier is dynamically generated and deleted according to the operation of the system. Therefore, when the object representing the exchange area is not necessary, the function of generating the identifier is also unnecessary, thereby deleting the identifier.

In this way, a function of generating and destroying a function and generating an identifier from the generated function is performed dynamically, which is performed online according to a request of a network management system and dynamically performed according to a user's use of a system. Thus, all of this generation, destruction, identifier generation, and identifier destruction functions have time to respond separately to the user.

In order for the execution time limit to be less than or equal to O (nlogn), consideration should be given to the initial preparation time for generating the identifier and the time to dissipate the function for generating the identifier, where n is the number of identifiers actually used and the maximum possible identifier. It is important to check whether the number of. Therefore, when n is the number of identifiers actually used in the use environment of the identifier management function, it can be regarded that O (n), O (nlogn), and O (1) are the same at the time of disappearance of the identifier generation function. Here, O (nlogn) represents a time requirement proportional to nlogn.

According to the present invention, a search tree is constructed using an identifier in use and an identifier interval not in use as a single element, and as a key (see FIG. 3).

In order to express the order in the search tree for the elements (p, q) of the key, Equation 1 is expressed. Here, the element of the key consists of a and b representing the minimum and maximum values of the interval, respectively.

p of b <q of a → p <q

b of q <a of p→q> p

a of p ≤ a of q and b of ≥ q of b → p = q

a of q ≤ a of p and b of q ≥ p of b → p = q

As shown in Equation 1, the search tree determines the order and stores whether the identifier is used as data mapped to each key.

The method of generating a unique identifier at a specific time point according to the present invention is as follows.

An initial preparation process for generating an identifier (see FIG. 4A), first, creates a search tree using the interval between the in-use identifier and the unused identifier as one element and using the key as a component (101), (1, n) The key is used to add unused data to the search tree (102).

In the process of generating a new identifier (see FIG. 4B), if the key of the second term of the first search tree is (i, j), i is assigned to the identifier (201).

Next, the assigned identifier (i) is transferred to the previous item to make the key of the previous item (x, y) (203), and the identifier (i) is added to the previous item in the list to delete the key of the previous item. After 204, the key of the previous item is (x, i) and the data usage is added to the search list (205).

Finally, delete the key (i, j) of the second term of the search tree and add (i + 1, j) instead (206).

In the process of checking whether the identifier is currently used (refer to FIG. 4C), if the identifier to be used is i, it is determined in the search tree by using (i, i) as a key (301) and determines whether the stored data value is used (302). ).

As a result of the determination, if the current data value is used, it is recognized as used (304), and if not used, it is recognized as not used (305).

The process of destroying the used identifier (see FIG. 4D) is as follows.

First, in order to stop the use of the identifier (i), a search is made in the search tree using (i, i) as a key (401).

If the item found in the search tree is (l, m) (402), (l, m) is the key (402).

At this time, if i is l (403), it deletes (l, m) and adds (i + 1, m) (404), and after deleting the previous item, i is added to the previous item and inserted again (405). . If i is not l but m (406), (l, m) is deleted, (l, m-1) is inserted (407), the next item is deleted and i is added again and inserted (408). Also, if i is not l and m, (l, m) is deleted (409), (l, i-1), (i, i), and (i + 1, m) divided into three sections. After inserting again (410 to 412). In this case, (l, i-1) stores data by use (410), (i, i) stores data by unuse (411), and (i + 1, m) stores data by use. (412).

In the process of destroying the identifier management function (see FIG. 4E), the first item of the search tree is deleted in order from the last item (501 to 503). In other words, it is determined whether there is an item remaining (501) and if there is an item remaining, the item is deleted (503) and then it is determined whether there is an item remaining from the beginning (501). Delete (502).

In the method of generating a unique identifier at a specific time point according to the present invention, the time required to perform each function is as follows.

The time to create a new identifier, the time to find out which identifier is currently being used, and the time to destroy the used identifier represent a time duration proportional to nlogn. In addition, the initial preparation time for generating the identifier may be performed as a constant time, and the time for extinguishing the function for generating the identifier represents a time requirement proportional to n. Where n is the number of identifiers actually used.

The present invention described above is capable of various substitutions, modifications, and changes without departing from the spirit of the present invention for those skilled in the art to which the present invention pertains, and the above-described embodiments and accompanying It is not limited to the drawing.

The present invention as described above, each function is performed online and dynamically performed according to the user's use of the system to efficiently generate an identifier for identifying a managed object, performing each function in less than nlogn time to balance the overall There is an effect that can be carried out evenly and quickly.

Claims (8)

A method of generating a unique identifier at a particular point in time for a communication system, A first step of generating a search tree to generate an identifier and adding unused data to the search tree; Creating a new identifier and adding it to the previous item; A third step of searching for an identifier for checking whether to use the search tree in the search tree and checking whether the stored data value is used; A fourth step of searching the search tree for deleting the used identifier, deleting the previous item, and adding and inserting the identifier; And The fifth step of deleting the first item of the navigation tree from the last item in order Unique identifier generation method at a specific time for a communication system comprising a. The method of claim 1, The first step is, A sixth step of constructing a search tree by using the interval between the identifier in use and the identifier not in use as one element and using the same as a key; And Step 7 of adding unused data to the search tree Method of generating a unique identifier at a specific point in time for a communication system comprising a. The method according to claim 1 or 2, The second step, An eighth step of allocating an identifier from the key of the second term of the generated search tree; A ninth step of transmitting the assigned identifier to the previous item and deleting the key of the previous item by adding the identifier to the previous item of the list; A tenth step of additionally generating an identifier to a key of the new item and adding data usage to a search list; And Eleventh step of adding a new key by deleting the key of the second term of the search tree Method of generating a unique identifier at a specific point in time for a communication system comprising a. The method of claim 3, wherein The third step, A twelfth step of determining whether a data value stored in the search tree is used, using the identifier to be checked for use as a primary key; And As a result of the determination of the twelfth step, the thirteenth step of recognizing that the current data value is used is used, and recognizing that the data is not used. Method of generating a unique identifier at a specific point in time for a communication system comprising a. The method of claim 4, wherein The fourth step, A fourteenth step using an item found in the search tree as a key using the identifier to be disabled as a primary key; A fifteenth step of deleting the found item and reinserting the identifier in the previous item if the identifier is a left element of the search item; If the identifier is a right element of the search item, deleting the found item and reinserting the identifier in the next item; And If the identifier is not an element of the found item, the 17th step of deleting the found item, separating it into a plurality of items and inserting again Method of generating a unique identifier at a specific point in time for a communication system comprising a. The method according to claim 4 or 5, The fifth step, An eighteenth step of determining whether there are any items remaining in the search tree; And As a result of the determination of the eighteenth step, if there is a remaining item, after deleting the item, it is checked whether there is a remaining item from the beginning, and if there is no remaining item, a nineteenth step of deleting the search tree Method of generating a unique identifier at a specific point in time for a communication system comprising a. The method of claim 2, The search tree of the sixth step, If the maximum value of the key left element is less than the minimum value of the key right element, the left element is smaller than the right element. If the maximum value of the key right element is less than the minimum value of the key left element, the right element is larger than the left element. If the minimum value is less than or equal to the minimum value of the key right element and the maximum value of the key left element is greater than or equal to the maximum value of the key right element, the left and right elements are equal, and the minimum value of the key right element is less than or equal to the minimum value of the key left element. Equal and greater than or equal to the maximum value of the key left element, the left element and the right element define the same order and store whether the identifier is used as data mapped to each key. How to generate a unique identifier at a given point in time. The method of claim 1, The time required to generate the unique identifier is The time to create a new identifier, the time it takes to find out which identifier is currently being used, and the time to destroy the used identifier are multiplied by the number of users actually used and the number of users actually logged (nlogn). In this case, the initial preparation time for generating the identifier can be performed as a constant time, and the time for displacing the function for generating the identifier indicates the time required in proportion to the number of identifiers actually used. Unique identifier generation method at a specific time for a communication system.

Images