CN116261109A - Long short message splicing method and system - Google Patents

Long short message splicing method and system Download PDF

Info

Publication number
CN116261109A
CN116261109A CN202310544699.7A CN202310544699A CN116261109A CN 116261109 A CN116261109 A CN 116261109A CN 202310544699 A CN202310544699 A CN 202310544699A CN 116261109 A CN116261109 A CN 116261109A
Authority
CN
China
Prior art keywords
short message
data
splicing
long
fragment
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Granted
Application number
CN202310544699.7A
Other languages
Chinese (zh)
Other versions
CN116261109B (en
Inventor
齐博
古鹏
邓双伍
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Beijing Jiujia Xintong Technology Co ltd
Original Assignee
Beijing Jiujia Xintong Technology Co ltd
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Beijing Jiujia Xintong Technology Co ltd filed Critical Beijing Jiujia Xintong Technology Co ltd
Priority to CN202310544699.7A priority Critical patent/CN116261109B/en
Publication of CN116261109A publication Critical patent/CN116261109A/en
Application granted granted Critical
Publication of CN116261109B publication Critical patent/CN116261109B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04WWIRELESS COMMUNICATION NETWORKS
    • H04W4/00Services specially adapted for wireless communication networks; Facilities therefor
    • H04W4/12Messaging; Mailboxes; Announcements
    • H04W4/14Short messaging services, e.g. short message services [SMS] or unstructured supplementary service data [USSD]
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L69/00Network arrangements, protocols or services independent of the application payload and not provided for in the other groups of this subclass
    • H04L69/22Parsing or analysis of headers
    • YGENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
    • Y02TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
    • Y02DCLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
    • Y02D30/00Reducing energy consumption in communication networks
    • Y02D30/70Reducing energy consumption in communication networks in wireless communication networks

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Computer Security & Cryptography (AREA)
  • Data Exchanges In Wide-Area Networks (AREA)

Abstract

The invention discloses a method and a system for splicing long short messages, which relate to the technical field of short message splicing, and the method comprises the following steps: protocol unpacking is carried out on each short message received by the short message gateway, and a plurality of fragment data of each short message are obtained; the fragment data comprises protocol header information; judging whether the slicing data are long short message slicing or not according to the type identification of the short message to which the slicing data belong; if the slicing data is long short message slicing, storing the slicing data into a long short message slicing queue; and when the number of the fragment data of any short message in the short message fragment queue is equal to the total number of fragments of the short message, performing short message splicing on the fragment data of the short message to obtain the spliced long short message. The invention avoids the situation that the fragmented data of the same long short message is randomly stored in the cache queues of different back-end examples by storing the unpacked long short message fragments into the shared long short message fragment queue, and improves the success rate and the processing efficiency of long short message splicing.

Description

Long short message splicing method and system
Technical Field
The invention relates to the technical field of short message splicing, in particular to a method and a system for splicing long short messages.
Background
The common method for splicing the long short messages is to distribute the client requests of the same IP source to the same back-end instance by setting a load balancing strategy, and distribute the same piece of super-long short message slicing data to the same back-end instance for short message splicing. However, in the short message splicing process, a plurality of IP clients submit the same piece of super-long short message slicing data, and when a plurality of clients simultaneously submit the same piece of super-long short message slicing data to a short message gateway, the long short message slicing may enter cache queues of different back-end examples, so that when each process performs short message splicing, the complete long short message slicing cannot be obtained, and the problem that splicing cannot occur.
Disclosure of Invention
The invention aims to provide a method and a system for splicing long short messages, which are used for improving the success rate of short message splicing when a plurality of IP clients submit the same piece of long short message slicing data.
The invention provides a long short message splicing method, which comprises the following steps:
protocol unpacking is carried out on each short message received by a short message gateway, and a plurality of fragment data of each short message are obtained; the fragment data comprises protocol header information; the protocol header information comprises the total number of fragments of the short message to which the corresponding fragment data belongs, the sequencing serial number of the corresponding fragment data in the short message to which the corresponding fragment data belongs and the type identifier of the short message to which the corresponding fragment data belongs;
judging whether the slicing data are long short message slicing or not according to the type identifier of the short message to which the slicing data belong;
if the fragment data is a long short message fragment, storing the fragment data into a long short message fragment queue;
and when the number of the fragment data of any short message in the short message fragment queue is equal to the total number of fragments of the short message, performing short message splicing on the fragment data of the short message to obtain the spliced long short message.
Optionally, performing short message splicing on the segmented data of the short message to obtain a spliced long short message, which specifically includes:
the piece data of the short message is put into a lock queue;
and performing short message splicing on the segmented data in the lock queue to obtain the spliced long short message.
Optionally, before performing the short message splicing on the fragment data in the lock queue, the method further includes:
storing a short message splicing process identifier and a gateway module identifier of the short message into the lock queue;
after the spliced long short message is obtained, the method further comprises the following steps:
judging whether the lock queue has the short message splicing process identifier and the gateway module identifier or not; if yes, outputting the spliced long short message; and if not, deleting the spliced long short message.
Optionally, the performing short message splicing on the fragment data in the lock queue to obtain a spliced long short message specifically includes:
sequencing the sliced data according to the sequencing sequence number of the sliced data in the lock queue;
and splicing the sequenced segmented data to obtain the spliced long short message.
Optionally, after storing the fragment data in the long short message fragment queue, the method further includes:
and recording the number of the fragment data of each short message in the long message fragment queue.
The invention also provides a long short message splicing system, which comprises:
the data processing module is used for carrying out protocol unpacking on each short message received by the short message gateway to obtain a plurality of fragment data of each short message; the fragment data comprises protocol header information; the protocol header information comprises the total number of fragments of the short message to which the corresponding fragment data belongs, the sequencing serial number of the corresponding fragment data in the short message to which the corresponding fragment data belongs and the type identifier of the short message to which the corresponding fragment data belongs;
the data judging module is used for judging whether the fragment data is a long short message fragment or not according to the type identifier of the short message to which the fragment data belongs;
the data storage module is used for storing the fragment data into a long short message fragment queue if the fragment data are long short message fragments;
and the data splicing module is used for carrying out short message splicing on the segmented data of the short messages when the number of the segmented data of any short message in the short message segmented queue is equal to the total number of the segments of the short messages, so as to obtain the spliced long short messages.
Optionally, the data stitching module includes:
the data storage unit is used for placing the fragment data of the short message into a lock queue;
and the data splicing unit is used for carrying out short message splicing on the segmented data in the lock queue to obtain the spliced long short messages.
Optionally, the data stitching module further includes:
the identification embedding unit is used for storing the short message splicing process identification and the gateway module identification of the short message into the lock queue;
the identification recognition unit is used for judging whether the short message splicing process identification and the gateway module identification exist in the lock queue after the spliced long short messages are obtained; if yes, outputting the spliced long short message; and if not, deleting the spliced long short message.
Optionally, the data stitching unit further includes:
the data sorting subunit is used for sorting the sliced data according to the sorting sequence number of the sliced data in the lock queue;
and the data splicing subunit is used for splicing the sequenced segmented data to obtain the spliced long short message.
Optionally, the system further comprises:
and the data recording module is used for recording the number of the fragment data of each short message in the long message fragment queue.
According to the specific embodiment provided by the invention, the invention discloses the following technical effects:
the invention provides a method and a system for splicing long short messages, wherein the method comprises the following steps: protocol unpacking is carried out on each short message received by the short message gateway, and a plurality of fragment data of each short message are obtained; the fragment data comprises protocol header information; the protocol header information comprises the total number of fragments of the short message to which the corresponding fragment data belongs, the sequencing serial number of the corresponding fragment data in the short message to which the corresponding fragment data belongs, and the type identifier of the short message to which the corresponding fragment data belongs; judging whether the slicing data are long short message slicing or not according to the type identification of the short message corresponding to the slicing data; if the slicing data is long short message slicing, storing the slicing data into a long short message slicing queue; and when the number of the fragment data of any short message in the short message fragment queue is equal to the total number of fragments of the short message, performing short message splicing on the fragment data of the short message to obtain the spliced long short message. According to the invention, the unpacked long short message fragments are stored into the shared long short message fragment queue, so that the situation that the fragment data of the same long short message is possibly randomly stored into the cache queues of different back-end examples to cause the failure of long short message splicing is avoided; and when the long short messages are spliced, only the short messages with the number of the short message slicing data equal to the total number of the short message slicing in the long short message slicing queue are spliced, so that the situation that the complete long short message slicing cannot be acquired in the short message splicing process is avoided, and the success rate and the processing efficiency of the long short message splicing are improved.
Drawings
In order to more clearly illustrate the embodiments of the present invention or the technical solutions of the prior art, the drawings that are needed in the embodiments will be briefly described below, it being obvious that the drawings in the following description are only some embodiments of the present invention, and that other drawings may be obtained according to these drawings without inventive effort for a person skilled in the art.
Fig. 1 is a schematic diagram of a method for splicing long short messages according to an embodiment of the present invention;
fig. 2 is a schematic diagram of a conventional long short message packet flow according to an embodiment of the present invention;
fig. 3 is a schematic flow diagram of a multi-process-based long short message packet according to an embodiment of the present invention;
fig. 4 is a schematic diagram of a long short message splicing process according to an embodiment of the present invention.
Detailed Description
The following description of the embodiments of the present invention will be made clearly and completely with reference to the accompanying drawings, in which it is apparent that the embodiments described are only some embodiments of the present invention, but not all embodiments. All other embodiments, which can be made by those skilled in the art based on the embodiments of the invention without making any inventive effort, are intended to be within the scope of the invention.
The invention aims to provide a method and a system for splicing long short messages, which are used for improving the success rate of short message splicing when a plurality of IP clients submit the same piece of long short message slicing data.
In order that the above-recited objects, features and advantages of the present invention will become more readily apparent, a more particular description of the invention will be rendered by reference to the appended drawings and appended detailed description.
The invention provides a long short message splicing method, as shown in figure 1, which comprises the following steps:
step 1: protocol unpacking is carried out on each short message received by a short message gateway, and a plurality of fragment data of each short message are obtained; the fragment data comprises protocol header information; the protocol header information comprises the total number of fragments of the short message to which the corresponding fragment data belongs, the sequencing serial number of the corresponding fragment data in the short message to which the corresponding fragment data belongs, and the type identifier of the short message to which the corresponding fragment data belongs.
Step 2: and judging whether the slicing data are long short message slicing or not according to the type identification of the short message to which the slicing data belong.
Step 3: if the fragment data is a long short message fragment, storing the fragment data into a long short message fragment queue;
step 4: and when the number of the fragment data of any short message in the short message fragment queue is equal to the total number of fragments of the short message, performing short message splicing on the fragment data of the short message to obtain the spliced long short message.
When the short message is spliced, the value of TP_udi in the short message protocol is set to be 1, and the short message content contains protocol header information. The protocol header information generally includes a protocol header with a length of 6 and a length of 7, and in this embodiment, the protocol header with a length of 6 is taken as an example, which is specifically as follows:
6-bit protocol header format: 05 00 XX MM NN.
Wherein, byte1:05 represents the length of the rest protocol header; byte2:00, this value being specified in the GSM03.40 specification 9.2.3.24.1, indicating that the length of the identification bit of the subsequent batch of overlength messages is 1 (XX value in format); byte3:03, this value representing the length of the remaining short message identifier; byte4 XX, unique identification of the batch of short messages. byte5 MM, number of messages in the batch. If a total of 5 ultra-long messages are received, the MM is 5.byte 6-NN, the number of the batch of short messages. If the current message is the first message in the batch, the NN is 1, and if the current message is the second message, the NN is 2.
For example: 05 00 03 39 02 01 protocol header total 6 bytes.
Wherein, byte one: the length of the protocol head is fixedly filled with 0x05; 2. byte two: the protocol head type mark is fixedly filled with 0x00 to represent a long short message; 3. byte three: the length of the sub-protocol is fixedly filled with 0x03, which represents the length of the last three bytes; 4. byte four to byte six: the protocol content is as follows: 1) Byte four: the reference numbers of the long short messages are different from each reference number sent by each SP to each user, and 1 can be added at each time from 0, so that the same terminal can conveniently identify different long short messages of the same SP at maximum 255; 2) Byte five: the total short message number of the long short message is from 1 to 255, and the general value should be more than 2; 3) Byte six: the position or serial number of the piece of data in the long short message is from 1 to 255, the first piece is 1, the second piece is 2, and the last piece is equal to the value of the fourth byte.
In some embodiments, when the number of the fragment data of any short message in the long message fragment queue is equal to the total number of fragments of the short message, short message splicing is performed on the fragment data of the short message, so as to obtain a spliced long message, which may specifically be as follows:
and when the number of the fragment data of any short message in the long message fragment queue is equal to the total number of fragments of the short message, the fragment data of the short message in the long message fragment queue is put into a lock queue.
For example, the short message gateway receives the short message a, the short message B and the short message C through a plurality of IP clients, at this time, the load balance distributes the slicing work of the short message a, the short message B and the short message C to each process according to the current load carried out by each short message slicing, and each process uniformly stores the short message slicing into the public redis long short message slicing queue after carrying out the short message slicing on the short message a, the short message B and the short message C. At this time, the short message slicing queues have different quantities of slicing data of short message A, short message B and short message C, and once the quantity of the short message slicing of short message A, short message B or short message C in the short message slicing queues is the same as the total quantity of the short message slicing of the short message, the short message A meets the splicing condition, and the slicing data of the short message A in the short message slicing queues are put into the lock queue. And then, performing short message splicing on the fragment data of the short message A in the lock queue to obtain the spliced long short message.
In some embodiments, before performing the short message splicing on the fragmented data in the lock queue, the method may further include:
and storing the short message splicing process identifier and the gateway module identifier of the short message into the lock queue.
Specifically, writing a key with a long short message identifier into the queue name of the to-be-spliced fragment queue; the corresponding values of the key with the long short message identifier are the thread identifier (short message splicing process identifier) and the gateway module identifier.
Wherein in the redis's lock queue, the key's key is typically placed in the name of the queue, rather than in the value as in a normal key-value pair. For example, assuming we use the List data structure of Redis as a lock queue, when put into a key with a long short message identifier as key, it may be set as: LPUSH lock: long_sms_key < value >, wherein lock is the name of the queue, long_sms_key is the unique identification of the long short message, and < value > is the value corresponding to the key, including the thread identification and gateway module identification combination. In this way, redis will take the lock long sms key as the name of the queue, and the key identified by the long short message as the key is placed in the name of the queue, so that locking and unlocking operations can be conveniently performed, and repetition and confusion of the key are avoided.
After the spliced long short message is obtained, the method further comprises the following steps:
judging whether the lock queue has the short message splicing process identifier and the gateway module identifier or not; if yes, outputting the spliced long short message; and if not, deleting the spliced long short message.
Specifically, taking a short message splicing logic 1 as an example, when in splicing, a key with a long message identifier as a key is put into a lock queue of redis, the key is a combination of a thread identifier and a gateway module identifier, the long message splicing logic 1 proves that when the short message is spliced, after the short message is spliced, the key with the long message identifier as the key is identified again, if the combination of the thread identifier and the gateway module identifier is found, when the short message splicing logic 1 splices the short message A, no other splicing logic interference or the short message A is found, if the combination of the thread identifier and the gateway module identifier is found, the other splicing logic interference or the short message A is found, and when other splicing logic splices, the thread identifier and the gateway module identifier are updated into other splicing logic. Therefore, the short message splicing logic 1 is not the latest splicing of the A short message, so that the A short message spliced by the short message splicing logic 1 is deleted, and the wrong A short message is prevented from being output.
In some embodiments, performing short message splicing on the fragment data in the lock queue to obtain a spliced long short message may specifically include:
and sequencing the sliced data according to the sequencing sequence number of the sliced data in the lock queue.
And splicing the sequenced segmented data to obtain the spliced long short message.
Specifically, taking the short message splicing logic 1 as an example for splicing the short message A, after the sliced data of the short message A in the long message sliced queue is put into the lock queue, the sliced data in the lock queue may not be sequenced in sequence, so that the splicing is failed. Therefore, according to the sequencing sequence number (byte six of the protocol header) of each piece of data, sequencing the piece of data to obtain sequenced piece of data, and then performing short message splicing on the piece of data of the short message by adopting a multithreading technology to obtain the spliced long short message.
In some embodiments, after storing the fragment data in the long short message fragment queue, recording the number of fragment data of each short message in the long short message fragment queue is further included.
The invention also provides a long short message splicing system, which comprises:
the data processing module is used for carrying out protocol unpacking on each short message received by the short message gateway to obtain a plurality of fragment data of each short message; the fragment data comprises protocol header information; the protocol header information comprises the total number of fragments of the short message to which the corresponding fragment data belongs, the sequencing serial number of the corresponding fragment data in the short message to which the corresponding fragment data belongs, and the type identifier of the short message to which the corresponding fragment data belongs.
And the data judging module is used for judging whether the fragment data is a long short message fragment or not according to the type identifier of the short message to which the fragment data belongs.
And the data storage module is used for storing the fragment data into a long short message fragment queue if the fragment data is long short message fragments.
And the data splicing module is used for carrying out short message splicing on the segmented data of the short messages when the number of the segmented data of any short message in the short message segmented queue is equal to the total number of the segments of the short messages, so as to obtain the spliced long short messages.
In some embodiments, the data stitching module includes a data storage unit and a data stitching unit, which may specifically be as follows:
and the data storage unit is used for placing the fragment data of the short message into a lock queue. And the data splicing unit is used for carrying out short message splicing on the segmented data in the lock queue to obtain the spliced long short messages.
In some embodiments, the data stitching module further includes an identifier embedding unit and an identifier identifying unit, which may specifically be as follows:
and the identifier embedding unit is used for storing the short message splicing process identifier and the gateway module identifier of the short message into the lock queue. The identification recognition unit is used for judging whether the short message splicing process identification and the gateway module identification exist in the lock queue after the spliced long short messages are obtained; if yes, outputting the spliced long short message; and if not, deleting the spliced long short message.
In some embodiments, the data stitching unit further includes a data sorting subunit and a data stitching subunit, which may specifically be as follows:
the data sorting subunit is configured to sort the sliced data according to the sorting sequence number of the sliced data in the lock queue. And the data splicing subunit is used for splicing the sequenced segmented data to obtain the spliced long short message.
In some embodiments, the system further includes a data recording module, configured to record the number of fragments of data of each short message in the long short message fragment queue.
In summary, the invention has the following advantages:
1) The invention stores the unpacked long short message fragments into the shared long short message fragment queue, thereby avoiding the situation that the fragment data of the same long short message is possibly randomly stored in the cache queues of different back-end examples, avoiding the situation that the fragment data of the same long short message is processed by different examples, and improving the success rate and the processing efficiency of long short message splicing.
2) The invention increases the latitude of the long short message service splicing in the available environment by adding the shared queue and the process lock between the short message gateway processes, and simultaneously reduces the number of times of applying the synchronous lock by the multiple short message gateway processes to the greatest extent, reduces the waiting time of the inter-process lock and improves the processing efficiency of splicing the same ultra-long short message by the multiple receiving processes. By utilizing the method, when the business scene of the same piece of long short message slicing data is submitted to multiple processes (or multiple threads), the short message splicing can be normally completed, and the efficiency loss caused by the data synchronization among the processes is reduced as much as possible. The processing efficiency of the short message gateway and the technical compatibility of the short message client are improved.
In this specification, each embodiment is mainly described in the specification as a difference from other embodiments, and the same similar parts between the embodiments are referred to each other. For the system disclosed in the embodiment, since it corresponds to the method disclosed in the embodiment, the description is relatively simple, and the relevant points refer to the description of the method section.
The principles and embodiments of the present invention have been described herein with reference to specific examples, the description of which is intended only to assist in understanding the methods of the present invention and the core ideas thereof; also, it is within the scope of the present invention to be modified by those of ordinary skill in the art in light of the present teachings. In view of the foregoing, this description should not be construed as limiting the invention.

