KR19980044280A - How to input a short message into the short message service center database of a cellular system - Google Patents

Abstract

The present invention relates to a method of storing short message information delivered to a short message service center according to a protocol of a teleservice layer in a database when a message cannot be transmitted due to a message incapable state of a called party. Its purpose is to perform an efficient short message entry procedure based on the data structure of a short message database based on a special data structure designed for a recipient-based range query and a subscriber-based random query. The characteristic is that it consists of storing a message for each called party and storing a message for each calling party.

Description

How to input a short message into the short message service center database of a cellular system

The present invention relates to a method for inputting short message information in a database for a short message service center applied to a cellular system. In particular, the short message information delivered to a short message service center according to a protocol of a teleservice layer is used to determine a message incapable state of a called party. It's about how to store it in the database if it can't be sent for a reason.

In general, the provision of a short message service using a mobile communication means enables a subscriber carrying a mobile terminal to send and receive a message of a limited size anytime, anywhere, following voice information transfer between mobile subscribers. For this purpose, a short message service center in a mobile communication network is a system for relaying a limited length of character information between end terminals called SMEs (Short Message Entity). Since the message delivery service must guarantee that the originating subscriber's message is correctly delivered anytime and anywhere, the message to be delivered to the subscriber is lost even if any called party is out of the service area or the terminal is powered off and it is impossible to receive the message. Should not be. Therefore, the short service center has a function of storing a message to be delivered to unreceivable subscribers in a database in the center and delivering the message when it is recognized as receivable. To this end, when the database recognizes that a message received from a calling party cannot be delivered to the called party, it enters the message into the database. However, in the related art, the message delivery service does not guarantee that the originating subscriber's message is correctly delivered anytime and anywhere, and even if any called party is outside the service area or the terminal is powered off, it is impossible to receive the message. There was a problem that the messages were lost because they could not be delivered.

In order to solve the above problems, the present invention performs an efficient short message input procedure according to the data structure of a short message database based on a special data structure designed to be suitable for a recipient-based range query and a caller-based random query. The purpose is to make it work.

A feature of the present invention for achieving the above object is to consist of storing a message for each called party and a message for each calling party.

In addition, the short-term service center database system to which the present invention is applied is an object-oriented database system implemented by an object-oriented concept, and all functions from the structure of data to the program that operates the data are implemented in C ++, an object-oriented language. It is.

1 is a structural diagram of a CMS network to which the present invention is applied;

2 is a block diagram of a short message service center used in the present invention;

3 is a structure of a short message data management proposed in the present invention;

4 is a message entry procedure for a short message database.

The procedure for entering data depends a lot on the database schema. It must be done to maintain access techniques or memory structures. Short message service centers that are the subject of the present invention are being developed a lot, and in particular, the object-oriented database technique is applied rather than the existing widely used relational database system in terms of database system. In addition, since the database of the short message service center supports a new structure of data schema to provide optimal performance by reflecting the characteristics of the short message service management and the short message, the short message database input procedure described in the present invention is performed in the existing database system. It is different from that and enables efficient data management.

1 is a structural diagram of a CMS network to which the present invention is applied. Referring to Figure 1 describes the structure of a CMS network to which the present invention is applied.

This is a form of adding an SMS-MC 106 node to a CDMA digital cellular system in a CMS (CDMA Mobile System) network structure. MS (Mobile Station) 101 is a mobile subscriber station that supports protocol processing for IS-637 short service, EIA-232-E I / F function with PC, and MMI (Man-Machine Interface) function for short service. BTS (Basestation Transceiver System) supports short message transmission and reception through access / paging channel, and BSC (Base Station Controller) supports short message transmission and reception through traffic channel and data burst message to short message format conversion / inverse conversion. Function, and service option processing function (102). MSC (Mobile Switching Center) 103 is a transport protocol processing function for IS-637 short message service, representative number identification and access function of short message service center, public switched telephone network (hereinafter abbreviated as PSTN) (107) It provides relay call processing and trunk access function to short message service center. Visitor Location Register (VLR) 104 is a short message originating subscriber authentication function, incoming and outgoing short message service, subscriber information retrieval function, routing function to incoming short service center, incoming and outgoing subscriber not registered location. Performs the location registration function. The home location register / authentication center (hereinafter abbreviated as HLR / AC) 105 is a mobile subscriber information management function, a routing information management function, a short message service billing function, a short message service authentication function, and an incoming call. Supports a short message receiving notification function of the terminal. The SMS-MC 106 is a system that performs a short message service that delivers a simple character string in a limited size message form between a mobile station and a mobile station and between a mobile station and a short message entity (SME). It is connected by 7 signaling schemes and based on this, the SMS MAP protocol 109 is used to support the store-and-forward function, which is a non-real-time message delivery characteristic. In addition, in order to match with a short service provider (hereinafter, abbreviated as SP) 110, a public Swithched Packet Data network (hereinafter abbreviated as PSPDN) using an X.25 or Ethernet protocol (108) ) Provides additional services that can be expressed in short messages such as weather, travel, road traffic information, credit card authentication and inquiry, remote monitoring, and automatic vehicle navigation.

2 is a block diagram of a short message service center used in the present invention. Referring to Figure 2 describes the configuration of a short message service center used in the present invention.

This is the platform structure of SMS-MC. The short message service center connects four computer systems with UNIX System V as the LAN and is designed to be easy to add depending on the capacity. Intelligent Peripheral (IP) provides users with special resources such as customized announcement devices, voice / language synthesis and recognition devices, DTMF digit receivers, tone generators, and MF tone generators to support input and output of various information to PSTN subscribers. It provides a flexible interaction between and the network (202). Intelligent Network (IN) is No. 7 Provides No.7 protocol stack and No.7 operation management for signaling network access, handles CMS (CDMA Mobile System) MAP protocol and teleservice layer protocol using TCAP API, and transmits and receives data with MC connected via LAN (203). The Message Center (MC) that processes the SMS Service Logic is composed of SMS application functions using a short message database, and provides X.25 and Ethernet interfaces to support PSPDN external service provider matching (201). SMS OAM (Operating and Maintenance) performs the operation maintenance functions such as state management light configuration management of these systems (204).

3 is a structure of a short message data management proposed in the present invention. 3 is a diagram illustrating a short message data management structure proposed in the present invention.

When a core transaction of a short service application using a short message database is informed that any called party can receive a message at any point in time from the present subscriber's location register which oversees registration and location information for all subscribers of the cellular network. All messages stored in the database are retrieved and delivered to the called party. In addition, such a transaction is preceded by a transaction for storing the message in the database when the called party is out of the service area or when the mobile terminal is turned off when the message is to be delivered, and from the database when the message transmission is normally completed. It is assumed that a transaction for deleting a message is performed. At this time, the storage and deletion operation of a message requires processing of one specific message, and thus takes a random access form. In some cases, the query is performed based on the calling party number, the called party number, the time the message is stored, and the message ID. Is performed. However, the message retrieval operation takes the form of a range query that requires retrieval of multiple messages at the same time based on a specific subscriber. 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 message, CMT message, VMN message, EMN message, FMN message, UserAck message, DeliveryAck message, and The message for the supplementary service is divided into a CancellationAck message and includes message information received from service providers connected to the short service center. In the present invention, the message buffers 302, 303, and 304 are defined for each of these message types. The message buffer is a CPT message buffer, a CMT message buffer, a VMN message buffer, an EMN message buffer, or an FMN message buffer. Eight message buffers are allocated, such as UserAck message buffer, DeliveryAck message buffer, and CancellationAck message buffer, and these message buffers are grouped for the same called party for easy retrieval of information. One or more message buffers exist in the group of message buffers 308 and are dynamically allocated or released according to the message input and delete operations. The group of message buffers for the called party must be stored in the same cluster (305, 306) and exclude all disk operations during information retrieval by storing all clusters in cache, i.e., in main memory, as long as the cache area allocated for the short database is available. do. In addition, the address of each of these groups is stored in the recipient message buffer 301 together 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 subscriber number having a random access form, a message buffer is configured for each message type as in a recipient operation method, and the message buffers for the same calling party are grouped and stored in the subscriber message buffer 307. However, only message buffers for a particular sender can be stored in different clusters, and this structure does not degrade data access performance during operation. Also, for fast data retrieval, incoming / outgoing message buffers are stored separately in a specific cluster so that they always reside in main memory.

Hereinafter, with reference to the accompanying drawings will be described in detail one of the preferred embodiments according to the present invention.

The data input procedure of the short service center database proposed in the present invention is provided in the form of a library and is linked to and operated with an application program for storing message information in the database, and its configuration and operation will be described in detail with reference to FIG. 4.

4 is a message input procedure diagram for a short message database. Referring to Figure 4 describes the message input procedure for the short message database as follows.

An application that wants to enter a short message into the database is started by calling the SubmitInsert () procedure with the short message information to be stored for each service. The SubmitInsert () procedure is called first.

In S1, the recipient number is obtained by analyzing the message delivered from the application. Search the subscriber dictionary to get the address of the group of message buffers for that recipient. In S2, it is determined whether the dictionary has obtained the address of the message buffer group.

