CN111754216A - Automatic switching method for payment link - Google Patents
Automatic switching method for payment link Download PDFInfo
- Publication number
- CN111754216A CN111754216A CN202010562631.8A CN202010562631A CN111754216A CN 111754216 A CN111754216 A CN 111754216A CN 202010562631 A CN202010562631 A CN 202010562631A CN 111754216 A CN111754216 A CN 111754216A
- Authority
- CN
- China
- Prior art keywords
- payment
- channel
- payment channel
- service
- data
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Pending
Links
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
- G06Q20/00—Payment architectures, schemes or protocols
- G06Q20/08—Payment architectures
- G06Q20/20—Point-of-sale [POS] network systems
-
- 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/02—Payment architectures, schemes or protocols involving a neutral party, e.g. certification authority, notary or trusted third party [TTP]
- G06Q20/027—Payment architectures, schemes or protocols involving a neutral party, e.g. certification authority, notary or trusted third party [TTP] involving a payment switch or gateway
-
- 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/38—Payment protocols; Details thereof
- G06Q20/382—Payment protocols; Details thereof insuring higher security of transaction
-
- 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/38—Payment protocols; Details thereof
- G06Q20/40—Authorisation, e.g. identification of payer or payee, verification of customer or shop credentials; Review and approval of payers, e.g. check credit lines or negative lists
- G06Q20/407—Cancellation of a transaction
Abstract
A payment link automatic switching method includes S1, a user logs in a platform through a service gateway to prepare for payment and monitor the state of a POS machine; s2, awakening and starting a payment channel monitoring service; s3, monitoring the state of a payment channel; s4, listing available payment channels and selecting a default payment channel; s5, selecting a payment channel; s7, scanning a payment channel; s8, reading the payment channel from the cache, scanning a payment channel interface by the payment monitoring service according to the interval time, checking whether other available payment channels exist currently or not if the payment channel currently used by the user is abnormal, prompting the user that the payment cannot be currently carried out if the payment channel currently used by the user does not exist, automatically switching to the available payment channel if the payment channel does not exist, acquiring the information selected and input by the user in the context, seamlessly switching to the service of the reselected payment channel, finishing the payment on the new channel by the user, and ensuring that the user does not sense the payment channel; and S9, processing the abnormal code and printing the receipt, and ending the payment process.
Description
Technical Field
The invention relates to a payment method. In particular to an automatic switching method of payment links.
Background
At present, single-channel deposit money collection is carried out on all single POS (point of sale) money collection and deposit channels in the medical and American industries, and no POS manufacturer can integrate a plurality of payment channels into one POS machine. The link payment fusion technology can seamlessly realize the integration of multi-channel payment on one POS machine, and the effectiveness of a plurality of payment channels enables users to complete seamless switching and effective payment under an unconscious condition.
The prior art is based on a single-channel communication implementation mode, only whether the payment state of the current channel is normal or not is reserved, and therefore the problem that whether the payment channel is alive or not needs to be dynamically monitored constantly when a plurality of payment channel clusters are deployed cannot be solved. The technology realizes dynamic monitoring and dynamic routing of the payment channel, can judge the current effective payment channel in real time, and selects the most effective payment channel for the payment of the POS machine.
Disclosure of Invention
The invention aims to overcome the defects of the prior art, focuses on the medical and American industry, applies a multilink payment fusion technology, solves the problem that the medical and American industry uses a single payment channel, and is mainly applied to an intelligent POS terminal payment module. A payment link automatic switching method is provided.
In order to achieve the purpose, the technical scheme of the invention is as follows: a method for automatically switching a payment link is provided,
s1, a user logs in a platform through a service gateway to prepare for payment and monitor the state of a POS machine, if the state is a starting state, S2 is entered, otherwise, the payment channel service is not started, and the user is prompted to start up;
s2, awakening and starting a payment channel monitoring service, calling an interface and returning an available payment channel;
s3, monitoring the state of the payment channel, scanning the port of the payment channel at regular time, and returning a state code: the payment monitoring service scans the current payment channel interface according to the interval time (every 5 seconds, the time interval can be configured), returns the status codes of all the payment channels (the channel is normal by 000, and other status codes indicate that the payment channel is abnormal), and puts all the status codes into the payment channel cache;
s4, listing available payment channels and selecting a default payment channel: the system automatically selects a default normal payment channel, if all the payment channels are unavailable, the system directly warns on the interface of the POS machine, and normal payment cannot be carried out currently;
s5, selecting a payment channel to prepare for payment, and carrying out card swiping, two-dimensional code payment and verification password input operations by a user;
s7, scanning a payment channel, and placing available information in a cache;
s8, reading the payment channel from the cache, scanning a payment channel interface by the payment monitoring service according to the interval time, checking whether other available payment channels exist currently or not if the payment channel currently used by the user is abnormal, prompting the user that the payment cannot be currently carried out if the payment channel currently used by the user does not exist, automatically switching to the available payment channel if the payment channel does not exist, acquiring the information selected and input by the user in the context, seamlessly switching to the service of the reselected payment channel, finishing the payment on the new channel by the user, and ensuring that the user does not sense the payment channel;
s9, abnormal code processing and receipt printing: if the Unionpay or the payment mechanism does not return a normal payment success code within the effective time, or an abnormal code is returned, the system scans that the current POS machine has a payment abnormal code or does not return within time, the system informs the user that the current payment is not successful, the Unionpay or the payment mechanism can complete fund correction and refund operation within a proper time limit, and simultaneously changes the current payment running order state into payment failure, if a normal code is returned, the system starts a printing program, completes the receipt printing of the Unionpay or the payment mechanism, and the payment process is ended.
Has the advantages that:
(1) a unified gateway authentication and identity authentication mechanism is adopted, so that the safety of platform information and fund and the convenience of user access operation are ensured, and the wind control of platform fund and sensitive information is greatly reduced;
(2) the complexity of mutual calling between internal services is simplified;
(3) the light-weight implantation characteristic is realized;
(4) the safety coefficient is high;
(5) the application range is wide;
(6) the soft and hard double encryption technology is used for ensuring the safety of the communication and information transmission of the platform;
(7) the method supports various system deployment scenes of network isolation and no network isolation;
(8) the data transmission safety in the credit data sharing exchange process is ensured through a hybrid encryption mode;
(9) the load balancer is distributed to the service nodes according to the strategy, so that the load balancer can really and accurately acquire the real-time processing capacity of the service nodes, and the influence of a real-time parameter process on the performance of the system is avoided;
drawings
FIG. 1 is a flow chart of a payment link auto-switching method of the present invention;
FIG. 2 is a timing diagram of an automatic switching method of payment links of the present invention;
Detailed Description
The invention is further described with reference to the following figures and examples.
A method for automatically switching a payment link is provided,
s1, a user logs in a platform through a service gateway to prepare for payment and monitor the state of a POS machine, if the state is a starting state, S2 is entered, otherwise, the payment channel service is not started, and the user is prompted to start up;
s2, awakening and starting a payment channel monitoring service, calling an interface and returning an available payment channel;
s3, monitoring the state of the payment channel, scanning the port of the payment channel at regular time, and returning a state code: the payment monitoring service scans the current payment channel interface according to the interval time (every 5 seconds, the time interval can be configured), returns the status codes of all the payment channels (the channel is normal by 000, and other status codes indicate that the payment channel is abnormal), and puts all the status codes into the payment channel cache;
s4, listing available payment channels and selecting a default payment channel: the system automatically selects a default normal payment channel, if all the payment channels are unavailable, the system directly warns on the interface of the POS machine, and normal payment cannot be carried out currently;
s5, selecting a payment channel to prepare for payment, and carrying out card swiping, two-dimensional code payment and verification password input operations by a user;
s7, scanning a payment channel, and placing available information in a cache;
s8, reading the payment channel from the cache, scanning a payment channel interface by the payment monitoring service according to the interval time, checking whether other available payment channels exist currently or not if the payment channel currently used by the user is abnormal, prompting the user that the payment cannot be currently carried out if the payment channel currently used by the user does not exist, automatically switching to the available payment channel if the payment channel does not exist, acquiring the information selected and input by the user in the context, seamlessly switching to the service of the reselected payment channel, finishing the payment on the new channel by the user, and ensuring that the user does not sense the payment channel;
s9, abnormal code processing and receipt printing: if the Unionpay or the payment mechanism does not return a normal payment success code within the effective time, or an abnormal code is returned, the system scans that the current POS machine has a payment abnormal code or does not return within time, the system informs the user that the current payment is not successful, the Unionpay or the payment mechanism can complete fund correction and refund operation within a proper time limit, and simultaneously changes the current payment running order state into payment failure, if a normal code is returned, the system starts a printing program, completes the receipt printing of the Unionpay or the payment mechanism, and the payment process is ended.
The time sequence process of automatic switching is as follows:
s1, scanning whether a payment channel in a cache is in a healthy state or not every 2 seconds by a timing thread task;
s2, initializing a Pos machine, requesting to load corresponding parameters, and encrypting part of sensitive information;
s2.1, starting a Pos host program to attach to a Netty user side, starting the service of the server at the same time, and establishing or maintaining the limitation of a connecting channel;
s2.2, monitoring a main thread, monitoring states of increase, decrease, failure, normal and the like of a payment channel;
s3, checking whether the thread of the payment channel is alive or not by monitoring the port of the payment channel;
s3.1, starting connection of a payment channel;
s3.2, starting a port reconnection mechanism in real time for the ports with connection overtime and failure;
s4, judging and checking the state of the payment channel through the survival of the port;
s4.1, putting the payment channel which is checked to be alive or healthy through the port into a cache queue to be checked and enabled;
s5, the front end requests a payment channel to complete the transaction;
and S5.1, returning one of the payment channels from the current effective payment channel for current payment.
And S6, when the effective payment channel is normally used, the platform sends an in-station message notification.
And S7, returning a result of the payment transaction to the platform through the transaction process of the current payment channel.
And S7.1, returning the transaction data of the payment channel.
And S8, the platform acquires payment data and a payment state returned by the payment mechanism, and completes the selection of a payment channel and the payment transaction result.
The data sharing cluster adopts a distributed cache/data synchronization technology Redis, all payment channels are stored in the Redis, management of multi-node payment channels, effective node loading access and the like are supported through distributed deployment, and the consistency and the effectiveness of data between a master node and a slave node are guaranteed through a data synchronization mechanism;
redis is a log-type and Key-Value database related high-performance storage system based on a memory and capable of being persisted, a plurality of languages API are provided, uniform distribution of Redis nodes corresponding to keys is realized by performing consistent hashing on the keys, and all accesses to Redis uniformly distribute requests to all deployed Redis effective nodes through a consistent hashing algorithm;
wherein, the consistent hash (hash) algorithm is as follows: judging which server an object should be cached on, mapping a caching server and the cached object to a hash ring, starting from the position of the cached object, starting from the first server encountered in the clockwise direction, namely the server where the current object is to be cached, and since the cached object and the value of the server after hash are fixed, under the condition that a deployment server is not changed, an object is cached on the fixed server certainly, so that when the object is accessed next time, the same algorithm is used for calculation again, the object can be calculated to be cached on the server, and the object can be directly searched on the corresponding server;
data synchronization is achieved by Redis: the Redis master-slave synchronization mechanism may ensure data synchronization between the master and slave of Redis. The method can be divided into full-range synchronization and partial synchronization according to the number of the synchronization contents, and specifically comprises the following steps:
initializing whole-course synchronization: when the slave is started, sending a SYNC message to a master of the slave, after receiving the message of the slave, the master possibly starts a background process to perform backup, and sending the backup data to the slave after the backup is completed;
data modification synchronization: after the initialization full-range synchronization operation is completed, all subsequent write operations are performed on the master, all read operations are performed on the slave, and the write operation of the user needs to be spread to all the slaves in time so as to keep the synchronization of the data to the maximum extent.
The POS machine is connected with a server through a load balancer, a Sentinel and a main flow frame Spring cloud (Spring service suite) are integrated together in an adapter mode, codes related to current limiting and degrading of the Sentinel are added to an expansion point of the Spring cloud, and when a certain server or servers in a cluster have too large load or do not respond timely for a long time, a Sentinel fusing mechanism starts to be started, so that the purposes of high stability and high availability of automatic payment link switching service are achieved;
the Sentinel is a lightweight high-available access flow control component oriented to a distributed service architecture, and mainly takes access flow as an entry point to protect the stability of automatic payment link switching service from multiple dimensions such as access flow control, fusing degradation, system load protection and the like;
the method comprises the following steps that a Sentinel forms a linked list based on a plurality of (7) different service nodes, each service node plays its own role, and after doing internal matters by itself, a request is transmitted to the next service node until the service of a certain service node meets a current-limiting fusing condition, blocking abnormity is thrown out and transmission is stopped, the Sentinel completes calling of an entry method of each service node through a service node chain, each service node performs logic processing of itself according to a created rule, and when a statistical result reaches a set threshold value, a current-limiting and fusing event is triggered; such as throwing an occlusion exception.
The functional responsibilities of the 7 nodes are as follows:
the NodeSelectrSlot is responsible for collecting the paths of the resources and storing the call paths of the resources in a tree structure for throttling degradation according to the call paths.
The ClusterBuilderSlot is used to store statistics of resources and caller information, such as RT (run time), QPS (query per second), and threaded count, which are used as the basis for multidimensional throttling and demotion.
And 3, the statistcSlot is used for recording and counting RunTime (running time) information at different latitudes.
And 4, the FlowSlot is used for carrying out current limiting according to a preset current limiting rule and the statistical state of the front node.
And 5, controlling the black and white list according to the black and white list by the AuthorationSlot.
And 6, fusing and degrading the DegradeSlot according to the statistical information and a preset rule.
The SystemSlot controls the total inlet flow by the state of the system.
The first 3 nodes are responsible for making statistics, and the last 4 nodes are responsible for specifically controlling whether to block the request or release the request according to the statistical result and the configured rule.
Wherein, the monitoring payment channel adopts two modes of Kafka polling and Listene active push,
kafka is used for message notification: caching message notification, message state refreshing, message expiration time and the like of whether the payment link port is valid; collecting logs: logs of various services can be collected with Kafka, and are exposed to various consumers for consumption by Kafka in a unified interface service.
Kafka is distributed, partition-supporting and multi-copy (replenica), and can process a large amount of data in real time to meet various demand scenes based on a zookeeper coordinated distributed message system;
kafka characteristics:
1. high throughput, low latency: kafka can handle hundreds of thousands of messages per second with a minimum delay of only a few milliseconds.
2. And (3) expandability: the kafka cluster supports hot-scaling.
3. Durability and reliability: messages are persisted to local disk and support data backup against data loss
4. Fault tolerance: allowing the nodes in the cluster to fail.
5. High concurrency: thousands of clients are supported to read and write simultaneously.
Listener is independent in development process, monitors the kafka message by using the @ KafkaListener annotation, and then consumes in the method, without concern for specific implementation of kafka, only needs to add topics to the configuration value file.
Polling is the core of kafka consumer API, requests data from the server by a simple poll, the consumer subscribes to the topic, the poll handles all details including group coordination, partition rebalancing, sending heartbeats and getting data, and the developer only needs to use a set of simple APIs to handle the data returned from the partitions.
The method comprises the steps of starting an effective payment channel, establishing a communication relation with the corresponding payment channel through a Socket long link in the initialization process of the effective payment channel, obtaining relevant parameters of current equipment, and obtaining relevant data between the effective payment channel and an interface of a platform server, wherein IO processing is performed through Nio. The Socket long connection and the Nio unimpeded transmission of the Netty ensure the service communication to be free of blocking;
the Netty uses socket long connection to save more tcp establishing/closing operations, reduce waste and save time, and is more suitable for long connection for users frequently requesting resources; there is a problem with clients and servers if they are not shut down for a long time: as more and more users are used, the resources of the server are consumed.
Aiming at the defect of long connection, the method can be solved by establishing a distribution server, and the specific scheme is as follows:
1. the equipment requests a distribution server, the distribution server returns an effective socket server IP and a port, and then the connection is disconnected;
2. after the device obtains the IP and the port, the device is connected with a socket server and then carries out protocol communication with the socket server;
3. if the device does not receive the connection success response, the device tries to connect again, and if the three requests still do not establish the connection successfully, the device needs to request the distribution server and then re-operate the operation.
4. The problem of frequent communication between the equipment and the server can be easily solved.
Nio is a non-blocking IO processing mode, and mainly comprises three core parts: channel, Buffer, Selector. Traditional IO operates based on a byte stream and a character stream, while Nio operates based on a Channel and Buffer, with data always being read from the Channel into the Buffer, or written from the Buffer into the Channel. The Selector (select area) is used to listen to events of multiple channels. A single thread may listen to multiple data channels.
Wherein, a distributed transaction component is employed: seata and RocktMQ are used for keeping the integrity of the payment transaction loop transaction, Seata and RocktMQ are used for monitoring the port state of the payment channel, message notification, state updating, sending and receiving of local transaction messages are completed through messages, and simultaneously Seata and RocktMQ are used for realizing transaction control for independent data updating among a plurality of services.
Seata is a distributed transaction framework capable of processing synchronous transactions, and an application layer realizes automatic compensation based on SQL analysis, so that service intrusiveness is reduced to the maximum extent; a TC (transaction coordinator) in the distributed transaction is independently deployed and is responsible for registering and rolling back the transaction; the write isolation and the read isolation are realized through the global lock;
the RocktMQ is an AMQ message middleware product, is a distributed message middleware of a queue model, processes the processing and message processing of asynchronous distributed transactions, can ensure strict message sequence, provides rich message pull modes, has high-efficiency subscriber horizontal expansion capability, a real-time message subscription mechanism and hundred million-level message accumulation capability; providing a docker mirror image for isolation testing and cloud cluster deployment; the instrument panel with rich functions of configuration, index, monitoring and the like is provided.
The message notification is automatically pushed through the Netty and the RocketMQ, the Netty and the RocketMQ monitor the port state of the payment channel, the message notification, the state updating, the sending and receiving of the local transaction message, the sending of the service message notification and the processing of the consumption service message are completed through the message;
netty is an asynchronous event-driven network application framework that supports the rapid development of maintainable high-performance protocol-oriented servers and clients; the Nety encapsulates the API of the Nio, the performance is improved to a certain extent in the following mode, and the concurrency of processing connection is improved through multiplexing; the Netty receiving and sending data adopt direct cache, Socket reading and writing are carried out by using an external direct memory, and secondary copying of a byte buffer area is not needed. The rockmq underlying RPC communication uses a Netty framework.
The application in the case of the scheme is as follows:
the automatic switching of the payment link integrates the payment interfaces of the multi-party payment channel, and a seamless non-delay automatic switching technology is adopted, so that the real-time performance and the convenience of the payment channel are guaranteed, and the safety of payment funds of a user is also guaranteed.
The payment link automatic switching technology means that when a user uses a POS machine for payment, a system can automatically select the most appropriate payment channel according to the state of the current payment channel to complete the current payment operation, and is embodied in the comprehensive integration of key technologies of Redis, Kafka, Sentiel, Netty, Seata, RocktMQ and GPE.
The GPE monitors the gateway payment route, the gateway payment channel, the gateway payment port and the interface service of the hardware equipment, and realizes an early warning mechanism and a heartbeat detection mechanism;
GPE is short for Grafana, Prometous and Exporter, Grafana is a visualization tool used after opening the box; prometheus is an open source service monitoring system, collects data from remote machines through the HTTP protocol and stores the data in a local time sequence database; the Exporter is an important component in prometheus monitoring and is responsible for acquiring data indexes and deploying agents at a user side;
the GPE workflow is as follows, an Exporter component is registered in a registration center; the Prometheus pulls a server in the registration center; an Exporter component acquires indexes of server or system software; grafana configures a Prometoxus data source to acquire acquired data thereof and combines a user-defined panel to realize large monitoring screen; grafana realizes monitoring and early warning by setting Alerting.
The user logs in the platform through the service Gateway, the service Gateway performs Gateway current limiting through SC Gateway and authenticates through JWT/Oauth2, the SC Gateway is Spring Cloud Gateway service Gateway, the Spring Cloud Gateway is a Gateway framework newly pushed out by Spring Cloud, and the Gateway generally simplifies the calling logic of the front end in the project and simplifies the complexity of mutual calling between internal services; the specific function is forwarding service, receiving and forwarding all internal and external user terminal calls; other common functions include authority authentication, current limit control, and the like.
JWT (JSON Web token) is an open standard (RFC 7519) that defines a protocol for securely transferring information between two points in a self-contained JSON format. The transmitted information is verifiable and trusted because it uses a digital signature. JWT is able to digitally sign an algorithm by using a public/private key pair. The oat 2 is itself an authorization protocol.
The public key/secret key pair algorithm introduces two classic encryption algorithms, namely an iterative block encryption algorithm and an asymmetric encryption algorithm, integrates the advantages of the two algorithms, and realizes credit data exchange transmission based on a mixed encryption mode of the two encryption algorithms so as to ensure the safety of data transmission in the credit data sharing exchange process.
The public key/secret key pair algorithm specifically comprises the following steps:
s1: carrying out data encryption on a plaintext P of information to be transmitted by utilizing an iterative block encryption algorithm to form a ciphertext;
s2: generating a pair of secret keys by using an asymmetric encryption algorithm, encrypting the secret keys of the iterative block encryption algorithm by using a public key generated by the asymmetric encryption algorithm by a sender, and transmitting the secret keys of the iterative block encryption algorithm encrypted by the asymmetric encryption algorithm and a ciphertext encrypted by the iterative block encryption algorithm to a receiver;
s3: the receiver decrypts the secret key of the iterative block encryption algorithm encrypted by the asymmetric encryption algorithm by using the private key generated by the asymmetric encryption algorithm, and then decrypts the ciphertext by using the secret key of the iterative block encryption algorithm to form a plaintext, so that the aim of safe transmission is fulfilled.
The iterative block encryption algorithm is specifically as follows:
the iterative block cipher algorithm produces 64-bit cipher text while processing 64-bit information plaintext blocks. In the iterative block encryption algorithm, eight bits are used as check bits, 8 th, 16 th, 24 th, 32 th, 40 th, 48 th, 56 th, 64 th bits, respectively, and the key significance used for encryption is 56 bits.
In 64-bit plaintext data input till 64-bit ciphertext output, 16 rounds of encryption are performed by the iterative block encryption algorithm, and 48 bits of secret key K exist in each round of encryptioniAnd 8 alternative mapping boxes SiThe method is characterized in that the input 64-bit plaintext data is split into two identical and independent 32-bit plaintexts, and the plaintexts are marked as L0And R0Performing the same round encryption for each round of algorithm, and using the 32-bit L of the previous roundi-1And Ri-1As an input parameter, a 32-bit parameter is output as LiAnd RiWherein the value range of i is more than or equal to 1 and less than or equal to 16.
The encryption calculation method for each round comprises the following specific steps:
s1, inputting 64-bit data;
s2, initially replacing IP;
s3. encrypt, Li＝Ri-1，
S4, finally replacing IP-1。
Wherein, f (R)i-1,Ki) Representing a mapping Box Algorithm, KiA key representing the ith round is represented by,
representing an exclusive-or operation, E () and P () representing an extension function and a mapping function, respectively, E () and P () pair Ri-1And
and carrying out bit number expansion mapping to expand 32 bits to 48 bits. For an iterative block cipher algorithm, an initial permutation IP and a final permutation IP-1The position replacement arrangement is carried out according to the corresponding rule;
wherein the mapping box algorithm f (R)i-1,Ki) The concrete implementation is as follows:
s1, adding Ri-1＝r1r2r3.......r32Extending from 32 bits to 48 bits, Ri-1Representing the ciphertext of a plaintext after i-1 rounds of encryption, riA character representing the ith bit;
s2. for Ri-1The expansion is carried out, and the expansion is carried out,
T1representing 8 6-bit character strings Bi，T1＝B1B2......B8；
S3.(S1(B1),S2(B2),...,S8(B8))→T2Wherein S isi(Bi) B is to bei＝b1b2......b6Is mapped as a mapping box SiR rows and c columns of (1), wherein r is 2b1+b6，b2b3b4b5Is a binary representation of c being greater than or equal to 0 and less than or equal to 15, biAs a string BiThe ith character of (1);
s4, pair T by replacing function P ()2Substitution is made, and is denoted as P (T)2)→T3By direct transposition, the T of 32 bits2＝t1t2......t32Substitution to T2＝t16t7......t25。
Wherein, the iteration is divided intoKey K of group encryption algorithmiIs composed of 48-bit cipher length, each iteration of 16 rounds of iteration needs different secret key KiEncrypted with a secret key KiThe generation process is as follows:
s1, removing 8 secret key parity check bits, and using 64-bit initial secret key K0Down to 56 bits, the 56 bit key is divided into two blocks, 28 bits C respectively, according to the key permutation selection0And 28 bit D0；
S2, according to the turns, the C0And D0Circularly left-shifting, generating C after conversion1And D1Then, C is added1And D1Combining, and generating 48-bit key K by key replacement selection1；
S3.C1And D1Performing left shift conversion again to generate C2And D2And C is1And D1Merging, generating a 48-bit key K by selective permutation2；
S4, repeating the step S3 for 9 times to obtain a 48-bit secret key Ki，3≤i≤16。
The number of bits of the loop left shift is determined by the number of iteration rounds, the 1 st, 2 nd, 9 th and 16 th rounds are left shift by one bit, and the rest rounds are left shift by two bits.
The asymmetric encryption algorithm comprises the following steps:
s1, selecting two large prime numbers p and q, and requiring that p is not equal to q, and calculating to obtain the final product
n＝p×q；
S2, selecting a prime number e, wherein the requirement e meets the requirement
And greatest common divisor
S3, calculating
mod represents a remainder function；
S4, publishing a secret key, and sending KpublicAs public key parameter, K ═ e, nprivateAs private key parameter (d, n);
s5, using C ═ peThe plaintext is encrypted by a modn formula, and p is CdThe modn formula decrypts the ciphertext; wherein the binary digit number of the prime numbers p and q is more than 1024, the decimal numerical value of the prime numbers p and q satisfies 1000 < | p-q | < 10000,
the load balancer distributes the request task to the service node according to a certain strategy, and in order to ensure that the load balancer can really and accurately acquire the real-time processing capacity of the service node, the processing capacity factors influencing the service node need to be analyzed. When the load balancing module collects parameters of the service node, if the parameters are too much, certain resource loss is caused to the load balancing node and the service node. In order to avoid the influence of the process of acquiring the real-time parameters of the service nodes on the performance of the system, two main core factors influencing the server nodes are determined as the indexes of the real-time load capacity, namely the utilization rate of the processor and the idle rate of the memory.
The method comprises the following steps:
s1, a Socket interface is adopted for communication of a load balancer and a service node, and UDP with less resource requirements is adopted as a transmission protocol for reducing the problem of resource loss caused by communication;
s2, the load balancer periodically sends an acquisition request to the service node, and the processor utilization rate and the memory vacancy rate of the service node are obtained through calculation;
the processor is divided into three operation states, namely an idle state, a user state and a system kernel state, the operation time of the idle state is represented by T1, the operation time of the user state is represented by T2, the operation time of the kernel state is represented by T3, and the utilization rate C of the processor is obtainediThe calculation formula is as follows:
the total memory of the current service node can be found out through the system filetotal size, buffer size, cached size, free memory size, and memory idle rate MiThe calculation is as follows:
s3, calculating the weight of the service node,
for a plurality of service nodes NiUsing the set Node ═ N1,N2,...,Ni,...,NnDenotes, for the service node NiProcessor utilization of CiIndicating that memory is free by MiMeans that weight is reused by WiRepresenting, a service node NiWeight expression function FiThe following were used: fi＝λ1(1-Ci)+λ2Mi；
Wherein λ1+λ2＝1，λ1And λ2Representing the impact factor of the processor and memory, CiAnd MiAll values of (A) are in the interval [0,1 ]]In the range of 1-CiAnd MiWhen both are 0, FiA value of 0 indicates that the service node is in an unavailable state and will not be assigned a task, and when the load weight difference is satisfied, Wi＝Fi；
Among them, λ is preferred1＝0.6，λ2＝0.4；
S4, carrying out boundary condition analysis on the new weight value and the old value, and setting the weight W of the service node under the boundary value PiThe update of (2) is to satisfy the following equation:
and when the boundary condition is met, calling a setsockopt function to write the new weight into a load configuration table of the load balancer and redistribute the load task, otherwise, forwarding and distributing the task according to the previous load balance.
The above-described embodiment merely represents one embodiment of the present invention, but is not to be construed as limiting the scope of the present invention. It should be noted that, for a person skilled in the art, several variations and modifications can be made without departing from the inventive concept, which falls within the scope of the present invention.
Claims (10)
1. A payment link automatic switching method comprises the following steps:
s1, a user logs in a platform through a service gateway to prepare for payment and monitor the state of a POS machine, if the state is a starting state, S2 is entered, otherwise, the payment channel service is not started, and the user is prompted to start up;
s2, awakening and starting a payment channel monitoring service, calling an interface and returning an available payment channel;
s3, monitoring the state of the payment channel, scanning the port of the payment channel at regular time, and returning a state code: the payment monitoring service scans the current payment channel interface according to the interval time, returns the state code of each payment channel and puts all the state codes into the payment channel cache;
s4, listing available payment channels and selecting a default payment channel: the system automatically selects a default normal payment channel, if all the payment channels are unavailable, the system directly warns on the interface of the POS machine, and normal payment cannot be carried out currently;
s5, selecting a payment channel to prepare for payment, and carrying out card swiping, two-dimensional code payment and verification password input operations by a user;
s7, scanning a payment channel, and placing available information in a cache;
s8, reading the payment channel from the cache, scanning a payment channel interface by the payment monitoring service according to the interval time, checking whether other available payment channels exist currently or not if the payment channel currently used by the user is abnormal, prompting the user that the payment cannot be currently carried out if the payment channel currently used by the user does not exist, automatically switching to the available payment channel if the payment channel does not exist, acquiring the information selected and input by the user in the context, seamlessly switching to the service of the reselected payment channel, finishing the payment on the new channel by the user, and ensuring that the user does not sense the payment channel;
s9, abnormal code processing and receipt printing: if the Unionpay or the payment mechanism does not return a normal payment success code within the effective time, or an abnormal code is returned, the system scans that the current POS machine has a payment abnormal code or does not return within time, the system informs the user that the current payment is not successful, the Unionpay or the payment mechanism can complete fund correction and refund operation within a proper time limit, and simultaneously changes the current payment running order state into payment failure, if a normal code is returned, the system starts a printing program, completes the receipt printing of the Unionpay or the payment mechanism, and the payment process is ended.
2. The method of claim 1, wherein the automatic switching comprises the following sequential steps:
s1, scanning whether a payment channel in a cache is in a healthy state or not every 2 seconds by a timing thread task;
s2, initializing a Pos machine, requesting to load corresponding parameters, and encrypting part of sensitive information;
s2.1, starting a Pos host program to attach to a Netty user side, starting the service of the server at the same time, and establishing or maintaining the limitation of a connecting channel;
s2.2, monitoring a main thread, monitoring states of increase, decrease, failure, normal and the like of a payment channel;
s3, checking whether the thread of the payment channel is alive or not by monitoring the port of the payment channel;
s3.1, starting connection of a payment channel;
s3.2, starting a port reconnection mechanism in real time for the ports with connection overtime and failure;
s4, judging and checking the state of the payment channel through the survival of the port;
s4.1, putting the payment channel which is checked to be alive or healthy through the port into a cache queue to be checked and enabled;
s5, the front end requests a payment channel to complete the transaction;
s5.1, returning one of the payment channels from the current effective payment channel for current payment;
s6, when the effective payment channel is normally used, the platform sends an in-station message notification;
s7, returning a result of the payment transaction to the platform through the transaction process of the current payment channel;
s7.1, returning the transaction data of the payment channel;
and S8, the platform acquires payment data and a payment state returned by the payment mechanism, and completes the selection of a payment channel and the payment transaction result.
3. The payment link automatic switching method of claim 2, wherein: the data sharing cluster adopts a distributed cache/data synchronization technology Redis, all the payment channels are stored in the Redis, management of multi-node payment channels, effective node loading access and the like are supported through distributed deployment, and the consistency and effectiveness of data between a master node and a slave node are guaranteed through a data synchronization mechanism;
redis is a log-type and Key-Value database related high-performance storage system based on a memory and capable of being persisted, a plurality of languages API are provided, uniform distribution of Redis nodes corresponding to keys is realized by performing consistent hashing on the keys, and all accesses to Redis uniformly distribute requests to all deployed Redis effective nodes through a consistent hashing algorithm;
wherein, the consistent hash (hash) algorithm is as follows: judging which server an object should be cached on, mapping a caching server and the cached object to a hash ring, starting from the position of the cached object, starting from the first server encountered in the clockwise direction, namely the server where the current object is to be cached, and since the cached object and the value of the server after hash are fixed, under the condition that a deployment server is not changed, an object is cached on the fixed server certainly, so that when the object is accessed next time, the same algorithm is used for calculation again, the object can be calculated to be cached on the server, and the object can be directly searched on the corresponding server;
data synchronization is achieved by Redis: the Redis master-slave synchronization mechanism may ensure data synchronization between the master and slave of Redis. The method can be divided into full-range synchronization and partial synchronization according to the number of the synchronization contents, and specifically comprises the following steps:
initializing whole-course synchronization: when the slave is started, sending a SYNC message to a master of the slave, after receiving the message of the slave, the master possibly starts a background process to perform backup, and sending the backup data to the slave after the backup is completed;
data modification synchronization: after the initialization full-range synchronization operation is completed, all subsequent write operations are performed on the master, all read operations are performed on the slave, and the write operation of the user needs to be spread to all the slaves in time so as to keep the synchronization of the data to the maximum extent.
4. The payment link automatic switching method of claim 2, wherein: the POS machine is connected with the server through a load balancer, a Sentinel and a mainstream framework Spring Cloud (Spring service suite) are integrated together in an adapter mode, relevant current limiting and degrading codes of the Sentinel are added to the extension point of the Spring Cloud, and when the load of one or more servers in a cluster is too large or no response is given for a long time, a Sentinel fusing mechanism starts to be started, so that the purposes of protecting high stability and high availability of automatic payment link switching service are achieved;
the Sentinel is a lightweight high-available access flow control component oriented to a distributed service architecture, and mainly takes access flow as an entry point to protect the stability of automatic payment link switching service from multiple dimensions such as access flow control, fusing degradation, system load protection and the like;
the method comprises the following steps that a Sentinel forms a linked list based on a plurality of (7) different service nodes, each service node plays its own role, and after doing internal matters by itself, a request is transmitted to the next service node until the service of a certain service node meets a current-limiting fusing condition, blocking abnormity is thrown out and transmission is stopped, the Sentinel completes calling of an entry method of each service node through a service node chain, each service node performs logic processing of itself according to a created rule, and when a statistical result reaches a set threshold value, a current-limiting and fusing event is triggered; such as throwing an occlusion anomaly;
the functional responsibilities of the 7 nodes are as follows:
the NodeSelectrSlot is responsible for collecting the paths of the resources, storing the calling paths of the resources in a tree structure and used for limiting the flow and degrading according to the calling paths;
the ClusterBuilderSlot is used for storing statistical information of resources and caller information, such as RT (run time), QPS (query per second), thread count, which are used as a basis for multidimensional current limiting and degradation;
the statistcSlot is used for recording and counting RunTime (running time) information at different latitudes;
the FlowSlot is used for carrying out current limiting according to a preset current limiting rule and the statistical state of the front node;
performing black and white list control according to the black and white list;
the DegradeSlot performs fusing degradation according to the statistical information and a preset rule;
the SystemSlot controls the total inlet flow according to the state of the system;
the first 3 nodes are responsible for making statistics, and the last 4 nodes are responsible for specifically controlling whether to block the request or release the request according to the statistical result and the configured rule.
5. The payment link automatic switching method of claim 2, wherein: the monitoring payment channel adopts two modes of Kafka polling and Listene active pushing,
kafka is used for message notification: caching message notification, message state refreshing, message expiration time and the like of whether the payment link port is valid; collecting logs: logs of various services can be collected with Kafka, and are exposed to various consumers for consumption by Kafka in a unified interface service.
Kafka is distributed, partition-supporting and multi-copy (replenica), and can process a large amount of data in real time to meet various demand scenes based on a zookeeper coordinated distributed message system;
the Listener monitors the messages of the kafka by using the @ KafkaListener annotation, then the consumption is carried out in the method, the specific implementation of the kafka is not required to be concerned, and only one topics is required to be added to the configuration value file;
polling is the core of kafka consumer API, requests data from the server by a simple poll, the consumer subscribes to the topic, the poll handles all details including group coordination, partition rebalancing, sending heartbeats and getting data, and the developer only needs to use a set of simple APIs to handle the data returned from the partitions.
6. The payment link automatic switching method of claim 2, wherein: and starting an effective payment channel, establishing a communication relation with the corresponding payment channel through a Socket long link in the initialization process of the effective payment channel, acquiring related parameters of the current equipment, and acquiring related data between the effective payment channel and an interface of a platform server, wherein IO processing is performed through Nio. The Socket long connection and the Nio unimpeded transmission of the Netty ensure the service communication to be free of blocking;
the Netty uses socket long connection to save more tcp establishing/closing operations, reduce waste and save time, and is more suitable for long connection for users frequently requesting resources; there is a problem with clients and servers if they are not shut down for a long time: with more and more users, the resources of the server are consumed;
aiming at the defect of long connection, the method can be solved by establishing a distribution server, and the specific scheme is as follows:
the equipment requests a distribution server, the distribution server returns an effective socket server IP and a port, and then the connection is disconnected;
after the device obtains the IP and the port, the device is connected with a socket server and then carries out protocol communication with the socket server;
if the device does not receive a connection success response, the device tries to connect again, and if the three requests still do not establish the connection successfully, the device needs to request the distribution server and then re-operate the operation;
nio is a non-blocking IO processing mode, and mainly comprises three core parts: channel, Buffer, Selector. Traditional IO operates based on a byte stream and a character stream, while Nio operates based on a Channel and Buffer, with data always being read from the Channel into the Buffer, or written from the Buffer into the Channel. The Selector (select area) is used to listen to events of multiple channels. A single thread may listen to multiple data channels.
7. The payment link automatic switching method of claim 2, wherein: with distributed transaction components: seata and RocktMQ are used for keeping the integrity of the payment transaction loop transaction, and are used for monitoring the port state of the payment channel, completing message notification, state updating, sending and receiving local transaction messages through messages, and realizing transaction control by adopting Seata and RocktMQ for independent data updating among a plurality of services;
seata is a distributed transaction framework capable of processing synchronous transactions, and an application layer realizes automatic compensation based on SQL analysis, so that service intrusiveness is reduced to the maximum extent; a TC (transaction coordinator) in the distributed transaction is independently deployed and is responsible for registering and rolling back the transaction; the write isolation and the read isolation are realized through the global lock;
the RocktMQ is an AMQ message middleware product, is a distributed message middleware of a queue model, processes the processing and message processing of asynchronous distributed transactions, can ensure strict message sequence, provides rich message pull modes, has high-efficiency subscriber horizontal expansion capability, a real-time message subscription mechanism and hundred million-level message accumulation capability; providing a docker mirror image for isolation testing and cloud cluster deployment; the instrument panel with rich functions of configuration, index, monitoring and the like is provided.
8. The payment link automatic switching method of claim 2, wherein: the message notification is automatically pushed through the Netty and the RocketMQ, the Netty and the RocketMQ monitor the port state of the payment channel, the message notification, the state updating, the sending and receiving of the local transaction message are completed through the message, and the service message notification and the consumption service message processing are sent;
netty is an asynchronous event-driven network application framework that supports the rapid development of maintainable high-performance protocol-oriented servers and clients; the Nety encapsulates the API of the Nio, the performance is improved to a certain extent in the following mode, and the concurrency of processing connection is improved through multiplexing; the Netty receiving and sending data adopt direct cache, Socket reading and writing are carried out by using an external direct memory, and secondary copying of a byte buffer area is not needed. The rockmq underlying RPC communication uses a Netty framework.
9. The payment link automatic switching method of claim 2, wherein: the GPE is used for monitoring gateway payment routing, a gateway payment channel, a gateway payment port and interface services of hardware equipment, and the GPE realizes an early warning mechanism and a heartbeat detection mechanism;
GPE is short for Grafana, Prometous and Exporter, Grafana is a visualization tool used after opening the box; prometheus is an open source service monitoring system, collects data from remote machines through the HTTP protocol and stores the data in a local time sequence database; the Exporter is an important component in prometheus monitoring and is responsible for acquiring data indexes and deploying agents at a user side;
the GPE workflow is as follows, an Exporter component is registered in a registration center; the Prometheus pulls a server in the registration center; an Exporter component acquires indexes of server or system software; grafana configures a Prometoxus data source to acquire acquired data thereof and combines a user-defined panel to realize large monitoring screen; grafana realizes monitoring and early warning by setting Alerting.
10. A payment link automatic switching method according to any one of claims 1-9, wherein: the automatic switching of the payment link integrates payment interfaces of multi-party payment channels, a seamless non-delay automatic switching technology is adopted, and the payment link automatic switching technology means that when a user uses a POS machine for payment, a system can automatically select the most appropriate payment channel according to the state of the current payment channel to complete the current payment operation, and is embodied in the comprehensive integration of key technologies of Redis, Kafka, Sentinel, Netty, Seata, RocktMQ and GPE.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010562631.8A CN111754216A (en) | 2020-06-19 | 2020-06-19 | Automatic switching method for payment link |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010562631.8A CN111754216A (en) | 2020-06-19 | 2020-06-19 | Automatic switching method for payment link |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN111754216A true CN111754216A (en) | 2020-10-09 |
Family
ID=72676333
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202010562631.8A Pending CN111754216A (en) | 2020-06-19 | 2020-06-19 | Automatic switching method for payment link |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN111754216A (en) |
Cited By (9)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN112288423A (en) * | 2020-10-30 | 2021-01-29 | 广州市汇聚支付电子科技有限公司 | Aggregation payment method and system of distributed framework |
| CN112506678A (en) * | 2020-12-08 | 2021-03-16 | 平安国际智慧城市科技股份有限公司 | RPC remote calling method, system and storage medium based on authentication and authorization |
| CN113468163A (en) * | 2021-09-01 | 2021-10-01 | 南京烽火星空通信发展有限公司 | Multisource heterogeneous public security big data intelligent docking engine system |
| CN113570366A (en) * | 2021-07-20 | 2021-10-29 | 国网河南省电力公司经济技术研究院 | Multi-party payment data transmission method and electricity selling method |
| CN115170131A (en) * | 2022-09-06 | 2022-10-11 | 云账户技术(天津)有限公司 | Payment method and device based on fuse, storage medium and terminal equipment |
| CN115801642A (en) * | 2023-02-13 | 2023-03-14 | 深圳市泛联信息科技有限公司 | RDMA communication management module, method, device and medium based on state control |
| CN115865791A (en) * | 2023-03-02 | 2023-03-28 | 北京天弛网络有限公司 | Method, system, medium, and electronic device for path switching of backbone network failure |
| CN116739571A (en) * | 2023-08-07 | 2023-09-12 | 深圳前海移联科技有限公司 | Intelligent route regulation and control method, system, computer equipment and storage medium |
| CN117519993A (en) * | 2024-01-05 | 2024-02-06 | 深圳桑达银络科技有限公司 | Efficient big data processing system and method based on distributed computing |
-
2020
- 2020-06-19 CN CN202010562631.8A patent/CN111754216A/en active Pending
Cited By (11)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN112288423A (en) * | 2020-10-30 | 2021-01-29 | 广州市汇聚支付电子科技有限公司 | Aggregation payment method and system of distributed framework |
| CN112506678A (en) * | 2020-12-08 | 2021-03-16 | 平安国际智慧城市科技股份有限公司 | RPC remote calling method, system and storage medium based on authentication and authorization |
| CN113570366A (en) * | 2021-07-20 | 2021-10-29 | 国网河南省电力公司经济技术研究院 | Multi-party payment data transmission method and electricity selling method |
| CN113468163A (en) * | 2021-09-01 | 2021-10-01 | 南京烽火星空通信发展有限公司 | Multisource heterogeneous public security big data intelligent docking engine system |
| CN113468163B (en) * | 2021-09-01 | 2021-12-21 | 南京烽火星空通信发展有限公司 | Multisource heterogeneous public security big data intelligent docking engine system |
| CN115170131A (en) * | 2022-09-06 | 2022-10-11 | 云账户技术(天津)有限公司 | Payment method and device based on fuse, storage medium and terminal equipment |
| CN115801642A (en) * | 2023-02-13 | 2023-03-14 | 深圳市泛联信息科技有限公司 | RDMA communication management module, method, device and medium based on state control |
| CN115865791A (en) * | 2023-03-02 | 2023-03-28 | 北京天弛网络有限公司 | Method, system, medium, and electronic device for path switching of backbone network failure |
| CN116739571A (en) * | 2023-08-07 | 2023-09-12 | 深圳前海移联科技有限公司 | Intelligent route regulation and control method, system, computer equipment and storage medium |
| CN117519993A (en) * | 2024-01-05 | 2024-02-06 | 深圳桑达银络科技有限公司 | Efficient big data processing system and method based on distributed computing |
| CN117519993B (en) * | 2024-01-05 | 2024-04-05 | 深圳桑达银络科技有限公司 | Efficient big data processing system and method based on distributed computing |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN111754216A (en) | Automatic switching method for payment link | |
| CN111787073B (en) | Current limiting fusing platform for unified service and method thereof | |
| CN111865920B (en) | Gateway authentication and identity authentication platform and method thereof | |
| Stathakopoulou et al. | Mir-bft: High-throughput bft for blockchains | |
| CN111461723B (en) | Data processing system, method and device based on block chain | |
| CN105247529B (en) | The synchronous voucher hash between directory service | |
| CN103209223B (en) | distributed application session information sharing method, system and application server | |
| US20210256016A1 (en) | Blockchain system and method | |
| Barger et al. | A byzantine fault-tolerant consensus library for hyperledger fabric | |
| US11444783B2 (en) | Methods and apparatuses for processing transactions based on blockchain integrated station | |
| US11082207B2 (en) | Blockchain platform as a service (BPaaS) | |
| CN111752795A (en) | Full-process monitoring alarm platform and method thereof | |
| US11689616B2 (en) | Optimization of delivery of blocks | |
| CN104011701A (en) | Content delivery network | |
| CN113259456B (en) | Cross-chain interaction method and device | |
| WO2020061597A2 (en) | BLOCKCHAIN PLATFORM AS A SERVICE (BPaaS) | |
| CN113098982B (en) | Block chain message transmission method and device | |
| CN108270739A (en) | A kind of method and device of managing encrypted information | |
| CN114401098A (en) | Application system and method for quickly constructing microservice | |
| CN110213338A (en) | A kind of clustering acceleration calculating method and system based on cryptographic calculation | |
| CN111698126B (en) | Information monitoring method, system and computer readable storage medium | |
| Huang et al. | Blockchain based log system | |
| CN108765230A (en) | A kind of resident's household register approaches to IM and server | |
| CN112699136B (en) | Cross-link certificate storage method and related device | |
| CN113259454B (en) | Cross-chain interaction 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 |
Effective date of registration: 20220512 Address after: 251500 No. 3, Xiguan Street, Deping Town, Linyi County, De Zhou City, Shandong Province Applicant after: Pang Maolin Address before: 100000 room 501-2010, Development Zone office building, No. 8, Xingsheng South Road, economic development zone, Miyun District, Beijing (centralized office area of Economic Development Zone) Applicant before: Duojia network technology (Beijing) Co.,Ltd. |
|
| TA01 | Transfer of patent application right |