Claims (10)

1. The long short message splicing method is characterized by comprising the following steps of:
protocol unpacking is carried out on each short message received by a short message gateway, and a plurality of fragment data of each short message are obtained; the fragment data comprises protocol header information; the protocol header information comprises the total number of fragments of the short message to which the corresponding fragment data belongs, the sequencing serial number of the corresponding fragment data in the short message to which the corresponding fragment data belongs and the type identifier of the short message to which the corresponding fragment data belongs;
judging whether the slicing data are long short message slicing or not according to the type identifier of the short message to which the slicing data belong;
if the fragment data is a long short message fragment, storing the fragment data into a long short message fragment queue;
and when the number of the fragment data of any short message in the short message fragment queue is equal to the total number of fragments of the short message, performing short message splicing on the fragment data of the short message to obtain the spliced long short message.
2. The method for splicing long short messages according to claim 1, wherein the short message splicing is performed on the segmented data of the short message to obtain the spliced long short message, and the method specifically comprises the following steps:
the piece data of the short message is put into a lock queue;
and performing short message splicing on the segmented data in the lock queue to obtain the spliced long short message.
3. The method for splicing long short messages according to claim 2, further comprising, before the short message splicing is performed on the fragmented data in the lock queue:
storing a short message splicing process identifier and a gateway module identifier of the short message into the lock queue;
after the spliced long short message is obtained, the method further comprises the following steps:
judging whether the lock queue has the short message splicing process identifier and the gateway module identifier or not; if yes, outputting the spliced long short message; and if not, deleting the spliced long short message.
4. The method for splicing long short messages according to claim 2, wherein the short message splicing is performed on the fragmented data in the lock queue to obtain the spliced long short message, and the method specifically comprises the following steps:
sequencing the sliced data according to the sequencing sequence number of the sliced data in the lock queue;
and splicing the sequenced segmented data to obtain the spliced long short message.
5. The long short message splicing method according to claim 1, further comprising, after storing the fragment data in a long message fragment queue:
and recording the number of the fragment data of each short message in the long message fragment queue.
6. A long short message splicing system, comprising:
the data processing module is used for carrying out protocol unpacking on each short message received by the short message gateway to obtain a plurality of fragment data of each short message; the fragment data comprises protocol header information; the protocol header information comprises the total number of fragments of the short message to which the corresponding fragment data belongs, the sequencing serial number of the corresponding fragment data in the short message to which the corresponding fragment data belongs and the type identifier of the short message to which the corresponding fragment data belongs;
the data judging module is used for judging whether the fragment data is a long short message fragment or not according to the type identifier of the short message to which the fragment data belongs;
the data storage module is used for storing the fragment data into a long short message fragment queue if the fragment data are long short message fragments;
and the data splicing module is used for carrying out short message splicing on the segmented data of the short messages when the number of the segmented data of any short message in the short message segmented queue is equal to the total number of the segments of the short messages, so as to obtain the spliced long short messages.
7. The long short message splicing system according to claim 6, wherein the data splicing module comprises:
the data storage unit is used for placing the fragment data of the short message into a lock queue;
and the data splicing unit is used for carrying out short message splicing on the segmented data in the lock queue to obtain the spliced long short messages.
8. The long short message splicing system according to claim 6, wherein the data splicing module further comprises:
the identification embedding unit is used for storing the short message splicing process identification and the gateway module identification of the short message into the lock queue;
the identification recognition unit is used for judging whether the short message splicing process identification and the gateway module identification exist in the lock queue after the spliced long short messages are obtained; if yes, outputting the spliced long short message; and if not, deleting the spliced long short message.
9. The long short message splicing system according to claim 7, wherein the data splicing unit further comprises:
the data sorting subunit is used for sorting the sliced data according to the sorting sequence number of the sliced data in the lock queue;
and the data splicing subunit is used for splicing the sequenced segmented data to obtain the spliced long short message.
10. The long short message splicing system of claim 6, further comprising:
and the data recording module is used for recording the number of the fragment data of each short message in the long message fragment queue.
CN202310544699.7A 2023-05-16 2023-05-16 Long short message splicing method and system Active CN116261109B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202310544699.7A CN116261109B (en) 2023-05-16 2023-05-16 Long short message splicing method and system

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202310544699.7A CN116261109B (en) 2023-05-16 2023-05-16 Long short message splicing method and system