When the address of the message buffer group is obtained from the dictionary at S2, at S3, the address of the message buffer for the service type of the message inputted from the message buffer group is obtained. In S4, the obtained message buffer is searched for whether a message for the called party number of the input message exists. If there is a message object for the called party in S4, in S5, the address of the message is obtained from the message buffer for each service type. In S6, the message ID of the message is compared with the message ID of the message to be entered using the address where the object is stored. When the message IDs are the same in S6, in S7, a storage time of a message already stored and a storage time of a new message to be stored are compared. If the storage times of the message are the same at S7, the message input is rejected at S8 and the input procedure ends. This is the same message already exists in the database. When there is no message object for the called party in S4, or when the message ID is different in S6, or when the message storage time compared in S7 is different, S9 stores a message to be input. Can be created to create a message class instance for a new message. In S10, the address of the message instance thus generated is stored in the message buffer obtained in S3. Perform the subscriber data configuration procedure. The calling party data storage step can be performed only when it is normally input during the called party data processing, and whether or not to store the input message is already verified, so the data structure is configured without additional verification.

On the other hand, if it is not possible to obtain the address of the message buffer group in the dictionary in S2, S11 creates an instance of a class for a new message because no message exists for the called party. In S12, a message buffer area for a service type of a corresponding message is allocated. Message buffers are then created for each of the eight service types. In S13, the address of the message instance is stored in the newly created message buffer. In S14, the address of the message buffer group to which the corresponding message buffer belongs is stored in the called party dictionary.

After performing S10 or after performing S14, first, in S15, the address of the message buffer group that stores the subscriber message information of the corresponding message is retrieved from the subscriber dictionary. In S16, it is determined whether information in the dictionary is found. If no address of the message buffer group is found from the subscriber dictionary in S16, then S17 creates a new message buffer. In S18, an instance of the message to be input is created. If there is a message buffer group in S16, an instance of a message class is created in S19.

After performing S18 or after performing S19, in S20, the address is stored in the message buffer. In S21, the input procedure is successfully terminated by storing the address of the message buffer group to which the message buffer belongs in the dictionary.

Connect to the message buffer and store the address of the message buffer group in the dictionary.

The procedure as described above is a prerequisite procedure for retrieving and forwarding the messages stored in the database when receiving the message reception status recovery notification of the called subscriber from the subscriber location register in the cellular system. In particular, this procedure is proposed to be performed based on a special data structure designed to be suitable for the recipient-based range query and the originating subscriber-based random query.

The short message input procedure of the short message service center proposed in the present invention as described above supports the efficient operation of the short message database shown in FIG. 3. The structure of this database divides short service into CPT service, CMT service, VMN service, EMN service, FMN service, UserAck service, DeliveryAck service, CancellationAck service, and supplementary service, and manages the message buffer for each of them. The data entry procedure is performed to group message buffers for the same called party for quick data retrieval, thereby ensuring the efficient storage management of the limited memory and the message storage that can support real-time data retrieval.

Claims (5)

Storing a message for each called party; And A method for inputting a short message to a short message service center database of a cellular system, characterized by storing the message for each calling party. The method of claim 1, The recipient message storage step, Analyzing the message delivered from the application to obtain a called party number; Searching the called subscriber dictionary to obtain an address for the group of message buffers for the called party and determining whether an address for the group of message buffers is obtained from the dictionary; Obtaining the address of the message buffer for the service type of the message inputted from the message buffer group when the address for the message buffer group is obtained from the dictionary; Searching the obtained message buffer to search for a message for the called party number of the input message; If there is a message object for the called party, obtaining an address of a message from a message buffer for each service type; Comparing the message ID of the message with the message ID of the message to be input using the address where the object is stored; When the message IDs are the same, comparing a storage time of a message already stored with a storage time of a new message to be stored; When the message storage times are the same because the same message as the message to be newly input already exists in the database, the message input is rejected and the input procedure ends; When the message object for the corresponding called party does not exist, or when the message ID is different, or when the compared message storage times are different, the message to be input can be stored and a new message can be stored. Creating a message class instance for the; Storing the address of the message instance in the obtained message buffer; If no address for the message buffer group is obtained from the dictionary, there is no message for the corresponding called party, so creating an instance of a class for a new message; Allocating an area of a message buffer for a service type of the corresponding message; Storing the address of the message instance in a newly created message buffer; And And storing the address of the message buffer group to which the corresponding message buffer belongs in the destination subscriber dictionary. The method of claim 2, And a message buffer is generated according to eight types of services in the area allocation step, respectively. The method of claim 1, The subscriber message storage step, Can only be performed when the incoming subscriber data is normally input during processing; Method of inputting a short message to a short message service center database of a cellular system, characterized in that the storage of the message to be input has already been verified and constitutes a data structure without additional verification. The method of claim 1, The subscriber message storage step, Determining whether information in the dictionary is found by searching an address of a message buffer group that stores the subscriber message information of the corresponding message from the subscriber dictionary; If no address of the message buffer group is found from the subscriber dictionary, creating a new message buffer; Creating an instance of a message to be input; If the message buffer group exists, creating an instance of a message class; Storing an address in the message buffer; And And storing the address of the message buffer group to which the corresponding message buffer belongs in advance, thereby successfully terminating the input procedure.