KR100205077B1 - The sm deleting method for sms center db in cellular system - Google Patents

Abstract

The present invention relates to a method for deleting short message information in a short message service center database of a cellular system. When a short message service center in a cellular system searches for messages stored in a database and terminates normal delivery to a called party, the transmitted message is transmitted. In addition, when the originating subscriber requests the message transmission after designating the transmission time or the valid time of the message, it is a method for deleting the messages stored in the database without being transmitted after that time, and the short message of the present invention. The deletion method includes a step of calling a deletion procedure, and the procedure called in the step of checking a search condition type and performing message deletion according to an incoming or outgoing subscriber number that is a result of a test, and stored in a database. To incoming subscribers By deleting all the messages sent after all the messages are sent, it is possible to efficiently manage the limited memory and support the real-time data operation, and present only the calling party and the called party number when requesting the deletion of the database. In one case, there is an advantage of improving performance by deleting all types of messages for the subscriber.

Description

How to delete short messages in short service center database of cellular system

The present invention provides a short message service center of a cellular system that performs efficient memory management through dynamic operation of message buffers in a message deletion procedure based on a special data structure designed to be suitable for an incoming subscriber-oriented range query and an outgoing subscriber-based random query. Its purpose is to provide a way to delete short messages in a database.

The present invention relates to a method for deleting short message information in a short message service center database of a cellular system, wherein a short message service state of a called subscriber is recovered from a home location register (HLR) of a short message service center in a cellular system. This method retrieves and stores messages stored in the database when notified and deletes the messages from the database when the messages are delivered normally. In addition, when the calling subscriber requests the message transmission after designating the transmission time or valid time of the message, it is used to delete the messages stored in the database without transmitting the message after that time.

The short message service center in the mobile communication network is a system for relaying to exchange character information of limited length between end terminals called SMEs (Short Message Entity). Therefore, even if any called subscriber exists outside the service area or the terminal is powered off, the message to be delivered to the subscriber should not be lost.

Therefore, the short service center stores a message to be delivered to unreceivable subscribers in a database in the center and delivers the message when it is recognized as receivable.

When the database recognizes that a message received from the calling subscriber cannot be delivered to the called subscriber, the database enters the message into the database, and the called subscriber returns to the service area or powers on the called terminal. When it is possible to receive a message, all stored messages must be sent. When these messages are successfully sent, they must be deleted from the database to efficiently manage the memory resources of the limited system.

Accordingly, the present invention has an object-oriented database system and an operation program implemented by the object-oriented concept, and performs a message deletion procedure by a range query focused on the called subscriber and a random query focused on the originating subscriber. In addition, we will provide a method for deleting short messages that operate an efficient database.

1 is a structural diagram of a CMS network.

2 is a block diagram of a short service center.

3 is a short message data management structure diagram.

4 is a flowchart of a message deletion method for a short message database according to an embodiment of the present invention.

In the short message deleting method provided by the present invention, an application program calls a deletion procedure with key information on a message to be deleted, and the procedure called in the step checks the type of search condition and receives or sends the result of the test. And deleting the message according to the subscriber number.

The data deletion procedure of the short service center database proposed in the present invention is provided in the form of a library and is linked with an application program for storing message information in the database.

Hereinafter, with reference to the accompanying drawings will be described in detail the present invention.

FIG. 1 is a structural diagram of a CMS (CDMA Mobile System) network, FIG. 2 is a schematic diagram of a short message service center, FIG. 3 is a structure of a short message data management structure, and FIG. 4 is a short message data according to an embodiment of the present invention. A flow chart of a message deletion method for a base.