Publications (2)

Publication Number Publication Date
CN116261109A true CN116261109A (en) 2023-06-13
CN116261109B CN116261109B (en) 2023-08-01

Family

ID=86682896

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202310544699.7A Active CN116261109B (en) 2023-05-16 2023-05-16 Long short message splicing method and system

Country Status (1)

Country Link
CN (1) CN116261109B (en)

Citations (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20070136484A1 (en) * 2005-12-09 2007-06-14 Mitch Kuninsky Transmit request management in a distributed shared storage system
CN101162923A (en) * 2007-11-06 2008-04-16 中兴通讯股份有限公司 Transmission method and reception apparatus of ultra-long bluetooth short message
CN101695154A (en) * 2009-10-27 2010-04-14 青岛海信移动通信技术股份有限公司 Short message processing method and short message processing device
CN101771975A (en) * 2010-01-21 2010-07-07 中国电信股份有限公司 Fault-tolerance processing method and terminal of long short message
CN101931919A (en) * 2010-08-18 2010-12-29 中国电信股份有限公司 Long short message sending processing method and device, business gateway and communication system
CN114339637A (en) * 2021-12-30 2022-04-12 上海大汉三通通信股份有限公司 Short message splicing method, device, equipment and storage medium
CN115297447A (en) * 2022-09-28 2022-11-04 广州市玄武无线科技股份有限公司 Long short message merging method, system, equipment and storage medium

Patent Citations (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20070136484A1 (en) * 2005-12-09 2007-06-14 Mitch Kuninsky Transmit request management in a distributed shared storage system
CN101162923A (en) * 2007-11-06 2008-04-16 中兴通讯股份有限公司 Transmission method and reception apparatus of ultra-long bluetooth short message
CN101695154A (en) * 2009-10-27 2010-04-14 青岛海信移动通信技术股份有限公司 Short message processing method and short message processing device
CN101771975A (en) * 2010-01-21 2010-07-07 中国电信股份有限公司 Fault-tolerance processing method and terminal of long short message
CN101931919A (en) * 2010-08-18 2010-12-29 中国电信股份有限公司 Long short message sending processing method and device, business gateway and communication system
CN114339637A (en) * 2021-12-30 2022-04-12 上海大汉三通通信股份有限公司 Short message splicing method, device, equipment and storage medium
CN115297447A (en) * 2022-09-28 2022-11-04 广州市玄武无线科技股份有限公司 Long short message merging method, system, equipment and storage medium

Also Published As

Publication number Publication date
CN116261109B (en) 2023-08-01

Similar Documents

Publication Publication Date Title
WO2019174406A1 (en) Data transmission method and apparatus, network device, and storage medium
CN101540740B (en) Prompting method of a plurality of instant communication windows, system and device thereof
CN108076098A (en) A kind of method for processing business and system
EP3066578B1 (en) Strict queue ordering in a distributed system
CN112822260B (en) File transmission method and device, electronic equipment and storage medium
CN111008087A (en) Message processing method and device
CN111338810A (en) Method and apparatus for storing information
CN116261109B (en) Long short message splicing method and system
CN107094085B (en) Signaling transmission method and device
CN116094651B (en) Message retry method, system, electronic device and storage medium
US20200236072A1 (en) Cross-Platform Messaging System
CN108063803B (en) Message management method and system based on distributed subscription and publication message system
CN114339637A (en) Short message splicing method, device, equipment and storage medium
CN112311627B (en) Universal power protocol testing method and system based on protocol description file in XML format
CN114528108A (en) Serial number generation method, device, server and storage medium
CN114070801A (en) Message processing method, message transmission method, device and electronic equipment
CN113111040A (en) File decompression method and device
CN102891732A (en) Data sending method and device and data receiving method and device
US20110213815A1 (en) Minimizing bandwidth in file path-centric protocol message
CN112463407A (en) Message transmission and consumption method
CN112769630B (en) Method and device for replaying flow of opening scene
CN115633044B (en) Message processing method and device, electronic equipment and storage medium
CN116089123A (en) Message touch method and system
US20240152473A1 (en) Can controller, can device and method for the can controller
CN115002079B (en) Short address generation method, device, equipment and storage medium

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
SE01 Entry into force of request for substantive examination
SE01 Entry into force of request for substantive examination
GR01 Patent grant
GR01 Patent grant