CN112085485B - Account checking method and system for third party payment system - Google Patents
Account checking method and system for third party payment system Download PDFInfo
- Publication number
- CN112085485B CN112085485B CN202010856083.XA CN202010856083A CN112085485B CN 112085485 B CN112085485 B CN 112085485B CN 202010856083 A CN202010856083 A CN 202010856083A CN 112085485 B CN112085485 B CN 112085485B
- Authority
- CN
- China
- Prior art keywords
- node
- information
- service
- buffer
- node 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
- 238000000034 method Methods 0.000 title claims abstract description 30
- 239000000872 buffer Substances 0.000 claims abstract description 120
- 230000002159 abnormal effect Effects 0.000 claims abstract description 109
- 238000012545 processing Methods 0.000 claims abstract description 85
- 230000003139 buffering effect Effects 0.000 claims abstract description 36
- 238000012544 monitoring process Methods 0.000 claims abstract description 26
- 238000006243 chemical reaction Methods 0.000 claims description 11
- 230000000149 penetrating effect Effects 0.000 abstract description 3
- 230000005856 abnormality Effects 0.000 abstract 2
- 238000005516 engineering process Methods 0.000 description 10
- 238000010586 diagram Methods 0.000 description 6
- 230000001360 synchronised effect Effects 0.000 description 4
- 230000000737 periodic effect Effects 0.000 description 2
- 230000009286 beneficial effect Effects 0.000 description 1
- 238000010276 construction Methods 0.000 description 1
- 230000007547 defect Effects 0.000 description 1
- 238000011161 development Methods 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- XLYOFNOQVPJJNP-UHFFFAOYSA-N water Substances O XLYOFNOQVPJJNP-UHFFFAOYSA-N 0.000 description 1
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
- G06Q20/00—Payment architectures, schemes or protocols
- G06Q20/08—Payment architectures
- G06Q20/085—Payment architectures involving remote charge determination or related payment systems
- G06Q20/0855—Payment architectures involving remote charge determination or related payment systems involving a third party
Landscapes
- Business, Economics & Management (AREA)
- Accounting & Taxation (AREA)
- Finance (AREA)
- Strategic Management (AREA)
- Physics & Mathematics (AREA)
- General Business, Economics & Management (AREA)
- General Physics & Mathematics (AREA)
- Engineering & Computer Science (AREA)
- Theoretical Computer Science (AREA)
- Computer And Data Communications (AREA)
Abstract
The invention discloses a reconciliation method and a system for a third party payment system, wherein the reconciliation method comprises the following steps: registering and configuring each node information related to the same service type in a node registry corresponding to the service type according to the service logic execution sequence; acquiring node information of each node involved in a service link, and filling the node information into a node information table or buffering the node information into a node buffer table; migrating the buffer node information in the node buffer table to a node information table; compensating the first abnormal node; monitoring the second abnormal node; and alarming the second abnormal node. The invention acquires the information generated by circulation of various orders in each service subsystem in the form of node information into the node information table and the node buffer table of the service link of the accounting system, and forms the overall flow information penetrating through the service global through the service logic execution sequence, thereby timely finding out the abnormality of the order information and timely processing the abnormality.
Description
Technical Field
The invention relates to the technical field of computers, in particular to a reconciliation method and a reconciliation system for a third party payment system.
Background
The third party payment is a third party payment mechanism with a certain strength and credit guarantee, and adopts a mode of signing up with each big bank, and the third party payment is a network payment mode of facilitating the transaction of both transaction parties through interfacing with a bank payment settlement system interface.
With the development of technology, the third party payment system in the industry is generally constructed by adopting a distributed technology, and according to the basic flow of service processing, the third party payment system based on the distributed technology can be split into a plurality of service subsystems, including: the system comprises a product subsystem, a transaction subsystem, a clearing subsystem, an accounting subsystem and a channel subsystem, wherein the service subsystems are mutually combined to jointly complete a plurality of service operations of the third-party payment system.
However, in the actual payment service, the order flows through the service subsystems in different service operation scenes, each service subsystem has respective processing logic, and the service subsystems have asynchronous processing conditions when other service subsystems are called, so that when order information is transferred and output, whether the order information is acquired is completely cannot be determined, and the problem that the order information is abnormal cannot be found timely is caused.
Disclosure of Invention
The invention aims at overcoming the defects of the prior art and provides a reconciliation method for a third party payment system and a reconciliation system for the third party payment system.
The first aspect of the present invention provides a reconciliation method for a third party payment system, the third party payment system including at least two different business subsystems, the at least two different business subsystems together completing business operations of the third party payment system, the reconciliation method comprising the steps of:
registering and configuring each node information related to the same service type in a node registry corresponding to the service type according to a service logic execution sequence, wherein a service subsystem is abstracted into three node types according to the service logic execution sequence: the first node, the middle node and the last node are combined into a service link according to the service logic execution sequence;
acquiring node information of each node involved in the service link, filling each node information into a node information table or buffering each node information into a node buffer table,
the node information state record in the node information table is 1, and the node information state record of the node which is not filled in the node information table is 0 by default;
Migrating the buffer node information in the node buffer table to a node information table;
the first abnormal node is compensated for,
the first abnormal node is a node which has a node information state of 0 and does not exist in the node buffer table within a first set time length;
the second abnormal node is monitored and a second abnormal node is monitored,
the second abnormal node is a node with the node information state of 0 in a second set time length, and the second set time length is longer than the first set time length;
and alarming the second abnormal node.
Preferably, a service link refers to an abstract concept that a service subsystem involved in a certain service type arranges and presents in a node type form according to a service logic execution sequence.
Preferably, the first node is the first node of the service logic execution sequence, the last node is the last node of the service logic execution sequence, and the intermediate node is the node between the first node and the last node in the service logic execution sequence.
Preferably, the node registry information comprises: service logic execution sequence and registration configuration information of each node in the service link.
Preferably, the registration configuration information of the head node in the node registry comprises a head node main order number field and a first associated lower node order number field;
The registration configuration information of the intermediate node in the node registry comprises a first associated upper node order number field and a second associated lower order number field;
the registration configuration information of the end node in the node registry includes a second associated upper level node order number field.
Preferably, the end node is an abstraction of an external system needing to pay attention to the processing result, the node information acquired by the end node from the corresponding service subsystem comprises a reconciliation file generated by the external system, and the external system is a silver-link or a network-link.
Preferably, the information in the node information table includes: the service logic execution sequence and the node information state of each node in the service link.
Preferably, acquiring node information of each node involved in the service link, and filling each node information into a node information table or buffering each node information into a node buffering table, including:
code conversion is carried out on each node information acquired from the service subsystem,
judging whether the node being processed is the head node or not according to the service logic execution sequence information in the node information table,
if the node being processed is the first node, inquiring the node registry and obtaining a first node main order number field and an associated lower node order number field, sequentially filling the first node main order number field, the node information of the first node and the first associated lower node order number field into a node information table,
If the node being processed is not the first node, the node information state of the node corresponding to the last node is queried according to the execution sequence of the service logic in the node information table,
if the node information state of the last node is 1, judging whether the processing node is the last node according to the execution sequence of the service logic in the node information table,
-if the node being processed is the end node, querying the node registry and obtaining a second associated upper node order number field of the end node, sequentially filling the second associated upper node order number field and node information of the end node into the node information table, and modifying the node information state of the end node to be 1,
if the node being processed is a certain intermediate node, querying the node registry and obtaining a first associated upper node order number field and a second associated lower node order number field of the intermediate node, sequentially filling the first associated upper node order number field, the node information of the intermediate node and the second associated lower node order number field into the node information table, and modifying the node information state of the intermediate node to be 1,
-if the node information status of the previous node is 0, buffering the node information corresponding to the node being processed into the node buffer table.
Preferably, each node obtains node information from the corresponding service subsystem through both synchronous and asynchronous technology protocols, and in a preferred embodiment, obtains node information through asynchronous technology protocols.
Preferably, each node information acquired from the service subsystem is subjected to code conversion, the node information is converted into node main information and auxiliary information, and the node information subjected to code conversion comprises first node information, intermediate node information, last node information and first abnormal node information.
Preferably, if the node information state of the previous node is 1, the node main information and the corresponding registration configuration information are filled into the node information table, then the node information state of the node is modified to 1, and the auxiliary information of the node is associated with the node main information of the node in the node information table.
Preferably, if the node information state of the previous node is 0, the node corresponding auxiliary information being processed is stored in the no-sql database.
Preferably, migrating the buffered node information in the node buffer table to the node information table includes:
inquiring the node information state of the last node of the buffer node in the node information table according to the service logic execution sequence in the node information table when the third set time is passed, wherein the third set time is smaller than the first set time,
If the node information state of the last node of the processing buffer node is 1, judging whether the buffer node is a last node according to the execution sequence of service logic in the node information table,
if the processing buffer node is the end node, inquiring the node registry and obtaining the second associated upper node order number field of the end node, sequentially filling the second associated upper node information and the node information of the end node into the node information table, modifying the node information state of the end node to be 1, deleting the end node from the node buffer table,
if the buffer node is an intermediate node, querying a node registry and obtaining a first associated upper node order number field and a second associated lower order number field of the intermediate node, sequentially filling the first associated upper node order number field, the node information of the intermediate node and the second associated lower node order number field into the node information table, modifying the node information state of the intermediate node to be 1, and deleting the intermediate node from the node buffer table,
-if the node information status of the previous node to the processing buffer node is 0, the processing buffer node remains in the node buffer table.
Preferably, compensating the first abnormal node includes:
it is determined whether a first outlier node exists,
if the motion is present, starting the subsequent motion,
if not, stopping the subsequent action,
wherein the follow-up actions include:
the location of the first anomaly node is determined,
the node information of the first abnormal node is retrieved,
and filling the obtained node information of the first abnormal node into a node information table.
Preferably, determining whether the first abnormal node exists includes:
counting the sum of the state values of all node information in the node information table every a first set time length;
comparing the sum of the status values of the information of each node with the number of registered nodes in the node registry,
if the sum of the information state values of all the nodes is smaller than the number of the registered nodes in the node registry, a first abnormal node exists,
-if the sum of the information state values of the nodes is equal to the number of registered nodes in the node registry, there is no first abnormal node.
Preferably, when there is a first abnormal node, determining the position of the first abnormal node includes:
selecting a buffer node with the buffer time exceeding a first set duration in the node buffer table;
according to the service logic execution sequence in the node registry, the buffer node arranged at the forefront is found out;
And taking the buffer node arranged at the forefront as a first reference point, and grabbing the last node of the first reference point as a first abnormal node according to the execution sequence of service logic in the node registry.
Preferably, re-acquiring node information of the first abnormal node includes:
acquiring association information between a first reference point and a first abnormal node according to a node registry;
and acquiring node information of the first abnormal node from the service subsystem corresponding to the first abnormal node according to the association information.
Preferably, the first abnormal node acquires node information through a synchronous technology protocol.
Preferably, the first abnormal node obtains node information from the corresponding service subsystem, performs code conversion, and fills the node information table.
Preferably, filling the obtained node information of the first abnormal node into the node information table includes:
judging whether the first abnormal node is the first node according to the service logic execution sequence information in the node information table,
if the first abnormal node is the first node, inquiring a node registry, acquiring a first node main order number field and an associated lower node order number field, and sequentially filling the first node main order number field, the node information of the first node and the first associated lower node order number field into a node information table;
If the first abnormal node is not the first node, judging whether the processing node is the last node according to the execution sequence of the business logic in the node information table,
if the first abnormal node is the last node, inquiring the node registry and obtaining a second associated upper node order number field of the last node, sequentially filling the second associated upper node order number field and the node information of the last node into the node information table, and modifying the node information state of the last node to be 1,
-if the first abnormal node is a certain intermediate node, querying a node registry and obtaining a first associated upper node order number field and a second associated lower node order number field of the intermediate node, filling the first associated upper node order number field, the node information of the intermediate node and the second associated lower node order number field into the node information table in sequence, and modifying the node information state of the intermediate node to be 1.
Preferably, monitoring the second abnormal node includes:
selecting a buffer node with the buffer time exceeding a second set time length in the node buffer table;
according to the service logic execution sequence in the node registry, the buffer node arranged at the forefront is found out;
taking the buffer node arranged at the forefront as a second reference point, and grabbing the last node of the second reference point as a second abnormal node according to the service logic execution sequence in the node registry;
Assembling corresponding alarm information according to registration configuration information of a second abnormal node in the node registration table;
and inserting the alarm information into an alarm information table.
Preferably, alarming the second abnormal node includes:
scanning the alarm information table every time the fourth set time length is passed;
when the alarm information is scanned, the alarm information is notified to the related personnel.
Preferably, the means for notifying the relevant person of the alarm information includes, but is not limited to: mail early warning, short message early warning, enterprise WeChat early warning and telephone early warning.
Preferably, the node registry, the node information table, the node buffer table and the alarm information table are stored in a database.
The second aspect of the present invention provides a reconciliation system for a third party payment system, the third party payment system comprising at least two different business subsystems that together complete business operations of the third party payment system. Preferably, the reconciliation system described herein operates using the reconciliation method described in the first aspect of the application.
Preferably, the reconciliation system for a third party payment system comprises:
the service node management module is used for registering and configuring the node information related to the same service type in a node registry corresponding to the service type according to the service logic execution sequence, and is used for abstracting the service subsystem into three node types according to the service logic execution sequence: the first node, the middle node and the last node are combined into a service link according to the service logic execution sequence;
The service node processing module is used for acquiring node information of each node involved in the service link and filling the node information into a node information table or buffering the node information into a node buffer table; the node information state record in the node information table is 1, and the node information state record of the node which is not filled in the node information table is 0 by default;
the data buffering and processing module is used for migrating the buffer node information in the node buffering table to the node information table;
the service node compensation module is used for compensating a first abnormal node, wherein the first abnormal node is a node which has a node information state of 0 and does not exist in the node buffer table within a first set duration;
the service node monitoring module is used for monitoring a second abnormal node, wherein the second abnormal node is a node with the node information state of 0 in a second set time length, and the second set time length is longer than the first set time length;
and the early warning notification module is used for warning the second abnormal node.
Preferably, acquiring node information of each node involved in the service link, and filling each node information into a node information table or buffering each node information into a node buffering table, including:
The service node processing module performs code conversion on each node information acquired from the service subsystem,
the service node processing module judges whether the node being processed is the head node according to the service logic execution sequence information in the node information table,
if the node being processed is the first node, the service node processing module queries the node registry and obtains the first node main order number field and the associated lower node order number field, sequentially fills the first node main order number field, the node information of the first node and the first associated lower node order number field into the node information table,
if the node being processed is not the first node, the service node processing module queries the node information state of the node being processed corresponding to the last node according to the service logic execution sequence in the node information table,
if the node information state of the last node is 1, the service node processing module judges whether the processing node is the last node according to the service logic execution sequence in the node information table,
if the node being processed is the last node, the service node processing module queries the node registry and obtains the second associated upper node order number field of the last node, the service node processing module sequentially fills the second associated upper node order number field and the node information of the last node into the node information table, and modifies the node information state of the last node to be 1,
If the node being processed is a certain intermediate node, the service node processing module queries the node registry and obtains the first associated upper node order number field and the second associated lower node order number field of the intermediate node, the service node processing module sequentially fills the first associated upper node order number field, the node information of the intermediate node and the second associated lower node order number field into the node information table, and modifies the node information state of the intermediate node to be 1,
-if the node information status of the previous node is 0, the service node processing module buffers the node information corresponding to the node being processed into the node buffer table.
Preferably, the service node processing module obtains node information of each node from the corresponding service subsystem through synchronous and asynchronous technical protocols, and in a preferred embodiment, obtains node information through asynchronous technical protocols.
Preferably, the service node processing module performs code conversion on each node information acquired from the service subsystem, the node information is converted into node main information and auxiliary information, and the node information subjected to code conversion comprises first node information, intermediate node information, last node information and first abnormal node information.
Preferably, if the node information state of the previous node is 1, the service node processing module fills the node main information and the corresponding registration configuration information into the node information table, modifies the node information state of the node to 1, and then associates the auxiliary information of the node with the node main information of the node in the node information table.
Preferably, if the node information state of the previous node is 0, the service node processing module stores the node corresponding auxiliary information being processed in the no-sql database.
Preferably, migrating the buffered node information in the node buffer table to the node information table includes:
the data buffering and processing module queries the node information state of the last node of the buffer node in the node information table according to the execution sequence of the service logic in the node information table every time the third set time is passed, wherein the third set time is smaller than the first set time,
if the node information state of the last node of the processing buffer node is 1, the data buffering and processing module judges whether the buffer node is the last node according to the execution sequence of the service logic in the node information table,
if the processing buffer node is the end node, the data buffer and processing module queries the node registry and obtains the second associated upper node order number field of the end node, sequentially fills the second associated upper node information and the node information of the end node into the node information table, modifies the node information state of the end node to 1, and deletes the end node from the node buffer table,
If the buffer node is an intermediate node, the data buffer and processing module queries the node registry and obtains a first associated upper node order number field and a second associated lower node order number field of the intermediate node, sequentially fills the first associated upper node order number field, the node information of the intermediate node, and the second associated lower node order number field into the node information table, modifies the node information state of the intermediate node to 1, and deletes the intermediate node from the node buffer table,
if the node information state of the last node of the processing buffer node is 0, the data buffering and processing module keeps the processing buffer node in the node buffer table.
Preferably, compensating the first abnormal node includes:
it is determined whether a first outlier node exists,
if the motion is present, starting the subsequent motion,
if not, stopping the subsequent action,
wherein the follow-up actions include:
the location of the first anomaly node is determined,
the node information of the first abnormal node is retrieved,
and filling the obtained node information of the first abnormal node into a node information table.
Preferably, determining whether the first abnormal node exists includes:
Every first set time length, the business node compensation module counts the sum of the state values of all node information in the node information table;
the service node compensation module compares the sum of the status values of the information of each node with the number of registered nodes in the node registry,
if the sum of the information state values of all the nodes is smaller than the number of the registered nodes in the node registry, a first abnormal node exists,
-if the sum of the information state values of the nodes is equal to the number of registered nodes in the node registry, there is no first abnormal node.
Preferably, when there is a first abnormal node, determining the position of the first abnormal node includes:
the service node compensation module selects a buffer node with the buffer time exceeding a first set duration in the node buffer table;
the service node compensation module finds out the buffer node arranged at the forefront according to the service logic execution sequence in the node registry; and taking the buffer node arranged at the forefront as a first reference point, and grabbing the last node of the first reference point as a first abnormal node by the service node compensation module according to the service logic execution sequence in the node registry.
Preferably, re-acquiring node information of the first abnormal node includes:
the service node compensation module acquires association information between a first reference point and a first abnormal node according to a node registry;
And according to the association information, the service node compensation module acquires node information of the first abnormal node from the service subsystem corresponding to the first abnormal node.
Preferably, the service node compensation module acquires node information of the first abnormal node through a synchronous technology protocol.
Preferably, the service node compensation module obtains node information from the corresponding service subsystem by the first abnormal node, performs code conversion, and fills the node information into the node information table.
Preferably, filling the obtained node information of the first abnormal node into the node information table includes:
the service node compensation module judges whether the first abnormal node is the head node according to the service logic execution sequence information in the node information table,
if the first abnormal node is the first node, the service node compensation module queries the node registry and acquires a first node main order number field and an associated lower node order number field, and the service node compensation module sequentially fills the first node main order number field, the node information of the first node and the first associated lower node order number field into the node information table;
if the first abnormal node is not the first node, the service node compensation module judges whether the processing node is the last node according to the service logic execution sequence in the node information table,
If the first abnormal node is a last node, the service node compensation module queries the node registry and obtains a second associated upper node order number field of the last node, the service node compensation module sequentially fills the second associated upper node order number field and node information of the last node into the node information table and modifies the node information state of the last node to 1,
-if the first abnormal node is a certain intermediate node, the service node compensation module queries the node registry and obtains a first associated upper node order number field and a second associated lower node order number field of the intermediate node, and the service node compensation module sequentially fills the first associated upper node order number field, the node information of the intermediate node and the second associated lower node order number field into the node information table and modifies the node information state of the intermediate node to be 1.
Preferably, the service node monitoring module monitors the second abnormal node, including:
the service node monitoring module selects a buffer node with the buffer time exceeding a second set duration in the node buffer table;
the service node monitoring module finds out the buffer node arranged at the forefront according to the service logic execution sequence in the node registry; taking the buffer node arranged at the forefront as a second reference point, and the service node monitoring module grabbing the last node of the second reference point as a second abnormal node according to the service logic execution sequence in the node registry;
The service node monitoring module assembles corresponding alarm information according to registration configuration information of a second abnormal node in the node registration table;
the service node monitoring module inserts the alarm information into the alarm information table.
Preferably, alarming the second abnormal node includes:
scanning the alarm information table every time the fourth set time length is passed;
when the alarm information is scanned, the alarm information is notified to the related personnel.
Preferably, the way in which the early warning notification module notifies the relevant personnel includes, but is not limited to: mail early warning, short message early warning, enterprise WeChat early warning and telephone early warning.
The invention provides a reconciliation method and a system for a third party payment system, which have the beneficial effects that:
abstracting each service subsystem in a third party payment system into service nodes according to each service subsystem related to service types to form different service links according to service logic execution sequences, registering and matching the service links into a node registry, acquiring information generated by circulation of various types of orders in each service subsystem into a node information table and a node buffer table of a reconciliation system service link in the form of node information, and combining registration configuration information and node information into overall flow information penetrating through the service links through the service logic execution sequences;
When order information is missing, problems can be found out in time and the positions of the problems can be checked out according to the flow information, the missing node information is found out and compensated by matching with a node registry and a node information table through setting the node information state and periodic self-checking, and then self-remedying of the problem order information is achieved to a certain extent, monitoring and early warning are carried out on the problem order information which cannot be self-remedied, and related personnel are reminded to process the problem order information.
Drawings
FIG. 1 is a schematic diagram of the operation of the present invention;
FIG. 2 is a schematic diagram illustrating the operation of a service node management module according to the present invention;
FIG. 3 is a schematic diagram illustrating the operation of a service node processing module according to the present invention;
FIG. 4 is a flow chart of the operation of the service node processing module of the present invention;
FIG. 5 is a flow chart of the operation of the data buffering and processing module of the present invention;
FIG. 6 is a general flow chart of the operation of the service node compensation module of the present invention;
FIG. 7 is a partial flow diagram of the operation of the service node compensation module of the present invention;
FIG. 8 is a partial flow diagram of the operation of the service node compensation module of the present invention;
FIG. 9 is a partial flow diagram of the operation of the service node compensation module of the present invention;
fig. 10 is a flowchart of the operation of the service node monitoring module of the present invention.
Detailed Description
The present invention will be described in further detail with reference to the accompanying drawings.
Referring to fig. 1, the reconciliation system for the third party payment system is applied to the third party payment system, the third party payment system is built based on a distributed technology and comprises a plurality of service subsystems, the service subsystems are mutually combined to jointly complete various service operations of the third party payment system, the reconciliation system abstracts each service subsystem related to the same service type under the third party payment system into nodes, the reconciliation system acquires node information from the third party payment system according to the service type and combines the node information into running water information penetrating through the whole process, wherein the node information is information of an order when the related service subsystem of the third party payment system is circulated, and the acquired node information is stored in a database.
In a specific embodiment, the third party payment system comprises a first subsystem, a second subsystem, a third subsystem, a fourth subsystem, a fifth subsystem and an external system, wherein the first subsystem, the second subsystem, the third subsystem, the fourth subsystem and the external system are sequentially combined to complete the class A service of the third party payment system, the third subsystem, the second subsystem, the fifth subsystem and the external system are sequentially combined to complete the class B service of the third party payment system,
The system comprises an external system, wherein the external system is last executed in all business types, the external system is a silver-connected or network-connected, the information of the order circulating in the external system is an account checking file transmitted by the silver-connected or network-connected, and the last node is the external system, so that the quasi-real-time monitoring of the funds in and out of a third party payment company is facilitated, the order which is not rectified through all business subsystems is early-warned, and further the occurrence of a large-range loss event is avoided.
The reconciliation system comprises: the system comprises a service node management module, a service node processing module, a data buffering and processing module, a service node compensation module, a service node monitoring module and a service node early warning module.
Referring to fig. 2, the service node management module is configured to register and configure each node information related to the same service type in a node registry corresponding to the service type according to a service logic execution sequence, where the node registry is located in a database, and the service node management module abstracts a service subsystem into three node types according to the service logic execution sequence: when orders circulate in all service subsystems under a third-party payment system, the first node is the first node of the service logic execution sequence, the last node is the last node of the service logic execution sequence, the middle node is a node between the first node and the last node in the service logic execution sequence, the first node, the middle node and the last node are arranged and combined into a service link according to the service logic execution sequence, and specifically, in the class A service, the first subsystem is the first node, the second subsystem, the third subsystem and the fourth subsystem are the middle node, and the external system is the last node.
Different types of services correspond to different service links and also correspond to different types of node registries respectively, a third party payment system registers and configures related service subsystems in the corresponding node registries through a service node management module according to the service types, and information in the node registries comprises: service logic execution sequence, registration configuration information of each node in the service link, wherein,
the registration configuration information of the head node in the node registry comprises a head node main order number field and a first associated lower node order number field; the registration configuration information of the intermediate node in the node registry comprises a first associated upper node order number field and a second associated lower order number field; the registration configuration information of the end node in the node registry comprises a second associated upper node order number field, wherein the first node main order number field is an identification in order flow information, and the first associated lower node order number field, the first associated upper node order number field, the second associated lower order number field and the second associated upper node order number field are used for association among the nodes, so that the node information can be retrieved conveniently when the later node information is lost.
Referring to fig. 3, a service node processing module is configured to obtain node information of each node involved in a service link, and fill each node information into a node information table or buffer each node information into a node buffer table in combination with registration configuration information in a node registry, where a node information state and a service logic execution order are set in the node information table, nodes in the node information table are filled, a node information state record in the node information table is 1, nodes not filled in the node information table are filled, a node information state default record is 0, and the node information table and the node buffer table are located in a database.
The service node processing module obtains node information from the corresponding service subsystem through an asynchronous technology protocol, the order of obtaining each node information is different from the service logic execution order, the filling order of the node information in the node information table is the same as the service logic execution order, therefore, the node information needs to confirm whether the previous node exists before filling the node information into the node information table, if so, the node information is filled into the node information table, if not, the node information is buffered to the node buffer table, specifically,
referring to fig. 4, a specific processing flow of the service node processing module is:
The service node processing module performs code conversion on node information acquired from each service subsystem, wherein the node information is converted into node main information and auxiliary information, the node information required to perform code conversion comprises first node information, intermediate node information, last node information and first abnormal node information,
the service node processing module judges whether the node being processed is the head node according to the service logic execution sequence information in the node information table,
if the node being processed is the first node, the service node processing module queries the node registry and obtains the first node main order number field and the associated lower node order number field, sequentially fills the first node main order number field, the node main information of the first node and the first associated lower node order number field into the node information table, associates the auxiliary information of the first node with the node main information of the first node in the node information table after modifying the node information state of the first node to be 1,
if the node being processed is not the first node, the service node processing module queries the node information state of the node being processed corresponding to the last node according to the service logic execution sequence in the node information table,
If the node information state of the last node is 1, the service node processing module judges whether the processing node is the last node according to the service logic execution sequence in the node information table,
if the node being processed is the last node, the service node processing module queries the node registry and acquires the second associated upper node order number field of the last node, the service node processing module sequentially fills the second associated upper node order number field and the node main information of the last node into the node information table, after modifying the node information state of the last node to be 1, associates the auxiliary information of the last node with the node main information of the last node in the node information table,
if the node being processed is a certain intermediate node, the service node processing module queries the node registry and acquires the first associated upper node order number field and the second associated lower node order number field of the intermediate node, the service node processing module sequentially fills the first associated upper node order number field, the node main information of the intermediate node and the second associated lower node order number field into the node information table, modifies the node information state of the intermediate node to be 1, associates the auxiliary information of the intermediate node with the node main information of the last node in the node information table,
-if the node information status of the previous node is 0, the service node processing module buffers the node main information corresponding to the node being processed into the node buffer table, and stores the auxiliary information of the node into the no-sql database.
The data buffering and processing module processes the node main information buffered in the node buffering table, because asynchronous technology is frequently used in the construction of an actual system, the logically processed node is likely to be acquired later, the logically acquired node main information is stored in the node buffering table later, the data buffering and processing module sets a timing scanning task to scan the node main information in the node buffering table and the node information state of the last node in the node information table, when the node information state of the last node is 1, the node main information of the buffering node in the node buffering table is migrated to the node information table, and after the node information state of the node is modified to be 1, the auxiliary information of the node is taken out from the no-sql database to be related with the node main information of the node in the node information table.
Referring to fig. 5, a specific processing flow of the data buffering and processing module to the buffering node is:
the data buffering and processing module sets a timing scanning task, each interval has a third set duration, the data buffering and processing module queries the node information state of the last node of the buffering node in the node information table according to the service logic execution sequence in the node information table, in a preferred embodiment, the third interval duration is set to 2 minutes,
If the node information state of the last node of the processing buffer node is 1, the data buffering and processing module judges whether the buffer node is the last node according to the execution sequence of the service logic in the node information table,
if the processing buffer node is the last node, the data buffer and processing module queries the node registry and obtains the second associated upper node order number field of the last node, sequentially fills the second associated upper node information and the node main information of the last node into the node information table, deletes the node main information of the last node from the node buffer table, and after modifying the node information state of the node to be 1, takes the auxiliary information of the last node out of the no-sql database to be associated with the node main information of the last node in the node information table,
if the buffer node is an intermediate node, the data buffer and processing module queries the node registry and obtains a first associated upper node order number field and a second associated lower node order number field of the intermediate node, sequentially fills the first associated upper node order number field, the node main information of the intermediate node and the second associated lower node order number field into the node information table, deletes the node main information of the intermediate node from the node buffer table, modifies the node information state of the intermediate node to 1, takes auxiliary information of the intermediate node from the no-sql database to be associated with the node main information of the intermediate node in the node information table,
If the node information state of the last node of the processing buffer node is 0, the data buffering and processing module keeps the node main information of the processing buffer node in the node buffer table, and keeps the auxiliary information of the processing buffer node in the no-sql database.
When the node information is collected, network problems or other system anomalies may occur, so that the service node processing module does not completely acquire all the node information related under the service link corresponding to a certain order type, and in order to avoid the problems caused by such anomalies, a service node compensation module is configured to compensate a first abnormal node, where the first abnormal node is defined as a node whose node information state is always 0 and is not in the node buffer table within a specified first set duration.
Referring to fig. 6, a specific processing flow of the service node compensation module for the first abnormal node is:
it is determined whether a first outlier node exists,
-if the first abnormal node does not exist, not performing subsequent operations;
-if the first abnormal node exists, the subsequent operations include:
the location of the first anomaly node is determined,
the node information of the first abnormal node is retrieved,
And filling the obtained node information of the first abnormal node into a node information table.
Referring to fig. 7, a specific process flow for determining whether the first abnormal node exists is:
the service node compensation module sets a timing scanning task, counts the sum of the state values of all the node information in the node information table every a first set time length, wherein the first set time length is longer than a third set time length, and in a preferred embodiment, the first interval time length is set to be 5 minutes;
the service node compensation module compares the sum of the status values of the information of each node with the number of registered nodes in the node registry,
if the sum of the information state values of all the nodes is smaller than the number of the registered nodes in the node registry, a first abnormal node exists,
-if the sum of the information state values of the nodes is equal to the number of registered nodes in the node registry, there is no first abnormal node.
Referring to fig. 8, a specific process flow for determining the location of the first abnormal node is:
the service node compensation module selects a buffer node with the buffer time exceeding a first set duration in the node buffer table;
the service node compensation module finds out the buffer node arranged at the forefront according to the service logic execution sequence in the node registry;
And taking the buffer node arranged at the forefront as a first reference point, and grabbing the last node of the first reference point as a first abnormal node by the service node compensation module according to the service logic execution sequence in the node registry.
Referring to fig. 9, a specific process flow of re-acquiring the node information corresponding to the first abnormal node is as follows:
the service node compensation module acquires association information between a first reference point and a first abnormal node according to a node registry;
and according to the association information, the service node compensation module acquires node information of the first abnormal node from the service subsystem corresponding to the first abnormal node.
The specific process flow of filling the obtained node information of the first abnormal node into the node information table is shown in fig. 4, and will not be described herein.
When the node information is collected, due to network problems or other system anomalies, the service node processing module does not completely acquire all the node information related under the service link corresponding to a certain order type, and the service node compensation module cannot process the problems, the service node monitoring module is configured to monitor a second abnormal node, where the second abnormal node is defined as a node whose node information state is always 0 within a specified second set duration, the second set duration is longer than the first set duration, and in a preferred embodiment, the second interval duration is set to 30 minutes.
Referring to fig. 10, a specific process flow of the service node monitoring module for monitoring the second abnormal node is:
the service node monitoring module selects a buffer node with the buffer time exceeding a second set duration in the node buffer table;
the service node monitoring module finds out the buffer node arranged at the forefront according to the service logic execution sequence in the node registry;
taking the buffer node arranged at the forefront as a second reference point, and the service node monitoring module grabbing the last node of the second reference point as a second abnormal node according to the service logic execution sequence in the node registry;
the service node monitoring module assembles corresponding alarm information according to registration configuration information of a second abnormal node in the node registration table;
the service node monitoring module inserts the alarm information into the alarm information table.
In view of the fact that related personnel cannot monitor the alarm information table from time to time, an early warning notification module is arranged and used for notifying related personnel that an order is abnormal, and the specific processing flow is as follows:
the early warning notification module sets a fourth set time length, and scans the warning information table once every the first set time length;
when the alarm information is scanned, the alarm information is notified to the related personnel.
The way in which the alert notification module notifies the relevant personnel includes, but is not limited to: mail pre-warning, short message pre-warning, enterprise micro-message pre-warning and telephone pre-warning, in a preferred embodiment, the fourth set time period is 3 minutes.
In summary, the invention abstracts each service subsystem in the third party payment system into service nodes according to each service subsystem related to the service type to form different service links according to the service logic execution sequence, registers and coordinates the service links into a node registry, acquires information generated by circulation of various types of orders in each service subsystem into a node information table and a node buffer table of the service links of the accounting system in the form of node information, and combines the registration configuration information and the node information into overall flow information through the service links according to the service logic execution sequence;
when order information is missing, problems can be found out in time and the positions of the problems can be checked out according to the flow information, the missing node information is found out and compensated by matching with a node registry and a node information table through setting the node information state and periodic self-checking, and then self-remedying of the problem order information is achieved to a certain extent, monitoring and early warning are carried out on the problem order information which cannot be self-remedied, and related personnel are reminded to process the problem order information.
The present embodiment is only for explanation of the present invention and is not to be construed as limiting the present invention, and those skilled in the art can make modifications to the present embodiment without creative contribution as required after reading the present specification, but are protected by patent laws within the scope of claims of the present invention.
Claims (8)
1. A method for reconciliation of a third party payment system, the third party payment system comprising at least two different business subsystems that together complete business operations of the third party payment system, the method comprising the steps of:
registering and configuring each node information related to the same service type in a node registry corresponding to the service type according to the service logic execution sequence,
the service subsystem is abstracted into three node types according to the service logic execution sequence: the first node, the middle node and the last node are combined into a service link according to the service logic execution sequence;
acquiring node information of each node involved in the service link, filling each node information into a node information table or buffering each node information into a node buffer table,
wherein, the node filled with the node information table has node information state recorded as 1, the node not filled with the node information table has node information state recorded as 0 by default,
the obtaining node information of each node involved in the service link, filling each node information into a node information table or buffering each node information into a node buffering table, and the method comprises the following steps:
Code conversion is carried out on each node information acquired from the service subsystem,
judging whether the processing node is the head node or not according to the service logic execution sequence information in the node information table,
if the node being processed is the first node, inquiring the node registry and obtaining a first node main order number field and an associated lower node order number field, sequentially filling the first node main order number field, the node information of the first node and the first associated lower node order number field into a node information table,
if the node being processed is not the first node, the node information state of the node corresponding to the last node is queried according to the execution sequence of the service logic in the node information table,
if the node information state of the last node is 1, judging whether the processing node is the last node according to the execution sequence of the service logic in the node information table,
-if the node being processed is the end node, querying the node registry and obtaining a second associated upper node order number field of the end node, sequentially filling the second associated upper node order number field and node information of the end node into the node information table, and modifying the node information state of the end node to be 1,
If the node being processed is a certain intermediate node, querying the node registry and obtaining a first associated upper node order number field and a second associated lower node order number field of the intermediate node, sequentially filling the first associated upper node order number field, the node information of the intermediate node and the second associated lower node order number field into the node information table, and modifying the node information state of the intermediate node to be 1,
-if the node information state of the previous node is 0, buffering the node information corresponding to the node being processed to the node buffer table;
migrating the buffered node information in the node buffer table to the node information table,
the step of migrating the buffer node information in the node buffer table to the node information table includes:
inquiring the node information state of the last node of the buffer node in the node information table according to the service logic execution sequence in the node information table when the third set time is passed, wherein the third set time is smaller than the first set time,
if the node information state of the last node of the processing buffer node is 1, judging whether the buffer node is a last node according to the execution sequence of service logic in the node information table,
If the processing buffer node is the end node, inquiring the node registry and obtaining the second associated upper node order number field of the end node, sequentially filling the second associated upper node information and the node information of the end node into the node information table, modifying the node information state of the end node to be 1, deleting the end node from the node buffer table,
if the buffer node is an intermediate node, querying a node registry and obtaining a first associated upper node order number field and a second associated lower order number field of the intermediate node, sequentially filling the first associated upper node order number field, the node information of the intermediate node and the second associated lower node order number field into the node information table, modifying the node information state of the intermediate node to be 1, and deleting the intermediate node from the node buffer table,
-if the node information state of the previous node of the processing buffer node is 0, the processing buffer node remains in the node buffer table;
the first abnormal node is compensated for,
the first abnormal node is a node which has a node information state of 0 and does not exist in the node buffer table within a first set time length;
The second abnormal node is monitored and a second abnormal node is monitored,
the second abnormal node is a node with the node information state of 0 in a second set time length, and the second set time length is longer than the first set time length;
and alarming the second abnormal node.
2. The method of claim 1, wherein compensating for the first anomaly node comprises:
it is determined whether a first outlier node exists,
if the motion is present, starting the subsequent motion,
if not, stopping the subsequent action,
wherein the follow-up actions include:
the location of the first anomaly node is determined,
the node information of the first abnormal node is retrieved,
and filling the obtained node information of the first abnormal node into a node information table.
3. The method of reconciliation for the third-party payment system of claim 2, wherein determining whether the first anomaly node is present comprises:
counting the sum of the state values of all node information in the node information table every a first set time length;
comparing the sum of the status values of the information of each node with the number of registered nodes in the node registry,
if the sum of the information state values of all the nodes is smaller than the number of the registered nodes in the node registry, a first abnormal node exists,
-if the sum of the information state values of the nodes is equal to the number of registered nodes in the node registry, there is no first abnormal node.
4. A method of reconciliation for a third party payment system as defined in claim 3, wherein determining the location of the first anomaly node comprises:
selecting a buffer node with the buffer time exceeding a first set duration in the node buffer table;
according to the service logic execution sequence in the node registry, the buffer node arranged at the forefront is found out;
and taking the buffer node arranged at the forefront as a first reference point, and grabbing the last node of the first reference point as a first abnormal node according to the execution sequence of service logic in the node registry.
5. The method of claim 1, wherein monitoring the second anomaly node comprises:
selecting a buffer node with the buffer time exceeding a second set time length in the node buffer table;
according to the service logic execution sequence in the node registry, the buffer node arranged at the forefront is found out;
taking the buffer node arranged at the forefront as a second reference point, and grabbing the last node of the second reference point as a second abnormal node according to the service logic execution sequence in the node registry;
Assembling corresponding alarm information according to registration configuration information of a second abnormal node in the node registration table;
and inserting the alarm information into an alarm information table.
6. The method of claim 5, wherein alerting the second anomaly node comprises:
scanning the alarm information table every time the fourth set time length is passed;
when the alarm information is scanned, the alarm information is notified to the related personnel.
7. A method of reconciliation for a third party payment system according to claim 1 or 5, wherein the node registry, the node information table, the node buffer table, the node alert table are stored in a database.
8. A reconciliation system for a third party payment system for implementing the reconciliation method for a third party payment system of claim 1, the third party payment system comprising at least two different business subsystems that together complete a business operation of the third party payment system; the reconciliation system includes:
the service node management module is used for registering and configuring the node information related to the same service type in a node registry corresponding to the service type according to the service logic execution sequence, and is used for abstracting the service subsystem into three node types according to the service logic execution sequence: the first node, the middle node and the last node are combined into a service link according to the service logic execution sequence;
The service node processing module is used for acquiring node information of each node involved in the service link and filling the node information into a node information table or buffering the node information into a node buffer table; the node information state record in the node information table is 1, and the node information state record of the node which is not filled in the node information table is 0 by default;
the data buffering and processing module is used for migrating the buffer node information in the node buffering table to the node information table;
the service node compensation module is used for compensating the first abnormal node; the first abnormal node is a node which has a node information state of 0 and does not exist in the node buffer table within a first set time length;
the service node monitoring module is used for monitoring the second abnormal node; the second abnormal node is a node with the node information state of 0 in a second set time length, and the second set time length is longer than the first set time length;
and the early warning notification module is used for warning the second abnormal node.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010856083.XA CN112085485B (en) | 2020-08-24 | 2020-08-24 | Account checking method and system for third party payment system |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010856083.XA CN112085485B (en) | 2020-08-24 | 2020-08-24 | Account checking method and system for third party payment system |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN112085485A CN112085485A (en) | 2020-12-15 |
| CN112085485B true CN112085485B (en) | 2023-12-26 |
Family
ID=73729238
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202010856083.XA Active CN112085485B (en) | 2020-08-24 | 2020-08-24 | Account checking method and system for third party payment system |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN112085485B (en) |
Families Citing this family (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN115641142A (en) * | 2022-12-22 | 2023-01-24 | 北京搜狐新动力信息技术有限公司 | Method and device for monitoring payment process |
Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US6363411B1 (en) * | 1998-08-05 | 2002-03-26 | Mci Worldcom, Inc. | Intelligent network |
| US7778960B1 (en) * | 2005-10-20 | 2010-08-17 | American Megatrends, Inc. | Background movement of data between nodes in a storage cluster |
| CN103929433A (en) * | 2014-04-30 | 2014-07-16 | 齐齐哈尔轨道交通装备有限责任公司 | Cross-system integrated account checking and signing method and device |
| CN108665198A (en) * | 2017-03-30 | 2018-10-16 | 苏宁云商集团股份有限公司 | A kind of method and device examined in service link |
| CN110427424A (en) * | 2019-07-09 | 2019-11-08 | 深圳壹账通智能科技有限公司 | Business datum checking method, device, computer equipment and storage medium |
| CN110765091A (en) * | 2019-09-09 | 2020-02-07 | 上海陆家嘴国际金融资产交易市场股份有限公司 | Account checking method and system |
Family Cites Families (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20180211252A1 (en) * | 2017-01-20 | 2018-07-26 | Jiko Group, Inc. | Systems and methods for private node-level data computing and reconciliation |
| US11257028B2 (en) * | 2019-01-07 | 2022-02-22 | United Parcel Service Of America, Inc. | System and methods for self-adjusting electronic reconciliation of a contribution amount and delivery value |
-
2020
- 2020-08-24 CN CN202010856083.XA patent/CN112085485B/en active Active
Patent Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US6363411B1 (en) * | 1998-08-05 | 2002-03-26 | Mci Worldcom, Inc. | Intelligent network |
| US7778960B1 (en) * | 2005-10-20 | 2010-08-17 | American Megatrends, Inc. | Background movement of data between nodes in a storage cluster |
| CN103929433A (en) * | 2014-04-30 | 2014-07-16 | 齐齐哈尔轨道交通装备有限责任公司 | Cross-system integrated account checking and signing method and device |
| CN108665198A (en) * | 2017-03-30 | 2018-10-16 | 苏宁云商集团股份有限公司 | A kind of method and device examined in service link |
| CN110427424A (en) * | 2019-07-09 | 2019-11-08 | 深圳壹账通智能科技有限公司 | Business datum checking method, device, computer equipment and storage medium |
| CN110765091A (en) * | 2019-09-09 | 2020-02-07 | 上海陆家嘴国际金融资产交易市场股份有限公司 | Account checking method and system |
Non-Patent Citations (3)
| Title |
|---|
| "军卫一号"与第三方支付平台的对账系统设计;郭旭;冯硕;刘敏超;;中国数字医学(第03期);全文 * |
| 在线二手房交易资金托管系统设计;张露;朱国强;;河南广播电视大学学报(第02期);全文 * |
| 基于流程引擎异步控制算法的事务并行处理方案的设计与实现;李成奇;林佳烨;欧建强;;通信与信息技术(第03期);全文 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN112085485A (en) | 2020-12-15 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US8799722B2 (en) | Business to business network management event detection and response system and method | |
| CN110765091B (en) | Account checking method and system | |
| US8484662B2 (en) | Systems and/or methods for end-to-end business process management, business event management, and/or business activity monitoring | |
| US8732516B2 (en) | Method and system for providing customer controlled notifications in a managed network services system | |
| US6617969B2 (en) | Event notification system | |
| US6697809B2 (en) | Data retrieval and transmission system | |
| US8738760B2 (en) | Method and system for providing automated data retrieval in support of fault isolation in a managed services network | |
| US6697810B2 (en) | Security system for event monitoring, detection and notification system | |
| US7890955B2 (en) | Policy based message aggregation framework | |
| US20060244585A1 (en) | Method and system for providing alarm reporting in a managed network services environment | |
| US7218980B1 (en) | Prediction based optimization of a semiconductor supply chain using an adaptive real time work-in-progress tracking system | |
| US6684180B2 (en) | Apparatus, system and method for reporting field replaceable unit replacement | |
| US20060233311A1 (en) | Method and system for processing fault alarms and trouble tickets in a managed network services system | |
| US20060233312A1 (en) | Method and system for providing automated fault isolation in a managed services network | |
| US20130283106A1 (en) | Management of data in a supply chain transaction | |
| US20060233313A1 (en) | Method and system for processing fault alarms and maintenance events in a managed network services system | |
| US7610172B2 (en) | Method and system for monitoring non-occurring events | |
| US20050188273A1 (en) | Apparatus and method for context-sensitive error event notification | |
| US20030093516A1 (en) | Enterprise management event message format | |
| US20020156601A1 (en) | Event monitoring and detection system | |
| CN112085485B (en) | Account checking method and system for third party payment system | |
| CN113452607A (en) | Distributed link acquisition method and device, computing equipment and storage medium | |
| CN109995585B (en) | Exception handling method, device and storage medium | |
| US7500144B2 (en) | Resolving problems in a business process utilizing a situational representation of component status | |
| JP2004178296A (en) | Knowledge based operation management system, method and program |
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 |