Referring to FIG. 1, the CMS network structure is a form of adding a Short Message Service-Message Center (SMS-MC) node to a Code Division Multiple Access (CDMA) digital cellular system. Public Switched Telephone Network (PSTN) 107, Public Switched Packet Data Network (PSTN) 108, Public Land Mobile Network (PLMN) 111, and IS-637 Short Message Service Mobile subscriber station (MS) 101 supporting protocol processing function, EIA-232-EI / F function with PC, MMI (Man-Machine Interface) function for short service, and short message via access / paging channel BTS / BSC (Basestation Transceiver System / Base Station Controll), which supports message transmission and reception, short message transmission and reception through traffic channels, format burst / back conversion of data burst messages into short messages, and service option processing. er) 102, transport protocol processing function for IS-637 short service, representative number identification and connection function of short service message center, and relay call processing and trunk connection function from the public telephone network 107 to the short service center; MSC (Mobile Switching Center) 103 to provide a short message outgoing subscriber authentication function and incoming and outgoing call processing short message service subscriber information search function, routing to the incoming short message service center, location registration of the incoming and outgoing subscriber not registered Visitor Location Register (VLR) 104 which performs location registration function, mobile subscriber information management function, routing information management function, short service charging classification function, short service authentication function, short message reception of called terminal Subscriber Location Register / Authentication Center (HLR / AC) 105 that supports possible notification function, and between mobile station and mobile station. Hitting consists of a SMS-MC (106) for performing a short message service for transmitting a short message to SME string between the mobile station and the form of a limited size.

The SMS-MC 106 is connected to the MSC 103, the VLR 104, and the HLR / AC 105. It is connected with 7 signaling methods and supports Store-and-Forward function, which is a non-real-time message transmission characteristic using SMS MAP protocol, and based on X25 or Ethernet for matching with Short Service Provider (SP) 110 It is connected to the Public Switched Packet Data Network (PSPDN) 108 as a protocol and can be expressed in short messages such as weather, travel, road traffic information, credit card authentication and inquiry, remote monitoring, and automatic vehicle navigation. Provide service.

Referring to FIG. 2, the short message service center (SMS-MC) 106 connects four computer systems, each of which is a UNIX System V, to an LAN, and is designed to be easily added according to capacity.

The computer system connected to the LAN is a message center (MC) 201, an intelligent peripheral (IP) 202, an intelligent network (IN) 203, an operating maintenan (O) 204, and a second. Description of each code of FIG. Is as follows.

SP I / F: Service Provider Interface

-IP I / F: Intelligent Peripheral Interface

IN I / F: Ingelligent Network Interface

-OM I / F: Operating Maintenance Interface

-SMS Function: Short Message Service Function

SMDB: Short Message DataBase

-IPM: Information Processing Module

-SDM: Statistics Data Module

DB: DataBase

GUI: Guide User Interface

-MC I / F: Message Center Interface

-SS7: Signaling System 7

SIU: Signaling Interface Unit

The IP 202 is composed of a plurality of IPs, to support the input and output of a variety of information to the PSTN 107 subscribers, the announcement system, voice / language customized to E1 R2 / MFC communication with the PSTM 107 It provides flexible interaction between user and network with special resources such as synthesis and recognition device, dual tone multi frequency (DTMF) digit receiver, tone generator, and multi frequency tone generator.

The IN 203 is composed of a SS7 and a plurality of SIUs to provide a No. 7 protocol stack and a No. 7 operation management unit for accessing a No. 7 signal network and use a TCAP API (Transmission Capabilities Application Part Application Program Interface). It handles CMS Manufacturing Automation Protocol (MAP) and Teleservice Layer protocols and sends and receives data to and from MCs connected by LAN.

The MC 201 that processes the SMS Service Logic is composed of SMS application functions using a short message database, and provides an X.25 and Ethernet interface to support PSPDN 108 external service provider matching.

The SMS OM (Operating Maintenance) 204 performs operational maintenance functions such as state management and configuration management of these systems.

Referring to FIG. 3, a data structure for efficient management of short message data includes a called party dictionary 301 for storing called party subscriber information, an outgoing subscriber dictionary 307 for storing outgoing subscriber information; Message buffers 302,303,304 defined by message type, one or more message buffers of eight or less, and a message buffer group 308 grouped for the same called subscriber, and a cluster 305,306. .

The core transaction of the short service application using the database is a function of receiving a message at any time from the subscriber locator 105 which manages registration and location information for all subscribers of the cellular network. When notified of the status, all messages stored in the database are retrieved and the message for the called party is delivered.

Such a transaction is preceded by a transaction that stores the message in the database when the called party is out of the service area or when the mobile terminal is powered off when attempting to deliver the message. The transaction to delete the message is followed.

At this time, the message storage and deletion operation requires a specific message, so it takes the form of random access. In some cases, the query is performed by the calling party number, the called party number, the time the message is stored, and the message ID. do. However, the message retrieval operation takes the form of a range query that requires the retrieval of multiple messages simultaneously based on a particular called party.

The messages to be managed in the short service center can be divided into basic service message and supplementary service message. The messages for basic service are CPT (Cellular Paging Teleservice) message, CMT (Celluler Message Teleservice) message, VMN (Voice Mail Notification) The message, EMN (E-Mail Notification) message, FAX Mail Notification (FMN) message, UserAck message, DeliveryAck message, and CancellationAck message, and the message for the supplementary service received from service providers connected to the short service center There is message information.

In the present invention, message buffers 302, 303 and 304 are defined for each of these message types. The message buffers include a CPT message buffer, a CMT message buffer, a VMN message buffer, an EMN message buffer, an FMN message buffer, a UserAck message buffer, Eight message buffers, such as the DeliveryAck message buffer and the CancellationAck message buffer, are allocated and these message buffers are grouped for the same destination subscriber to easily retrieve information. One or more message buffers exist in the group of message buffers 308 and are dynamically allocated or freed according to message input and delete operations. The group of message buffers for the called subscriber must be stored in the same cluster (305, 306) and exclude disk operations during information retrieval by storing all clusters in cache, i.e., in main memory, as long as the cache area allocated for short databases is available. .

In addition, the address of each of these groups is stored in the called party message buffer 301 along with each called party number so that all messages for that subscriber can be retrieved when retrieving data for any called party. In order to retrieve data through a calling party number having a random access form, a message buffer is configured for each type of message, and the message buffers for the same calling party are grouped and stored in the calling party message buffer 307 as in the called subscriber operating method. However, only message buffers for a particular originating subscriber can be stored in different clusters, and this structure does not degrade data access performance during operation. In addition, for fast data retrieval, the originating and incoming subscriber message buffers are stored separately in a specific cluster so that they always reside in main memory.

With reference to FIG. 4, the procedure for deleting a message for a short message database is described in an embodiment of the present invention. First, after the short message stored in the database has been successfully delivered to the called party, the following database deletion procedure is performed. To do this, the application calls the SMDelete () procedure with key information about the message to be deleted. do.

When the SMDelete () procedure is called from the application program (401), the application program checks the type of condition to search for a message (402). At this time, there are four types of conditions that the application can give. First condition for retrieving test results by first called party number, second calling party number, third calling party number and message ID, fourth calling party number and message storage time. If it is the calling party number, the second condition is searched (403).

If there is no separate search condition as a result of the inspection of the second condition, a message search procedure based on the calling party number is performed in order to delete all messages for any calling party (404), and the search condition stores the calling party number and the message. If it is time to delete only one message that satisfies the two conditions and perform the search procedure accordingly (405), if the search condition is the calling party number and message ID to delete the message also satisfies both conditions A search procedure using the message ID is performed (406). If the search result is found whether the message to be deleted is found (407), if the message is not found, it is determined whether to repeat the deletion procedure (408), and if there is no more message to delete and there is a successful deleted message. If not, copy the failure to the return buffer and exit (409).

At this time, if there is a message to be deleted, the delete procedure is repeatedly performed.

If the message to be deleted normally is found in step 407, it is checked whether the message buffer to which the message is linked has a link to another message (410). If there is a link to another message, delete the instance of that message, free the stored memory (414), then process the data structure for the called party, and if there is no link for the other message, the message buffer Check if other message buffers in the belonging message buffer group are empty (411), if not empty, delete the message buffer and free memory (413), then delete the instance of the message and free the stored memory ( 414) Process the data structure for the next called party, and if all message buffers in the message buffer group checked in step 411 are empty, delete the message buffer group and the message buffer and release the memory (412, 413) and then the message instance. Delete the memory and free the stored memory (414). Deal with Joe. At this time, deleting the message means that the message buffer and the message buffer group to hold the message will not have any messages.

After deleting the data structure for the calling subscriber as described above, the data structure of the called subscriber including the corresponding message should be processed. The procedure for processing the data structure of the called party firstly performs a search procedure using the called party number of the message requested to be deleted (415), then checks whether there is a message to be deleted (416), and then deletes the message to be deleted. If no message is found, perform step 4-B, that is, step 407 to delete the next message. If the message to be deleted is found as a result of step 416, the message buffer to which the message is linked has a link to another message. Check if it exists (417). As a result of the check, if there is a link of another message, the instance of the message is deleted, the stored memory is released (421), and the message deletion procedure is successfully completed (422). Perform step 4-B to delete. As a result of step 417, if there is no link of another message, then it is checked 418 whether another message buffer in the message buffer group to which the message buffer belongs is empty. If it is not empty, delete the message buffer and release the memory (420), then delete the instance of the message, free the stored memory (421), copy the message deletion success to the return buffer (422), and then Follow step 4-B to delete it. If all message buffers are empty as a result of step 417, the message buffer group and the message buffer are deleted (419, 420), then the message instance is deleted, the stored memory is released (421), and the message deletion procedure is successfully performed. Copy it to the return buffer (422) and follow step 4-B to delete the next message.

At this time, deleting the message means that the message buffer and the message buffer group to hold the message will not have any messages.

If the result of the search 402 of the first search condition is that the message is deleted by the called party number, the deletion procedure is first applied to the called party dictionary, the message buffer group, the message buffer, and the actual message object, and accordingly the deletion of the calling party data structure. Has the same procedure as in the case of deleting a message by the calling party number except that occurs.

If the first condition is the called party number, the message search procedure based on the called party number is performed (423), and whether the message to be deleted is found (424).

At this time, if the message is not found, it is determined whether the delete procedure is to be repeatedly performed (425). If there is no message to be deleted and there is a successful deleted message, it is success. Otherwise, the failure is copied to the return buffer. End (426).

If there is a message to delete, the delete procedure is repeatedly performed. If the message to be deleted normally is found in step 424, it is checked whether the message buffer to which the message is linked has a link to another message (427). If there is a link to another message, delete the instance of that message, release the stored memory (431), then process the data structure for the called party, and if no other message link exists, the message buffer Check if other message buffers in the belonging message buffer group are empty (428), if not empty, delete the message buffer and free memory (430), then delete the instance of the message and free the stored memory ( 431) Process the data structure for the next called party, and if all message buffers in the message buffer group checked in step 428 are empty, delete the message buffer group and the message buffer and release the memory (429,430) and then the message instance. Delete the memory and release the stored memory (431). Deal with Joe. At this time, deleting the message means that the message buffer and the message buffer group to hold the message will not have any messages.

After deleting the data structure for the called party as described above, the data structure of the calling party including the corresponding message should be processed. The procedure for processing the data structure of the calling subscriber first performs a search procedure using the calling subscriber number of the message requested to be deleted (432), then checks whether there is a message to be deleted (433), and then deletes the message to be deleted. If no message is found, perform step 4-E, or step 424, to delete the next message. Once the message to be deleted is found as a result of step 433, the message buffer to which the message is linked has a link to another message. Check if there is (434). As a result of the check, if there is a link to another message, it deletes the instance of the message, frees the stored memory (438), and then saves (422) the message deletion procedure to the end. Perform step 4-E to delete. As a result of step 434, if a link of another message does not exist, then it is checked 435 whether another message buffer in the message buffer group to which the message buffer belongs is empty. If not empty, delete the message buffer, free memory (437), delete the instance of the message, free the stored memory (438), copy the successful message deletion to the return buffer (439), and Follow step 4-E to delete.

If all message buffers are empty as a result of step 434, the message buffer group and the message buffer are deleted (436, 437), then the message instance is deleted and the stored memory is released (438), and the message deletion procedure is successfully performed. Copy it to the return buffer (439), then perform steps 4-E to delete the next message.

In the present invention as described above, if only the outgoing subscriber number or the called party number is provided as a search condition, all messages for the calling / called party are removed.

Using the short message deletion method for the short message service center database of the cellular system, all messages corresponding to the called subscriber stored in the database are transmitted, and then all the messages are deleted, thereby efficiently removing the limited memory. It can manage and support real-time data operation.

In addition, when the request for deletion of the database is provided only as a condition of the calling party and the called party number, all types of messages for the subscriber are deleted, thereby reducing the number of interfaces between the application and the database, thereby improving performance.

Claims (16)

Step 100 of calling the deletion procedure with the key information on the message to be deleted by the application, Step 200 of the procedure called in step 100 to check the type of search condition, and result of the check in step 200 A step 300 for checking a search subcondition in the case of an outgoing subscriber number; and a step 400 for performing a search procedure based on the outgoing subscriber number if there is no subcondition in the search subcondition checking result in step 300; A step 500 for checking whether a message is found as a result of the search; a step 600 for checking a repetition condition if the message is not found as a result of step 500; and a repetition condition for the test result of step 600 is not satisfied If not, the cellular system, comprising the step 700 of copying the success or failure of the message to the return buffer How to delete a short message service center database. The method of claim 1, wherein the search condition type of step 200 is a called subscriber number and an outgoing subscriber number. The method of claim 1, wherein the search retrieval type in step 300 is a message storage time and a message ID. The method of claim 1, wherein the step 500 includes checking whether the message buffer is empty when the message is found as a result of the checking, and if the buffer of the message is empty as a result of the checking of the step 510, the message Step 520 of checking whether the buffer group is empty; if the buffer group of the message is empty as a result of the checking of step 520, deleting the message buffer group and releasing the memory; The short-term service center data of the cellular system comprising the step 540 of releasing the message, the step 550 of releasing the memory after deleting an instance of the message, and the step 560 of processing a data structure for the called party. How to delete short messages to the base. 5. The cellular system of claim 4, wherein the step 510 omits steps 520, 530, and 540 when the message buffer is not empty and a link of another message exists. How to delete short messages to a short message center database. 5. The method of claim 4, wherein the step 520 omits the step 530 when the message buffer group is not empty. 5. The method of claim 4, wherein step 560 is a step 561 of performing a search procedure based on a called subscriber number, a step 562 of checking whether there is a corresponding message as a result of step 561, and a corresponding message as a result of step 562. If the message buffer is empty as a result of step 563, and if the message buffer group is empty, step 564 is checked to see if the message buffer group is empty; and as a result of step 564, the message buffer group is checked. If empty, step 565 of releasing memory after deleting the corresponding message buffer group; step 566 of releasing memory after deleting the corresponding message buffer; and step 567 of releasing memory after deleting an instance of the message; Cell system comprising the step 568 of copying the data to the return buffer and then deleting the next message. How to delete a short message to the short message service center database. The short message service center data of the cellular system according to claim 7, wherein step 563 omits steps 564, 565, and 566 if the test result message buffer is not empty. How to delete short messages to the base. 10. The method of claim 7, wherein step 564 is omitted if the test buffer group is not empty, and step 565 is omitted. The method of claim 1, wherein the step 200 is a step 210 of performing a search procedure based on a called subscriber number when the check result of the step 200 is a called subscriber number; Step 220 of checking whether or not, if there is a corresponding message as a result of the check in step 220, checking whether the corresponding message buffer is empty, and if the message buffer is empty as a result of step 230, the corresponding message buffer Step 240 of checking whether the group is empty; if the corresponding message buffer group is empty as a result of step 240, step 250 of deleting the message buffer group after releasing the message buffer group; and releasing memory after deleting the message buffer group; Step 260, step 270 of releasing memory after instance deletion of a corresponding message, and step 280 of processing a data structure for an originating subscriber; And deleting the short message from the short service center database of the cellular system. The method of claim 10, wherein the step 220 is a step 221 of checking a repeat execution condition if a corresponding message is not found as a result of the check; and failure or success of deleting a message if the repeat execution condition is not satisfied as a result of the step 221. And a step 222 of copying to a return buffer. 11. The short message service database of claim 10, wherein step 230 omits step 240, step 250, and step 260 if the check result message buffer is not empty. How to delete short messages for. 11. The method of claim 10, wherein in step 240, if the test result message buffer group is not empty, step 250 is omitted. 11. The method of claim 10, wherein step 280 includes steps 281 for performing a search procedure based on a calling party number, step 282 for checking whether a corresponding message is found as a result of step 281, and a corresponding message as a result of step 282. If there is, step 283 of checking whether the corresponding message buffer is empty; if the message buffer is empty as a result of step 283, checking of whether the corresponding message buffer group is empty; If the buffer group is empty, step 285 of releasing memory after deleting the message buffer group; step 286 of releasing memory after deleting the message buffer; and step 287 of releasing memory after deleting the corresponding message; And copying the successful deletion to the return buffer and performing a retrieval procedure based on the called party number again. How to delete a short message to the short message service center database of cellular systems. 15. The short service center database of claim 14, wherein step 283 omits step 284, step 285, and step 286 if the check result message buffer is not empty. How to delete short messages for. 15. The method of claim 14, wherein in operation 284, if the test result message buffer group is not empty, the operation 285 is omitted.