CN108765138B - Object and fund transfer method and device - Google Patents
Object and fund transfer method and device Download PDFInfo
- Publication number
- CN108765138B CN108765138B CN201810550302.4A CN201810550302A CN108765138B CN 108765138 B CN108765138 B CN 108765138B CN 201810550302 A CN201810550302 A CN 201810550302A CN 108765138 B CN108765138 B CN 108765138B
- Authority
- CN
- China
- Prior art keywords
- path
- service
- allocation
- call path
- service information
- 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
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q40/00—Finance; Insurance; Tax strategies; Processing of corporate or income taxes
- G06Q40/02—Banking, e.g. interest calculation or account maintenance
Abstract
An embodiment of the present specification provides an object allocation method and an object allocation device, where in the object allocation method, an object allocation request sent by a service processing system is received. And acquiring at least one corresponding to-be-selected allocation path from the allocation path pool according to the service information in the object allocation request. And acquiring constraint conditions corresponding to a plurality of nodes in at least one to-be-selected call path. And according to the constraint condition, deciding a target allocation path from at least one allocation path to be selected. And executing corresponding object allocation processing according to the target allocation path.
Description
Technical Field
One or more embodiments of the present disclosure relate to the field of computer technologies, and in particular, to a method and an apparatus for allocating objects and funds.
Background
In the conventional technology, when a corresponding object allocation process needs to be executed for a certain type of service, the allocation path of an object is usually a solidified single path. For example, in the fund transfer scenario shown in fig. 1, when the fund transfer from the bank a to the bank G needs to be completed for a certain type of service, there may be no direct connection path between the bank a and the bank G, and there are only multiple reachable paths. Therefore, a call path from bank A to bank G, such as A- > B, B- > E, E- > G, can be solidified by human decision.
Therefore, there is a need to provide a more flexible object allocation scheme.
Disclosure of Invention
One or more embodiments of the specification describe an object, a fund transfer method and a fund transfer device, which can transfer and process the object more flexibly.
In a first aspect, an object allocation method is provided, including:
receiving an object allocation request sent by a service processing system, wherein the object allocation request comprises service information of a service processed by the service processing system;
acquiring at least one corresponding to-be-selected allocating path from an allocating path pool according to the service information; the allocation path pool is composed of one or more allocation paths corresponding to different service information, each allocation path comprises a plurality of nodes, and each node corresponds to one or more constraint conditions;
acquiring constraint conditions corresponding to a plurality of nodes in the at least one to-be-selected call path;
according to the constraint condition, deciding a target allocation path from the at least one allocation path to be selected;
and executing corresponding object allocation processing according to the target allocation path.
In a second aspect, a method for transferring funds is provided, which includes:
receiving a fund transfer request sent by a service processing system, wherein the fund transfer request comprises service information of services processed by the service processing system;
acquiring at least one corresponding to-be-selected allocating path from an allocating path pool according to the service information; the allocation path pool is composed of one or more allocation paths corresponding to different service information, each allocation path comprises a plurality of nodes, and each node corresponds to one or more constraint conditions;
acquiring constraint conditions corresponding to a plurality of nodes in the at least one to-be-selected call path;
according to the constraint condition, deciding a target allocation path from the at least one allocation path to be selected;
and executing corresponding fund allocation processing according to the target allocation path.
In a third aspect, an object allocating apparatus is provided, including:
a receiving unit, configured to receive an object allocation request sent by a service processing system, where the object allocation request includes service information of a service processed by the service processing system;
the acquisition unit is used for acquiring at least one corresponding to-be-selected call path from the call path pool according to the service information; the allocation path pool is composed of one or more allocation paths corresponding to different service information, each allocation path comprises a plurality of nodes, and each node corresponds to one or more constraint conditions;
the obtaining unit is further configured to obtain constraint conditions corresponding to a plurality of nodes in the at least one to-be-selected call path;
a decision unit, configured to decide a target allocation path from the at least one allocation path to be selected according to the constraint condition obtained by the obtaining unit;
and the execution unit is used for executing corresponding object allocation processing according to the target allocation path decided by the decision unit.
In a fourth aspect, there is provided a funds transfer apparatus comprising:
the system comprises a receiving unit, a processing unit and a processing unit, wherein the receiving unit is used for receiving a fund transfer request sent by a service processing system, and the fund transfer request comprises service information of services processed by the service processing system;
the acquisition unit is used for acquiring at least one corresponding to-be-selected call path from the call path pool according to the service information; the allocation path pool is composed of one or more allocation paths corresponding to different service information, each allocation path comprises a plurality of nodes, and each node corresponds to one or more constraint conditions;
the obtaining unit is further configured to obtain constraint conditions corresponding to a plurality of nodes in the at least one to-be-selected call path;
a decision unit, configured to decide a target allocation path from the at least one allocation path to be selected according to the constraint condition obtained by the obtaining unit;
and the execution unit is used for executing corresponding fund allocation processing according to the target allocation path decided by the decision unit.
The object, the fund transfer method and the fund transfer device provided by one or more embodiments of the present specification receive an object transfer request sent by a business processing system. And acquiring at least one corresponding to-be-selected allocation path from the allocation path pool according to the service information in the object allocation request. And acquiring constraint conditions corresponding to a plurality of nodes in at least one to-be-selected call path. And according to the constraint condition, deciding a target allocation path from at least one allocation path to be selected. And executing corresponding object allocation processing according to the target allocation path. That is, the scheme provided in this specification dynamically decides the corresponding allocation path according to the service information and the constraint condition, which can greatly improve the flexibility of object allocation.
Drawings
In order to more clearly illustrate the technical solutions of the embodiments of the present disclosure, the drawings needed to be used in the description of the embodiments are briefly introduced below, and it is obvious that the drawings in the following description are only some embodiments of the present disclosure, and it is obvious for those skilled in the art to obtain other drawings based on the drawings without creative efforts.
FIG. 1 is a schematic diagram of a conventional fund transfer path;
fig. 2 is a schematic view of an application scenario of the object allocation method provided in this specification;
fig. 3 is a flowchart of an object allocation method according to an embodiment of the present specification;
FIG. 4 is a schematic diagram of a pool of allocation paths provided herein;
FIG. 5 is a schematic diagram of a service attribute policy group provided in the present specification;
fig. 6 is a schematic diagram of a relationship between a service, a service attribute policy group, a node constraint policy group, and a call path pool provided in the present specification;
FIG. 7 is a schematic diagram of a fund transfer method provided herein;
fig. 8 is a schematic diagram of an object allocating apparatus according to an embodiment of the present disclosure;
fig. 9 is a schematic view of a fund transfer device provided in the present specification.
Detailed Description
The scheme provided by the specification is described below with reference to the accompanying drawings.
The object allocation method provided by the present specification may be applied to the scenario shown in fig. 2, and in fig. 2, the service processing system may process the service, for example, the service of payment and chargeback of the user may be processed. It should be noted that, when the service processing system processes a service, it is usually necessary to perform corresponding call processing on an object, where the object may refer to a network resource such as funds. For example, when processing transaction paid by the buyer user, the transaction processing system may transfer funds of a corresponding amount in the account of the buyer user to the account of the merchant. The transfer of funds into and out of the bank typically requires a transfer of funds between banking facilities. In fig. 2, when an object needs to be deployed, the service processing system may send an object deployment request to the object deployment system. After receiving the object allocation request, the object allocation system can execute corresponding object allocation processing for the service.
Fig. 3 is a flowchart of an object allocation method according to an embodiment of the present disclosure. The execution subject of the method may be a device with processing capabilities: a server or system or device, such as the object invocation system of fig. 2. As shown in fig. 3, the method may specifically include:
step 310, receiving an object allocation request sent by a service processing system.
The object invocation request may include service information for a service processed by the service processing system. The service information here may include any one or more of the following: type of service, amount and currency, etc.
The processed service is as follows: for the transaction service paid by the buyer user, for example, the payment amount is assumed to be 100 yuan. The service types may be: paying; the amount can be: 100, respectively; the currency can be as follows: RMB. Then the processed service is as follows: for example, the transaction service of the user refund assumes that the refund amount is 100 yuan. The service types may be: refund; the amount can be: 100, respectively; the currency can be as follows: RMB.
And 320, acquiring at least one corresponding to-be-selected call path from the call path pool according to the service information.
The allocation path pool may be formed by one or more allocation paths corresponding to different service information, each allocation path includes a plurality of nodes, and each node corresponds to one or more constraint conditions. In one example, the pool of callout paths may be presented as a tree structure as shown in FIG. 4. For example, in fig. 1, the call path in fig. 4 may be: (A- > B), (A- > B, B- > E, E- > G), (A- > B, B- > C), …, (A- > B, B- > C, C- > D), wherein A-G may be a node in the dial path. In a fund transfer scenario, the node may refer to a specific banking institution.
As can be seen from fig. 4, each dial path may be composed of several sub-paths. Taking the allocation path as follows: (A- > B, B- > E, E- > G) for example, it may include a sub-path: a- > B, B- > E and E- > G.
The allocation path in the allocation path pool may correspond to the service information. If, dial path: (A- > B, B- > E, E- > G) can be compared with a service type: the X type is corresponding, that is, the transfer path only supports the object transfer of the X type service. In one implementation, when there are multiple pieces of service information corresponding to one dial-up path, the multiple pieces of service information may form a service attribute policy group as shown in fig. 5. In fig. 5, the service attribute policy group satisfies a one-to-many data relationship, that is, one policy group may map a plurality of specific atomic policies. Each atomic policy corresponds to a piece of business information. For example, the various atomic policies may be: the service type is X type, the amount is more than 100 ten thousand, the currency is RMB, and the like.
It should be noted that the service attribute policy group in fig. 5 may be used by the object call setup system when initially selecting a call setup path.
In a word, the present specification sets an optional path set for different services, thereby greatly improving the switching capability of the call path of the object. By setting the selectable path set, the problem that the whole service is unavailable due to the fact that one node in a single solidified path is unavailable under the intervention of an external uncontrollable factor can be solved.
It should also be noted that one or more constraints corresponding to each node may constitute a node constraint policy group. The schematic diagram of the node constraint policy group can also be shown in fig. 5, except that each atomic policy may correspond to a constraint. For example, the atomic policies that the node constraint policy group may map may be: the amount does not exceed 1 hundred million RMB/day, the date is working day, etc.
It can be seen from the above that there is an essential difference between the node constraint policy group and the service attribute policy group, and the two are defined from two different dimensions respectively. The service attribute policy group is closer to the service, and the constraint condition of the node is theoretically independent of the service, such as the limit constraint (the limit does not exceed 1 hundred million RMB/day) which is not related to the specific service.
In summary, in the embodiment of the present specification, the relationship between the service, the service attribute policy group, the node constraint policy group, and the allocation path pool may be as shown in fig. 6. In fig. 6, a service attribute policy group may establish a relationship with a specific service, and one service may correspond to a plurality of service attribute policy groups. Meanwhile, the node constraint strategy group is a public resource, a plurality of node constraint strategy groups can be bound in the allocation path pool, and a single node constraint strategy group can also be used for the decision of various allocation paths.
In this specification, by establishing the service attribute policy group and the node constraint policy group, a dynamic decision capability of an object allocation path can be formed, and finally, an optimal allocation path dynamic selection is realized, thereby improving an object service capability.
Returning to step 320, in an implementation manner, step 320 may specifically be: the traffic information is identified to determine an originating node and a terminating node. And acquiring at least one to-be-selected call path from the starting node to the terminating node, which is matched with the service information, from the call path pool.
Also taking fig. 1 as an example, assume that the determined start node and end node are: a and G, and assuming a dial path: the service information corresponding to (A- > B, B- > E, E- > G) is as follows: the service type is X type, the amount is more than 100 ten thousand and the currency is RMB. Further, assume that the dial path: the service information corresponding to (A- > F, F- > E, E- > G) is as follows: the service type is X type, the amount is less than 10 ten thousand and the currency is RMB. Then the service type of the service processed by the service processing system is: type X; the amount is as follows: 100, respectively; the coin types are: and when the RMB is used, the two allocating paths can be acquired as allocating paths to be selected.
In step 330, constraint conditions corresponding to a plurality of nodes in at least one to-be-selected call path are obtained.
As in the previous example, the path to be dialed: (A- > B, B- > E, E- > G), which may be the constraint corresponding to the obtaining node A, B, E and G. And (3) to-be-selected call path: (A- > F, F- > E, E- > G), which may be the constraint corresponding to the obtaining node A, F, E and G.
It should be noted that, since the partial nodes (A, E and G) in the two paths to be elected are the same, the obtained constraint conditions corresponding to the partial nodes are also the same. It can be seen that the constraints of the nodes in this specification belong to a common resource.
And 340, deciding a target allocation path from at least one allocation path to be selected according to the constraint condition.
The constraints of the nodes in this description may correspond to traffic parameters. Taking the constraint conditions as follows: for example, the amount does not exceed 1 hundred million RMB/day, the corresponding service parameters may be: and (4) a quota. And then taking the constraint conditions as follows: for example, the date is a working day, and the corresponding service parameters may be: the date.
When the constraint condition of the node corresponds to the service parameter, the decision process may be: parameter values of the traffic parameters corresponding to the constraints are determined. And judging whether the parameter value of the service parameter corresponding to the constraint condition of each node meets the constraint condition or not for each to-be-selected call path in the at least one to-be-selected call path. And if so, deciding the call path to be selected as a target call path. For the step of determining whether the constraint condition is satisfied, the following steps may be taken: the constraint condition corresponding to the node F is assumed as follows: the amount does not exceed 1 hundred million RMB/day, and the business parameters corresponding to the constraint conditions are as follows: and the amount is that the capital of 100 ten thousand RMB has been allocated in the same day, and the amount of the service processed by the service processing system is as follows: when 10 ten thousand yuan is consumed, the parameter values of the service parameter can be: 110 ten thousand, i.e. the parameter values of the traffic parameters corresponding to the constraints of node F satisfy the constraints (110 ten thousand <1 million). Assume the constraint conditions corresponding to the node B are: the date is the working day, and the service parameters corresponding to the constraint conditions are as follows: and if the date is the date, when the business processing system processes a certain business on holidays, the parameter values of the business parameters are as follows: holidays, i.e. the parameter values of the traffic parameters corresponding to the constraint of the node B do not satisfy the constraint.
It can be understood that, for each node in each to-be-selected call path, whether the parameter value of the service parameter corresponding to the constraint condition meets the constraint condition may be determined by referring to the above method. And when the constraint condition of any node in a certain to-be-selected call path is not met, abandoning the to-be-selected call path. And when the constraint condition of each node in a certain to-be-selected call path is met, deciding the to-be-selected call path as a target call path.
And 350, executing corresponding object allocation processing according to the target allocation path.
As in the previous example, assume that the target call path of the decision is: (A- > F, F- > E, E- > G), and then funds can be allocated through the target allocation path.
In practical application, after the target allocation path is decided, correctness of the target allocation path can be checked. And after the verification is passed, executing the step of object allocation processing. The correctness checking here may include: checking whether the target call path of the decision is consistent with the expected call path, and the like.
In summary, the object allocation method provided in the embodiments of the present specification can implement dynamic decision of an object allocation path. Therefore, the problem of poor usability and expansibility brought by object allocation path solidification configuration can be solved, and the usability and the robustness of object service processing are improved.
Fig. 7 is a schematic diagram of a fund transfer method provided in the present specification. In fig. 7, the fund transfer method may include the following steps: service identification, service attribute decision, node constraint decision and check decision result. The service identification comprises the following steps: and when receiving a fund transfer request sent by the service processing system, the fund processing system identifies the service according to the service information in the fund transfer request. The service information may include information data such as a service identification code. The service attribute decision comprises: after a specific service is identified, all reachable paths (also called to-be-selected call paths) matched with the current service are selected from the call path pool according to a service attribute decision group corresponding to the service, which means that the selected reachable paths only meet the service requirements, and when nodes in the call paths also have corresponding constraint conditions, the constraint conditions usually generate constraints on sub-paths and call paths. For example, a holiday constraint of a node may cause a path (including a sub-path and a transfer path) not to support fund transfers, and a constraint of a node exceeding a single-day limit may cause a path not to support fund transfers. Therefore, the solution provided in the present specification can also perform the step of node constraint decision. The node constraint decision is to further decide for all the selected reachable paths to obtain the optimal allocation path meeting the constraint conditions. And the decision checking result is the last step of decision, so that the decision result is checked, and finally, the optimal fund allocation path is returned.
The fund transfer method provided by the specification can realize dynamic selection and configuration of the fund transfer path, and can dynamically switch the transfer path once external uncontrollable factor intervention occurs, so that high availability and optimal charging of the fund transfer are ensured in a very short time.
Corresponding to the object allocating method, an embodiment of the present specification further provides an object allocating device, as shown in fig. 8, where the device includes:
a receiving unit 801, configured to receive an object allocation request sent by a service processing system, where the object allocation request includes service information of a service processed by the service processing system.
The service information herein may include one or more of the following: type of service, amount, and currency.
An obtaining unit 802, configured to obtain, according to the service information, at least one corresponding to-be-selected call path from the call path pool; the allocation path pool is composed of one or more allocation paths corresponding to different service information, the allocation paths comprise a plurality of nodes, and the nodes correspond to one or more constraint conditions.
The obtaining unit 802 may specifically be configured to:
the traffic information is identified to determine an originating node and a terminating node.
And acquiring at least one to-be-selected call path from the starting node to the terminating node, which is matched with the service information, from the call path pool.
The obtaining unit 802 is further configured to obtain constraint conditions corresponding to multiple nodes in at least one to-be-selected call path.
The decision unit 803 is configured to decide a target allocation path from the at least one allocation path to be selected according to the constraint condition obtained by the obtaining unit 802.
The constraints may correspond to traffic parameters.
The decision unit 803 may specifically be configured to:
parameter values of the traffic parameters corresponding to the constraints are determined.
And judging whether the parameter value of the service parameter corresponding to the constraint condition of each node meets the constraint condition or not for any to-be-selected call path in the at least one to-be-selected call path.
And if so, deciding the call path to be selected as a target call path.
An executing unit 804, configured to execute corresponding object allocation processing according to the target allocation path decided by the decision unit 803.
The functions of each functional module of the device in the above embodiments of the present description may be implemented through each step of the above method embodiments, and therefore, a specific working process of the device provided in one embodiment of the present description is not repeated herein.
In the object allocating apparatus provided in an embodiment of this specification, the receiving unit 801 receives an object allocating request sent by a service processing system. The obtaining unit 802 obtains at least one corresponding to-be-selected call path from the call path pool according to the service information. The obtaining unit 802 obtains constraint conditions corresponding to a plurality of nodes in at least one to-be-selected call path. The decision unit 803 decides a target allocation path from at least one allocation path to be selected according to the constraint condition. The execution unit 804 executes corresponding object allocation processing according to the target allocation path. Thereby, the availability and robustness of object service processing may be improved.
The object allocating device provided in the embodiments of the present specification may be a module or a unit of the object allocating system in fig. 1.
In correspondence with the above fund transfer method, an embodiment of the present specification further provides a fund transfer device, as shown in fig. 9, the device may include:
a receiving unit 901, configured to receive a fund transfer request sent by a service processing system, where the fund transfer request includes service information of a service processed by the service processing system.
An obtaining unit 902, configured to obtain, according to the service information, at least one corresponding to-be-selected call path from the call path pool; the allocation path pool is composed of one or more allocation paths corresponding to different service information, the allocation paths comprise a plurality of nodes, and the nodes correspond to one or more constraint conditions.
The obtaining unit 902 is further configured to obtain constraint conditions corresponding to a plurality of nodes in at least one to-be-selected call path.
A deciding unit 903, configured to decide a target allocation path from the at least one allocation path to be selected according to the constraint condition obtained by the obtaining unit 902.
An executing unit 904, configured to execute corresponding fund allocation processing according to the target allocation path decided by the decision unit 903.
The functions of each functional module of the device in the above embodiments of the present description may be implemented through each step of the above method embodiments, and therefore, a specific working process of the device provided in one embodiment of the present description is not repeated herein.
The fund transfer device provided by the specification can realize dynamic selection and configuration of a fund transfer path, and once intervention of an external uncontrollable factor occurs, the transfer path can be dynamically switched, so that high availability and optimal charging of fund transfer are ensured in a very short time.
Those skilled in the art will recognize that in one or more of the examples described above, the functions described in this specification can be implemented in hardware, software, firmware, or any combination thereof. When implemented in software, the functions may be stored on or transmitted over as one or more instructions or code on a computer-readable medium.
The above-mentioned embodiments, objects, technical solutions and advantages of the present specification are further described in detail, it should be understood that the above-mentioned embodiments are only specific embodiments of the present specification, and are not intended to limit the scope of the present specification, and any modifications, equivalent substitutions, improvements and the like made on the basis of the technical solutions of the present specification should be included in the scope of the present specification.
Claims (8)
1. An object allocation method, comprising:
receiving an object allocation request sent by a service processing system, wherein the object allocation request comprises service information of a service processed by the service processing system;
acquiring at least one corresponding to-be-selected allocating path from an allocating path pool according to the service information; the allocation path pool is composed of one or more allocation paths corresponding to different service information, each allocation path comprises a plurality of nodes, and each node corresponds to one or more constraint conditions; the constraint condition corresponds to a service parameter;
acquiring constraint conditions corresponding to a plurality of nodes in the at least one to-be-selected call path;
determining parameter values of the service parameters corresponding to the constraint conditions;
judging whether the parameter value of the service parameter corresponding to the constraint condition of each node meets the constraint condition or not for any to-be-selected call path in the at least one to-be-selected call path;
if yes, deciding the to-be-selected call path as a target call path;
and executing corresponding object allocation processing according to the target allocation path.
2. The method according to claim 1, wherein the obtaining, according to the service information, the corresponding at least one to-be-selected call path from the call path pool includes:
identifying the service information to determine a starting node and a terminating node;
and acquiring at least one to-be-selected call path from the starting node to the terminating node, which is matched with the service information, from a call path pool.
3. The method according to any of claims 1-2, wherein the service information comprises one or more of: type of service, amount, and currency.
4. A method of fund transfer, comprising:
receiving a fund transfer request sent by a service processing system, wherein the fund transfer request comprises service information of services processed by the service processing system;
acquiring at least one corresponding to-be-selected allocating path from an allocating path pool according to the service information; the allocation path pool is composed of one or more allocation paths corresponding to different service information, each allocation path comprises a plurality of nodes, and each node corresponds to one or more constraint conditions; the constraint condition corresponds to a service parameter;
acquiring constraint conditions corresponding to a plurality of nodes in the at least one to-be-selected call path;
determining parameter values of the service parameters corresponding to the constraint conditions;
judging whether the parameter value of the service parameter corresponding to the constraint condition of each node meets the constraint condition or not for any to-be-selected call path in the at least one to-be-selected call path;
if yes, deciding the to-be-selected call path as a target call path;
and executing corresponding fund allocation processing according to the target allocation path.
5. An object allocation device, comprising:
a receiving unit, configured to receive an object allocation request sent by a service processing system, where the object allocation request includes service information of a service processed by the service processing system;
the acquisition unit is used for acquiring at least one corresponding to-be-selected call path from the call path pool according to the service information; the allocation path pool is composed of one or more allocation paths corresponding to different service information, each allocation path comprises a plurality of nodes, and each node corresponds to one or more constraint conditions; the constraint condition corresponds to a service parameter;
the obtaining unit is further configured to obtain constraint conditions corresponding to a plurality of nodes in the at least one to-be-selected call path;
a decision unit, configured to determine a parameter value of a service parameter corresponding to the constraint condition; judging whether the parameter value of the service parameter corresponding to the constraint condition of each node meets the constraint condition or not for any to-be-selected call path in the at least one to-be-selected call path; if yes, deciding the to-be-selected call path as a target call path;
and the execution unit is used for executing corresponding object allocation processing according to the target allocation path decided by the decision unit.
6. The apparatus according to claim 5, wherein the obtaining unit is specifically configured to:
identifying the service information to determine a starting node and a terminating node;
and acquiring at least one to-be-selected call path from the starting node to the terminating node, which is matched with the service information, from a call path pool.
7. The apparatus according to any of claims 5-6, wherein the service information comprises one or more of: type of service, amount, and currency.
8. A money allocation apparatus, comprising:
the system comprises a receiving unit, a processing unit and a processing unit, wherein the receiving unit is used for receiving a fund transfer request sent by a service processing system, and the fund transfer request comprises service information of services processed by the service processing system;
the acquisition unit is used for acquiring at least one corresponding to-be-selected call path from the call path pool according to the service information; the allocation path pool is composed of one or more allocation paths corresponding to different service information, each allocation path comprises a plurality of nodes, and each node corresponds to one or more constraint conditions; the constraint condition corresponds to a service parameter;
the obtaining unit is further configured to obtain constraint conditions corresponding to a plurality of nodes in the at least one to-be-selected call path;
a decision unit, configured to determine a parameter value of a service parameter corresponding to the constraint condition; judging whether the parameter value of the service parameter corresponding to the constraint condition of each node meets the constraint condition or not for any to-be-selected call path in the at least one to-be-selected call path; if yes, deciding the to-be-selected call path as a target call path;
and the execution unit is used for executing corresponding fund allocation processing according to the target allocation path decided by the decision unit.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810550302.4A CN108765138B (en) | 2018-05-31 | 2018-05-31 | Object and fund transfer method and device |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810550302.4A CN108765138B (en) | 2018-05-31 | 2018-05-31 | Object and fund transfer method and device |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN108765138A CN108765138A (en) | 2018-11-06 |
| CN108765138B true CN108765138B (en) | 2021-09-21 |
Family
ID=64001420
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201810550302.4A Active CN108765138B (en) | 2018-05-31 | 2018-05-31 | Object and fund transfer method and device |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN108765138B (en) |
Families Citing this family (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111147377B (en) * | 2019-12-05 | 2020-09-11 | 连连银通电子支付有限公司 | Method, device, equipment and medium for determining service channel |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101504756A (en) * | 2009-03-16 | 2009-08-12 | 阿里巴巴集团控股有限公司 | System and method for implementing capital allocation based on network |
| CN101916421A (en) * | 2010-09-01 | 2010-12-15 | 中国建设银行股份有限公司 | Foreign exchange remittance service processing method and system |
| CN108057249A (en) * | 2017-11-29 | 2018-05-22 | 腾讯科技(成都)有限公司 | A kind of business data processing method and device |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20110246358A1 (en) * | 2010-03-31 | 2011-10-06 | Bank Of America Corporation | Enhanced Least Cost Routing of Fund Transfer Transactions |
-
2018
- 2018-05-31 CN CN201810550302.4A patent/CN108765138B/en active Active
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101504756A (en) * | 2009-03-16 | 2009-08-12 | 阿里巴巴集团控股有限公司 | System and method for implementing capital allocation based on network |
| CN101916421A (en) * | 2010-09-01 | 2010-12-15 | 中国建设银行股份有限公司 | Foreign exchange remittance service processing method and system |
| CN108057249A (en) * | 2017-11-29 | 2018-05-22 | 腾讯科技(成都)有限公司 | A kind of business data processing method and device |
Also Published As
| Publication number | Publication date |
|---|---|
| CN108765138A (en) | 2018-11-06 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN108764868B (en) | Block chain node proxy reconciliation method and block reconciliation proxy node | |
| CN107103462B (en) | Method and device for processing snapshot data of cross-border remittance of bank | |
| CN109242483A (en) | A kind of dual trading method and system based on centralization and decentralization | |
| CN110910230A (en) | Accounting method, accounting system and storage medium | |
| US20150026052A1 (en) | Methods, systems and computer readable media for facilitating a remote deposit to a prepaid card account | |
| CN107886428B (en) | Method for determining payment clearing exchange rate and payment clearing system | |
| CN111415146A (en) | Resource data processing method, device and equipment | |
| CN110874728A (en) | Online payment system, online payment method, device, medium and server | |
| CN108765138B (en) | Object and fund transfer method and device | |
| CN112633954B (en) | Rights and interests processing method and device based on block chain | |
| CN114066592A (en) | Method and device for transferring resources in batches | |
| CN110717756B (en) | Payment data processing device and method based on contract | |
| CN110532810B (en) | Information processing method and device, electronic equipment and readable storage medium | |
| CN109829708B (en) | Transaction processing system | |
| CN108564433B (en) | Method, device and server for currency conversion | |
| CN105787736A (en) | Data business processing method and device | |
| KR102107454B1 (en) | System for multiplication of financial payment networks, method for financial services using the same and computer program for the same | |
| CN113935507A (en) | Foreign currency cash exchange reservation method and device based on block chain | |
| CN111311395B (en) | Management system, method, equipment and storage medium for public accumulation fund-charging and repayment service | |
| CN109905446B (en) | Service processing method, server and computer storage medium | |
| CN110458701A (en) | A kind of data processing method, device, block chain node device and medium | |
| CN108830703A (en) | Amount control system and amount service system | |
| CN110827009B (en) | Fund transfer method and device based on account balance limit | |
| CN113379537A (en) | Service processing method, device and equipment | |
| CN117093359A (en) | Resource allocation method and device |
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 | ||
| TA01 | Transfer of patent application right | ||
| TA01 | Transfer of patent application right |
Effective date of registration: 20200924 Address after: Cayman Enterprise Centre, 27 Hospital Road, George Town, Grand Cayman Islands Applicant after: Innovative advanced technology Co.,Ltd. Address before: Cayman Enterprise Centre, 27 Hospital Road, George Town, Grand Cayman Islands Applicant before: Advanced innovation technology Co.,Ltd. Effective date of registration: 20200924 Address after: Cayman Enterprise Centre, 27 Hospital Road, George Town, Grand Cayman Islands Applicant after: Advanced innovation technology Co.,Ltd. Address before: A four-storey 847 mailbox in Grand Cayman Capital Building, British Cayman Islands Applicant before: Alibaba Group Holding Ltd. |
|
| GR01 | Patent grant | ||
| GR01 | Patent grant |