CN109862089A - Data processing method, device, system, computer readable storage medium - Google Patents
Data processing method, device, system, computer readable storage medium Download PDFInfo
- Publication number
- CN109862089A CN109862089A CN201910071518.7A CN201910071518A CN109862089A CN 109862089 A CN109862089 A CN 109862089A CN 201910071518 A CN201910071518 A CN 201910071518A CN 109862089 A CN109862089 A CN 109862089A
- Authority
- CN
- China
- Prior art keywords
- service node
- service
- node
- data
- address
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
Landscapes
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The disclosure provides a kind of data processing method, is applied to first service node, which comprises according to the pending data of the first service node, be determined to handle multiple second service nodes of the pending data；Obtain the multiple second service address of node data；The destination service node in the multiple second service node is determined based on the address date, wherein, the destination service node is the second service node for meeting preset condition in the multiple second service node with the data transmission distance of the first service node；And the pending data is sent to the destination service node.The disclosure also provides a kind of data processing equipment, a kind of data processing system and a kind of computer readable storage medium.
Description
Technical field
This disclosure relates to which field of computer technology, fills more particularly, to a kind of data processing method, a kind of data processing
It sets, a kind of data processing system and a kind of computer readable storage medium.
Background technique
Current serving Node where production application in processing center (such as computer room) usually requires to send data to it
He is handled in service node.In the related art, current serving Node can randomly choose wherein from other multiple service nodes
At least one service node, and send data at least one service node processing in selected.But other multiple services
Some service nodes in node may belong to different processing centers from current serving Node.The service node chosen with
(across processing center calling occurs) when current serving Node is not belonging to same processing center, increases unnecessary allocating time
With network overhead, the service performance of current serving Node is caused to decline indirectly.
During realizing disclosure design, at least there are the following problems in the prior art for inventor's discovery, existing skill
In art when calling service node, across processing center calling service node is caused due to random call, increases unnecessary tune
With time and network overhead, service performance is caused to decline indirectly.
Summary of the invention
In view of this, present disclose provides a kind of data processing method of optimization and data processing systems.
An aspect of this disclosure provides a kind of data processing method, is applied to first service node, the method packet
It includes: according to the pending data of the first service node, being determined to handle multiple second services of the pending data
Node, obtains the multiple second service address of node data, determines the multiple second service based on the address date
Destination service node in node, wherein the destination service node is in the multiple second service node with described first
The data transmission distance of service node meets the second service node of preset condition, and the pending data is sent to institute
State destination service node.
In accordance with an embodiment of the present disclosure, the above-mentioned mesh determined based on the address date in the multiple second service node
Mark service node, comprising: each second service node in the multiple second service node is determined based on the address date
Priority, the priority characterize the data transmission distance of the second service node Yu the first service node, Yi Jiji
The destination service node is determined in the priority of the second service node.
In accordance with an embodiment of the present disclosure, above-mentioned to be determined in the multiple second service node each based on the address date
The priority of second service node, comprising: according to first service address of node data and the multiple second service section
The address date of point, determines the relative positional relationship of the first service node Yu each second service node respectively, with
And the priority of the multiple second service node is determined based on the relative positional relationship.
In accordance with an embodiment of the present disclosure, above-mentioned first service address of node data include multiple first fields, and described
The address date of two service nodes includes multiple second fields, according to specific fields in the multiple first field and described more
Specific fields in a second field determine the relative positional relationship of the first service node Yu the second service node.
In accordance with an embodiment of the present disclosure, the above-mentioned mesh determined based on the address date in the multiple second service node
Mark service node, comprising: to the specific fields in the specific fields and the multiple second field in the multiple first field
It is handled, obtains multiple characteristic values corresponding with the multiple second service node, based on the multiple characteristic value to described
Multiple second service nodes are grouped, and obtain at least one grouping, wherein the of each grouping at least one described grouping
The priority of two service nodes is identical, determines targeted packets according to the priority of each grouping at least one described grouping, with
And at least one second service node in the determining targeted packets is as the destination service node.
Another aspect of the disclosure provides a kind of data processing equipment, is applied to first service node, described device
Include: the first determining module, obtain module, the second determining module and sending module.Wherein, the first determining module is according to institute
The pending data for stating first service node is determined to handle multiple second service nodes of the pending data, obtains
Module obtains the multiple second service address of node data, the second determining module, based on described in address date determination
Destination service node in multiple second service nodes, wherein the destination service node is the multiple second service node
In meet the second service node of preset condition with the data transmission distance of the first service node, sending module will it is described to
Processing data are sent to the destination service node.
In accordance with an embodiment of the present disclosure, the above-mentioned mesh determined based on the address date in the multiple second service node
Mark service node, comprising: each second service node in the multiple second service node is determined based on the address date
Priority, the priority characterize the data transmission distance of the second service node Yu the first service node, Yi Jiji
The destination service node is determined in the priority of the second service node.
In accordance with an embodiment of the present disclosure, above-mentioned to be determined in the multiple second service node each based on the address date
The priority of second service node, comprising: according to first service address of node data and the multiple second service section
The address date of point, determines the relative positional relationship of the first service node Yu each second service node respectively, with
And the priority of the multiple second service node is determined based on the relative positional relationship.
In accordance with an embodiment of the present disclosure, above-mentioned first service address of node data include multiple first fields, and described
The address date of two service nodes includes multiple second fields, according to specific fields in the multiple first field and described more
Specific fields in a second field determine the relative positional relationship of the first service node Yu the second service node.
In accordance with an embodiment of the present disclosure, above-mentioned second determining module includes: processing submodule, is grouped submodule, first really
Stator modules and the second determining submodule.Wherein, processing submodule in the multiple first field specific fields and institute
The specific fields stated in multiple second fields are handled, and multiple features corresponding with the multiple second service node are obtained
Value, grouping submodule are based on the multiple characteristic value and are grouped to the multiple second service node, obtain at least one point
Group, wherein the priority of the second service node of each grouping is identical at least one described grouping, and first determines submodule root tuber
Targeted packets are determined according to the priority of each grouping at least one described grouping, and second determines that submodule determines the target point
At least one second service node in group is as the destination service node.
Another aspect of the present disclosure provides a kind of computer readable storage medium, is stored with computer executable instructions,
Described instruction is when executed for realizing method as described above.
Another aspect of the present disclosure provides a kind of computer program, and the computer program, which includes that computer is executable, to be referred to
It enables, described instruction is when executed for realizing method as described above.
In accordance with an embodiment of the present disclosure, it can at least be partially solved in the prior art when calling service node, due to
Random call and cause across processing center calling service node, increase unnecessary allocating time and network overhead, cause indirectly
Therefore the problem of service performance declines, and may be implemented to call the service node being closer as far as possible, with reduce allocating time with
Network overhead improves the technical effect of service performance.
Detailed description of the invention
By referring to the drawings to the description of the embodiment of the present disclosure, the above-mentioned and other purposes of the disclosure, feature and
Advantage will be apparent from, in the accompanying drawings:
Fig. 1 diagrammatically illustrates the application scenarios of data processing method and processing system according to the embodiment of the present disclosure；
Fig. 2 diagrammatically illustrates the flow chart of the data processing method according to the embodiment of the present disclosure；
Fig. 3 diagrammatically illustrates the flow chart for the service node that sets the goal really according to the embodiment of the present disclosure；
Fig. 4 diagrammatically illustrates the block diagram of the data processing method according to the embodiment of the present disclosure；
Fig. 5 diagrammatically illustrates the block diagram for the service node that sets the goal really according to the embodiment of the present disclosure；And
Fig. 6 diagrammatically illustrates the block diagram of the computer system suitable for data processing according to the embodiment of the present disclosure.
Specific embodiment
Hereinafter, will be described with reference to the accompanying drawings embodiment of the disclosure.However, it should be understood that these descriptions are only exemplary
, and it is not intended to limit the scope of the present disclosure.In the following detailed description, to elaborate many specific thin convenient for explaining
Section is to provide the comprehensive understanding to the embodiment of the present disclosure.It may be evident, however, that one or more embodiments are not having these specific thin
It can also be carried out in the case where section.In addition, in the following description, descriptions of well-known structures and technologies are omitted, to avoid
Unnecessarily obscure the concept of the disclosure.
Term as used herein is not intended to limit the disclosure just for the sake of description specific embodiment.It uses herein
The terms "include", "comprise" etc. show the presence of the feature, step, operation and/or component, but it is not excluded that in the presence of
Or add other one or more features, step, operation or component.
There are all terms (including technical and scientific term) as used herein those skilled in the art to be generally understood
Meaning, unless otherwise defined.It should be noted that term used herein should be interpreted that with consistent with the context of this specification
Meaning, without that should be explained with idealization or excessively mechanical mode.
It, in general should be according to this using statement as " at least one in A, B and C etc. " is similar to
Field technical staff is generally understood the meaning of the statement to make an explanation (for example, " system at least one in A, B and C "
Should include but is not limited to individually with A, individually with B, individually with C, with A and B, with A and C, have B and C, and/or
System etc. with A, B, C).Using statement as " at least one in A, B or C etc. " is similar to, generally come
Saying be generally understood the meaning of the statement according to those skilled in the art to make an explanation (for example, " having in A, B or C at least
One system " should include but is not limited to individually with A, individually with B, individually with C, with A and B, have A and C, have
B and C, and/or the system with A, B, C etc.).
Embodiment of the disclosure provides a kind of data processing method, is applied to first service node, this method comprises: root
According to the pending data of first service node, multiple second service nodes of processing pending data are determined to, are obtained multiple
Second service address of node data determine the destination service node in multiple second service nodes based on address date, wherein
Destination service node is meet preset condition in multiple second service nodes with the data transmission distance of first service node the
Two service nodes, and pending data is sent to destination service node.
Fig. 1 diagrammatically illustrates the application scenarios of data processing method and processing system according to the embodiment of the present disclosure.It needs
It should be noted that being only the example that can apply the scene of the embodiment of the present disclosure shown in Fig. 1, to help those skilled in the art to manage
The technology contents of the disclosure are solved, but are not meant to that the embodiment of the present disclosure may not be usable for other equipment, system, environment or field
Scape.
As shown in Figure 1, the application scenarios are for example including multiple processing centers, for example including processing center 10, processing center
11, processing center 20, processing center 21, processing center 30, processing center 31 etc..Multiple processing center, which can be, to be belonged to together
The processing center in city, or the processing center for strange land.For example, processing center 10 and processing center 11 are located at Beijing, processing
Center 20 and processing center 21 are located at Shanghai, and processing center 30 and processing center 31 are located at Shenzhen.
Wherein, each processing center includes at least one service node, for example, processing center 10 include service node 101,
Service node 102, service node 103 etc..The service node that other processing centers include is as shown in Figure 1, herein no longer one by one
It lists.
For example, service node 101 can when service node 101 is needed to send data to and be handled in other service nodes
With from the every other service node (service node for example including all processing centers, it is assumed herein that every other service node
All have the ability for handling the data) in call at least one service node, and send data at least one called
It is handled in service node.
Wherein, it when service node 101 calls at least one service node from other service nodes, can preferentially call
Apart from close service node, to avoid unnecessary allocating time and network overhead is increased.For example, service node 101 can be excellent
First call therewith be in same processing center service node 102 or service node 103, malloc failure malloc (such as service save
Point 102 and service node 103 break down) in the case where, the service node in same city processing center 11 can be called (such as to adjust
With service node 111 or 112).If processing center 11 is abnormal, continue to call in the processing center 20 for being located at Shanghai or processing
Service node in the heart 21, next is only positioned at the processing center 31 in Shenzhen or the service node of processing center 32 (for position
For Pekinese's service node, Shanghai and Pekinese's distance therefore can be at Pekinese less than Shenzhen and Pekinese's distance
It is preferential to call the service node being located in the processing center in Shanghai when reason center occurs abnormal).
The technical solution of embodiment of the disclosure may be implemented to call the clothes being closer as far as possible when calling service node
Business node improves the technical effect of service performance to reduce allocating time and network overhead.
Fig. 2 diagrammatically illustrates the flow chart of the data processing method according to the embodiment of the present disclosure.
As shown in Fig. 2, this method includes operation S210~S240.
The multiple of processing pending data are determined to according to the pending data of first service node in operation S210
Second service node.
According to the embodiment of the present disclosure, pending data of multiple second service nodes for example with processing first service node
Ability.It wherein, for example may include being in same processing center with first service node in multiple second service node
Second service node can also include the second service node that different disposal center is in first service node.
For example, second service node can be in addition to clothes as shown in Figure 1, first service node can be service node 101
Other service nodes except business node 101.
In operation S220, multiple second service addresss of node data are obtained.
According to the embodiment of the present disclosure, second service address of node data can for example be characterized locating for second service node
City or locating processing center.For example, the address date can be the IP address of service node.Wherein, first service section
Point includes multiple second service addresss of node data in the service list for example with a service list, should by obtaining
Service list can obtain multiple second service addresss of node data.
In operation S230, the destination service node in multiple second service nodes is determined based on address date, wherein target
Service node is the second clothes for meeting preset condition in multiple second service nodes with the data transmission distance of first service node
Business node.
According to the embodiment of the present disclosure, since address date can characterize city locating for second service node or locating
Processing center, therefore, first service node can be multiple according to determining in the corresponding address date of multiple second service nodes
Destination service node in second service node.The destination service node for example can be in multiple second service nodes with first
The nearest second service node of the data transmission distance of service node.
For example, second service node, which for example can be, to be removed as shown in Figure 1, first service node can be service node 101
Other service nodes except service node 101.Wherein, destination service node can be is in first service node 101
The node of same processing center, for example, the destination service node can be service node 102 or service node 103.It can manage
Solution belongs to the data transmission distance between the service node of same processing center less than between the service node at different disposal center
Data transmission distance.
In the embodiments of the present disclosure, the destination service node in multiple second service nodes is determined based on address date, wrapped
Include following steps.
(1) priority of each second service node in multiple second service nodes, priority are determined based on address date
Characterize the data transmission distance of second service node and first service node.Description that detailed process is as follows.
Firstly, being determined respectively according to first service address of node data and multiple second service addresss of node data
The relative positional relationship of first service node and each second service node.
According to the embodiment of the present disclosure, since address date can characterize city locating for service node or locating processing
Center.Therefore, first can be determined by first service address of node data and multiple second service addresss of node data
The relative positional relationship of service node and each second service node.Wherein, relative positional relationship for example can be each second
Service node and first service node whether be located at same processing center or whether be located at city but different processing centers,
It or whether is strange land (different cities) etc..
Secondly, determining the priority of multiple second service nodes based on relative positional relationship.
According to the embodiment of the present disclosure, the second service node different from the relative positional relationship of first service node it is preferential
Grade is different.For example, be in the highest priority of the second service node of same processing center with first service node, secondly for
First service node is in city but different processing center, finally to be in different cities (such as the with first service node
In the case that two service nodes and first service node are located at different cities, in the city close with first service nodal distance the
The priority of two service nodes is higher than the second service node in the city remote with first service nodal distance.For example, such as Fig. 1 institute
Show, for first service node 101, is higher than the positioned at Shenzhen positioned at the priority of the second service node 211 in Shanghai
Two service nodes 302).
(2) priority based on second service node determines destination service node.
For example, the second service node of highest priority in multiple second service nodes is determined as destination service node.
For example, being in the second service node of same processing center as target with first service node in multiple second service nodes
Service node.It, can be from remaining if the second service node for being in same processing center with first service node breaks down
Select the higher second service node of priority as destination service node in second service node.
Specifically, first service address of node data include multiple first fields, second service address of node data
Including multiple second fields.According to the specific fields in the specific fields and multiple second fields in multiple first fields, determine
The relative positional relationship of first service node and second service node.
For example, as shown in Figure 1, address date is, for example, IP address.The address date of first service node 101 is, for example,
10.0.1.1, which includes 4 the first fields (for example including 10,0,1,1).In order to make it easy to understand, below in Fig. 1
The citing of part second service node.Similarly, each second service node includes 4 the second fields.Specifically, second service section
The address date of point 102 is, for example, 10.0.2.2, and the address date of second service node 111 is, for example, 10.16.1.1, the second clothes
The address date of business node 201 is, for example, 10.32.3.3, and the address date of second service node 311 is, for example, 10.80.4.4.
Wherein, specific fields can be for example second in address date (multiple first fields or multiple second fields)
Field.That is, the specific fields of the address date of first service node 101 are 0, second service node 102,111,201,311
Specific fields are respectively 0,16,32,80.Wherein, the specific fields of the specific fields of second service node and first service node
Between difference when being 0, indicate the second service node and first service node belong to same processing center；When difference is 16,
Indicate that the second service node belongs to same city from first service node but belongs to different processing centers；When difference is other values,
It can indicate the second service node and first service node difference city.As a result, according to second service node 102,111,201,
311 specific fields are respectively 0,16,32,80, it can be seen that second service node 102 belong to first service node 101 it is same
Processing center, second service node 111 belong to same city from first service node 101 but belong to different processing centers, the second clothes
The business city different from first service node 101 of node 201,311.
In operation S240, pending data is sent to destination service node.
After determining destination service node, the pending data in first service node can be sent to target clothes
It is handled in business node.
The technical solution of the embodiment of the present disclosure obtains the ground of second service node by determining multiple second service nodes
Location data determine that data transmission distance meets the second service node of preset condition as destination service section based on address date
Point, and the pending data in first service node is sent in destination service node and is handled.It may be implemented selecting with this
When destination service node, called with the closer second service node of first service nodal distance as far as possible as destination service node,
To reduce allocating time and network overhead, the technical effect of service performance is improved.
Fig. 3 diagrammatically illustrates the flow chart for the service node that sets the goal really according to the embodiment of the present disclosure.
As shown in figure 3, operation S230 includes operation S231~S234.
In operation S231, at the specific fields in the specific fields and multiple second fields in multiple first fields
Reason, obtains multiple characteristic values corresponding with multiple second service nodes.
Wherein, characteristic value can be the difference between the specific fields in the specific fields and the second field in the first field
Value is perhaps and the relevant value specific fields of value can be second field in the first field or the second field.Each second
Service node is corresponding with corresponding characteristic value, and this feature value can characterize the opposite position of second service node Yu first service node
Set relationship.
In operation S232, multiple second service nodes are grouped based on multiple characteristic values, obtain at least one grouping,
Wherein, the priority of the second service node of each grouping is identical at least one grouping.
Wherein, since characteristic value can characterize the relative positional relationship of second service node Yu first service node.Therefore,
Multiple second service nodes can be grouped by the embodiment of the present disclosure according to the corresponding characteristic value of multiple second service nodes, be obtained
To multiple groupings.For example, as shown in Figure 1, second service node 102,103 is the in the case where first service node is 101
One group, second service node 111,112 is second group, and second service node 201,211,212 is third group, second service node
301,302,311 be the 4th group.Wherein, the priority for the multiple second service nodes for including in each grouping is identical.
In operation S233, targeted packets are determined according to the priority of each grouping at least one grouping.
According to the embodiment of the present disclosure, determined according to the data transmission distance between each grouping and first service node each
The priority of grouping.Wherein, priority is for example followed successively by first group, second group, third group, the 4th group from high to low.Therefore, root
The second service node 102,103 and first service node 101 for determining first group for targeted packets, in this first group according to priority
Belong to identical processing center.In the case that multiple second service nodes 102,103 in the first set break down, Ke Yicong
Second group, third group, redefine the high grouping of priority as targeted packets in the 4th group.
In operation S234, determine at least one second service node in targeted packets as destination service node.
According to the embodiment of the present disclosure, after determining targeted packets, at least one of targeted packets can be determined
Two service nodes are as destination service node.For example, as shown in Figure 1, determining that first group is the targeted packets after targeted packets
Including second service node 102, second service node 103, second service node 102 can be determined, in second service node 103
At least one as destination service node.
The technical solution of the embodiment of the present disclosure in order to facilitate understanding, makes concrete example below.
In conjunction with Fig. 1, the IP address allocation rule of each processing center is as shown in table 1 below:
Table 1
| Processing center number | IP address | Second field of IP address |
| 10 processing centers | 10.0.x.x | 0 |
| 11 processing centers | 10.16.x.x | 16 |
| 20 processing centers | 10.32.x.x | 32 |
| 21 processing centers | 10.48.x.x | 48 |
| 30 processing centers | 10.64.x.x | 64 |
| 31 processing centers | 10.80.x.x | 80 |
According to the embodiment of the present disclosure, the selection target service section from multiple second service nodes is needed in first service node
When point, the second service section can be judged according to the IP address allocation rule of the IP address of second service node and processing center
Processing center where point.And multiple second service nodes are grouped, so as to first service node according to group result into
Row is specific to be chosen and calls.Realize that step is specific as follows:
1, the IP address of first service node and multiple second service nodes is obtained first, such as obtains second word of IP
Section.
2, traversal includes the service list of the IP address of multiple second service nodes, will be in service list according to IP address
Multiple second service nodes are grouped, for example, second field and each second of the IP address using first service node
Second field of the IP address of service node is calculated, and (following symbol "=" indicates to be equal to, and "+" indicates to be added, and "-" indicates
Subtract each other), the result being calculated is used as and is grouped foundation to multiple second service nodes, specific as follows:
2.1, when second field=second service node IP address, second field of first service node IP address,
Illustrate first service node and second service node is same processing center, KEY is (second word of first service node IP address
Second field of section-second service node IP address) absolute value+1, i.e. KEY=1.
2.2, when (second field-second service node IP address, second field of first service node IP address)
Absolute value=16 and (second field+second service node IP address, second field of first service node IP address)
When=16 or 80 or 144, illustrates first service node and second service node is with city processing center, KEY is (first service section
Point IP address second field-second service node IP address, second field) absolute value+2, i.e. KEY=16+2=
18。
2.3, in addition to above-mentioned 2.1 and 2.2 two kind of situation, first service node and second service node are in the processing of strange land
The heart.It is understood that (second field-second service node IP address, second field of first service node IP address)
Absolute value is more than or equal to 16, and KEY is (second field-second service node IP address of first service node IP address at this time
Second field) absolute value+3, i.e. KEY >=(16+3=19).
3, selecting KEY is the corresponding grouping of minimum value as targeted packets, and at least one is randomly choosed from targeted packets
A second service node is sent to selected mesh as destination service node, and by the pending data in first service node
It is handled in mark service node.
Fig. 4 diagrammatically illustrates the block diagram of the data processing equipment according to the embodiment of the present disclosure.
As shown in figure 4, data processing equipment 400 includes the first determining module 410, obtains module 420, the second determining module
430 and sending module 440.
First determining module 410 can be used for the pending data according to first service node, be determined to handle wait locate
Manage multiple second service nodes of data.According to the embodiment of the present disclosure, the first determining module 410 can for example execute above with reference to
The operation S210 of Fig. 2 description, details are not described herein.
Obtaining module 420 can be used for obtaining multiple second service addresss of node data.According to the embodiment of the present disclosure, obtain
Modulus block 420 can for example execute the operation S220 above with reference to Fig. 2 description, and details are not described herein.
Second determining module 430 can be used for determining the destination service section in multiple second service nodes based on address date
Point, wherein destination service node is to meet to preset with the data transmission distance of first service node in multiple second service nodes
The second service node of condition.
In accordance with an embodiment of the present disclosure, the above-mentioned destination service section determined based on address date in multiple second service nodes
Point, comprising: the priority of each second service node in multiple second service nodes, priority characterization are determined based on address date
The data transmission distance of second service node and first service node, and target is determined based on the priority of second service node
Service node.
In accordance with an embodiment of the present disclosure, above-mentioned that each second service in multiple second service nodes is determined based on address date
The priority of node, comprising: according to first service address of node data and multiple second service addresss of node data, respectively
It determines the relative positional relationship of first service node Yu each second service node, and is determined based on relative positional relationship multiple
The priority of second service node.
In accordance with an embodiment of the present disclosure, above-mentioned first service address of node data include multiple first fields, the second clothes
Address of node data of being engaged in include multiple second fields, according in the specific fields and multiple second fields in multiple first fields
Specific fields, determine the relative positional relationship of first service node Yu second service node.
According to the embodiment of the present disclosure, the second determining module 430 can for example execute the operation above with reference to Fig. 2 description
S230, details are not described herein.
Sending module 440 can be used for for pending data being sent to destination service node.According to the embodiment of the present disclosure, hair
The operation S240 described above with reference to Fig. 2 can be executed by sending module 440 for example, and details are not described herein.
Fig. 5 diagrammatically illustrates the block diagram for the service node that sets the goal really according to the embodiment of the present disclosure.
As shown in figure 5, the second determining module 430 includes processing submodule 431, the determining submodule of grouping submodule 432, first
Block 433 and the second determining submodule 434.
Processing submodule 431 can be used for specific in the specific fields and multiple second fields in multiple first fields
Field is handled, and multiple characteristic values corresponding with multiple second service nodes are obtained.According to the embodiment of the present disclosure, submodule is handled
Block 431 can for example execute the operation S231 above with reference to Fig. 3 description, and details are not described herein.
Grouping submodule 432 can be used for being grouped multiple second service nodes based on multiple characteristic values, obtain to
A few grouping, wherein the priority of the second service node of each grouping is identical at least one grouping.According to disclosure reality
Example is applied, grouping submodule 432 can for example execute the operation S232 above with reference to Fig. 3 description, and details are not described herein.
First determines that submodule 433 can be used for determining target point according to the priority of each grouping at least one grouping
Group.According to the embodiment of the present disclosure, first determines that submodule 433 can for example execute the operation S233 above with reference to Fig. 3 description,
This is repeated no more.
Second determines that submodule 434 is determined at least one second service node in targeted packets as target
Service node.According to the embodiment of the present disclosure, second determines that submodule 434 can for example execute the operation above with reference to Fig. 3 description
S234, details are not described herein.
It is module according to an embodiment of the present disclosure, submodule, unit, any number of or in which any more in subelement
A at least partly function can be realized in a module.It is single according to the module of the embodiment of the present disclosure, submodule, unit, son
Any one or more in member can be split into multiple modules to realize.According to the module of the embodiment of the present disclosure, submodule,
Any one or more in unit, subelement can at least be implemented partly as hardware circuit, such as field programmable gate
Array (FPGA), programmable logic array (PLA), system on chip, the system on substrate, the system in encapsulation, dedicated integrated electricity
Road (ASIC), or can be by the hardware or firmware for any other rational method for integrate or encapsulate to circuit come real
Show, or with any one in three kinds of software, hardware and firmware implementations or with wherein any several appropriately combined next reality
It is existing.Alternatively, can be at least by part according to one or more of the module of the embodiment of the present disclosure, submodule, unit, subelement
Ground is embodied as computer program module, when the computer program module is run, can execute corresponding function.
For example, the first determining module 410, acquisition module 420, the second determining module 430, sending module 440, processing submodule
Block 431, grouping submodule 432, first determine submodule 433 and second determine in submodule 434 any number of can close
And it is realized in a module or any one module therein can be split into multiple modules.Alternatively, in these modules
At least partly functions of one or more modules can be combined at least partly function of other modules, and in a module
Middle realization.In accordance with an embodiment of the present disclosure, the first determining module 410, acquisition module 420, the second determining module 430, transmission mould
Block 440, processing submodule 431, grouping submodule 432, first determine in submodule 433 and the second determining submodule 434
At least one can at least be implemented partly as hardware circuit, such as field programmable gate array (FPGA), programmable logic
Array (PLA), system on chip, the system on substrate, the system in encapsulation, specific integrated circuit (ASIC), or can be by right
Circuit carries out the hardware such as any other rational method that is integrated or encapsulating or firmware to realize, or with software, hardware and consolidates
Any one in three kinds of implementations of part several appropriately combined is realized with wherein any.Alternatively, the first determining module
410, module 420, the second determining module 430, sending module 440, processing submodule 431, grouping submodule 432, first are obtained
Determine that at least one of submodule 433 and second determining submodule 434 can at least be implemented partly as computer journey
Sequence module can execute corresponding function when the computer program module is run.
Fig. 6 diagrammatically illustrates the block diagram of the computer system suitable for data processing according to the embodiment of the present disclosure.Fig. 6
The computer system shown is only an example, should not function to the embodiment of the present disclosure and use scope bring any limit
System.
As shown in fig. 6, include processor 601 according to the computer system 600 of the embodiment of the present disclosure, it can be according to storage
It is loaded into random access storage device (RAM) 603 in the program in read-only memory (ROM) 602 or from storage section 608
Program and execute various movements appropriate and processing.Processor 601 for example may include general purpose microprocessor (such as CPU), refer to
Enable set processor and/or related chip group and/or special microprocessor (for example, specific integrated circuit (ASIC)), etc..Processing
Device 601 can also include the onboard storage device for caching purposes.Processor 601 may include for executing according to disclosure reality
Apply single treatment unit either multiple processing units of the different movements of the method flow of example.
In RAM 603, it is stored with system 600 and operates required various programs and data.Processor 601, ROM 602 with
And RAM 603 is connected with each other by bus 604.Processor 601 is held by executing the program in ROM 602 and/or RAM 603
The various operations gone according to the method flow of the embodiment of the present disclosure.It is noted that described program also can store except ROM 602
In one or more memories other than RAM 603.Processor 601 can also be stored in one or more of by execution
Program in memory executes the various operations of the method flow according to the embodiment of the present disclosure.
In accordance with an embodiment of the present disclosure, system 600 can also include input/output (I/O) interface 605, input/output
(I/O) interface 605 is also connected to bus 604.System 600 can also include be connected to I/O interface 605 with one in lower component
Item is multinomial: the importation 606 including keyboard, mouse etc.；Including such as cathode-ray tube (CRT), liquid crystal display (LCD)
Deng and loudspeaker etc. output par, c 607；Storage section 608 including hard disk etc.；And including such as LAN card, modulatedemodulate
Adjust the communications portion 609 of the network interface card of device etc..Communications portion 609 executes communication process via the network of such as internet.
Driver 610 is also connected to I/O interface 605 as needed.Detachable media 616, such as disk, CD, magneto-optic disk, semiconductor
Memory etc. is mounted on as needed on driver 610, in order to be pacified as needed from the computer program read thereon
It is packed into storage section 608.
In accordance with an embodiment of the present disclosure, computer software journey may be implemented as according to the method flow of the embodiment of the present disclosure
Sequence.For example, embodiment of the disclosure includes a kind of computer program product comprising be carried on computer readable storage medium
Computer program, which includes the program code for method shown in execution flow chart.In such implementation
In example, which can be downloaded and installed from network by communications portion 609, and/or from detachable media 611
It is mounted.When the computer program is executed by processor 601, the above-mentioned function limited in the system of the embodiment of the present disclosure is executed
Energy.In accordance with an embodiment of the present disclosure, system as described above, unit, module, unit etc. can pass through computer program
Module is realized.
The disclosure additionally provides a kind of computer readable storage medium, which can be above-mentioned reality
It applies included in equipment/device/system described in example；Be also possible to individualism, and without be incorporated the equipment/device/
In system.Above-mentioned computer readable storage medium carries one or more program, when said one or multiple program quilts
When execution, the method according to the embodiment of the present disclosure is realized.
In accordance with an embodiment of the present disclosure, it is non-volatile computer-readable to can be computer for computer readable storage medium
Storage medium, such as can include but is not limited to: portable computer diskette, hard disk, random access storage device (RAM),
Read-only memory (ROM), erasable programmable read only memory (EPROM or flash memory), portable compact disc read-only memory
(CD-ROM), light storage device, magnetic memory device or above-mentioned any appropriate combination.In the disclosure, computer-readable
Storage medium can be it is any include or storage program tangible medium, the program can be commanded execution system, device or
Device use or in connection.
For example, in accordance with an embodiment of the present disclosure, computer readable storage medium may include above-described ROM 602
And/or one or more memories other than RAM 603 and/or ROM 602 and RAM 603.
Flow chart and block diagram in attached drawing are illustrated according to the system of the various embodiments of the disclosure, method and computer journey
The architecture, function and operation in the cards of sequence product.In this regard, each box in flowchart or block diagram can generation
A part of one module, program segment or code of table, a part of above-mentioned module, program segment or code include one or more
Executable instruction for implementing the specified logical function.It should also be noted that in some implementations as replacements, institute in box
The function of mark can also occur in a different order than that indicated in the drawings.For example, two boxes succeedingly indicated are practical
On can be basically executed in parallel, they can also be executed in the opposite order sometimes, and this depends on the function involved.Also it wants
It is noted that the combination of each box in block diagram or flow chart and the box in block diagram or flow chart, can use and execute rule
The dedicated hardware based systems of fixed functions or operations is realized, or can use the group of specialized hardware and computer instruction
It closes to realize.
It will be understood by those skilled in the art that the feature recorded in each embodiment and/or claim of the disclosure can
To carry out multiple combinations and/or combination, even if such combination or combination are not expressly recited in the disclosure.Particularly, exist
In the case where not departing from disclosure spirit or teaching, the feature recorded in each embodiment and/or claim of the disclosure can
To carry out multiple combinations and/or combination.All these combinations and/or combination each fall within the scope of the present disclosure.
Embodiment of the disclosure is described above.But the purpose that these embodiments are merely to illustrate that, and
It is not intended to limit the scope of the present disclosure.Although respectively describing each embodiment above, but it is not intended that each reality
Use cannot be advantageously combined by applying the measure in example.The scope of the present disclosure is defined by the appended claims and the equivalents thereof.It does not take off
From the scope of the present disclosure, those skilled in the art can make a variety of alternatives and modifications, these alternatives and modifications should all fall in this
Within scope of disclosure.
Claims (12)
1. a kind of data processing method is applied to first service node, which comprises
According to the pending data of the first service node, it is determined to handle multiple second services of the pending data
Node；
Obtain the multiple second service address of node data；
The destination service node in the multiple second service node is determined based on the address date, wherein the target clothes
Business node is to meet preset condition with the data transmission distance of the first service node in the multiple second service node
Second service node；And
The pending data is sent to the destination service node.
2. described to determine the multiple second service section based on the address date according to the method described in claim 1, wherein
Destination service node in point, comprising:
The priority of each second service node in the multiple second service node is determined based on the address date, it is described excellent
First grade characterizes the data transmission distance of the second service node Yu the first service node；And
The destination service node is determined based on the priority of the second service node.
3. described to determine the multiple second service section based on the address date according to the method described in claim 2, wherein
The priority of each second service node in point, comprising:
According to first service address of node data and the multiple second service address of node data, institute is determined respectively
State the relative positional relationship of first service node Yu each second service node；And
The priority of the multiple second service node is determined based on the relative positional relationship.
4. according to the method described in claim 3, wherein:
First service address of node data include multiple first fields, and second service address of node data include
Multiple second fields；
According to the specific fields in the specific fields and the multiple second field in the multiple first field, described is determined
The relative positional relationship of one service node and the second service node.
5. described to determine the multiple second service section based on the address date according to the method described in claim 4, wherein
Destination service node in point, comprising:
Specific fields in specific fields and the multiple second field in the multiple first field are handled, are obtained
Multiple characteristic values corresponding with the multiple second service node；
The multiple second service node is grouped based on the multiple characteristic value, obtains at least one grouping, wherein institute
The priority for stating the second service node of each grouping at least one grouping is identical；
Targeted packets are determined according to the priority of each grouping at least one described grouping；And
Determine at least one second service node in the targeted packets as the destination service node.
6. a kind of data processing equipment, is applied to first service node, described device includes:
First determining module is determined to handle the pending data according to the pending data of the first service node
Multiple second service nodes；
Module is obtained, the multiple second service address of node data are obtained；
Second determining module determines the destination service node in the multiple second service node based on the address date,
In, the destination service node is full with the data transmission distance of the first service node in the multiple second service node
The second service node of sufficient preset condition；And
The pending data is sent to the destination service node by sending module.
7. device according to claim 6, wherein described to determine the multiple second service section based on the address date
Destination service node in point, comprising:
The priority of each second service node in the multiple second service node is determined based on the address date, it is described excellent
First grade characterizes the data transmission distance of the second service node Yu the first service node；And
The destination service node is determined based on the priority of the second service node.
8. device according to claim 7, wherein described to determine the multiple second service section based on the address date
The priority of each second service node in point, comprising:
According to first service address of node data and the multiple second service address of node data, institute is determined respectively
State the relative positional relationship of first service node Yu each second service node；And
The priority of the multiple second service node is determined based on the relative positional relationship.
9. device according to claim 8, in which:
First service address of node data include multiple first fields, and second service address of node data include
Multiple second fields；
According to the specific fields in the specific fields and the multiple second field in the multiple first field, described is determined
The relative positional relationship of one service node and the second service node.
10. device according to claim 9, wherein second determining module includes:
Handle submodule, to the specific fields in the specific fields and the multiple second field in the multiple first field into
Row processing, obtains multiple characteristic values corresponding with the multiple second service node；
It is grouped submodule, the multiple second service node is grouped based on the multiple characteristic value, obtains at least one
Grouping, wherein the priority of the second service node of each grouping is identical at least one described grouping；
First determines submodule, determines targeted packets according to the priority of each grouping at least one described grouping；And
Second determines submodule, determines at least one second service node in the targeted packets as the destination service section
Point.
11. a kind of data processing system, comprising:
One or more processors；
Storage device, for storing one or more programs,
Wherein, when one or more of programs are executed by one or more of processors, so that one or more of
Processor executes method according to any one of claims 1 to 5.
12. a kind of computer readable storage medium, is stored thereon with executable instruction, which makes to handle when being executed by processor
Device executes method according to any one of claims 1 to 5.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910071518.7A CN109862089B (en) | 2019-01-24 | 2019-01-24 | Data processing method, device, system and computer readable storage medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910071518.7A CN109862089B (en) | 2019-01-24 | 2019-01-24 | Data processing method, device, system and computer readable storage medium |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN109862089A true CN109862089A (en) | 2019-06-07 |
| CN109862089B CN109862089B (en) | 2021-11-09 |
Family
ID=66896081
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201910071518.7A Active CN109862089B (en) | 2019-01-24 | 2019-01-24 | Data processing method, device, system and computer readable storage medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN109862089B (en) |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110569031A (en) * | 2019-09-10 | 2019-12-13 | 联想(北京)有限公司 | programming implementation method and device |
| CN113765793A (en) * | 2021-06-07 | 2021-12-07 | 北京京东振世信息技术有限公司 | Data transmission method and device, storage medium and electronic equipment |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN106533973A (en) * | 2016-11-04 | 2017-03-22 | 华为技术有限公司 | Method and system for distributing service message, and equipment |
| CN107896180A (en) * | 2017-10-24 | 2018-04-10 | 北京小蓦机器人技术有限公司 | Equipment room cooperates with method, equipment, system and the storage medium of processing event |
| CN107920139A (en) * | 2017-11-06 | 2018-04-17 | 顺丰科技有限公司 | A kind of confirmation method of domain name, system, equipment and computer-readable recording medium |
| KR20180099109A (en) * | 2017-02-28 | 2018-09-05 | (주)라이비오 | System and method for requesting real time broadcasting |
-
2019
- 2019-01-24 CN CN201910071518.7A patent/CN109862089B/en active Active
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN106533973A (en) * | 2016-11-04 | 2017-03-22 | 华为技术有限公司 | Method and system for distributing service message, and equipment |
| KR20180099109A (en) * | 2017-02-28 | 2018-09-05 | (주)라이비오 | System and method for requesting real time broadcasting |
| CN107896180A (en) * | 2017-10-24 | 2018-04-10 | 北京小蓦机器人技术有限公司 | Equipment room cooperates with method, equipment, system and the storage medium of processing event |
| CN107920139A (en) * | 2017-11-06 | 2018-04-17 | 顺丰科技有限公司 | A kind of confirmation method of domain name, system, equipment and computer-readable recording medium |
Cited By (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110569031A (en) * | 2019-09-10 | 2019-12-13 | 联想(北京)有限公司 | programming implementation method and device |
| CN113765793A (en) * | 2021-06-07 | 2021-12-07 | 北京京东振世信息技术有限公司 | Data transmission method and device, storage medium and electronic equipment |
| CN113765793B (en) * | 2021-06-07 | 2023-09-05 | 北京京东振世信息技术有限公司 | Data transmission method and device, storage medium and electronic equipment |
Also Published As
| Publication number | Publication date |
|---|---|
| CN109862089B (en) | 2021-11-09 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US9628438B2 (en) | Consistent ring namespaces facilitating data storage and organization in network infrastructures | |
| US9400767B2 (en) | Subgraph-based distributed graph processing | |
| CN106095589B (en) | A kind of method, apparatus and system for distributing subregion | |
| CN111880936B (en) | Resource scheduling method, device, container cluster, computer equipment and storage medium | |
| CN110391938B (en) | Method and apparatus for deploying services | |
| CN111818194A (en) | Domain name based access system and method | |
| CN109862089A (en) | Data processing method, device, system, computer readable storage medium | |
| US9467532B2 (en) | Server, arithmatic processing method, and arithmatic processing system | |
| CN108243254A (en) | Electronic device, the method and storage medium of the publication of application upgrade version | |
| CN112860412B (en) | Service data processing method and device, electronic equipment and storage medium | |
| US8341368B2 (en) | Automatic reallocation of structured external storage structures | |
| JP6542865B2 (en) | Interface aggregation device and interface management method | |
| CN116185578A (en) | Scheduling method of computing task and executing method of computing task | |
| CN114070889B (en) | Configuration method, traffic forwarding device, storage medium, and program product | |
| CN109104446B (en) | Message order-preserving method, network node and storage medium | |
| CN116418826A (en) | Object storage system capacity expansion method, device and system and computer equipment | |
| CN108920175A (en) | The realization method and system of baseboard management controller BMC code logic | |
| CN110120959A (en) | Big data method for pushing, device, system, equipment and readable storage medium storing program for executing | |
| CN114466031A (en) | CDN system node configuration method, device, equipment and storage medium | |
| US10819775B2 (en) | Systems and methods for server failover and load balancing | |
| CN103984545A (en) | Mobile terminal advertisement request method and mobile terminal advertisement request device | |
| CN111314457B (en) | Method and device for setting virtual private cloud | |
| CN113472565B (en) | Method, apparatus, device and computer readable medium for expanding server function | |
| US20230418681A1 (en) | Intelligent layer derived deployment of containers | |
| CN114244744B (en) | Node discovery method and device based on Internet of things equipment |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |