CN105813037A - Short message parallel sending business processing method and device - Google Patents
Short message parallel sending business processing method and device Download PDFInfo
- Publication number
- CN105813037A CN105813037A CN201410853754.1A CN201410853754A CN105813037A CN 105813037 A CN105813037 A CN 105813037A CN 201410853754 A CN201410853754 A CN 201410853754A CN 105813037 A CN105813037 A CN 105813037A
- Authority
- CN
- China
- Prior art keywords
- note
- short message
- message table
- batch
- service system
- 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
Links
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W4/00—Services specially adapted for wireless communication networks; Facilities therefor
- H04W4/12—Messaging; Mailboxes; Announcements
- H04W4/14—Short messaging services, e.g. short message services [SMS] or unstructured supplementary service data [USSD]
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Mobile Radio Communication Systems (AREA)
- Debugging And Monitoring (AREA)
Abstract
The invention discloses a short message parallel sending business processing method and device. The method comprises the following steps that an intelligent business system enables to-be-sent short messages to be divided into a plurality of batches according to the longest processing time of the to-be-sent short messages and a predefined divided interval, wherein each batch comprises a plurality of short messages; the intelligent business system divides the short messages of each batch for sending at a time or many times, wherein at least two short messages are sent at each time; and the intelligent business system enables the sent short messages to be deleted. The method and device provided by the invention can solve problems that a conventional short message push scheme is low in reliability and efficiency.
Description
Technical field
The present invention relates to the communications field, particularly relate to a kind of note concurrent service processing method and device.
Background technology
Intelligent network be in order to more flexible, convenient, economical, effectively provide value-added service (i.e. various new business), a kind of stacking network introduced in traditional mobile switch net, whole mobile network just defines the network structure being made up of the intelligent layer of original switching layer and superposition, switching layer has been responsible for basic service calling linkage function, some value-added services of complexity are then by intelligent layer control realization, and common intelligent network business has prepayment service, M-ZONE business etc..
Note is widely used in intelligent network business, it is not only between mobile subscriber to transmit the approach of information, when more providing intelligent network business as mobile operator through frequently with the method notifying user, for instance: order/cancel set meal notice, set meal comes into force notice, open/expiry feature after note remind, account balance deficiency is reminded, supplement with money be restored to account remind, monthly set meal use/available duration via prompting etc..Along with the development of intelligent network business, the application scenarios of SMS notification gets more and more.
For Common Short transmission interface, simultaneously in order to avoid the impact to short message processing center, note is caused to lose, it is usually IN service side and controls the transmission of notice class note, existing way is to create a short message table to be sent, each application stores needing the short message content sent in the table, by the SMS transmission module principle according to first in first out, from this table, take out a short message sending and from this table, delete this note or amendment short message state for send, task timing deleting and sent successful note.
As can be seen from the above technical solutions, in currently existing scheme, have the disadvantage in that
It is concurrent operations owing to each application obtains and delete note to insertion note in short message table and SMS transmission module; often cause short message table lock table; note is inserted or deletes unsuccessfully, causes note to be lost or repeatedly sends same note, and influential system is properly functioning.
Transmitting efficiency is low: the note in short message table has the requirement of first in first out, needing of namely first writing first sends, owing to all pending notes are stored in a table, SMS transmission module is inserted an acquisition time time note the earliest only in note every time and is processed, it is impossible to process a plurality of note simultaneously.
Summary of the invention
The invention provides a kind of note concurrent service processing method and device, be used for solving existing note and push scheme reliability and inefficient problem.
In order to solve above-mentioned technical problem, the present invention provides a kind of note concurrent service processing method, comprise the following steps: INTElligent Service System is according to most long process time of note to be sent and predefined division interval, described note to be sent is divided into multiple batches, and each batch comprises a plurality of note；Note in each batch is divided into one or many and sends by described INTElligent Service System, sends at least two notes every time；The note being sent completely is deleted by described INTElligent Service System.
Further, described INTElligent Service System is according to most long process time of note to be sent and predefined division interval, described note to be sent is divided into multiple batches, and each batch comprises a plurality of note and includes: described INTElligent Service System estimates the most long process time being sent completely described note to be sent；Described INTElligent Service System according to predefined division interval, calculates batch size, and described batch size adds one after being rounded downwards by the ratio of described most long process time and described division interval and obtains；Described INTElligent Service System is each batch of definition one short message table, and is sequentially each short message table numbering, and in each short message table, storage has the note of write in the division interval of correspondence.
Further, the note in each batch is divided into one or many and sends by described INTElligent Service System, sends at least two notes every time and includes: described INTElligent Service System determines the short message table being currently needed for processing；Described INTElligent Service System is extracted at least two notes from the short message table determined and sends；Described INTElligent Service System, after being sent completely, processes and is numbered Next short message table.
Further, described note concurrent service processing method also includes: when currently processed short message table is for last short message table, described INTElligent Service System jumps back to first short message table, and the note in this first short message table is processed.
Further, described note concurrent service processing method, also include: described INTElligent Service System, after division completes, starts timing；The note received after starting timing, according to described division interval, is carried out the write operation to short message table by described INTElligent Service System.
Further, described INTElligent Service System is according to described division interval, carry out including to the write operation of short message table to the note received after starting timing: described INTElligent Service System adopts the current time product complementation to described batch size and described division interval, add one after being rounded downwards by the ratio of described remainder values and described division interval, obtain the numbering of the short message table that currently should write, and by short message table corresponding for note write.
The present invention also provides for a kind of note voice and packet data concurrent service and processes device, is arranged at INTElligent Service System, including a batch division module, processing module and removing module.Described batch divides module, for the most long process time according to note to be sent and predefined division interval, described note to be sent is divided into multiple batches, and each batch comprises a plurality of note；Described processing module, for being divided into one or many to send the note in each batch, sends at least two notes every time；Described removing module, deletes for the note that will be sent completely.
Further, described batch of division module includes processing time calculating unit, batch size computing unit and short message table administrative unit.Described process time calculating unit, for estimating the most long process time being sent completely described note to be sent；Described batch size computing unit, for according to predefined division interval, calculating batch size, described batch size adds one after being rounded downwards by the ratio of described most long process time and described division interval and obtains；Described short message table administrative unit, is used for defining a short message table for each batch, and is sequentially each short message table numbering, and in each short message table, storage has the note of write in the division interval of correspondence.
Further, described note voice and packet data concurrent service process device also includes timing module and note writing module.Described timing module, for, after division completes, starting timing；Described note writing module, for according to described division interval, carrying out the write operation to short message table to the note received after starting timing.
Further, described note writing module includes numbering computing unit and writing unit.Described numbering computing unit, for by the current time product complementation to described batch size and described division interval, adding one after being rounded downwards by the ratio of described remainder values and described division interval, obtain the numbering of the short message table that currently should write；Said write unit, for by short message table corresponding for note write.
Note concurrent service processing method provided by the invention and device, note to be sent is divided into multiple batches, each batch comprises a plurality of note, note batch one or many in each batch is sent, send at least two notes every time, the note being sent completely is deleted, it is achieved thereby that batch processing note pushes, improve transmitting efficiency, solve the problem that note is lost and sent out by mistake.
Accompanying drawing explanation
Fig. 1 show the flow chart of the note concurrent service processing method that present pre-ferred embodiments provides；
Fig. 2 show the flow chart of the note write processing procedure that present pre-ferred embodiments provides；
Fig. 3 show the flow chart of the short message sending processing procedure that present pre-ferred embodiments provides；
Fig. 4 show the schematic diagram of the note voice and packet data concurrent service process device that present pre-ferred embodiments provides.
Detailed description of the invention
As shown in Figure 1, present pre-ferred embodiments provides a kind of note concurrent service processing method, comprise the following steps: S1: INTElligent Service System is according to most long process time of note to be sent and predefined division interval, described note to be sent is divided into multiple batches, and each batch comprises a plurality of note；S2: the note in each batch is divided into one or many and sends by described INTElligent Service System, sends at least two notes every time；S3: the note being sent completely is deleted by described INTElligent Service System.
Wherein, step S1 specifically includes: described INTElligent Service System estimates the most long process time being sent completely described note to be sent；According to predefined division interval N, calculating batch size, wherein, described batch size adds one after being rounded downwards by the ratio of described most long process time and described division interval and obtains, i.e. batch sizeDefining a short message table for each batch, and be sequentially each short message table numbering, in each short message table, storage has the note of write in the division interval of correspondence.Wherein, after division completes, start timing；According to described division interval, the note received after starting timing is carried out the write operation to short message table.Specifically, when front time noise is become minute T value complementation to M*N, except N, end value rounds downwards and adds 1, it may be assumed that (TmodM*N)/N+1, accordingly, obtain the numbering of the short message table that currently should write, and by short message table corresponding for note write.
Step S2 specifically includes: described INTElligent Service System determines the short message table being currently needed for processing；From the short message table determined, extract at least two notes and send；After being sent completely, process and be numbered Next short message table.Wherein, when currently processed short message table is last short message table, jump back to first short message table, the note in this first short message table is processed.
In the present embodiment, illustrate for note parallel processing.But, this is not limited by the present invention.In other preferred embodiments, for instance can apply to multimedia message, unstructured supplementary data traffic (UnstructuredSupplementaryServicesData, USSD) message etc. needs according to sequential parallel processing field.
Specifically, in the present embodiment, the total quantity of short message table is such as M (table mark from 1 to M), and every table such as comprises the short message of N minute.The value of M and N can according to application scenarios, flexible configuration.
Note is mainly write in corresponding short message table by note write processing procedure.Calculate the table mark that should write according to current time, computational methods: (TmodM*N)/N+1, wherein, T is that current time is converted to a minute value, and M is summary table number, and N is the number of minutes of contingency table.
The short message sending processing procedure of INTElligent Service System is mainly from short message table and obtains note and process.Identify whether identical by relatively currently processed table mark and the table calculated by the current time in system, if the same recalculate again after waiting the W second and compare, if difference, from the table of currently processed table mark instruction, obtain S bar note and process, after this table record has all processed, currently processed table mark is added 1, continues with next table.If new table identifies more than summary table number M, then new table is set and is designated 1, restart circulation.If currently processed table mark is not within the scope of 1 to M, expression system just initializes, and the value calculating ((T-N) modM*N)/N+1 identifies as currently processed table, wherein, T is that current time is converted to a minute value, and M is summary table number, and N is the number of minutes of contingency table.
Specifically, the conflict of present pre-ferred embodiments solution note concurrent processing and the process of efficiency is utilized to comprise the following steps:
(1) according to system processing power and user receptible time delay, it is determined that separate the number of minutes N of table, namely every table should comprise the data of N minute, and N general recommendations takes 5 minutes, has both taken into account system process performance, can improve again Consumer's Experience；The note time is sent to determine short message table quantity M according to the most long hair of system, M=(the most long hair of system send note time/N)+1, wherein, the most long hair of system send note time/value of N needs to round downwards, currently processed table is set simultaneously and is designated 1 and identifies as system initialization to the extraneous value of M (such as: 0)；Two other parameter that present pre-ferred embodiments relates to, the note bar number S and waiting time W that SMS transmission module processes every time dynamically can adjust when system is run, to reach system performance optimum.
(2) note write processing procedure is: after receiving the request of sending short messages (such as step S101), note table mark (such as step S102) that should write is calculated according to current time, computational methods: (TmodM*N)/N+1, wherein, T is that current time is converted to a minute value, M is summary table number, and N is the number of minutes of contingency table, note is write in corresponding table.Concrete handling process is as shown in Figure 2.
(3) short message sending processing procedure is: relatively currently processed table identifies whether within the scope of 1 to M (such as step S201), if currently processed table mark is not within the scope of 1 to M, expression system just initializes, the value calculating ((T-N) modM*N)/N+1 identifies (such as step S206) as currently processed table, wherein, T is that current time is converted to a minute value, and M is summary table number, and N is the number of minutes of contingency table；If currently processed table mark is within the scope of 1 to M, then compare currently processed table mark and the write table calculated by the current time in system identifies whether identical (such as step S202), if difference, from the table of currently processed table mark instruction, obtain S bar note (such as step S203) every time and process (such as step S205), until this table record has all processed, currently processed table mark is added 1, continue with next table, if new table identifies more than summary table number M, new table is then set and is designated 1, restart circulation (such as step S208)；If currently processed table mark is identical with the write table mark calculated by the current time in system, SMS transmission module recalculates after then waiting the W second (such as step S207) again and compares.Concrete handling process is as shown in Figure 3.
Specifically, in actual applications, short message sending can not in strict accordance with the principle of first in first out, it is possible to having certain error, general range of error was less than 5-10 minute, for instance: receiving note in 5 minutes can send simultaneously.Opening short message table based on this this present pre-ferred embodiments by creating M, every table comprises the note being inserted into N minute, and wherein, M, N can configure.M needs note data amount to be processed and short message sending capacity scheme according to system, M=(system most long process time/N)+1, wherein, system most long process time/value of N needs to round downwards.
Such as: the longest needs of note that system produces have processed and (can calculate according in system peak load situation for 55 minutes, such as: it is 10/second that system processes SMS capability, need in system peak load situation in 5 minutes to send 33000 notes, then these notes are all sent, need 33000/10=3300 second=55 minutes), N takes 5 minutes, then M=55/5+1=12, namely need to create 12 tables to store note, wherein:
The storing time intervals of table 1 correspondence is 00:00:00-00:N-1:59；
The storing time intervals of table 2 correspondence is 00:N:00-00:2*N-1:59；
……
The storing time intervals of table 12 correspondence is 00:11*N:00-00:12*N-1:59.
Calculate write which table according to current time, for instance: current time is 00:07:08, then by note write table 2, computational methods are: current time is converted to minute T value complementation to M*N, except N, end value rounds downwards and adds 1, it may be assumed that (TmodM*N)/N+1.nullThe table mark of the currently transmitted process of system log (SYSLOG)，Initial value is non-1 other values arriving M scope，Such as: 0，Read currently processed table mark，If value is 0，The table mark then calculated for-N minute according to current time according to above-mentioned rule determines table to be processed，And currently processed table mark is set to this value，From this table, obtain S (S can configure) bar note once and send，This S bar note is deleted after success，Still further obtain S bar to process，Until all records in this table are disposed，By currently processed table mark+1，If the new table calculated identifies more than maximum table number，Then currently processed table mark starts the cycle over from 1，If currently processed table mark is not equal to presently written table mark (calculate according to current time and draw)，Then continue with，Otherwise，Wait that W (W can configure) compares after the second more again.
By insertion and the deletion action of short message table being separated (after front a collection of note has all processed according to write note time submeter, newly-generated note is write already present short message table, synchronization is actual, and to only have a table be write operation, other tables are all read and deletion action), avoid lock table, meanwhile, when sending note, from short message table, the random S bar note that obtains sends simultaneously and processes, and improves system treatment effeciency.
As shown in Figure 4, present pre-ferred embodiments also provides for a kind of note voice and packet data concurrent service and processes device, is arranged at INTElligent Service System, including a batch division module 10, processing module 11, removing module 12, timing module 14 and note writing module 13.Specifically, batch dividing module 10, for the most long process time according to note to be sent and predefined division interval, described note to be sent is divided into multiple batches, each batch comprises a plurality of note；Processing module 11, for being divided into one or many to send the note in each batch, sends at least two notes every time；Removing module 12, deletes for the note that will be sent completely；Timing module 14, for, after division completes, starting timing；Note writing module 13, for according to described division interval, carrying out the write operation to short message table to the note received after starting timing.
Wherein, a batch division module 10 includes processing time calculating unit 101, batch size computing unit 102 and short message table administrative unit 103.Process time calculating unit 101, for estimating the most long process time being sent completely described note to be sent；Batch size computing unit 102, for according to predefined division interval, calculating batch size, described batch size adds one after being rounded downwards by the ratio of described most long process time and described division interval and obtains；Short message table administrative unit 103, is used for defining a short message table for each batch, and is sequentially each short message table numbering, and in each short message table, storage has the note of write in the division interval of correspondence.Note writing module 13 includes numbering computing unit 130 and writing unit 131.Numbering computing unit 130, for by the current time product complementation to described batch size and described division interval, adding one after being rounded downwards by the ratio of described remainder values and described division interval, obtain the numbering of the short message table that currently should write；Writing unit 131, for by short message table corresponding for note write.
It addition, process the specific operation process of device with described in said method about described note voice and packet data concurrent service, therefore repeat no more in this.
In sum, present pre-ferred embodiments is by according to write note time submeter, solving short message table and insert and delete concurrent processing collision problem, meanwhile, improve system treatment effeciency.Compared with prior art, it is possible to solve the lock problem of note concurrent processing in IN service, improve short message sending efficiency simultaneously.
One of ordinary skill in the art will appreciate that all or part of step of above-described embodiment can use computer program flow process to realize, described computer program can be stored in a computer-readable recording medium, described computer program performs (such as system, unit, device etc.) on corresponding hardware platform, upon execution, including step of embodiment of the method one or a combination set of.
Alternatively, all or part of step of above-described embodiment can also use integrated circuit to realize, and these steps can be fabricated to integrated circuit modules one by one respectively, or the multiple modules in them or step are fabricated to single integrated circuit module realize.So, the present invention is not restricted to the combination of any specific hardware and software.
Each device/functional module/functional unit in above-described embodiment can adopt general calculation element to realize, and they can concentrate on single calculation element, it is also possible to is distributed on the network that multiple calculation element forms.
When each device/functional module/functional unit in above-described embodiment is using the form realization of software function module and as independent production marketing or use, it is possible to be stored in a computer read/write memory medium.Computer read/write memory medium mentioned above can be read only memory, disk or CD etc..
Any those familiar with the art, in the technical scope that the invention discloses, can readily occur in change or replace, should be encompassed within protection scope of the present invention.Therefore, protection scope of the present invention should be as the criterion with the protection domain described in claim.
Claims (10)
1. a note concurrent service processing method, it is characterised in that comprise the following steps:
Described note to be sent, according to most long process time of note to be sent and predefined division interval, is divided into multiple batches by INTElligent Service System, and each batch comprises a plurality of note；
Note in each batch is divided into one or many and sends by described INTElligent Service System, sends at least two notes every time；
The note being sent completely is deleted by described INTElligent Service System.
2. note concurrent service processing method according to claim 1, it is characterized in that, described note to be sent, according to most long process time of note to be sent and predefined division interval, is divided into multiple batches by described INTElligent Service System, and each batch comprises a plurality of note and include:
Described INTElligent Service System estimates the most long process time being sent completely described note to be sent；
Described INTElligent Service System according to predefined division interval, calculates batch size, and described batch size adds one after being rounded downwards by the ratio of described most long process time and described division interval and obtains；
Described INTElligent Service System is each batch of definition one short message table, and is sequentially each short message table numbering, and in each short message table, storage has the note of write in the division interval of correspondence.
3. note concurrent service processing method according to claim 2, it is characterised in that the note in each batch is divided into one or many and sends by described INTElligent Service System, sends at least two notes every time and includes:
Described INTElligent Service System determines the short message table being currently needed for processing；
Described INTElligent Service System is extracted at least two notes from the short message table determined and sends；
Described INTElligent Service System, after being sent completely, processes and is numbered Next short message table.
4. note concurrent service processing method according to claim 3, it is characterised in that the method also includes:
When currently processed short message table is last short message table, described INTElligent Service System jumps back to first short message table, and the note in this first short message table is processed.
5. note concurrent service processing method according to claim 2, it is characterised in that the method also includes:
Described INTElligent Service System, after division completes, starts timing；
The note received after starting timing, according to described division interval, is carried out the write operation to short message table by described INTElligent Service System.
6. note concurrent service processing method according to claim 5, it is characterised in that the note received after starting timing, according to described division interval, is carried out including to the write operation of short message table by described INTElligent Service System:
Described INTElligent Service System adopts the current time product complementation to described batch size and described division interval, add one after being rounded downwards by the ratio of described remainder values and described division interval, obtain the numbering of the short message table that currently should write, and by short message table corresponding for note write.
7. note voice and packet data concurrent service processes a device, is arranged at INTElligent Service System, it is characterised in that include a batch division module, processing module and removing module,
Described batch divides module, for the most long process time according to note to be sent and predefined division interval, described note to be sent is divided into multiple batches, and each batch comprises a plurality of note；
Described processing module, for being divided into one or many to send the note in each batch, sends at least two notes every time；
Described removing module, deletes for the note that will be sent completely.
8. note voice and packet data concurrent service according to claim 7 processes device, it is characterised in that described batch divides module and include processing time calculating unit, batch size computing unit and short message table administrative unit,
Described process time calculating unit, for estimating the most long process time being sent completely described note to be sent；
Described batch size computing unit, for according to predefined division interval, calculating batch size, described batch size adds one after being rounded downwards by the ratio of described most long process time and described division interval and obtains；
Described short message table administrative unit, is used for defining a short message table for each batch, and is sequentially each short message table numbering, and in each short message table, storage has the note of write in the division interval of correspondence.
9. note voice and packet data concurrent service according to claim 8 processes device, it is characterised in that also include timing module and note writing module,
Described timing module, for, after division completes, starting timing；
Described note writing module, for according to described division interval, carrying out the write operation to short message table to the note received after starting timing.
10. note voice and packet data concurrent service according to claim 9 processes device, it is characterised in that described note writing module includes numbering computing unit and writing unit,
Described numbering computing unit, for by the current time product complementation to described batch size and described division interval, adding one after being rounded downwards by the ratio of described remainder values and described division interval, obtain the numbering of the short message table that currently should write；
Said write unit, for by short message table corresponding for note write.
Priority Applications (2)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201410853754.1A CN105813037B (en) | 2014-12-30 | 2014-12-30 | Short message concurrent service processing method and device |
| PCT/CN2015/081971 WO2016107102A1 (en) | 2014-12-30 | 2015-06-19 | Short message concurrent sending service processing method and apparatus |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201410853754.1A CN105813037B (en) | 2014-12-30 | 2014-12-30 | Short message concurrent service processing method and device |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN105813037A true CN105813037A (en) | 2016-07-27 |
| CN105813037B CN105813037B (en) | 2020-09-15 |
Family
ID=56284084
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201410853754.1A Active CN105813037B (en) | 2014-12-30 | 2014-12-30 | Short message concurrent service processing method and device |
Country Status (2)
| Country | Link |
|---|---|
| CN (1) | CN105813037B (en) |
| WO (1) | WO2016107102A1 (en) |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109246631A (en) * | 2018-11-29 | 2019-01-18 | 甘肃万维信息科技有限责任公司 | A kind of method that short message is sent |
| CN114025318A (en) * | 2021-11-22 | 2022-02-08 | 上海通联金融服务有限公司 | Method, storage medium and terminal for sending in batches based on credit card short message reminding |
Families Citing this family (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107425600A (en) * | 2017-05-02 | 2017-12-01 | 广东电网有限责任公司惠州供电局 | One kind power supply distribution transformer monitoring system |
| CN107205082A (en) * | 2017-05-05 | 2017-09-26 | 深圳市金立通信设备有限公司 | A kind of short message method for cleaning and mobile terminal |
| CN117851434B (en) * | 2024-03-07 | 2024-05-14 | 深圳市雁联计算系统有限公司 | Method, system and storage medium for concurrent migration of database |
Citations (11)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101001406A (en) * | 2006-01-10 | 2007-07-18 | 英业达股份有限公司 | Short message receiving confirmation system and method |
| CN101110987A (en) * | 2007-07-19 | 2008-01-23 | 中兴通讯股份有限公司 | System and method for implementing short message group sending |
| CN101217587A (en) * | 2008-01-14 | 2008-07-09 | 深圳国人通信有限公司 | SMS receiving method and device |
| CN101483838A (en) * | 2008-04-08 | 2009-07-15 | 中兴通讯股份有限公司 | Method and system for implementing short message group sending |
| CN101527691A (en) * | 2009-03-26 | 2009-09-09 | 中兴通讯股份有限公司 | Reporting and processing method for status information and network server |
| US20110231510A1 (en) * | 2000-09-25 | 2011-09-22 | Yevgeny Korsunsky | Processing data flows with a data flow processor |
| CN102612001A (en) * | 2012-02-24 | 2012-07-25 | 端允 | Method for realizing short message group sending by transferring short message group sending platform server |
| CN103139732A (en) * | 2011-11-24 | 2013-06-05 | 方正国际软件有限公司 | Improved short message sending method and system |
| CN103237296A (en) * | 2013-04-19 | 2013-08-07 | 中国建设银行股份有限公司 | Message sending method and message sending system |
| CN103458384A (en) * | 2013-09-27 | 2013-12-18 | 武钢集团昆明钢铁股份有限公司 | Enterprise short message sending system and method |
| CN103534978A (en) * | 2013-04-07 | 2014-01-22 | 华为技术有限公司 | Mass texting method and device |
Family Cites Families (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN100407807C (en) * | 2005-03-07 | 2008-07-30 | 中兴通讯股份有限公司 | Short message down transmitting flow control method of short message centre |
| CN100589599C (en) * | 2005-06-29 | 2010-02-10 | 华为技术有限公司 | Information group transmitting system and method |
| CN101588555A (en) * | 2008-05-21 | 2009-11-25 | 中兴通讯股份有限公司 | Flow control method of short messages and short message gateway |
-
2014
- 2014-12-30 CN CN201410853754.1A patent/CN105813037B/en active Active
-
2015
- 2015-06-19 WO PCT/CN2015/081971 patent/WO2016107102A1/en active Application Filing
Patent Citations (11)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20110231510A1 (en) * | 2000-09-25 | 2011-09-22 | Yevgeny Korsunsky | Processing data flows with a data flow processor |
| CN101001406A (en) * | 2006-01-10 | 2007-07-18 | 英业达股份有限公司 | Short message receiving confirmation system and method |
| CN101110987A (en) * | 2007-07-19 | 2008-01-23 | 中兴通讯股份有限公司 | System and method for implementing short message group sending |
| CN101217587A (en) * | 2008-01-14 | 2008-07-09 | 深圳国人通信有限公司 | SMS receiving method and device |
| CN101483838A (en) * | 2008-04-08 | 2009-07-15 | 中兴通讯股份有限公司 | Method and system for implementing short message group sending |
| CN101527691A (en) * | 2009-03-26 | 2009-09-09 | 中兴通讯股份有限公司 | Reporting and processing method for status information and network server |
| CN103139732A (en) * | 2011-11-24 | 2013-06-05 | 方正国际软件有限公司 | Improved short message sending method and system |
| CN102612001A (en) * | 2012-02-24 | 2012-07-25 | 端允 | Method for realizing short message group sending by transferring short message group sending platform server |
| CN103534978A (en) * | 2013-04-07 | 2014-01-22 | 华为技术有限公司 | Mass texting method and device |
| CN103237296A (en) * | 2013-04-19 | 2013-08-07 | 中国建设银行股份有限公司 | Message sending method and message sending system |
| CN103458384A (en) * | 2013-09-27 | 2013-12-18 | 武钢集团昆明钢铁股份有限公司 | Enterprise short message sending system and method |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109246631A (en) * | 2018-11-29 | 2019-01-18 | 甘肃万维信息科技有限责任公司 | A kind of method that short message is sent |
| CN114025318A (en) * | 2021-11-22 | 2022-02-08 | 上海通联金融服务有限公司 | Method, storage medium and terminal for sending in batches based on credit card short message reminding |
Also Published As
| Publication number | Publication date |
|---|---|
| WO2016107102A1 (en) | 2016-07-07 |
| CN105813037B (en) | 2020-09-15 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN105813037A (en) | Short message parallel sending business processing method and device | |
| CN107395697A (en) | Push Channel Selection, information push method, device and equipment, computer-readable recording medium | |
| CN103379021A (en) | Method and system for achieving distributed message queue | |
| CN108550038A (en) | A kind of data dissemination system and method applied to block chain | |
| CN105487760A (en) | Method and device for displaying message and electronic equipment | |
| CN108399175B (en) | Data storage and query method and device | |
| CN105847447A (en) | Message push method and device | |
| CN101916399A (en) | Method and system for adding recipients | |
| CN109032533B (en) | Data storage method, device and equipment | |
| CN110264332A (en) | The method, apparatus and electronic equipment that account is entered an item of expenditure in the accounts | |
| CN101763433B (en) | Data storage system and method | |
| CN111552991A (en) | Block chain transaction method and device | |
| CN112152872B (en) | Network sub-health detection method and device | |
| CN109242582A (en) | The generation method and Related product of invoice | |
| CN104618432A (en) | Event sending and receiving handling method and system | |
| CN103581846B (en) | A kind of user's business card update method and system | |
| CN109299043A (en) | Method, device, equipment and storage medium for deleting large files of distributed cluster system | |
| CN109242384A (en) | The flow distribution method and Related product of e-commerce order | |
| CN103092768B (en) | The method of data processing and device in a kind of application system | |
| CN103929480A (en) | Data backup method and device based on tasks | |
| CN103942213A (en) | Data paging method and device | |
| CN102646136B (en) | Method and system for efficiently storing and inquiring data | |
| CN110134537A (en) | Session entry timeout treatment method, apparatus and multiple nucleus system in multiple nucleus system | |
| CN113592639B (en) | Block chain transaction deleting method and system | |
| CN111461868B (en) | Dot queuing method, device, computer equipment and readable storage medium |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| TA01 | Transfer of patent application right | ||
| TA01 | Transfer of patent application right |
Effective date of registration: 20200814 Address after: 210012 Nanjing, Yuhuatai District, South Street, Bauhinia Road, No. 68 Applicant after: Nanjing Zhongxing New Software Co.,Ltd. Address before: 518057 Nanshan District Guangdong high tech Industrial Park, South Road, science and technology, ZTE building, Ministry of Justice Applicant before: ZTE Corp. |
|
| GR01 | Patent grant | ||
| GR01 | Patent grant |