CN100531059C - State Synchronization System and Method - Google Patents
State Synchronization System and Method Download PDFInfo
- Publication number
- CN100531059C CN100531059C CNB2006100903278A CN200610090327A CN100531059C CN 100531059 C CN100531059 C CN 100531059C CN B2006100903278 A CNB2006100903278 A CN B2006100903278A CN 200610090327 A CN200610090327 A CN 200610090327A CN 100531059 C CN100531059 C CN 100531059C
- Authority
- CN
- China
- Prior art keywords
- electronic device
- service
- service status
- identification code
- state
- 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.)
- Expired - Fee Related
Links
- 238000000034 method Methods 0.000 title claims abstract description 46
- 230000003213 activating effect Effects 0.000 claims 5
- 238000009434 installation Methods 0.000 description 31
- 230000001360 synchronised effect Effects 0.000 description 17
- 238000010586 diagram Methods 0.000 description 11
- 230000009471 action Effects 0.000 description 7
- 230000007246 mechanism Effects 0.000 description 5
- 238000004891 communication Methods 0.000 description 4
- 230000008859 change Effects 0.000 description 3
- 238000007726 management method Methods 0.000 description 3
- 230000027455 binding Effects 0.000 description 2
- 238000009739 binding Methods 0.000 description 2
- 238000005516 engineering process Methods 0.000 description 2
- 230000006870 function Effects 0.000 description 2
- 230000008901 benefit Effects 0.000 description 1
- 230000005540 biological transmission Effects 0.000 description 1
- 238000004364 calculation method Methods 0.000 description 1
- 238000005266 casting Methods 0.000 description 1
- 238000004590 computer program Methods 0.000 description 1
- 238000007689 inspection Methods 0.000 description 1
- 230000005055 memory storage Effects 0.000 description 1
- 230000008569 process Effects 0.000 description 1
- 238000012797 qualification Methods 0.000 description 1
- 230000004044 response Effects 0.000 description 1
Images
Landscapes
- Information Transfer Between Computers (AREA)
Abstract
The embodiment of the invention provides a state synchronization method which is executed by using a first electronic device. The examples include the following steps: obtaining a first service state version identification code stored in a local cache memory of a first electronic device; receiving a second service state version identification code transmitted by the second electronic device; judging whether the first service state version identification code is older than the second service state version identification code; and when the first service state version identification code is older than the second service state version identification code, querying and obtaining the latest service state value and a third service state version identification code corresponding to the obtained service state value from the service in the third electronic device. The first electronic device, the second electronic device and the third electronic device are organized into an event propagation tree structure, the third electronic device is located at a root node in the event propagation tree structure, and the first electronic device and the second electronic device are located at leaf nodes in the event propagation tree structure.
Description
Technical field
The present invention relates to a kind of event synchronization technology, particularly a kind of state synchronous system and method in large-scale distribution service environment.
Background technology
Device in distributed environment (the particularly service management system that is driving with incident) can be shared common state (common states), realizes service coordination and cooperate the purpose of (service coordination and collaboration).Generally speaking, in service management system, the mode that the notice that service state changes can asynchronous (asynchronous) is carried out, and just a service (or a central management platform) is one by one with the state notifying device that is changed.Yet, when the value of common state is stored (cache) in device the time, different device can be safeguarded the common state of storage with different modes, so, may have the value of inconsistent common state between different device, and then cause the situation of service collaboration failure.Therefore, need a kind of state synchronizing apparatus and method, in order to reduce the generation probability that has the value of inconsistent common state between different device.
Summary of the invention
The object of the present invention is to provide a kind of state synchronous system and method, in order to reduce the generation probability that has the value of inconsistent common state between different device.
The embodiment of the invention provides a kind of state synchronization method, uses first electronic installation to carry out.Comprise following steps among the embodiment: obtain the first service state version recognition code in the local cache memory that is stored in first electronic installation; Reception is by the second service state version recognition code that second electronic device transmitted; Judge whether the first service state version recognition code is older than the second service state version recognition code; And when the first service state version recognition code than the second service state version recognition code old times, the service-seeking in the 3rd electronic installation is also obtained up-to-date service state value and corresponding to the 3rd service state version recognition code of the service state value of being obtained.Wherein, first electronic installation, second electronic device and the 3rd electronic installation are organized into event propagation tree (event casting tree), the 3rd electronic installation is arranged in the root node of event propagation tree, and first electronic installation and second electronic device are arranged in the leaf node of event propagation tree.
The embodiment of the invention also provides a kind of state synchronization method, uses first electronic installation to carry out.Comprise following steps among the embodiment: receive the request of upwards checking by second electronic device, should check upwards that request comprised the first service state version recognition code; Obtain the second service state version recognition code in the local cache memory that is stored in first electronic installation; And by relatively the first service state version recognition code and the second service state version recognition code optionally activate upwards audit program or refresh routine downwards.First electronic installation and second electronic device are organized into the event propagation tree, and first electronic installation is the father node of second electronic device.Upwards audit program is used for asking upwards to be sent to cause the inconsistent electronic installation of service release with upwards checking, and, all nodes that downward refresh routine directly or indirectly is linked to first electronic installation to sending a notice are used to store the first service state value corresponding to the first service state version recognition code.
The embodiment of the invention also provides a kind of state synchronization method, uses first electronic installation to carry out.Comprise following steps among the embodiment: receive downward update request by second electronic device, downwards update request comprises the first service state version recognition code and corresponding to the first service state value of the first service state version recognition code; And use the first service state version recognition code and the first service state value to upgrade the second service state version recognition code and the second service state value in the local cache memory that originally is stored in first electronic installation respectively.Wherein, first electronic installation and second electronic device are organized into the event propagation tree, and first electronic installation is the child node of second electronic device.
The embodiment of the invention provides a kind of state synchronous system, comprises first, second and the 3rd electronic installation.First electronic installation comprises a service.Wherein, first electronic installation, second electronic device and the 3rd electronic installation are organized into the event propagation tree.First electronic installation is represented the root node in the event propagation tree, and second electronic device is represented the via node (relay node) in the event propagation tree, and the 3rd electronic installation is represented the leaf node in the event propagation tree.The 3rd electronic installation is to a plurality of event notices of service subscription corresponding to service, and the first electronic installation hierarchy type ground sends event notice to the 3rd electronic installation one by one by second electronic device.
For above and other objects of the present invention, feature and advantage can be become apparent, cited below particularlyly go out preferred embodiment, and conjunction with figs., be described in detail below:
Description of drawings
Fig. 1 is the network architecture schematic diagram of expression according to the state synchronous system of the embodiment of the invention;
Fig. 2 is the hardware structure figure of expression according to the personal computer of the embodiment of the invention;
Fig. 3 is the distributed event propagation schematic diagram of mechanism of expression according to the embodiment of the invention;
Fig. 4 is the inconsistent schematic diagram of the typical state of expression;
Fig. 5 is the state synchronization method by the leaf node execution according to the embodiment of the invention;
Fig. 6 is the state synchronization method by via node or root node execution according to the embodiment of the invention;
Fig. 7 is the state synchronization method by via node or leaf node execution according to the embodiment of the invention;
Fig. 8 represents the state synchronized finite state machine according to the embodiment of the invention;
Fig. 9 represents the state synchronized computer read/write memory medium schematic diagram according to the embodiment of the invention;
Figure 10 and Figure 11 represent the state synchronized schematic diagram according to the embodiment of the invention.
Embodiment
Fig. 1 is the network architecture schematic diagram of expression according to the state synchronous system 10 of the embodiment of the invention.In the preferred case, this network architecture comprises personal computer 11,13,15,17 and 19.Wherein, personal computer 11,13,15, the 17 mixed mutually mode of (wired-connection), wireless connections or wired connection and wireless connections that can be wired with 19 is connected to each other.And those skilled in the art know that perhaps personal computer 11,13,15,17 and 19 be connected need by a plurality of agent nodes, for example, WAP (wireless access point) (access point), base station (base station), hub (hub), bridger (bridge), router (router) or other are used to handle the agent node of network communication.State synchronous system 10 adopts publisher-subscriber's models (publisher-subscriber model) or pushes away and broadcasts model (push model) and carry out state and change notice.Specifically, personal computer 11 is announced the service that (advertise) provides on network, makes personal computer 13,15,17 and 19 can find and subscribe to the service that these come forth.Personal computer 11 is played the part of state source (state source) role, and its event notice (event notification) that uses asynchronous mode transmission to comprise the service state value is given personal computer 13,15,17 and 19. Personal computer 13,15,17 and 19 can be subscribed to a service to personal computer 11, so that can receive the event notice (information that wherein comprises the service state value) of ordered service in the future.When many personal computers are subscribed to same service, personal computer 11 can use single-point broadcast (clean culture) (unicasting), multicast (multicast) (multicasting) or the mode of broadcasting (broadcasting) event notice is passed to the computer of subscription.The computer of subscribing to is stored in service state value wherein the cache memory (local cache) of this locality after receiving event notice.In addition, the computer of subscription also can initiatively be asked (request) service state values to personal computer 11, and upgrades local service state value of being stored according to the service state value in the answer that receives (response).It should be noted that at this personal computer 11 also can transmit the valid period (valid duration) corresponding to the service state value, representative is before its valid period overtime, and the service state value of this storage can be in an effective state.
Fig. 2 is that expression is according to the personal computer 11,13,15,17 of the embodiment of the invention and 19 hardware structure figure.In the personal computer 11,13,15,17 and 19 one comprises processing unit 21, memory 22, storage device 23, output device 24, input unit 25, communication device 26, and uses bus 27 that it is linked together.In addition, those skilled in the art also can be applied in personal computer 11,13,15,17 and 19 on other computer system configurations (configuration), for example, multicomputer system, based on microprocessor or programmable consumption electronic products (microprocessor-based or programmable consumer electronics), network computer, microcomputer, mainframe, mobile computer and similar equipment.Wherein, based on microprocessor or programmable consumption electronic products can comprise mobile phone, projector, display screen, personal digital assistant (personal digital assistant, PDA), digital video recording equipment, digital music player etc.Processing unit 21 can comprise single CPU (central-processing unit; CPU) or with a plurality of parallel processing elements of parallel processing environment (parallel processing environment).Memory 22 comprises read-only memory (read only memory; ROM), flash memory (flash ROM), with and/or random access memory (random access memory; RAM), being used to store can be for the program module and the data of processing unit 21 execution.Generally speaking, program module comprise routine (routines), program (program), target (program) (object), assembly (component) etc., be used for the executing state synchronizing function.The present invention can also be applied to the distributed arithmetic environment, and its computing work is carried out by the teleprocessing equipment that is attached at communication network.In distributed environment, one function executing in the personal computer 11,13,15,17 and 19 can be finished jointly by this locality and multi-section remote computer system.In distributed environment, program module can be present in this locality and the remote memory storage devices simultaneously, and the remote access framework comprises DCOM (DCOM), common object request broker architecture (CORBA), webpage assembly (Web objects), network service (Web Services) or other similar framework.
When the personal computer of subscription service or electronic installation are scattered in the large network environment, use distributed event propagation mechanism (distributed event disseminationmechanism) to send event notice to personal computer or electronic installation.Fig. 3 represents the distributed event propagation schematic diagram of mechanism according to the embodiment of the invention.It is an event propagation tree (event castingtree) that all personal computers or electronic installation are organized into, and uses the mode (cascade-like way) of similar waterfall that event notice is from top to bottom transmitted.The event propagation tree comprises three kinds of fundamental nodes: root node (root node) S, via node (relay node) R1 to R10 etc. and leaf node (leaf node) L1 to L4 etc.Root node S representative comprises the personal computer or the electronic installation of service, and this service is event publisher, is used for by via node R1 to R10 etc. event notice being passed to leaf node L1 to L4 etc.Leaf node L1 to L4 etc. is the incident recipient, and it subscribes to event notice service (event notification service) to event publisher.(in-between) device in the middle of via node R1 to R10 etc. represents is between root node S and leaf node L1 to L4 etc.Via node can be personal computer, electronic installation or or even network equipment, for example, WAP (wireless access point), base station, hub, bridger, router or other are used to handle the node of network communication.
Event notice can be packaged into form as follows:
Event?notification
service_identifier?sid;
service_location_reference?slr;
relay_node_identifier?rid;
state?sValue;
version?vValue;
time?tValue;
duration?dValue;
Comprise position, several data territory in the event notice, be used to write down Service Identifier (serviceidentifier, sid), service position is with reference to (service location reference, slr), via node identification code (relay node identifier, rid), service state value (service statevalue, sValue), service state version recognition code (service state version, vValue), incident generation time (tValue) and valid period (valid duration, dValue).Version recognition code is used to distinguish different event notices.Each version recognition code can comprise a Service Identifier (service identifier) and an Identification of events sign indicating number (event identifier), separates with hyphen (hyphen) between two identification codes, and form is as follows:
version:=“service?identifier”-“event?identifier”。
Via node identification code field wherein nullifies when initialization (" null " value), is packaged in the initial event notice, and sends sub-via node to by root node.When via node receives an event notice, oneself identification code is joined via node identification code field in this event notice, and the event notice after will upgrading sends sub-via node or leaf node to.In addition, via node records the Service Identifier (sid) in father node identification code (parent ' srid) and the event notice, service state value (sValue) and service state version identification code (vValue) in the local cache memory.The form of record can be expressed as<sid parent ' s rid, vValue, sValue 〉.When leaf node receives an event notice, with the Service Identifier (sid) in father node identification code (parent ' s rid) and the event notice, via node identification code (rid), service state value (sValue) and service state version identification code information such as (vValue), record in the local cache memory.The form of record can be expressed as<sid rid, parent ' s rid, vValue, sValue 〉.
Any two leaf nodes may be found the service state value with different editions when service collaboration, and the inconsistent situation of generation state.Have and manyly may cause the inconsistent reason of state, for instance, may temporarily lose efficacy, cause temporary incident bang path to interrupt, or the situation of network blockage takes place on the bang path between certain two node because of one of them via node.Fig. 4 is the inconsistent schematic diagram of the typical state of expression.Event propagation tree T
0In have a root node S, root node S is linked to a via node R
K-1, and, via node R
K-1Be linked to two via node R
k *And R
kWhen the relaying node R
k *During the device mistake that takes place temporarily can not to expect, event notice just can't be delivered to and directly or indirectly be attached at via node R
k *All via nodes or leaf node, thereby cause subtree (sub-tree) T
k *And T
kBetween the inconsistent situation of generation state.As leaf node L
iAnd L
jBetween when carrying out service collaboration and checking to each other service state version, then can find leaf node L
iThe service state value version that is had is than leaf node L
jIn had old.
Fig. 5 is the state synchronization method according to the embodiment of the invention, is carried out by leaf node, for example the L of Fig. 4
iOr L
jAt step S511, obtain the service state version recognition code V that is stored in local cache memory
i, this identification code is corresponding to the up-to-date service state value of storing in the local cache memory.Local cache memory can be comprised in memory 22 or the storage device 23 (as shown in Figure 2).At step S513, receive the service state version recognition code V that transmits by another leaf node
j, this identification code is corresponding to the up-to-date service state value of storing in another leaf node.At step S521, judge V
iWhether than V
jOld, be the processing of then carrying out step S531, otherwise finish entire process.At step S531, come the service-seeking (query) in root node S (as Fig. 3 or shown in Figure 4) and obtain up-to-date service state value and version recognition code thereof by sending a request (request).At step S533, will check upwards that request (upward check request) sends father node (can be via node or root node) to, comprise up-to-date service state value and the version recognition code thereof that is obtained by service in this request.The father node identification code can be obtained from local cache memory.
Fig. 6 is the state synchronization method according to the embodiment of the invention, by via node or root node, (as the S among Fig. 3, R
1To R
10Deng) carry out.At step S611, receive the request of upwards checking that transmits by child node.At step S613, obtain the service state version recognition code V that upwards checks in the request
bAt step S615, obtain the service state identification code V that is stored in the local cache memory
a, this identification code is corresponding to the up-to-date service state value of storing in the local cache memory.At step S621, judge V
aWhether than V
bOld, be the processing of then carrying out step S631, otherwise carry out the processing of step S641.At step S631, the request will upwards checked sends father node (can be via node or root node) to, comprises the service state value and the version recognition code thereof that are obtained from the upwards inspection request that receives in this request.The father node identification code can be obtained from local cache memory.At step S641, (downward update request) sends all child nodes (can be via node or leaf node) to downward update request, comprises up-to-date service state value and the version recognition code thereof that is obtained by child node in this request.
Fig. 7 is the state synchronization method according to the embodiment of the invention, by via node or leaf node, (as the R among Fig. 3
1To R
10, L
1To L
4Deng) carry out.At step S711, receive the downward update request that transmits by father node.At step S713, obtain service state value and service state version recognition code thereof in the downward update request.At step S721, judge whether to exist the child node of binding, be the processing of then carrying out step S731 and S741, otherwise carry out the processing of step S741.At step S731, send downward update request the child node (can be via node or leaf node) of all bindings to, comprise service state value and the version recognition code thereof that from the downward update request that receives, is obtained in this request.At step S741, service state value that use is obtained and service state version recognition code thereof upgrade service state value and the service state version recognition code thereof in the local cache memory.
Fig. 8 represents the state synchronized finite state machine (finite stateautomata) according to the embodiment of the invention, comprises three state S1 to S5.State S1 comprises any two leaf nodes when service collaboration, the action (action) that must carry out, detailed action details can be with reference to figure 5 described steps.When one of them leaf node detects the own service state identification code that is had than in the service state identification code old times that another leaf node had, then change (transit) to state S3.State S3 comprises when relaying node or root node and receives the action that institute when upwards checking request must execution, and detailed action details can be with reference to step shown in Figure 6.State S3 can continue to carry out, and detects when checking that upwards service state identification code that the service state identification code that comprised in the request stored unlike itself is new up to a via node or root node, just state can be transformed into S5 by S3.State S5 comprise when relaying node or leaf node receive downward update request the action that must carry out, detailed action details can be with reference to step shown in Figure 7.State S5 can continue to carry out, and when all via nodes and leaf node detect without any the child node that links, just state can be transformed into S1 by S5.
Moreover the embodiment of the invention more proposes a kind of computer read/write memory medium, is used for storage computation machine program, and aforementioned calculation machine program is used to realize state synchronization method, and these methods can be carried out aforesaid step.Fig. 9 represents the state synchronized computer read/write memory medium schematic diagram according to the embodiment of the invention.This storage medium 90 is used for store status synchronous computer program 920, when this program is loaded into processing unit 21 (as shown in Figure 2) and carries out, realizes aforesaid state synchronization method.
Below also enumerate the detailed operation situation that several examples illustrate state synchronization method.Figure 10 represents the state synchronized schematic diagram according to the embodiment of the invention.At first, as leaf node L
iDetect the service state version recognition code that had than leaf node L
jIn old times of being had, come to the service-seeking among the root node S and obtain up-to-date service state value and version recognition code (shown in the step S531 among Fig. 5) by sending a request, the request will upwards checked sends father node (shown in the step S533 among Fig. 5) to and activates a upwards audit program, is used for asking to be sent to cause the inconsistent node of service state version with upwards checking.With reference to method shown in Figure 6, upwards audit program inspection request that this can be made progress is sent to via node R in proper order
kWhen the relaying node R
kDetect the service state version recognition code that is had and check the service state version recognition code old times that comprised in the request, transmit downward update request and activate a downward refresh routine for all child nodes (shown in the step S641 among Fig. 6) unlike making progress.This downward refresh routine is used for upgrading via node R downwards
kService state value and the service state identification code thereof in all nodes of directly or indirectly linking.With reference to method shown in Figure 7, subtree T
kIn all nodes all can use service state value in the downward update request of reception and service state version recognition code thereof to upgrade service state value and service state version recognition code (shown in the step S741 among Fig. 7) thereof in the local cache memory.
Figure 11 represents the state synchronized schematic diagram according to the embodiment of the invention.In this example, suppose leaf node L
iWith leaf node L
i' have an identical service state version recognition code.As leaf node L
iDetect the service state version recognition code that had than leaf node L
jIn old times of being had, remove the state synchronized mechanism that activates as shown in figure 10 and upgrade subtree T
kIn all nodes in the service state value and the service state version recognition code outside, also will pass to another leaf node L by service state value and the service state identification code thereof that root node S is obtained
i'.Make leaf node L
i' the state synchronized mechanism that can activate as shown in figure 10 upgrades subtree T
k' in all nodes in service state value and service state version recognition code thereof.
Though the present invention discloses as above by preferred embodiment; but it also is not used in qualification the present invention; any those skilled in the art; without departing from the spirit and scope of the present invention; all can change and revise, so protection scope of the present invention should be as the criterion with appended claim institute restricted portion.
Claims (18)
Priority Applications (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CNB2006100903278A CN100531059C (en) | 2006-06-29 | 2006-06-29 | State Synchronization System and Method |
Applications Claiming Priority (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CNB2006100903278A CN100531059C (en) | 2006-06-29 | 2006-06-29 | State Synchronization System and Method |
Publications (2)
Publication Number | Publication Date |
---|---|
CN101098249A CN101098249A (en) | 2008-01-02 |
CN100531059C true CN100531059C (en) | 2009-08-19 |
Family
ID=39011788
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
CNB2006100903278A Expired - Fee Related CN100531059C (en) | 2006-06-29 | 2006-06-29 | State Synchronization System and Method |
Country Status (1)
Country | Link |
---|---|
CN (1) | CN100531059C (en) |
Families Citing this family (4)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US8185495B2 (en) * | 2008-02-01 | 2012-05-22 | Microsoft Corporation | Representation of qualitative object changes in a knowledge based framework for a multi-master synchronization environment |
EP2450793A1 (en) * | 2010-11-04 | 2012-05-09 | HTC Corporation | Method of defining state transitions in a software and application control management object |
CN108446356B (en) * | 2018-03-12 | 2023-08-29 | 上海哔哩哔哩科技有限公司 | Data caching method, server and data caching system |
CN115567862A (en) * | 2022-09-27 | 2023-01-03 | 海信视像科技股份有限公司 | Display device, hearing aid and volume adjustment method |
Citations (2)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN1345148A (en) * | 2000-09-18 | 2002-04-17 | 阿尔卡塔尔加拿大公司 | Method and device for implementation of resynchronization of topological data base in communication network having topological state routing protocol |
CN1725758A (en) * | 2004-07-19 | 2006-01-25 | 西门子公司 | Method for synchronizing distributed systems |
-
2006
- 2006-06-29 CN CNB2006100903278A patent/CN100531059C/en not_active Expired - Fee Related
Patent Citations (3)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN1345148A (en) * | 2000-09-18 | 2002-04-17 | 阿尔卡塔尔加拿大公司 | Method and device for implementation of resynchronization of topological data base in communication network having topological state routing protocol |
EP1598995A2 (en) * | 2000-09-18 | 2005-11-23 | Alcatel Canada Inc. | Method and apparatus for topology database re-synchronization in communications networks having topology state routing protocols |
CN1725758A (en) * | 2004-07-19 | 2006-01-25 | 西门子公司 | Method for synchronizing distributed systems |
Also Published As
Publication number | Publication date |
---|---|
CN101098249A (en) | 2008-01-02 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
JP6894944B2 (en) | Application implementation methods, devices, devices and storage media based on blockchain networks | |
CN101529415B (en) | Offline execution of web based applications | |
CN103917972B (en) | For providing session compatibility and improved connective system and method in company-data lab environment | |
CN104205099B (en) | Method and system for centralized issue track | |
CN102742303B (en) | There is the message based mobile object that local PIM is integrated | |
CN102362272A (en) | Device dependent on-demand compiling and deployment of mobile applications | |
CN101160563A (en) | Method and system for hosting and executing a component application | |
US20120215880A1 (en) | Forwarding data from server to device | |
WO2019184775A1 (en) | Management data storage method and device, and storage medium | |
CN100531059C (en) | State Synchronization System and Method | |
CN109410019B (en) | Commodity price comparison method based on block chain and Internet of things technology | |
CN101562804A (en) | Region management server system based on mobile P2P and deploying method thereof | |
CN102937897A (en) | Asynchronous data binding | |
US20070299958A1 (en) | State synchronization apparatuses and methods | |
CN101675424A (en) | Inter-process communication methods and apparatus for building scalable/redundant telecommunications systems | |
CN113014618B (en) | Message processing method and system and electronic equipment | |
CN102833272A (en) | Downloading method and device based on user subscription | |
CN101699436B (en) | The methods, devices and systems of resource management | |
US20070263671A1 (en) | State synchronization apparatuses and methods | |
CN108877188A (en) | A kind of environment protection digital concurrently acquires and Multi net voting dissemination method and device | |
CN101106489A (en) | State Synchronization System and Method | |
CN102326371B (en) | Transmission method for door application assembly information, and slave station and main station | |
US7366505B2 (en) | Apparatus and method for delivering messages to a mobile information terminal | |
CN112230968A (en) | Firmware update method, apparatus, server, and computer-readable storage medium | |
JPWO2013161522A1 (en) | Log collection server, log collection system, and log collection method |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
C06 | Publication | ||
PB01 | Publication | ||
C10 | Entry into substantive examination | ||
SE01 | Entry into force of request for substantive examination | ||
C14 | Grant of patent or utility model | ||
GR01 | Patent grant | ||
C17 | Cessation of patent right | ||
CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20090819 Termination date: 20100629 |