CN106790648A - A kind of synchronous method and system of task data - Google Patents
A kind of synchronous method and system of task data Download PDFInfo
- Publication number
- CN106790648A CN106790648A CN201710026976.XA CN201710026976A CN106790648A CN 106790648 A CN106790648 A CN 106790648A CN 201710026976 A CN201710026976 A CN 201710026976A CN 106790648 A CN106790648 A CN 106790648A
- Authority
- CN
- China
- Prior art keywords
- target
- server
- servers
- service broker
- autonomous service
- 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.)
- Pending
Links
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L67/00—Network arrangements or protocols for supporting network services or applications
- H04L67/01—Protocols
- H04L67/10—Protocols in which an application is distributed across nodes in the network
- H04L67/1095—Replication or mirroring of data, e.g. scheduling or transport for data synchronisation between network nodes
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Computer And Data Communications (AREA)
Abstract
The invention discloses a kind of synchronous method and system of task data, belong to content distributing network technical field.Methods described includes：Target AMA servers determine that goal task is interval,Obtain the interval corresponding target merkle tree of the goal task,The bottom layer node of the target merkle tree is task ID,The target AMA servers are selected with reference to AMA servers in the corresponding network node of target AMF servers,Synchronization request is sent to the reference AMA servers,The interval start-stop mark of the goal task is carried in the synchronization request,The reference AMA servers are according to the interval start-stop mark of the goal task carried in the synchronization request,Obtain corresponding reference merkle tree,The target AMA servers and the reference AMA servers are based on merkle tree alignment algorithms,Compare the target merkle tree and reference merkle tree,Task data synchronization is carried out according to comparison result.Using the present invention, when node server carries out task data synchronization, increase the operating load of management server.
Description
Technical field
The present invention relates to content distributing network technical field, the synchronous method and system of more particularly to a kind of task data.
Background technology
Internet service continues the growth of explosion type, and the backstage for corresponding to service providing end is then background server quantity
Continue the growth of explosion type.Specifically, certain specific Internet service, fraction visitor need to be only serviced at its birth initial stage
Family, but as client's amount increases, old background server quantity often can not meet new demand, and now service providing end is past
It is past to take the mode of newly-increased background server to tackle.
In content distributing network, the management typically to background server is to carry out centralization tune by node server
Degree, as background server quantity is on the increase, the quantity of node server also accordingly increases.Node server side can set up
Management server, for managing multiple node servers.Operation troubles is produced to avoid factor data mistake, node server warp
The acquisition data from management server are often needed to synchronize, however, because the quantity of node server is more, management server
Operating load it is higher.
The content of the invention
In order to solve problem of the prior art, the embodiment of the invention provides a kind of synchronous method of task data and be
System.The technical scheme is as follows：
First aspect, there is provided a kind of synchronous method of task data, methods described applies to oneself of content distributing network
Service management system is adapted to, the self adaptation service management system includes at least one network node, and each network node is by one
Individual autonomous service framework AMF servers and at least one autonomous service broker AMA server groups are into methods described includes：
Target AMA servers determine that goal task is interval, obtain the interval corresponding target merkle of the goal task
The bottom layer node of tree, the target merkle tree is task ID；
The target AMA servers are selected with reference to AMA servers in the corresponding network node of target AMF servers, to
The reference AMA servers send synchronization request, and the interval start-stop mark of the goal task is carried in the synchronization request；
The reference AMA servers are obtained according to the interval start-stop mark of the goal task carried in the synchronization request
Corresponding reference merkle tree；
The target AMA servers and the reference AMA servers are based on merkle tree alignment algorithms, compare described
The target merkle tree and reference merkle tree, task data synchronization is carried out according to comparison result.
Second aspect, there is provided a kind of synchronous system of task data, the system includes：
Target AMA servers, for determining that goal task is interval, obtain the interval corresponding target of the goal task
The bottom layer node of merkle tree, the target merkle tree is task ID；
The target AMA servers, for being selected in the corresponding network node of target AMF servers with reference to AMA services
Device, synchronization request is sent to the reference AMA servers, and the interval start-stop of the goal task is carried in the synchronization request
Mark；
The reference AMA servers, for being identified according to the interval start-stop of the goal task carried in the synchronization request,
Obtain corresponding reference merkle tree；
The target AMA servers and the reference AMA servers, for based on merkle tree alignment algorithms, comparing
The target merkle tree and reference merkle tree, task data synchronization is carried out according to comparison result.
The beneficial effect that technical scheme provided in an embodiment of the present invention is brought is：
In the embodiment of the present invention, target AMA servers determine that goal task is interval, obtain the interval corresponding mesh of goal task
The bottom layer node of mark merkle tree, target merkle tree is task ID, and target AMA servers are in target AMF servers
Selection refers to AMA servers in corresponding network node, and synchronization request is sent to reference to AMA servers, is carried in synchronization request
There is the interval start-stop of goal task to identify, with reference to AMA servers according to the interval start-stop of the goal task carried in synchronization request
Mark, obtains corresponding reference merkle tree, and target AMA servers and reference AMA servers are based on merkle tree ratios
To algorithm, compare target merkle tree and refer to merkle tree, task data synchronization is carried out according to comparison result.This
Sample, when target AMA servers need to carry out task data synchronization, at other AMA servers that can be from consolidated network node
Task data is obtained, management server operating load will not be increased.
Brief description of the drawings
Technical scheme in order to illustrate more clearly the embodiments of the present invention, below will be to that will make needed for embodiment description
Accompanying drawing is briefly described, it should be apparent that, drawings in the following description are only some embodiments of the present invention, for
For those of ordinary skill in the art, on the premise of not paying creative work, other can also be obtained according to these accompanying drawings
Accompanying drawing.
Fig. 1 is a kind of synchronous method flow diagram of task data provided in an embodiment of the present invention；
Fig. 2 is a kind of flow chart of merkle tree alignment algorithms provided in an embodiment of the present invention；
Fig. 3 is a kind of flow chart for determining bottom difference node provided in an embodiment of the present invention；
Fig. 4 is a kind of synchronous schematic flow sheet of task data provided in an embodiment of the present invention；
Fig. 5 is a kind of block schematic illustration of LAM systems provided in an embodiment of the present invention；
Fig. 6 is a kind of method flow diagram of self adaptation Service Management provided in an embodiment of the present invention；
Fig. 7 is a kind of method flow diagram of process task request provided in an embodiment of the present invention；
Fig. 8 is a kind of logical flow chart of process task request provided in an embodiment of the present invention.
Specific embodiment
To make the object, technical solutions and advantages of the present invention clearer, below in conjunction with accompanying drawing to embodiment party of the present invention
Formula is described in further detail.
A kind of method of data syn-chronization is the embodiment of the invention provides, the method can apply to oneself of content distributing network
Adapt to service management system, it is also possible to referred to as LAM (Local Autonomous Manager, partial autonomy's management) system, such as
Shown in Fig. 5, the system includes at least one network node, and a network node can be single computer room, or multiple machines
Room, one AMF (Autonomous Management Framework, the autonomous service framework) service of each network node correspondence
Device (can be described as management server) and at least one AMA (Autonomous Management Agent, autonomous service broker) take
Business device (can be described as node server), AMF servers are used to manage all AMA servers in each node, while can be right
Outer to receive the task requests that service request end (may be considered client) sends, AMA servers are used to process and service offer
The survival detection of the Register Cancel, business of the service of Fang Xiangguan, such as business and hardware resource management, and to service providing end
The task requests of forwarding.Server provides the specific service device that end is business provider exploitation, as long as meeting the clothes of access conditions
Business device, can be linked into LAM systems by AMA servers, AMR (Autonomous Management Resolve, from
Control service parsing) server is responsible for for the domain name addresses of AMF servers resolving to specific IP (Internet Protocol, net
Network agreement) address, for the detection of AMA servers.
Below in conjunction with specific embodiment, the handling process shown in Fig. 1 is described in detail, content can be as
Under：
Step 101, target AMA servers determine that goal task is interval, obtain the interval corresponding target of goal task
The bottom layer node of merkle tree (Merkel tree), target merkle tree is task ID.
In force, when LAM systems receive the task requests of service request end transmission, it is connected with the service request end
AMF servers can distribute task ID for the task requests, wherein, the task ID of multiple tasks request is mutually continuous, and often
Individual task ID is not repeated uniquely, and the form of task ID can be：TaskID001, TaskID002, TaskID003 etc..AMF is serviced
Task requests can be sent to device all AMA servers of its management.After AMA servers receive task requests, can be by
All the elements of task requests are stored in database, and task ID is stored in into disk in addition in the form of merkle tree,
Merkle tree can be complete binary tree, the node data of the bottom layer node of merkle tree be the task ID that has stored or
Person represents the None values not stored, and the node data of remaining each node is all based on default computation rule, by its next layer
What the node data of node was calculated.In order to reduce disk and EMS memory occupation, each Merkle Tree maximum numbers of plies can be
15, then the task ID sum that each merkle tree is preserved is no more than 215-1, i.e., 16384.And work as total task number more than 215-1
When, can the store tasks ID in the form of sub- merkle tree and father merkle tree, i.e., the bottom section of sub- merkle tree
The None values that the node data of point is not stored for task ID or expression, the node data of the top mode of sub- merkle tree
It is the node data of the bottom layer node of father merkle tree, and the maximum number of plies of father merkle tree can also be 15, so
One father merkle tree can record 215-1x 215-1Individual task ID.After AMA servers receive new task requests, then
Its task ID can be stored into merkle tree corresponding position, that is, cover None values.AMF servers can be managed for it
All AMA servers of reason divide unified task interval, and the interval size of task, quantity can be specified by AMF servers, and
Timing rollback is supported, such as：Task interval size be 10, quantity is 3, then be respectively [TaskID000, TaskID009],
[TaskID010,TaskID019]、[TaskID020,TaskID029]；If task task ID030 arrives, task is interval will
It is changed into [TaskID010, TaskID019], [TaskID020, TaskID029], [TaskID030, TaskID039], deletes and appoint
Business is interval [TaskID000, TaskID009].
AMA servers periodically can carry out data syn-chronization with other the AMA servers in consolidated network node, i.e., together
Step task data.When certain AMA server (i.e. target AMA servers) needs to initiate data syn-chronization, this can be first determined
Need synchronous task interval (i.e. goal task is interval), then obtain the interval corresponding target of the goal task being locally stored
Merkle tree, if the task ID quantity that goal task interval includes is more than 215-1It is individual, then can obtain multiple target
Merkle tree, then target AMA servers can be based on the sub- merkle tree generation target fathers merkle of multiple targets
Tree, so, subsequent treatment may be considered what target father merkle tree were carried out.
Step 102, target AMA servers select to be serviced with reference to AMA in the corresponding network node of target AMF servers
Device, synchronization request is sent to reference to AMA servers, and the interval start-stop mark of goal task is carried in synchronization request.
In force, target AMA servers can take in other AMA in the corresponding network node of target AMF servers
Any selection one refers to AMA servers in business device, used as the object of data syn-chronization.Afterwards, target AMA servers can be to ginseng
Examine AMA servers and send synchronization request, the mesh of target AMA servers determination in step 101 can be carried in the synchronization request
The interval start-stop mark of mark task, start-stop mark can be goal task two task ID values of interval head and the tail.
Step 103, with reference to AMA servers according to the interval start-stop mark of the goal task carried in synchronization request, obtains
Corresponding reference merkle tree.
In force, the synchronization request that target AMA servers send is received with reference to AMA servers, what acquisition was wherein carried
The start-stop mark of target interval, can then obtain what is stored in local disk afterwards, and the start-stop identifies corresponding reference merkle
tree.Similarly, if the task ID quantity that goal task interval includes is more than 215-1It is individual, then can obtain multiple with reference to son
Merkle tree, can be based on multiple with reference to sub- merkle tree generation reference fathers merkle then referring to AMA servers
Tree, so, subsequent treatment may be considered to referring to what father merkle tree were carried out.
Step 104, target AMA servers and reference AMA servers are based on merkle tree alignment algorithms, compare target
Merkle tree and reference merkle tree, data syn-chronization is carried out according to comparison result.
In force, target merkle tree and ginseng are got respectively in target AMA servers and with reference to AMA servers
After examining merkle tree, merkle tree alignment algorithms can be based on, compare target merkle tree and refer to merkle
Whether the node data of same position node is consistent in tree, can carry out corresponding data according to comparison result afterwards same
Step.Specifically, target/with reference to AMA servers can by target/be sent to other side with reference to the node data of merkle tree, with
The machine merkle for making the node data of the other side merkle tree that will be received with reference to/target AMA servers and having obtained
The node data of tree is compared.
Optionally, the merkle tree alignment algorithms in step 104 can specifically as represented by the flow of figure 2：
Step 201, target AMA servers are to all sections of n-th layer with reference to AMA servers transmission target merkle tree
The node data of point, wherein N is the integer more than 0.
In force, target AMA servers can choose target merkle after target merkle tree are obtained
A certain layer (i.e. n-th layer, N is the integer more than 0) all nodes of tree, then send out the node data of all nodes of n-th layer
Give with reference to AMA servers.
Step 202, the n-th layer with reference to merkle tree and target merkle tree is compared with reference to AMA servers one by one
The node data of all nodes.
In force, the N of the target merkle tree of target AMA servers transmission can be received with reference to AMA servers
The node data of all nodes of layer, then can be by with reference to the node data and target of all nodes of n-th layer of merkle tree
The node data of all nodes of n-th layer of merkle tree one by one and is compared.
Step 203, if there is node data with reference to inconsistent in merkle tree and target merkle tree
N-th layer difference node, target AMA servers and then determines bottom difference section with reference to AMA servers according to n-th layer difference node
Point.
In force, during comparison, if it find that with reference in merkle tree and target merkle tree certain
The node data of one same position node is inconsistent, then can be difference node by the vertex ticks.Own n-th layer has been compared
After the node data of node, target AMA servers and can be according to all n-th layer difference sections for marking with reference to AMA servers
Point determination bottom difference node.It should be noted that in the present embodiment, in the network node of target AMF server admins
In the corresponding different merkle tree of different AMA servers, same position node may be considered same node, so such as
Non-specific is limited, and is to different merkle tree interior joints while processing when processing some node, such as
The treatment of above-mentioned " being difference node by the vertex ticks ", it can be understood as " while will be with reference to merkle tree and target
Corresponding vertex ticks is difference node in merkle tree ".
Step 204, the corresponding task data of bottom difference node is sent with reference to AMA servers to target AMA servers, with
Target AMA servers are made to complete task data synchronization.
In force, after bottom difference node is determined, the bottom difference node can be obtained with reference to AMA servers
Node data, i.e. task ID, then obtain corresponding task data in the local database, and then can be with reference to AMA servers
The corresponding task data of bottom difference node is sent to target AMA servers, so that target AMA server storage number of tasks
According to, and more fresh target merkle tree, complete task data synchronization.
Optionally, if the node data of all nodes of n-th layer with reference to merkle tree and target merkle tree
It is consistent, then send synchronous cancellation message to target AMA servers with reference to AMA servers.
In force, if the nodes of all nodes of n-th layer with reference to merkle tree and target merkle tree
According to consistent, then it represents that subsynchronous without carrying out, so can send synchronous to target AMA servers with reference to AMA servers
Cancel message, this subsynchronous end.
Optionally, target AMA servers and bottom is determined according to n-th layer difference node with reference to AMA servers in step 203
The treatment of difference node can be as shown in Fig. 3 flows：
Step 301, the node identification of n-th layer difference node is sent with reference to AMA servers to target AMA servers.
In force, after n-th layer difference node is determined, can be sent out to target AMA servers with reference to AMA servers
The node identification of n-th layer difference node is sent, the node identification can be the positional information of node, such as n-th layer m-th node.
Step 302, target AMA servers are to N in N+1 layers with reference to AMA servers transmission target merkle tree
The node data of all lower level nodes of layer difference node.
In force, target AMA servers receive the node mark of the n-th layer difference node sent with reference to AMA servers
After knowledge, the lower level node of difference node can be determined according to the node identification, then by N+1 layers of target merkle tree
The node data of all lower level nodes of middle n-th layer difference node is sent to reference to AMA servers, for example, target merkle
Tree is complete binary tree, and difference node is n-th layer m-th node, then all lower level nodes of the difference node are N+1 layers
2M-1, the 2M node.
Step 303, the N+1 with reference to merkle tree and target merkle tree is compared with reference to AMA servers one by one
The node data of all lower level nodes of difference node, determines N+1 layers of difference node in layer.
In force, the N+1 of the target merkle tree of target AMA servers transmission is received with reference to AMA servers
The node data of all lower level nodes of difference node in layer, can be by itself and difference in N+1 layers with reference to merkle tree
The node data of all lower level nodes of node is compared one by one, it is then determined that inconsistent N+1 layers of egress data is poor
Heteromerism point.
Step 304, when being the bottom for N+1 layers, the reference AMA servers determine bottom difference node.
In force, after N+1 layers of difference node is determined, can determine according to the treatment of step 301 to step 303
Underlying differences node, so, by that analogy, when the bottom that N+1 layers is merkle tree, then can determine that bottom is poor
Heteromerism point.
Optionally, to avoid excessive AMA servers from initiating the bandwidth pressure mistake that synchronization request causes in network node simultaneously
Greatly, AMA servers are necessary to determine whether possess synchronous authority before task data synchronization is carried out, and corresponding treatment can be as follows：
Target AMA servers receive the synchronometer numerical value and AMA servers sum that target AMF servers send, target AMA server roots
Judge whether possess synchronous authority according to synchronometer numerical value and AMA servers sum, and the machine sequence number.
In force, in order to ensure the correctness of the task data of each AMA servers, the AMA clothes in consolidated network node
Business device needs to carry out task data synchronization in turn.AMF servers can be all AMA servers in the network node of its management
Allotment Serial Number, while synchronometer numerical value and AMA servers sum can be provided to all AMA servers.So, target AMA clothes
Business device can receive the synchronometer numerical value and AMA servers sum of target AMF servers transmission.Herein, synchronometer numerical value and AMA
The treatment of server sum can will carry out actively being serviced from target AMF before task data is synchronous in target AMA servers
Target AMF servers are actively sent to target after device is obtained, or synchronometer numerical value and AMA servers always change
AMA servers.Target AMA servers can be sentenced according to synchronometer numerical value and AMA servers sum, and the machine sequence number afterwards
It is disconnected whether to possess synchronous authority, specifically, work as meeting formula " synchronometer numerical value " % " AMA servers sum "==" target
During AMA servers sequence number ", target AMA servers possess synchronous authority, wherein, " % " is to take the remainder computing.In addition, working as this
After EOS, target AMA servers can be sent to target AMF servers and synchronously complete message, and target AMF servers then may be used
Add one with by synchronometer numerical value.
Fig. 4 shows a kind of synchronous schematic flow sheet of feasible task data.
In the embodiment of the present invention, target AMA servers determine that goal task is interval, obtain the interval corresponding mesh of goal task
The bottom layer node of mark merkle tree, target merkle tree is task ID, and target AMA servers are in target AMF servers
Selection refers to AMA servers in corresponding network node, and synchronization request is sent to reference to AMA servers, is carried in synchronization request
There is the interval start-stop of goal task to identify, with reference to AMA servers according to the interval start-stop of the goal task carried in synchronization request
Mark, obtains corresponding reference merkle tree, and target AMA servers and reference AMA servers are based on merkle tree ratios
To algorithm, compare target merkle tree and refer to merkle tree, task data synchronization is carried out according to comparison result.This
Sample, when target AMA servers need to carry out task data synchronization, at other AMA servers that can be from consolidated network node
Task data is obtained, management server operating load will not be increased.
The embodiment of the present invention additionally provides a kind of method of self adaptation Service Management, and the method can apply to the above
The self adaptation service management system of distribution network.
Below in conjunction with specific embodiment, the handling process shown in Fig. 6 is described in detail, content can be as
Under：
Step 601, Target Autonomous service broker AMA servers are according at least one autonomous service framework for prestoring
The address information of AMF servers, the first probe message is sent at least one AMF servers.
In force, in force, do not add the AMA servers of any AMF servers to be referred to as free AMA to service
Device, free AMA servers need to be added in AMF servers by the detection mechanism of self adaptation.Existing one free AMA servers
(i.e. target AMA servers), can be previously stored with the address information of at least one AMF servers, so in target AMA servers
Target AMA servers can be started with marker detection process afterwards, and set time-out time (such as 5 seconds), while target AMA servers
Initiated to connect at least one AMF servers according to address above mentioned information, and send detection bag (i.e. the first probe message), the bag
ID can be ID1.
Step 602, at least one AMF servers receive the first probe message that target AMA servers send, to target
AMA servers return to the first probe response of the first probe message of correspondence.
In force, part AMF servers (i.e. at least one AMF servers) in LAM systems can receive target
The first probe message that AMA servers send, then can return to the first of the first probe message of correspondence to target AMA servers
Probe response.
Step 603, target AMA servers receive the first probe response of at least one AMF servers return, at least
Selection target AMF servers in one AMF server, and send addition request to target AMF servers.
In force, after target AMA servers receive the first probe response of at least one AMA servers return, can
So that an AMF servers (i.e. target AMF service to be added is selected in above-mentioned AMA servers according to the first probe response
Device), and marker detection process terminates, so that target AMA servers can send to target AMF servers adds request.
Step 604, target AMF servers receive the addition request that target AMA servers send, by target AMA servers
Added in the corresponding network node of target AMF servers.
In force, after target AMF servers receive the addition request of target AMA servers transmission, can be by target
AMA servers are added in the corresponding network node of target AMF servers.
Optionally, the treatment of above-mentioned steps 601 to step 604 is properly termed as unidirectional detection, and detection mechanism can also include
Bi-directional probing, accordingly, also includes following treatment after step 602：If at least one AMF servers are serviced with target AMF
Device is in consolidated network node, or target AMA servers possess outer net IP, and at least one AMF servers then take to target AMA
Business device sends the second probe message, and target AMA servers receive the second probe message that at least one AMF servers send, to
At least one AMF servers send the second probe response.
In force, at least one AMF servers are sending the probe response of correspondence probe message to target AMA servers
Afterwards, network node that can be according to residing for the network address of target AMA servers judges it, if AMF servers and target
AMF servers are in consolidated network node, or target AMA servers possess outer net network protocol IP address, then AMF servers
The second probe message can be sent to target AMA servers；Target AMA servers receive what at least one AMF servers sent
Second probe message, sends the second probe response, so that above-mentioned at least one AMF servers can at least one AMF servers
To receive the second probe response of target AMA servers transmission, so, bi-directional probing is to complete.It should be noted that in AMA
When server selects AMF servers to be added, bi-directional probing result priority is higher than unidirectional detection, i.e. AMA servers always
It is preferential to add the successful AMF servers of bi-directional probing, so corresponding selection treatment can be as follows：In the second spy having been received by
Survey in the corresponding at least one AMF servers of message, selection target AMF servers, i.e. target AMA servers can preferentially connect
Target AMF servers are chosen in the corresponding all AMF servers of the second probe message for receiving.
Optionally, target AMA servers can be according to the response speed selection target AMF servers of each AMF servers, phase
Answer, the treatment of step 604 can be as follows：For each the AMF server at least one AMF servers, target AMA services
Device calculates the moment that the first probe message is sent to AMF servers, with the first probe response for receiving the return of AMF servers
Time difference between moment, the minimum AMF servers of selection time difference are used as target AMF servers.
In force, target AMA servers at least one AMF servers send the first probe message when, Ke Yikai
Beginning timing, then often receives first probe response of AMF server feedbacks, then record to should AMF servers
Detection take, the time-consuming most short AMF servers of detection then can be selected as target AMF servers, so, then can select
Select out the AMF server best with network quality between target AMA servers.
Optionally, this programme additionally provides the treatment that a kind of service providing end registers business process on AMA servers, phase
The treatment answered can be as follows：Target AMA servers receive the business process registration request that service providing end sends, business process note
Log-on message is carried in volume request, wherein, log-on message at least includes service identification, serve port mark, business process mark
Knowledge, service announcements mode；Target AMA servers detect whether log-on message business process registration request has according to log-on message
Effect, if it is, allowing business process registration request；If it is not, then sending registration error message to service providing end.
In force, LAM systems support that target AMA servers carry out dynamic plug-in type management to the machine different business.
Dynamic refers to that LAM systems are not aware which service providing end can carry out business process registration in advance.Plug-in type refers to that business is entered
The registration or cancellation of journey have no effect on the function of other LAM systems, and such as business process registration of service providing end, business process is deposited
Detection living, business process are nullified, service resources are controlled and business datum is pushed etc..Service providing end is in target AMA servers
Enterprising industry business process registers need to meet following condition：Business must be the business that target AMA servers are supported, business must be with
Process is registered for unit, and the port of registration need to support http protocol.
The process that business process is registered can be as：Service providing end is first coupled to target AMA servers, and service providing end can
Business process registration request is sent with to target AMA servers, content includes：Service identification, serve port mark, business process
ID, and service announcements mode.Wherein service identification is used to compare with the Service name in above-mentioned task requests, " service end
Mouthful mark " is target port that task requests are sent to, namely serve port, " serve port mark " and " business process ID " jointly
Correctness for judging business process, " service announcements mode " is that target AMA servers please to service providing end transmission task
The mode asked.Afterwards, target AMA servers can check the validity of business process registration request, including：Serve port and industry
Whether business process ID matches, and whether business process ID survives.Once verifying successfully, AMA servers are same by above-mentioned log-on message
LAM systems are walked, and registering result is returned to service providing end；Otherwise then return to error message.
It is noted that after the completion of business process registration, still need to timing and send log-on message to target AMA servers,
Now target AMA servers can automatically be regarded as heartbeat signal.If the heartbeat signal of business process is persistently lost and is reached
The upper limit (such as 5 times), the business process will be automatically logged out, if not receiving target service process in preset duration
Heartbeat signal, target AMA servers then nullify target service.Specifically：If business process is surprisingly exited to cause to have little time master
Dynamic cancellation, or service logic causes process ossified extremely, and triggering is automatically logged out into logic：Target AMA servers are in preset duration
The heartbeat signal of target service process is not received inside, and target AMA servers then may determine that whether business process survives, if
When business process is still survived trigger alarm (business process survive but heartbeat lose, now mean that business is stuck), no matter industry
Whether business process survives, and all deletes the corresponding log-on message of business process.
After the completion of business process registration, resource management, including CPU core numerical control system, internal memory will be carried out by target AMA servers
Using numerical control system.The business process accessed in LAM systems has differences in importance, need to ensure that important service process possesses more
Many hardware resources, therefore can be realized by the way of setting is responsible in hardware aspect.
Optionally, this programme is additionally provided after the completion of a kind of business registered, the task that processing business request end sends
The handling process of request, corresponding treatment can be as shown in Figure 7：
Step 701, target AMF servers receive the task requests that service request end sends, and mesh is carried in task requests
Mark AMA server identifications.
Wherein, AMA server identifications can be the ID (identification, identity) of AMA servers.
In force, service request end can be entered with certain the AMF server (i.e. target AMF servers) in LAM systems
Row communication connection, when service request end needs to obtain the service of a certain service providing end offer, can be to target AMF servers
The corresponding task requests of the service are sent, meanwhile, service request end can specify at least one AMA servers, and (such as target AMA takes
Business device) this task requests is processed, so, target AMA server identifications can be then carried in task requests.
Step 702, target AMF servers forward task requests to target AMA servers.
In force, after target AMF servers receive the task requests of service request end transmission, can obtain and wherein take
Then above-mentioned task requests can be transmitted to target AMA servers by the target AMA server identifications of band.If task requests
In carry annex, target AMF servers can randomly choose AMA servers in its corresponding network node as master
AMA servers, task requests first then are sent into the AMA servers carries out pre-download and is cached the cache to node
Machine, to accelerate the downloading process of other AMA servers.If task requests need the timing feedback, target AMF servers can to set
Determine the timer of timing feedback and with now for timing starts.If target AMF servers do not determine corresponding target AMA clothes
Business device, then return to error code to service request end.
Step 703, target AMA servers according to the service identification that prestores and the corresponding relation of service port-mark,
Determine that target service identifies corresponding destination service port-mark.
Wherein, service identification can be business name, and serve port mark can be the ID of serve port.
In force, after target AMA servers get target service mark, can in the service identification that prestores and
In the corresponding relation of serve port mark, search target service and identify corresponding destination service port-mark.Herein, above-mentioned correspondence
When relation can be that destination service offer end is registered on target AMA servers, target AMA server records.In addition, if
Target AMA servers cannot find target service and identify corresponding destination service port-mark, then can return to error code.
Step 704, target AMA servers provide end transmission task to the corresponding destination service of destination service port-mark please
Ask.
In force, target AMA servers, can be to destination service port after destination service port-mark is determined
Identify corresponding destination service and transmission task requests in end are provided.
Optionally, target AMA servers can provide end corresponding service announcements mode according to destination service, and selection is different
Mode send task requests, accordingly, the treatment of step 304 can be as follows：Target AMA servers are according to destination service port
Mark determines that destination service provides end, obtains destination service and provides end corresponding service announcements mode；If destination service is provided
Corresponding service announcements mode is held for net_notify, task requests are then sent to destination service and provided by target AMA servers
End；If it is file_notify that destination service provides the corresponding service announcements mode in end, target AMA servers then store tasks
Request, and storage address is sent to destination service offer end；If destination service provides end, corresponding service announcements mode is
The then store tasks request of file, target AMA server.
In force, target AMA servers, can be according to destination service end after destination service port-mark is determined
Mouth mark determines that destination service provides end, obtains the corresponding service announcements mode in destination service offer end.Herein, destination service is carried
For the corresponding service announcements mode in end can be destination service provide end registered on target AMA servers when, target AMA service
Device record.Wherein, target AMA servers support three kinds of different business advice methods, to adapt to different demands for services, bag
Include：Task requests are directly sent to destination service and provide end by net_notify (network advertisement), target AMA server, are applicable
It is small in data volume and frequently service, concretely comprise the following steps：Target AMA servers are direct-connected to destination service port, to destination service
End is provided and sends task requests, destination service provides end and responded；File_notify (documentary information), target AMA servers
Task requests are written to disk, then notify that destination service provides end, it is adaptable to the clothes that data volume is big and requirement of real-time is high
Business, concretely comprises the following steps：Task requests are first stored in disk by target AMA servers, destination service port are then connected to, to target
Service providing end sends store path, and destination service provides end and responded；File (file), AMA servers are by task requests
It is written to disk and is and terminate, it is adaptable to which data volume is big and requirement of real-time service not high.
Step 705, target AMA servers receive destination service and provide the task requests feedback that end sends, and please by task
Feedback of negating is sent to target AMF servers.
In force, after target AMA servers provide end transmission task requests to destination service, destination service provides end can
Fed back with to task requests, so that, target AMA servers can receive destination service and provide the task requests that end sends
Feedback, then can be sent to target AMF servers by task requests feedback.
Step 706, target AMF servers receive the task requests feedback that target AMA servers send, and task requests are anti-
Feedback is sent to service request end.
In force, target AMF servers can receive at least one target AMA servers transmission task requests it is anti-
Feedback, then collects each task requests feedback, and to service request end feedback result.If task requests need timing feedback,
Can now be fed back with timeing closing.
Fig. 8 is the corresponding simple logic flow chart of above-mentioned steps 701 to 706.
Optionally, this programme additionally provides a kind for the treatment of of service providing end active logout service on AMA servers, phase
The treatment answered can be as follows：Target AMA servers receive the business process de-registration request that service providing end sends, business process note
Log-off message is carried in pin request, wherein, log-off message at least includes service identification, serve port mark, business process mark
Knowledge, service announcements mode；Whether effectively target AMA servers detect business process de-registration request according to log-off message, if it is,
Then allow business process de-registration request；If it is not, then send nullifying error message to service providing end.
In force, service providing end can actively send business process de-registration request, this kind of cancellation mode to AMA servers
For active is nullified, actively nullifying need to meet following condition：The business process of cancellation must be the business that target AMA servers are supported
Process, it is necessary to be unregistered in units of process.The active log off procedure of service providing end can be：Service providing end is connected to
Target AMA servers, business process de-registration request is sent to target AMA servers, and content includes：Service identification, serve port
Mark, business process mark.Target AMA servers can detect the validity of business process de-registration request, including：Serve port
Whether matched with business process ID, whether business process ID survives.If effectively, target AMA servers then can be from LAM systems
The log-on message of business process is deleted in system, and deregistration is returned to service providing end.
In the embodiment of the present invention, it is proposed that LAM systems, the system can realize following technique effect：
(1) dynamic home of AMA servers is realized by adaptation mechanism, it is to avoid add AMA servers manually；
(2) " plug-in unit " mode is used, it is allowed to business process dynamic registration and various cancellation modes, it is to avoid single business process
Termination causes the disabled problem of all business process；
(3) multiple business access way is supported, different business amount, the demand for services of different real-times can be met；
(4) using global unified resource management mechanism, resource reasonable distribution is realized, it is to avoid the resource of important service is robbed
Account for；
Based on identical technology design, the embodiment of the present invention additionally provides a kind of synchronous system of task data, the system
System includes：
Target AMA servers, for determining that goal task is interval, obtain the interval corresponding target of the goal task
The bottom layer node of merkle tree, the target merkle tree is task ID；
The target AMA servers, for being selected in the corresponding network node of target AMF servers with reference to AMA services
Device, synchronization request is sent to the reference AMA servers, and the interval start-stop of the goal task is carried in the synchronization request
Mark；
The reference AMA servers, for being identified according to the interval start-stop of the goal task carried in the synchronization request,
Obtain corresponding reference merkle tree；
The target AMA servers and the reference AMA servers, for based on merkle tree alignment algorithms, comparing
The target merkle tree and reference merkle tree, task data synchronization is carried out according to comparison result.
Optionally, the target AMA servers, for sending target merkle tree's to the reference AMA servers
The node data of all nodes of n-th layer, wherein N is the integer more than 0；
The reference AMA servers, for comparing the reference merkle tree and target merkle one by one
The node data of all nodes of n-th layer of tree；
The target AMA servers and the reference AMA servers, for if there is node data in the reference
Inconsistent n-th layer difference node in the merkle tree and target merkle tree, then according to the n-th layer difference section
Point determination bottom difference node；
The reference AMA servers send the corresponding number of tasks of the bottom difference node to the target AMA servers
According to so that the target AMA servers complete task data synchronization.
Optionally, the reference AMA servers, if being additionally operable to the reference merkle tree and the target
The node data of all nodes of n-th layer of merkle tree is consistent, then send synchronous cancellation to the target AMA servers
Message.
Optionally, the reference AMA servers, for sending the n-th layer difference node to the target AMA servers
Node identification；
The target AMA servers, the N for sending the target merkle tree to the reference AMA servers
The node data of all lower level nodes of the node of n-th layer difference described in+1 layer；
The reference AMA servers, for comparing the reference merkle tree and target merkle one by one
The node data of all lower level nodes of difference node described in N+1 layers of tree, determines N+1 layers of difference node, as N
+ 1 layer be the bottom when, determine bottom difference node.
Optionally, the target AMA servers, are additionally operable to receive synchronometer numerical value and AMA that target AMF servers send
Server sum, judges whether possess synchronization according to the synchronometer numerical value and AMA servers sum, and the machine sequence number
Authority.
In the embodiment of the present invention, target AMA servers determine that goal task is interval, obtain the interval corresponding mesh of goal task
The bottom layer node of mark merkle tree, target merkle tree is task ID, and target AMA servers are in target AMF servers
Selection refers to AMA servers in corresponding network node, and synchronization request is sent to reference to AMA servers, is carried in synchronization request
There is the interval start-stop of goal task to identify, with reference to AMA servers according to the interval start-stop of the goal task carried in synchronization request
Mark, obtains corresponding reference merkle tree, and target AMA servers and reference AMA servers are based on merkle tree ratios
To algorithm, compare target merkle tree and refer to merkle tree, task data synchronization is carried out according to comparison result.This
Sample, when target AMA servers need to carry out task data synchronization, at other AMA servers that can be from consolidated network node
Task data is obtained, management server operating load will not be increased.
One of ordinary skill in the art will appreciate that realizing that all or part of step of above-described embodiment can be by hardware
To complete, it is also possible to instruct the hardware of correlation to complete by program, described program can be stored in a kind of computer-readable
In storage medium, storage medium mentioned above can be read-only storage, disk or CD etc..
The foregoing is only presently preferred embodiments of the present invention, be not intended to limit the invention, it is all it is of the invention spirit and
Within principle, any modification, equivalent substitution and improvements made etc. should be included within the scope of the present invention.
Claims (10)
1. a kind of synchronous method of task data, it is characterised in that methods described applies to the self adaptation clothes of content distributing network
Business management system, the self adaptation service management system includes at least one network node, and each network node is by an autonomy
Service framework server and at least one autonomous service broker's server group are into methods described includes：
Target Autonomous service broker's server determines that goal task is interval, obtains the interval corresponding target Merck of the goal task
You set, and the bottom layer node of the target Merkel tree is task identity；
The Target Autonomous service broker server selects ginseng in the corresponding network node of Target Autonomous service framework server
Autonomous service broker's server is examined, synchronization request is sent with reference to autonomous service broker's server to described, in the synchronization request
Carry the interval start-stop mark of the goal task；
It is described to be identified according to the interval start-stop of the goal task carried in the synchronization request with reference to autonomous service broker's server,
Obtain corresponding reference Merkel tree；
The Target Autonomous service broker server and described comparison based on Merkel tree with reference to autonomous service broker's server are calculated
Method, compares the target Merkel tree and the reference Merkel tree, and task data synchronization is carried out according to comparison result.
2. method according to claim 1, it is characterised in that the Target Autonomous service broker server and the reference
Autonomous service broker's server is based on Merkel's tree alignment algorithm, compares the target Merkel tree and the reference Merkel
Tree, task data synchronization is carried out according to comparison result, including：
The Target Autonomous service broker server sends target Merkel tree to described with reference to autonomous service broker's server
The node data of all nodes of n-th layer, wherein N is the integer more than 0；
The N for comparing the reference Merkel tree and the target Merkel tree one by one with reference to autonomous service broker's server
The node data of all nodes of layer；
If there is the inconsistent n-th layer difference section in the reference Merkel tree and the target Merkel tree of node data
Point, the Target Autonomous service broker server and the autonomous service broker's server of the reference are then according to the n-th layer difference
Node determines bottom difference node；
It is described to send the bottom difference section to the Target Autonomous service broker server with reference to autonomous service broker's server
The corresponding task data of point, so that the Target Autonomous service broker server completes task data synchronization.
3. method according to claim 2, it is characterised in that described to compare institute one by one with reference to autonomous service broker's server
State after the node data of all nodes of n-th layer for referring to Merkel tree and the target Merkel tree, also include：
If the reference Merkel tree is consistent with the node data of all nodes of n-th layer of the target Merkel tree, institute
State and then send synchronous cancellation message to the Target Autonomous service broker server with reference to autonomous service broker's server.
4. method according to claim 2, it is characterised in that described to determine that bottom is poor according to the n-th layer difference node
Heteromerism point, including：
It is described to send the n-th layer difference section to the Target Autonomous service broker server with reference to autonomous service broker's server
The node identification of point；
The Target Autonomous service broker server sends the target Merkel to described with reference to autonomous service broker's server
The node data of all lower level nodes of n-th layer difference node described in N+1 layers of tree；
The N for comparing the reference Merkel tree and the target Merkel tree one by one with reference to autonomous service broker's server
The node data of all lower level nodes of difference node described in+1 layer, determines N+1 layers of difference node；
It is described to determine bottom difference node with reference to autonomous service broker's server when being the bottom for N+1 layers.
5. method according to claim 1, it is characterised in that the Target Autonomous service broker server determines that target is appointed
Before business interval, also include：
The Target Autonomous service broker server receive the synchronometer numerical value that Target Autonomous service framework server sends and from
Control service proxy server sum；
The Target Autonomous service broker server is total according to the synchronometer numerical value and autonomous service broker's server,
And the machine sequence number judges whether possess synchronous authority.
6. the synchronous system of a kind of task data, it is characterised in that the system includes：
Target Autonomous service broker's server, for determining that goal task is interval, obtains the interval corresponding mesh of the goal task
Mark Merkel tree, the bottom layer node of the target Merkel tree is task identity；
The Target Autonomous service broker server, for being selected in the corresponding network node of Target Autonomous service framework server
Select with reference to autonomous service broker's server, synchronization request is sent with reference to autonomous service broker's server to described, the synchronization please
The interval start-stop mark of the goal task is carried in asking；
The autonomous service broker's server of reference, for according to the interval start-stop of the goal task carried in the synchronization request
Mark, obtains corresponding reference Merkel tree；
The Target Autonomous service broker server and the autonomous service broker's server of the reference, for based on Merkel tree ratio
To algorithm, the target Merkel tree and the reference Merkel tree are compared, task data synchronization is carried out according to comparison result.
7. system according to claim 6, it is characterised in that the Target Autonomous service broker server, for institute
State the node data of all nodes of n-th layer that target Merkel tree is sent with reference to autonomous service broker's server, wherein N be more than
0 integer；
The autonomous service broker's server of reference, for comparing the reference Merkel tree and the target Merkel tree one by one
The all nodes of n-th layer node data；
The Target Autonomous service broker server and the autonomous service broker's server of the reference, for if there is nodes
According to inconsistent n-th layer difference node in the reference Merkel tree and the target Merkel tree, then according to the n-th layer
Difference node determines bottom difference node；
It is described to send the bottom difference section to the Target Autonomous service broker server with reference to autonomous service broker's server
The corresponding task data of point, so that the Target Autonomous service broker server completes task data synchronization.
8. system according to claim 7, it is characterised in that described with reference to autonomous service broker's server, be additionally operable to as
Really described reference Merkel tree is consistent with the node data of all nodes of n-th layer of the target Merkel tree, then to described
Target Autonomous service broker server sends synchronous cancellation message.
9. system according to claim 7, it is characterised in that described with reference to autonomous service broker's server, for institute
State the node identification that Target Autonomous service broker server sends the n-th layer difference node；
The Target Autonomous service broker server, for being write from memory with reference to autonomous service broker's server transmission target to described
The node data of all lower level nodes of n-th layer difference node described in N+1 layers of Ke Er trees；
The autonomous service broker's server of reference, for comparing the reference Merkel tree and the target Merkel tree one by one
N+1 layers described in difference node all lower level nodes node data, N+1 layers of difference node is determined, when N+1 layers
During for the bottom, bottom difference node is determined.
10. system according to claim 6, it is characterised in that the Target Autonomous service broker server, is additionally operable to connect
Synchronometer numerical value and autonomous service broker's server sum that Target Autonomous service framework server sends are received, according to the synchronization
Count value and autonomous service broker's server sum, and the machine sequence number judge whether possess synchronous authority.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710026976.XA CN106790648A (en) | 2017-01-15 | 2017-01-15 | A kind of synchronous method and system of task data |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710026976.XA CN106790648A (en) | 2017-01-15 | 2017-01-15 | A kind of synchronous method and system of task data |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN106790648A true CN106790648A (en) | 2017-05-31 |
Family
ID=58946770
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201710026976.XA Pending CN106790648A (en) | 2017-01-15 | 2017-01-15 | A kind of synchronous method and system of task data |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN106790648A (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2019061720A1 (en) * | 2017-09-29 | 2019-04-04 | 网宿科技股份有限公司 | Data synchronization method and system |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102054035A (en) * | 2010-12-29 | 2011-05-11 | 北京播思软件技术有限公司 | Data range-based method for synchronizing data in database |
| CN102378156A (en) * | 2010-08-10 | 2012-03-14 | 鸿富锦精密工业（深圳）有限公司 | Client side equipment and method for updating equipment parameter |
| CN102693302A (en) * | 2012-05-21 | 2012-09-26 | 浙江省公众信息产业有限公司 | Quick file comparison method, system and client side |
| CN102945262A (en) * | 2012-10-19 | 2013-02-27 | 大唐移动通信设备有限公司 | Comparing method and device for RNC (Radio Network Controller) configuration data |
| CN105141681A (en) * | 2015-08-18 | 2015-12-09 | 北龙中网（北京）科技有限责任公司 | RPKI file synchronizing method and device |
-
2017
- 2017-01-15 CN CN201710026976.XA patent/CN106790648A/en active Pending
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102378156A (en) * | 2010-08-10 | 2012-03-14 | 鸿富锦精密工业（深圳）有限公司 | Client side equipment and method for updating equipment parameter |
| CN102054035A (en) * | 2010-12-29 | 2011-05-11 | 北京播思软件技术有限公司 | Data range-based method for synchronizing data in database |
| CN102693302A (en) * | 2012-05-21 | 2012-09-26 | 浙江省公众信息产业有限公司 | Quick file comparison method, system and client side |
| CN102945262A (en) * | 2012-10-19 | 2013-02-27 | 大唐移动通信设备有限公司 | Comparing method and device for RNC (Radio Network Controller) configuration data |
| CN105141681A (en) * | 2015-08-18 | 2015-12-09 | 北龙中网（北京）科技有限责任公司 | RPKI file synchronizing method and device |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2019061720A1 (en) * | 2017-09-29 | 2019-04-04 | 网宿科技股份有限公司 | Data synchronization method and system |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| EP2532137B1 (en) | Method and node entity for enhancing content delivery network | |
| CN104011701B (en) | Content transmission network system and the method that can be operated in content distribution network | |
| JP5398836B2 (en) | Method and system for message processing | |
| CN103581276B (en) | Cluster management device, system, service customer end and correlation method | |
| US7676599B2 (en) | System and method of binding a client to a server | |
| CN105704034B (en) | Access the method and central server of network | |
| CN106407011B (en) | A kind of method and system of the search system cluster service management based on routing table | |
| CN103973725B (en) | A kind of distributed cooperative algorithm and synergist | |
| CN106850710A (en) | A kind of safe data cloud storage system, client terminal, storage server and application process | |
| JP2002528966A (en) | Method and apparatus for deploying service modules in service nodes distributed to an intelligent network | |
| CN104601702B (en) | Cluster remote procedure calling (PRC) method and system | |
| CN102333029A (en) | Routing method in server cluster system | |
| CN106713506A (en) | Data acquisition method and data acquisition system | |
| CN106713391A (en) | Session information sharing method and sharing system | |
| CN106101290A (en) | A kind of method and system of server cluster management | |
| CN106953926A (en) | A kind of method for routing and device | |
| CN106487768A (en) | A kind of file sharing method and device | |
| CN106790647A (en) | A kind of method and system of self adaptation Service Management | |
| CN107430582A (en) | Thin client system, connection management device, virtual machine operations device, method and storage medium | |
| CN112217843A (en) | Service unit switching method, system and equipment | |
| US20060136487A1 (en) | Clustering apparatus and method for content delivery system by content classification | |
| CN106970843A (en) | remote invocation method and device | |
| CN108737495A (en) | Data capture method, apparatus and system | |
| CN109120556A (en) | A kind of method and system of cloud host access object storage server | |
| CN110011984A (en) | A kind of distributed cluster system and method based on REST and RPC |
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 | ||
| RJ01 | Rejection of invention patent application after publication | ||
| RJ01 | Rejection of invention patent application after publication |
Application publication date: 20170531 |