CN104270466B - Data reporting method and relevant device - Google Patents
Data reporting method and relevant device Download PDFInfo
- Publication number
- CN104270466B CN104270466B CN201410569349.7A CN201410569349A CN104270466B CN 104270466 B CN104270466 B CN 104270466B CN 201410569349 A CN201410569349 A CN 201410569349A CN 104270466 B CN104270466 B CN 104270466B
- Authority
- CN
- China
- Prior art keywords
- node
- group
- main controlled
- queuing service
- service management
- 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.)
- Active
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/12—Protocols specially adapted for proprietary or special-purpose networking environments, e.g. medical networks, sensor networks, networks in vehicles or remote metering networks
-
- 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/50—Network services
- H04L67/56—Provisioning of proxy services
- H04L67/566—Grouping or aggregating service requests, e.g. for unified processing
-
- G—PHYSICS
- G07—CHECKING-DEVICES
- G07C—TIME OR ATTENDANCE REGISTERS; REGISTERING OR INDICATING THE WORKING OF MACHINES; GENERATING RANDOM NUMBERS; VOTING OR LOTTERY APPARATUS; ARRANGEMENTS, SYSTEMS OR APPARATUS FOR CHECKING NOT PROVIDED FOR ELSEWHERE
- G07C11/00—Arrangements, systems or apparatus for checking, e.g. the occurrence of a condition, not provided for elsewhere
- G07C2011/04—Arrangements, systems or apparatus for checking, e.g. the occurrence of a condition, not provided for elsewhere related to queuing systems
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Health & Medical Sciences (AREA)
- Computing Systems (AREA)
- General Health & Medical Sciences (AREA)
- Medical Informatics (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
- Telephonic Communication Services (AREA)
Abstract
The embodiment of the invention discloses data reporting method and relevant device, to mitigate the burden of queuing service management server.The above method is applied to queuing service and manages system, and queuing service management system includes at least two node layers, wherein, 0th node layer is queuing service management server, other node layers are queue machine, and the node of same layer forms at least one group, and there are one main controlled nodes for tool in group；Method includes：The terminal data of all nodes in this group of main controlled node timed collection；Main controlled node is summarized and is counted to the terminal data being collected into, and statistical result is reported to upper layer node.In embodiments of the present invention, statistical result is simultaneously uploaded to superior node by the terminal data be responsible in collect statistics group by the main controlled node in group, is finally uploaded onto the server.Since the quantity of group will be less than terminal quantity, so the concurrency of data upload can be reduced.Also, server need to only carry out data simple secondary statistics, computation amount.
Description
Technical field
The present invention relates to field of communication technology, more specifically to data reporting method and relevant device.
Background technology
In banking institution, be distributed in the queue machine (alternatively referred to as terminal) of each site need timing upload data (including
Pipelined data, monitoring data, report data etc.) to queuing service management server.Queuing service management server receives end
After the business datum at end, data can be summarized and carry out statistical analysis.
Since queuing service management server is towards all terminals, when terminal quantity reaches thousands of or even tens of thousands of
It waits, the concurrency that terminal data uploads is huge, and queuing service management server needs to handle a large amount of data upload requests, service
Device resource consumption is larger.Also, queuing service management server needs timing for statistical analysis to the data received, and eventually
End data amount is big so that queuing service management server is constantly in busy calculating.
Invention content
In view of this, the embodiment of the present invention is designed to provide data reporting method and relevant device, is lined up with mitigating
The burden of service manager server.
To achieve the above object, the embodiment of the present invention provides following technical solution：
It is according to embodiments of the present invention in a first aspect, a kind of data reporting method is provided, applied to queuing service management system
System, the queuing service management system include at least two node layers, wherein, the 0th node layer is queuing service management server,
His node layer is queue machine, and the node of same layer forms at least one group, and there are one main controlled nodes for tool in each group；It is described
Method includes：
The terminal data of all nodes in this group of main controlled node timed collection in group；
Main controlled node in group is summarized and is counted to the terminal data being collected into, and statistical result is reported to connected
The upper layer node connect.
With reference to first aspect, in the first possible implementation, the group is set up in the following way：Institute
It states the 0th node layer and divides group, generate the group information of each group；The group information includes each in group identification, group
In the IP address of node, group in the device number of each node and group site where each node mechanism number；Every other layer
Node obtains corresponding group information；The node for belonging to same group is negotiated to determine main controlled node.
The first possible realization method with reference to first aspect, in second of possible realization method, the master control section
Point is determined as follows：The minimum node of mechanism number collects all nodes in group as interim main controlled node in group
Operating status weights；The node of operating status maximum weight is determined as main controlled node, and notify group by the interim main controlled node
All nodes in group.
Second of possible realization method with reference to first aspect, in the third possible realization method, in the group
I-th of node operating status weights is calculated by equation below：Wherein, SiRepresent institute
State the operating status weights of i-th of node, NiRepresent the business processing amount of i-th of node, DiRepresent i-th of node
Days running, eiRepresent i-th of node failure rate；tiRepresent the run time of i-th of node.
Any one of the third possible realization method to first aspect with reference to first aspect, in the 4th kind of possible reality
In existing mode, the 0th node layer is according to mechanism hierarchical relationship, the distance between node, address of node position, if
Belong to same LAN, whether node intercommunication is needed using core network bandwidth, and communication path is most short, between group mutually
It influences at least one of minimum and divides group.
Second aspect according to embodiments of the present invention provides a kind of queue machine, and system is managed applied to queuing service, described
Queuing service management system include at least two node layers, wherein, the 0th node layer be queuing service management server, other layer sections
For point for queue machine, the node of same layer forms at least one group, and there are one main controlled nodes for tool in each group；
When as main controlled node, the queue machine includes：
Main controlled node information collection module, for the terminal data of all nodes in this group of timed collection；
Main controlled node data statistics module, for the terminal data being collected into be summarized and counted, by statistical result
Report to the upper layer node being connected.
With reference to second aspect, in the first possible implementation, further include：Acquiring unit, it is corresponding for obtaining
Group information；Negotiation element, for negotiating to determine main controlled node with belonging to other nodes of same group；Each group is by described
Queuing service management server divides, and each group information is generated by the queuing service management server；The group information
Net where each node in device number and group including each node in the IP address of each node, group in group identification, group
The mechanism number of point.
The third aspect according to embodiments of the present invention provides a kind of queuing service management server, applied to queuing service
Management system, the queuing service management system include at least two node layers, wherein, the 0th node layer is the queuing service pipe
Manage server, other node layers are queue machine, and the node of same layer forms at least one group, and there are one main for tool in each group
Control node；Including：
Data collection module is at least used to obtain the statistical result that main controlled node reports；The statistical result is master control section
The terminal data of all nodes in point timed collection this group, and carry out what is obtained after collect statistics.
With reference to the third aspect, in the first possible implementation, further include：
Group division module for dividing group, generates the group information of each group；The group information includes group
Mark, in group in the IP address of each node, group in the device number of each node and group site where each node mechanism
Number, so that every other node layer obtains corresponding group information, determine main controlled node.
As it can be seen that in embodiments of the present invention, queuing service management server is no longer directly facing all terminals, but towards
Group.Terminal data in collect statistics group is responsible for, and statistical result is uploaded to higher level's section by the main controlled node in group
Point, and pass through transmission and finally upload to queuing service management server.Since the quantity of group will be less than terminal quantity, so can
The concurrency that data upload is reduced, reduces the resource consumption of queuing service management server.Also, queuing service management server
The data received are the data that main control terminal has counted, and queuing service management server need to only carry out data simple secondary
Statistics, calculation amount is than existing compared with greatly reducing.
Description of the drawings
In order to illustrate more clearly about the embodiment of the present invention or technical scheme of the prior art, to embodiment or will show below
There is attached drawing needed in technology description to be briefly described, it should be apparent that, the accompanying drawings in the following description is only this
Some embodiments of invention, for those of ordinary skill in the art, without creative efforts, can be with
Other attached drawings are obtained according to these attached drawings.
Fig. 1 manages system configuration example figure for queuing service provided in an embodiment of the present invention；
Fig. 2 is group's exemplary plot provided in an embodiment of the present invention；
Fig. 3 is data reporting method flow chart provided in an embodiment of the present invention；
Fig. 4 manages another topology example figure of system for queuing service provided in an embodiment of the present invention；
Fig. 5 manages the another topology example figure of system for queuing service provided in an embodiment of the present invention；
Fig. 6 is group's constructional flow figure provided in an embodiment of the present invention；
Fig. 7,8 are queue machine structure diagram provided in an embodiment of the present invention；
Fig. 9 is queuing service management server structure diagram provided in an embodiment of the present invention；
Figure 10 is queue machine provided in an embodiment of the present invention or queuing service management server hardware architecture diagram.
Specific embodiment
Purpose, technical scheme and advantage to make the embodiment of the present invention are clearer, below in conjunction with the embodiment of the present invention
In attached drawing, the technical solution in the embodiment of the present invention is clearly and completely described, it is clear that described embodiment is only
Only it is part of the embodiment of the present invention, instead of all the embodiments.Based on the embodiments of the present invention, ordinary skill
Personnel's all other embodiments obtained without creative efforts, shall fall within the protection scope of the present invention.
In banking institution, queuing service management system application is very extensive.Queuing service management system includes queue machine
With queuing service management server.By taking Construction Bank as an example, Construction Bank disposes more queue machines in each subbranch site, pacifies on queue machine
Equipped with CQSMC (China Construction Bank's site queuing service management system is mounted on the end application on queue machine), Construction Bank
Queuing service management server is deployed in head office, CQSMH (site queuing service management systems of China Construction Bank are installed thereon
Server-side of uniting application).
Queue machine is the machine for safeguarding custom queueing order.It is distributed in queue machine (alternatively referred to as terminal) needs of each site
Timing uploads data (including pipelined data, monitoring data, report data etc.) to queuing service management server.Queuing service pipe
After reason server receives the data of terminal, data can be summarized and carry out statistical analysis.
Since queuing service management server is towards all terminals (referring to Fig. 1), when terminal quantity reach it is thousands of even
When tens of thousands of, the concurrency that terminal data uploads is huge, and queuing service management server needs to handle in a large amount of data
Request is passed, server resource consumption is larger.Also, queuing service management server needs timing to unite the data received
Meter analysis, and terminal data amount is big so that queuing service management server is constantly in busy calculating.
In view of this, the embodiment of the present invention is designed to provide data reporting method, to mitigate queuing service management clothes
The burden of business device.
Above-mentioned data reporting method is applied to queuing service and manages system.Fig. 2 is referred to, above-mentioned queuing service manages system
For tree, it may include at least two node layers.Wherein, the 0th node layer be queuing service management server, other node layers
(being in fig. 2 the 1st node layer) is queue machine, and the node of same layer forms at least one group, in each group there are one tools
Main controlled node.
Fig. 3 is referred to, above-mentioned data reporting method may include：
The terminal data of all nodes in this group of main controlled node timed collection in S1, group；
Main controlled node in S2, group is summarized and is counted to the terminal data being collected into, and statistical result is reported to
The upper layer node being connected.
By taking the system of queuing service management shown in Fig. 2 as an example, the 1st layer of node forms multiple groups, and the 0th node layer is namely
Queuing service management server opens group's main controlled node data collection interface, and group's main controlled node uploads group by this interface
Statistical result in group.Queuing service management server carries out simple secondary statistics after receiving statistical result.
In this way, referring to Fig. 4, main controlled node logically forms a node layer again, can be by main controlled node logically
It is considered as branch's node, other queue machines are subbranch's node, then branch's node is located at queuing service management server (the 0th node layer)
Between other queue machines (the 2nd node layer).
More specifically, subbranch's node specifically may include the client of this operation node to the monitoring data that its main controlled node is sent
Average latency, the client's number handled and business average handling time.Branch's node is receiving Zhong Ge subbranches of group section
After the monitoring data that point is sent, statistical result is branch's monitoring data, for example, branch client average latency, branch trade
Business average handling time.
By taking the branch client average latency as an example, the branch client average latency is according to Nei Ge subbranches of group node
Client's average latency and client's number for handling be calculated.
Assuming that certain group shares N number of subbranch's node, wherein client's average latency of i-th of subbranch's node is ti, do
Client's number of reason is xi, the branch client average latency is t, then
After branch's node statistics go out branch's monitoring data, then to queuing service management server send branch monitoring data.
And in existing way, it is to send subbranch's monitoring data from subbranch's node to queuing service management server, then by queuing service
Management server calculates branch's monitoring data according to subbranch's monitoring data.Than existing, the present embodiment uses group
Prescription formula can greatly reduce the concurrency of data upload and the calculation amount of queuing service management server.Queuing service management
After server receives branch's monitoring data again, secondary statistics can be carried out, obtains head office's monitoring data, for example, head office client puts down
Equal stand-by period, head office's business average handling time etc..
By taking the head office client average latency as an example, the head office client average latency is the client according to each branch's node
What average latency and the client's number handled were calculated.
Assuming that there is M branch's node, wherein client's average latency of j-th of branch's node is tj, handle in lines
Client's number is xj, the head office client average latency is T, then
In other embodiments of the present invention, as the main controlled node (branch's node) in Fig. 4 is more, refer to Fig. 5, then it can will
The subdivided group of branch's node also (for the sake of difference, can be described as branch's master control section in each group including a main controlled node
Point), the terminal data of all nodes in this group of main controlled node timed collection of branch summarizes the terminal data being collected into
And statistics, statistical result is reported to the upper layer node (namely queuing service management server) being connected.
How branch's main controlled node counts the statistical that can refer to aforementioned main controlled node, and therefore not to repeat here.
If branch's node is still more, then can continue to divide group, therefore not to repeat here.
Overview diagrams 2,5, in scene shown in Fig. 2, the terminal data of i-th of node (i is integer) only includes in certain group
The data of i-th of node itself.And in scene shown in Fig. 5, the terminal data of i-th of node then may include in certain group of branch
Statistical result that node data of itself are either reported comprising lower level node or simultaneously comprising the node data of itself
And the statistical result that lower level node reports.
As it can be seen that in embodiments of the present invention, queuing service management server is no longer directly facing all terminals, but towards
Group.Terminal data in collect statistics group is responsible for, and statistical result is uploaded to higher level's section by the main controlled node in group
Point, and pass through transmission and finally upload to queuing service management server.Since the quantity of group will be less than terminal quantity, so can
The concurrency that data upload is reduced, reduces the resource consumption of queuing service management server.Also, queuing service management server
The data received are the data that main control terminal has counted, and queuing service management server need to only carry out data simple secondary
Statistics, calculation amount is than existing compared with greatly reducing.
In other embodiments of the present invention, the main controlled node in above-mentioned all embodiments can in automatic regular polling group respectively into
Member collects the terminal data of member, and confirmation is collected into after the terminal data of all nodes, counts the data of this group.
In addition, main controlled node, in the data for collecting group member, if other side does not respond to, detecting distant terminal is
It is no online.The mode of detection can there are many, for example, main controlled node can send inquiry message to the member that does not respond to, such as receive
To the response of other side, then judge that other side is online, do not receive response such as, judgement other side is not online, and the state of the member is set to
Off-line state.
Main controlled node can be detected continuously three times, and when continuously testing result is all off-line state three times, main controlled node can incite somebody to action
The information off-line of the member feeds back to queuing service management server, and does not regather the terminal data of the member.
It is explained below and how to set up group.
Fig. 6 is referred to, by taking structure shown in Fig. 2 as an example, above-mentioned group is set up in the following way：
S601, queuing service management server (the 0th node layer) divide group, generate the group information of each group.
Above-mentioned group information includes the device number of each node in the IP address of each node, group in group identification, group, with
And in group site where each node mechanism number.
More specifically, it is that group is carried out according to mechanism hierarchical relationship by being deployed in the CQSMH in queuing service management server
What group divided.
Certainly, those skilled in the art may also set up queuing service management server and divide group, example according to other conditions
Such as, according to the distance between node, whether address of node position, node belongs to same LAN, phase intercommunication between node
Whether letter is needed using core network bandwidth, and communication path is most short, and influence each other at least one of minimum etc. division between group
Group.
S602, every other node layer (namely queue machine) obtain corresponding group information.
More specifically, it when the CQSMC disposed on queue machine starts, asks to download group's letter to queuing service management server
Breath.Queuing service management server determines which group it belongs to according to the device number of queue machine, the mechanism number of place site,
The corresponding group information of the group is sent to queue machine.
S603, the determining main controlled node of node negotiation for belonging to same group.
More specifically, the main controlled node in a certain group can be determined as follows：
Step A：The node of mechanism minimum (or maximum) collects all sections in group as interim main controlled node in group
The operating status weights of point.Operating status weights characterize the comprehensive treatment capability of node.
Step B：The node of operating status maximum weight is determined as main controlled node, and notify in group by interim main controlled node
All nodes.The identity information (mechanism number, IP address, device number) of main controlled node under each nodes records.
Further, i-th of node operating status weights can be calculated by equation below in certain group：
Wherein, SiRepresent the operating status weights of above-mentioned i-th of node, NiRepresent the business processing of above-mentioned i-th of node
Amount, DiThe expression days running of above-mentioned i-th of node, eiRepresent above-mentioned i-th of node failure rate；tiRepresent above-mentioned i-th of node
Run time.
In actual operation, NiNumber can be taken to represent with daily being averaged；eiFormula ED can be usedi/DiIt calculates, wherein EDiTable
Show the number of days that i-th of node breaks down；tiIt can be represented with the hourage always run.
In other embodiments of the present invention, the group member in above-mentioned all embodiments by regular check main controlled node whether
Online.The mode how to check can there are many.For example, main controlled node periodically can send inquiry message, group's composition to group member
Member then records query time, if the time interval between current time and last query time reaches threshold values, group
Member will send inquiry message to determine whether main controlled node is online to main controlled node.If main controlled node is without response, group's composition
Member can retransmit inquiry message after preset duration is waited for, if still other group member main controlled nodes is notified to lose without response
Effect.
Then, the member in group will negotiate new main controlled node according to the mode of abovementioned steps A and step B.
Due to site enlarging etc., queue machine can be increased newly.Therefore, in other embodiments of the present invention, queuing service pipe
Group can be divided in daily morning by managing server, so as to which the queue machine increased newly is added in group.The number of terminals of newly-increased queue machine
According to will be collected by the main controlled node of its affiliated group.So, the increase of terminal number is to queuing service management service
Device influences little.
Alternatively, in other embodiments of the present invention, newly-increased terminal is reached the standard grade can apply adding in group, queuing service management automatically
Server repartitions group after application is received, and generates the group information of each group, is can be achieved in this way by newly-increased terminal
It is included in group in time.
It corresponds, queue machine is also claimed in the embodiment of the present invention.
Above-mentioned queue machine is applied to queuing service and manages system.
Above-mentioned queuing service management system includes at least two node layers, wherein, the 0th node layer is queuing service management service
Device, other node layers are queue machine, and the node of same layer forms at least one group, and there are one master control sections for tool in each group
Point.
When as main controlled node, Fig. 7 is referred to, above-mentioned queue machine may include：
Main controlled node information collection module 1, for the terminal data of all nodes in this group of timed collection；
Main controlled node data statistics module 2, for the terminal data being collected into be summarized and counted, by statistical result
Report to the upper layer node being connected.
Wherein, in above-mentioned group i-th of node terminal data include above-mentioned i-th of node itself business datum and/
Or the statistical result that lower level node reports, i are integer.
Detail refers to record described previously herein, and therefore not to repeat here.
In practice, since each queue machine is all possibly as main controlled node, actually each queue machine all includes master
Control nodal information collection module 1 and main controlled node data statistics module 2.Only, above-mentioned main controlled node information collection module 1 and master
Control node data statistical module 2, which is given tacit consent to, not to be started, only when queue machine is confirmed as main controlled node, just enables main controlled node information
Collection module 1 and main controlled node data statistics module 2.
In other embodiments of the present invention, Fig. 8 is referred to, above-mentioned queue machine may also include adaptive adjustment module 3.
Above-mentioned adaptive adjustment module 3 may particularly include such as lower unit：
Acquiring unit, for obtaining corresponding group information；
Negotiation element, for negotiating to determine main controlled node with belonging to other nodes of same group；
Wherein, each group is divided by above-mentioned queuing service management server, and each group information is by above-mentioned queuing service
Management server generates；Above-mentioned group information includes that group identification, each node is set in the IP address of each node, group in group
The mechanism number of site where each node in standby number and group.
Detail refers to record described previously herein, and therefore not to repeat here.
Queuing service management server is also claimed in the embodiment of the present invention, and the server application is in queuing service management system
System, above-mentioned queuing service management system include at least two node layers, wherein, the 0th node layer is above-mentioned queuing service management service
Device, other node layers are queue machine, and the node of same layer forms at least one group, and there are one master control sections for tool in each group
Point.
Fig. 9 is referred to, above-mentioned queuing service management server may include：
Data collection module 901 is at least used to obtain the statistical result that main controlled node reports；
Wherein, above-mentioned statistical result is the terminal data of all nodes in this group of main controlled node timed collection, and carries out
It is obtained after collect statistics；
And the terminal data of i-th of node includes the business datum of i-th of node itself and/or lower floor's section in group
The statistical result that point reports, i is integer.
Detail refers to record described previously herein, and therefore not to repeat here.
In other embodiments of the present invention, Fig. 9 is still referred to, the queuing service management server in above-mentioned all embodiments
It may also include：
Data statistics module 902, the statistical result for being obtained to data collection module 901 carry out secondary statistics.
In other embodiments of the present invention, Fig. 9 is still referred to, the queuing service management server in above-mentioned all embodiments
It may also include：
Group division module 903 for dividing group, generates the group information of each group.
Above-mentioned group information includes the device number of each node in the IP address of each node, group in group identification, group, with
And in group site where each node mechanism number, so that every other node layer obtains corresponding group information, determine master control
Node.
Figure 10 gives above-mentioned queue machine or a kind of hardware configuration of queuing service management server, may include processor
101st, memory 102, bus 103 and communication interface 104.Processor 101, memory 102, communication interface 104 pass through bus 103
It is connected with each other；Memory 102, for storing program.Specifically, program can include program code, and program code includes calculating
Machine operational order.
Memory 102 may include high-speed random access memory (random access memory, abbreviation RAM) and store
Device, it is also possible to further include nonvolatile memory (non-volatile memory), for example, at least a magnetic disk storage.
Processor 101 can be general processor, including central processing unit (Central Processing Unit, abbreviation
CPU), network processing unit (Network Processor, abbreviation NP) etc.；It can also be digital signal processor (DSP), special
Integrated circuit (ASIC), ready-made programmable gate array (FPGA) either other programmable logic device, discrete gate or transistor
Logical device, discrete hardware components.
Processor 101 in (as main controlled node) queue machine performs the program that memory 102 is stored, and is used to implement this
The execution step for the data reporting method that inventive embodiments provide：
The terminal data of all nodes in this group of timed collection；
The terminal data being collected into is summarized and counted, statistical result is reported to the upper layer node being connected.
In addition, the program that the above-mentioned execution of processor 101 memory 102 is stored can also complete context of methods part and be introduced
Main controlled node or common queue machine involved by other steps and each step refinement, therefore not to repeat here.
Processor 101 in queuing service management server performs the program that memory 102 is stored, and can perform following step
Suddenly：
Obtain the statistical result that main controlled node reports；
Secondary statistics is carried out to statistical result.
In other embodiments of the present invention, the processor 101 in queuing service management server performs memory 102 and is deposited
The program put, can also carry out following steps：
Group is divided, generates the group information of each group.
Above-mentioned group information includes the device number of each node in the IP address of each node, group in group identification, group, with
And in group site where each node mechanism number, so that every other node layer obtains corresponding group information, determine master control
Node.
Detail refers to record described previously herein, and therefore not to repeat here.
In the present invention, CPU and memory can be integrated in same chip or independent two devices.
Each embodiment is described by the way of progressive in this specification, the highlights of each of the examples are with other
The difference of embodiment, just to refer each other for identical similar portion between each embodiment.
It can directly be held with reference to the step of method or algorithm that the embodiments described herein describes with hardware, processor
The combination of capable software module or the two is implemented.Software module can be placed in random access memory (RAM), memory, read-only deposit
Reservoir (ROM), electrically programmable ROM, electrically erasable ROM, register, hard disk, moveable magnetic disc, CD-ROM or technology
In any other form of storage medium well known in field.
The foregoing description of the disclosed embodiments enables professional and technical personnel in the field to realize or use the present invention.
A variety of modifications of these embodiments will be apparent for those skilled in the art, it is as defined herein
General Principle can be realized in other embodiments without departing from the spirit or scope of the present invention.Therefore, it is of the invention
The embodiments shown herein is not intended to be limited to, and is to fit to and the principles and novel features disclosed herein phase one
The most wide range caused.
Claims (5)
1. a kind of data reporting method, which is characterized in that manage system applied to queuing service, the queuing service manages system
Including at least two node layers, wherein, the 0th node layer be queuing service management server, other node layers be queue machine, same layer
Node form at least one group, there are one main controlled nodes for tool in each group；The method includes：
The terminal data of all nodes in this group of main controlled node timed collection in group；Wherein, the main controlled node is divides
Row node, other queue machines in the group in addition to the main controlled node are subbranch's node；The terminal data includes prison
Control data；The monitoring data that subbranch's node is sent to main controlled node its described includes client's average waiting of this operation node
Time, the client's number handled and business average handling time；
Main controlled node in group is summarized and is counted to the terminal data being collected into, and statistical result is reported to what is be connected
Upper layer node；The statistical result includes branch's monitoring data；When branch's monitoring data includes branch's client's average waiting
Between, branch's business average handling time；
The group is set up in the following way：
0th node layer divides group, generates the group information of each group；The group information includes group identification, group
In group in the IP address of each node, group in the device number of each node and group site where each node mechanism number；Its
In, group division is carried out according to mechanism hierarchical relationship by being deployed in the CQSMH in the queuing service management server；
Every other node layer obtains corresponding group information；
The node for belonging to same group is negotiated to determine main controlled node；
The main controlled node is determined as follows：
The minimum node of mechanism number collects the operating status weights of all nodes in group as interim main controlled node in group；
The node of operating status maximum weight is determined as main controlled node by the interim main controlled node, and is notified all in group
Node.
2. the method as described in claim 1, which is characterized in that i-th of node operating status weights passes through such as in the group
Lower formula calculates：
Wherein, SiRepresent the operating status weights of i-th of node, NiRepresent the business processing amount of i-th of node, Di
Represent the days running of i-th of node, eiRepresent i-th of node failure rate；tiRepresent the fortune of i-th of node
The row time.
3. method as claimed in claim 1 or 2, which is characterized in that the 0th node layer is according to mechanism hierarchical relationship, node
Distance each other, address of node position, if belong to same LAN, whether node intercommunication needs to use core
Heart network bandwidth, communication path is most short, and at least one of the minimum that influences each other between group divides group.
4. a kind of queue machine, which is characterized in that manage system applied to queuing service, the queuing service management system is included extremely
Few two node layers, wherein, the 0th node layer is queuing service management server, other node layers are queue machine, the node of same layer
Form at least one group, there are one main controlled nodes for tool in each group；
When as main controlled node, the queue machine includes：
Main controlled node information collection module, for the terminal data of all nodes in this group of timed collection；Wherein, the master control
Node is branch's node, other queue machines in the group in addition to the main controlled node are subbranch's node；The number of terminals
According to including monitoring data；The monitoring data that subbranch's node is sent to main controlled node its described includes the client of this operation node
Average latency, the client's number handled and business average handling time；
For the terminal data being collected into be summarized and counted, statistical result is reported for main controlled node data statistics module
To the upper layer node being connected；The statistical result includes branch's monitoring data；Branch's monitoring data includes branch client
Average latency, branch's business average handling time；
Acquiring unit, for obtaining corresponding group information；
Negotiation element, for negotiating to determine main controlled node with belonging to other nodes of same group；
Each group is divided by the queuing service management server, and each group information is by the queuing service management server
Generation；The group information include group identification, in group in the IP address of each node, group the device number of each node and
The mechanism number of site where each node in group；Wherein, by be deployed in the CQSMH in the queuing service management server according to
Mechanism hierarchical relationship carries out group division；
The main controlled node is determined as follows：
The minimum node of mechanism number collects the operating status weights of all nodes in group as interim main controlled node in group；Institute
It states interim main controlled node and the node of operating status maximum weight is determined as main controlled node, and notify all nodes in group.
5. a kind of queuing service management server, which is characterized in that manage system, the queuing service pipe applied to queuing service
Reason system includes at least two node layers, wherein, the 0th node layer is the queuing service management server, other node layers are row
Team's machine, the node of same layer form at least one group, and there are one main controlled nodes for tool in each group；Wherein, the master control section
It is branch's node to put, other queue machines in the group in addition to the main controlled node are subbranch's node；Including：
Data collection module is at least used to obtain the statistical result that main controlled node reports；The statistical result is that main controlled node is determined
When collect the terminal data of all nodes in this group, and carry out what is obtained after collect statistics；The terminal data includes monitoring
Data；When the monitoring data of subbranch's node to main controlled node transmission its described includes client's average waiting of this operation node
Between, client's number for handling and business average handling time；The statistical result includes branch's monitoring data；Branch's monitoring
Data include branch client average latency, branch's business average handling time；Group division module, for dividing group,
Generate the group information of each group；The group information includes each in the IP address of each node, group in group identification, group
The mechanism number of site where each node in the device number of node and group, so that every other node layer obtains corresponding group
Group information determines main controlled node；
Wherein, group division is carried out according to mechanism hierarchical relationship by being deployed in the CQSMH in the queuing service management server；
The main controlled node is determined as follows：
The minimum node of mechanism number collects the operating status weights of all nodes in group as interim main controlled node in group；
The node of operating status maximum weight is determined as main controlled node by the interim main controlled node, and is notified all in group
Node.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201410569349.7A CN104270466B (en) | 2014-10-22 | 2014-10-22 | Data reporting method and relevant device |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201410569349.7A CN104270466B (en) | 2014-10-22 | 2014-10-22 | Data reporting method and relevant device |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN104270466A CN104270466A (en) | 2015-01-07 |
| CN104270466B true CN104270466B (en) | 2018-07-03 |
Family
ID=52161955
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201410569349.7A Active CN104270466B (en) | 2014-10-22 | 2014-10-22 | Data reporting method and relevant device |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN104270466B (en) |
Families Citing this family (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107508759B (en) * | 2017-08-16 | 2020-06-05 | 北京星选科技有限公司 | Information reporting method and device, computer readable storage medium and electronic equipment |
| CN112910740A (en) * | 2021-02-09 | 2021-06-04 | 珠海格力电器股份有限公司 | State reporting method, device, equipment and computer readable storage medium |
| CN114500558A (en) * | 2021-12-21 | 2022-05-13 | 天翼云科技有限公司 | Task layered reporting system and control method thereof |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101179499A (en) * | 2007-12-06 | 2008-05-14 | 上海大学 | Method for wireless self-organizing of monitoring system to form tree-shaped routing |
| CN102185749A (en) * | 2011-06-07 | 2011-09-14 | 北京交通大学 | Method for avoiding routing loop by adopting tree topology relationship |
| CN102427597A (en) * | 2011-12-05 | 2012-04-25 | 昆明理工大学 | Fusion method for WSN (Wireless Sensor Network) tree type clustering data based on CR (Cognitive Radio) |
| CN103118439A (en) * | 2013-01-18 | 2013-05-22 | 中国科学院上海微系统与信息技术研究所 | Data fusion method based on sensor network node universal middleware |
| CN103780402A (en) * | 2012-10-23 | 2014-05-07 | 北京网动网络科技股份有限公司 | Tree network-based multistage server networking communication method |
-
2014
- 2014-10-22 CN CN201410569349.7A patent/CN104270466B/en active Active
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101179499A (en) * | 2007-12-06 | 2008-05-14 | 上海大学 | Method for wireless self-organizing of monitoring system to form tree-shaped routing |
| CN102185749A (en) * | 2011-06-07 | 2011-09-14 | 北京交通大学 | Method for avoiding routing loop by adopting tree topology relationship |
| CN102427597A (en) * | 2011-12-05 | 2012-04-25 | 昆明理工大学 | Fusion method for WSN (Wireless Sensor Network) tree type clustering data based on CR (Cognitive Radio) |
| CN103780402A (en) * | 2012-10-23 | 2014-05-07 | 北京网动网络科技股份有限公司 | Tree network-based multistage server networking communication method |
| CN103118439A (en) * | 2013-01-18 | 2013-05-22 | 中国科学院上海微系统与信息技术研究所 | Data fusion method based on sensor network node universal middleware |
Also Published As
| Publication number | Publication date |
|---|---|
| CN104270466A (en) | 2015-01-07 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN108712464A (en) | A kind of implementation method towards cluster micro services High Availabitity | |
| CN104639374B (en) | A kind of application deployment management system | |
| US6748414B1 (en) | Method and apparatus for the load balancing of non-identical servers in a network environment | |
| WO2017113868A1 (en) | Method and system for self-adaptive bandwidth control for cdn platform | |
| CN103493449B (en) | Efficient circuit in packet switching network | |
| CN107241384A (en) | A kind of content distribution service priority scheduling of resource method based on many cloud frameworks | |
| US20030120764A1 (en) | Real-time monitoring of services through aggregation view | |
| US20020194251A1 (en) | Systems and methods for resource usage accounting in information management environments | |
| US20030046396A1 (en) | Systems and methods for managing resource utilization in information management environments | |
| CN104092756B (en) | A kind of resource dynamic distributing method of the cloud storage system based on DHT mechanism | |
| CN103763130B (en) | Management method, the device and system of large-scale cluster | |
| CN103152393A (en) | Charging method and charging system for cloud computing | |
| CN106412113A (en) | Energy cloud service system and communication method thereof | |
| CN106850710A (en) | A kind of safe data cloud storage system, client terminal, storage server and application process | |
| CN103907321A (en) | System and method for using dynamic allocation of virtual lanes to alleviate congestion in a fat-tree topology | |
| CN104219069B (en) | access frequency control method, device and control system | |
| CN103081407A (en) | Failure analysis device, and system and method for same | |
| CN103986766A (en) | Self-adaptation load balancing job task scheduling method and device | |
| CN102724103A (en) | Proxy server, hierarchical network system and distributed workload management method | |
| JP2022549055A (en) | NODE RATE LIMITING METHOD, APPARATUS, ELECTRONIC DEVICE AND STORAGE MEDIUM | |
| CN104270466B (en) | Data reporting method and relevant device | |
| CN106649856A (en) | Database access device, system and method | |
| CN106936877A (en) | A kind of content distribution method, apparatus and system | |
| CN101399713B (en) | Method for measuring proximity of network node | |
| So et al. | Latency and bandwidth-minimizing failure detectors |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |