CN104486401A - Partitioned data control method and system - Google Patents
Partitioned data control method and system Download PDFInfo
- Publication number
- CN104486401A CN104486401A CN201410765150.1A CN201410765150A CN104486401A CN 104486401 A CN104486401 A CN 104486401A CN 201410765150 A CN201410765150 A CN 201410765150A CN 104486401 A CN104486401 A CN 104486401A
- Authority
- CN
- China
- Prior art keywords
- processing node
- node group
- group
- service request
- service
- 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
Abstract
The invention provides a partitioned data control method and a partitioned data control system. The partitioned data control method comprises the following steps: receiving a service request, wherein the service request comprises a service type tag of the service to be processed; confirming a processing node corresponding to the service type tag; transferring the service request to the processing node, thereby processing the service request at the processing node. By the adoption of the technical scheme provided by the invention, the processing efficiency of the system is improved, and the possibility that conflict is made in data operation of the system is reduced.
Description
Technical field
The present invention relates to computer data control field, particularly relate to a kind of data partition control method and system.
Background technology
Chinese Railway passenger ticket is sold and the development of reservation system along with Internet technology, and ticketing channel develops into present window by originally single window channel, orders tickets by telephone, the Internet, mobile phone, automatic machine and the ticketing simultaneously by all kinds of means such as ticket taking machine automatically.Within 2012, the Internet ticket sale system 12306 is reached the standard grade, and this system adopts centralized architecture, all ticketings, gets tickets, changes the business operations such as label, returned ticket, inquiry, is applicable to registered user and lacks the not high working condition of traffic carrying capacity.
But, when this system, to be in registered user many, during the huge working condition of traffic carrying capacity, because the centralized architecture disposal ability of system is limited, the burden of system is very large, causes the treatment effeciency of system lower, and, its multi-service state can cause system business conflict, thus the normal operation of influential system.
Summary of the invention
The invention provides a kind of data partition control method and system, low in order to solve existing the Internet ticket sale system treatment effeciency, and the problem easily causing system business to conflict when it is in multi-service state.
First aspect present invention provides a kind of data partition control method, and the method comprises:
Receive service request, described service request comprises the type of service mark of pending business;
Determine to identify corresponding processing node with described type of service;
Described service request is forwarded to described processing node, to make described processing node, described service request is processed.
Second aspect present invention provides a kind of data partition control system, and this system comprises:
Management node and at least one processing node;
Described management node comprises:
Receiver module, for receiving service request, described service request comprises the type of service mark of pending business;
Determination module, identifies corresponding processing node for determining with described type of service;
Sending module, for being forwarded to described processing node by described service request;
Described processing node, for processing described service request.
Data partition provided by the invention control method and system, identified by the type of service according to different business request, determine the processing node processing described service request; Described service request is forwarded to described processing node, to make described processing node, described service request is processed.Improve the efficiency of system data process, reduce system data and operate the possibility clashed.
Accompanying drawing explanation
The schematic flow sheet of the data partition control method that Fig. 1 provides for the embodiment of the present invention one;
The schematic flow sheet of the data partition control method that Fig. 2 provides for the embodiment of the present invention two;
The structural representation of the data partition control system that Fig. 3 provides for the embodiment of the present invention three;
The structural representation of the data partition control system that Fig. 4 provides for the embodiment of the present invention four.
Embodiment
For making the object of the embodiment of the present invention, technical scheme and advantage clearly, below in conjunction with the accompanying drawing in the embodiment of the present invention, technical scheme in the embodiment of the present invention is clearly and completely described, obviously, described embodiment is the present invention's part embodiment, instead of whole embodiments.Based on the embodiment in the present invention, those of ordinary skill in the art, not making the every other embodiment obtained under creative work prerequisite, belong to the scope of protection of the invention.
The schematic flow sheet of the data partition control method that Fig. 1 provides for the embodiment of the present invention one, the described data partition control method that the present embodiment provides can be performed by a management node, and this management node is for being arranged in the control system of data partition.As shown in Figure 1, the data partition control method that the present embodiment provides, specifically comprises the steps:
Step 101, reception service request, described service request comprises the type of service mark of pending business;
Step 102, determine to identify corresponding processing node with described type of service;
Step 103, described service request is forwarded to described processing node, to make described processing node, described service request is processed.
Concrete, described management node receives the service request that user sends, described service request comprises the type of service mark of business, according to the type of service mark comprised in service request, determine to identify corresponding processing node with described type of service, and described service request is forwarded to described processing node, described processing node processes according to described service request.Wherein, described type of service can comprise: ticketing, get tickets, change label, returned ticket, Transaction Inquiries etc., and to identify corresponding processing node can be one with same type of service also can be multiple.Described service request mark can be those skilled in the art, as required or preference sets itself, as long as reach the type distinguishing different business request.
What deserves to be explained is, one-to-one relationship can be had with processing node for type of service mark, also the corresponding relation of one-to-many can be had, namely some processing nodes can be set and be specifically designed to the service request processing a certain type of service, multiple processing node also can be set to process the service request of a certain type of service.When the latter and multiple processing node process the service request of a certain type of service, management node, when receiving the service request comprising this type of service mark, can such as be determined to have according to the loading condition of each processing node in multiple processing nodes of correspondence and which processing node to process this service request by.
For example, if certain moment management node have received service request and service request of getting tickets that type of service is ticketing simultaneously, management node is according to ticketing type of service and type of service of getting tickets, determine respectively processing one or more processing node of ticketing business and the one or more processing nodes for the treatment of the business of getting tickets, and then from one or more processing nodes of the process ticketing business determined, determine processing the processing node of this ticketing business, from the process determined get tickets business one or more processing nodes determine processing the processing node of the business of getting tickets, then ticketing and the service request of getting tickets are forwarded to corresponding processing node respectively, alignment processing node processes ticketing business or the business of getting tickets.
The data partition control method that the present embodiment provides, is identified by the type of service according to different business request, determines the processing node processing described service request; Described service request is forwarded to described processing node, to make described processing node, described service request is processed.By business being carried out the division of type, thus at least one processing node corresponding to often kind of type of service is set, make when receiving the service request of different service types, the process of service request can be carried out in a distributed manner, improve the efficiency of system data process, reduce system data and operate the possibility clashed.
Further, the schematic flow sheet of the data partition control method that Fig. 2 provides for the embodiment of the present invention two, as shown in Figure 2, on basis embodiment illustrated in fig. 1, described step 102 is comprised and being realized by following steps:
Step S1, determine to identify corresponding processing node group with described type of service.
Concrete, all processing nodes can be divided into three node groups, the first processing node group is for the treatment of ticketing business; Second processing node group is for the treatment of label of getting tickets, change, returned ticket business; Described 3rd processing node group is for the treatment of inquiry transaction business.When receiving the service request of user, according to the type of service mark comprised in service request, determine described service request which node group corresponding.But above-mentioned processing node group is not limited only to the corresponding service that can only process corresponding node group.The division of above node group is only exemplary illustration, and not being limited with the example described in the present embodiment divides processing node grouping.
Step S1 is by dividing into groups processing node according to type of service, thus, different service request is according to the difference of the type of service corresponding to it, transfer to corresponding processing node group to process, avoid in prior art, system only has a processing node, all business are all processed by a processing node, cause system treatment effeciency low, easily produce the problem of multi-service conflict, substantially increase the treatment effeciency of system.
Step S2, according to preset strategy, from described processing node group, determine described processing node, described processing node group comprises processing node described at least one.
Concrete, can by adopting following preset strategy, to determine by which processing node to process this service request from the processing node group corresponding to identifying with the type of service that comprises service request:
Method one, employing polling method determine described processing node from described processing node group.Concrete, the service request received each time is distributed in turn the processing node in described alignment processing node group.Such as, if current service request type is ticketing, adopt polling method, given by current ticketing request dispatching the first processing node group i-th processing node, so next ticketing request will distribute to the i-th+1 processing node of the first processing node group.
Method two, default poll weighted value according to each described processing node, determine described processing node.Concrete, according to the difference of each processing node disposal ability in described processing node group, distribute different weights in advance each processing node, the service request of corresponding weight value number can be accepted.Such as, the weights that the weights that the weights of node A1 are designed to 2, A2 are designed to 3, A3 are 5, then processing node A1, A2, A3, the service request of corresponding requests type of 20%, 30%, 50% will be accepted respectively.
Method three, determine that the processing node that in described processing node group, load is the lightest is described processing node.Concrete, determine loading condition according to server CPU model, CPU quantity, memory size and current linking number etc., described service request is forwarded to the processing node that in alignment processing node group, load is the lightest and processes.
Method four, determine that the response time of network detection request in described processing node group the shortest processing node is described processing node.Concrete, because certain moment processing node reflects the service conditions of this moment processing node for response time of request, response time is shorter, then illustrate that the disposal ability in this moment of processing node is stronger, therefore, by sending probe requests thereby to each processing node in the processing node group of correspondence, then according to the fastest response time of each processing node, described service request can be forwarded to response time the fastest processing node.
Said method, can apply separately, also can several method connected applications.
According to said method, described management node according to described service request, by said method, can adopt optimum preset strategy, while realizing each processing node load balancing, is conducive to the treatment effeciency of raising business.
Step S3, detect the operating state of described processing node, determine whether described operating state indicates described handle node failures.If described operating state indicates described processing node normally, perform step S4, if described operating state indicates described handle node failures, then perform step S5.
Step S4, by described processing node, described service request to be processed.
Step S5, determine belonging to described processing node described processing node group in other whole processing nodes whether all fault; If not, then perform step S51, if so, then perform step S52.
Step S51, return step S2, according to described preset strategy, from described processing node group, redefine another processing node, and described service request is forwarded to another processing node described and processes.
Step S52, the processing node in the backup node group corresponding with described processing node group is sent to process described service request.In the present embodiment, arrange the backup node group of the second processing node group as the first processing node group, the 3rd processing node group is as the backup node group of the second processing node group.Such as, described service request is ticketing request, if all processing nodes in described first processing node group all break down, then processed by the processing node in the second processing node group described in the processing node group for subsequent use of described first processing node group, determine the method for described processing node, identical with the method for preset strategy in step S2, here repeat no more.
According to detection and the system of selection of above-mentioned processing node, described system by the testing result to described processing node, further can be determined the processing node of described service request, thus improves reliability and the redundancy ability of system.
The structural representation of the data partition control system that Fig. 3 provides for the embodiment of the present invention three, as shown in Figure 3, the data partition control system that the present embodiment provides comprises:
Management node 1 and at least one processing node 2; Described management node 1 comprises:
Receiver module 11, for receiving service request, described service request comprises the type of service mark of pending business;
Determination module 12, identifies corresponding processing node for determining with described type of service;
Sending module 13, for being forwarded to described processing node by described service request;
Described processing node 2, for processing described service request.
The described control system that the present embodiment provides may be used for performing the technical scheme of embodiment of the method as shown in Figure 1, and it realizes principle and technique effect is similar, repeats no more herein.
The structural representation of the data partition control system that Fig. 4 provides for the embodiment of the present invention four, as shown in Figure 4, on basis embodiment illustrated in fig. 3, described determination module 12, also identifies corresponding processing node group for determining with described type of service;
Described determination module 12, also for according to preset strategy, from described processing node group, determine described processing node 2, described processing node group comprises processing node 2 described at least one.
Particularly, described determination module 12 specifically for:
Polling method is adopted to determine described processing node from described processing node group; Or,
According to the default poll weighted value of each described processing node, determine described processing node; Or,
Determine that the processing node that in described processing node group, load is the lightest is described processing node; Or,
Determine that the response time of network detection request in described processing node group the shortest processing node is described processing node.
Further, described system also comprises:
Detection module 14, for detecting the operating state of described processing node, determines whether described operating state indicates described processing node 2 fault;
Described determination module 12, if also indicate described processing node 2 fault for described operating state, then according to described preset strategy, redefines another processing node from described processing node group;
Described sending module 13, also processes for described service request being forwarded to another processing node described.
Further, whether all described determination module 12, if also indicate described processing node 2 fault for described operating state, then determine other the whole processing nodes fault in the described processing node group belonging to described processing node 2;
Described sending module 13, if also for other whole processing nodes described all faults, then sends to the processing node in the backup node group corresponding with described processing node group to process by described service request.
The described control system that the present embodiment provides may be used for performing the technical scheme of embodiment of the method as shown in Figure 2, and it realizes principle and technique effect is similar, repeats no more herein.
One of ordinary skill in the art will appreciate that: all or part of step realizing above-mentioned each embodiment of the method can have been come by the hardware that program command is relevant.Aforesaid program can be stored in a computer read/write memory medium.This program, when performing, performs the step comprising above-mentioned each embodiment of the method; And aforesaid storage medium comprises: ROM, RAM, magnetic disc or CD etc. various can be program code stored medium.
Last it is noted that above each embodiment is only in order to illustrate technical scheme of the present invention, be not intended to limit; Although with reference to foregoing embodiments to invention has been detailed description, those of ordinary skill in the art is to be understood that: it still can be modified to the technical scheme described in foregoing embodiments, or carries out equivalent replacement to wherein some or all of technical characteristic; And these amendments or replacement, do not make the essence of appropriate technical solution depart from the scope of various embodiments of the present invention technical scheme.
Claims (12)
1. a data partition control method, is characterized in that, comprising:
Receive service request, described service request comprises the type of service mark of pending business;
Determine to identify corresponding processing node with described type of service;
Described service request is forwarded to described processing node, to make described processing node, described service request is processed.
2. method according to claim 1, is characterized in that, describedly determines to identify corresponding processing node with described type of service, comprising:
Determine to identify corresponding processing node group with described type of service;
According to preset strategy, from described processing node group, determine described processing node, described processing node group comprises processing node described at least one.
3. method according to claim 2, is characterized in that, described according to preset strategy, determines described processing node, comprising from described processing node group:
Polling method is adopted to determine described processing node from described processing node group; Or,
According to the default poll weighted value of each described processing node, determine described processing node; Or,
Determine that the processing node that in described processing node group, load is the lightest is described processing node; Or,
Determine that the response time of network detection request in described processing node group the shortest processing node is described processing node.
4. according to the method in claim 2 or 3, it is characterized in that, described processing node group comprises:
First processing node group, the second processing node group and the 3rd processing node group;
Described second processing node group is the backup node group of the first processing node group, and the 3rd processing node group is the backup node group of the second processing node group;
Described first processing node group is for the treatment of ticketing business; Described second processing node group is for the treatment of label of getting tickets, change, returned ticket business; Described 3rd processing node group is for the treatment of inquiry transaction business.
5. method according to claim 4, is characterized in that, described according to preset strategy, after determining described processing node, also comprises from described processing node group:
Detect the operating state of described processing node, determine whether described operating state indicates described handle node failures;
If described operating state indicates described handle node failures, then according to described preset strategy, from described processing node group, redefine another processing node;
Described service request is forwarded to another processing node described to process.
6. method according to claim 5, is characterized in that, described method also comprises:
If described operating state indicates described handle node failures, then determine other the whole processing nodes whether all fault in the described processing node group belonging to described processing node;
If other whole processing nodes described all faults, then the processing node in the backup node group corresponding with described processing node group described service request is sent to process.
7. a data partition control system, is characterized in that, comprising:
Management node and at least one processing node;
Described management node comprises:
Receiver module, for receiving service request, described service request comprises the type of service mark of pending business;
Determination module, identifies corresponding processing node for determining with described type of service;
Sending module, for being forwarded to described processing node by described service request;
Described processing node, for processing described service request.
8. system according to claim 7, is characterized in that:
Described determination module, also identifies corresponding processing node group for determining with described type of service;
Described determination module, also for according to preset strategy, from described processing node group, determine described processing node, described processing node group comprises processing node described at least one.
9. system according to claim 8, is characterized in that, described determination module specifically for:
Polling method is adopted to determine described processing node from described processing node group; Or,
According to the default poll weighted value of each described processing node, determine described processing node; Or,
Determine that the processing node that in described processing node group, load is the lightest is described processing node; Or,
Determine that the response time of network detection request in described processing node group the shortest processing node is described processing node.
10. system according to claim 8 or claim 9, it is characterized in that, described processing node group comprises:
First processing node group, the second processing node group and the 3rd processing node group;
Described second processing node group is the backup node group of the first processing node group, and the 3rd processing node group is the backup node group of the second processing node group;
Described first processing node group is for the treatment of ticketing business; Described second processing node group is for the treatment of label of getting tickets, change, returned ticket business; Described 3rd processing node group is for the treatment of inquiry transaction business.
11. systems according to claim 10, is characterized in that, described system also comprises:
Detection module, for detecting the operating state of described processing node, determines whether described operating state indicates described handle node failures;
Described determination module, if also indicate described handle node failures for described operating state, then according to described preset strategy, redefines another processing node from described processing node group;
Described sending module, also processes for described service request being forwarded to another processing node described.
12. systems according to claim 11, is characterized in that:
Whether all described determination module, if also indicate described handle node failures for described operating state, then determine other the whole processing nodes fault in the described processing node group belonging to described processing node;
Described sending module, if also for other whole processing nodes described all faults, then sends to the processing node in the backup node group corresponding with described processing node group to process by described service request.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201410765150.1A CN104486401A (en) | 2014-12-11 | 2014-12-11 | Partitioned data control method and system |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201410765150.1A CN104486401A (en) | 2014-12-11 | 2014-12-11 | Partitioned data control method and system |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN104486401A true CN104486401A (en) | 2015-04-01 |
Family
ID=52760905
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201410765150.1A Pending CN104486401A (en) | 2014-12-11 | 2014-12-11 | Partitioned data control method and system |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN104486401A (en) |
Cited By (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN108156236A (en) * | 2017-12-22 | 2018-06-12 | 平安养老保险股份有限公司 | Service request processing method, device, computer equipment and storage medium |
| CN111240831A (en) * | 2019-12-31 | 2020-06-05 | 陕西医链区块链集团有限公司 | Method and device for parallel execution of transactions in block chain, electronic equipment and storage medium |
| CN113093958A (en) * | 2021-04-06 | 2021-07-09 | 中国工商银行股份有限公司 | Data processing method and device and server |
| CN113986493A (en) * | 2021-10-26 | 2022-01-28 | 阿波罗智能技术(北京)有限公司 | Service use request processing method, related device and computer program product |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1805379A (en) * | 2006-01-05 | 2006-07-19 | 西安交通大学 | Method of constructing cluster management and monitoring system in resilient system architecture |
| CN1836212A (en) * | 2003-08-14 | 2006-09-20 | 甲骨文国际公司 | Automatic and dynamic provisioning of databases |
| CN102148850A (en) * | 2010-08-09 | 2011-08-10 | 华为软件技术有限公司 | Cluster system and service processing method thereof |
| CN102158546A (en) * | 2011-02-28 | 2011-08-17 | 中国科学院计算技术研究所 | Cluster file system and file service method thereof |
| CN102571947A (en) * | 2011-12-29 | 2012-07-11 | 奇智软件（北京）有限公司 | Processing method proxy method, device and system |
-
2014
- 2014-12-11 CN CN201410765150.1A patent/CN104486401A/en active Pending
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1836212A (en) * | 2003-08-14 | 2006-09-20 | 甲骨文国际公司 | Automatic and dynamic provisioning of databases |
| CN1805379A (en) * | 2006-01-05 | 2006-07-19 | 西安交通大学 | Method of constructing cluster management and monitoring system in resilient system architecture |
| CN102148850A (en) * | 2010-08-09 | 2011-08-10 | 华为软件技术有限公司 | Cluster system and service processing method thereof |
| CN102158546A (en) * | 2011-02-28 | 2011-08-17 | 中国科学院计算技术研究所 | Cluster file system and file service method thereof |
| CN102571947A (en) * | 2011-12-29 | 2012-07-11 | 奇智软件（北京）有限公司 | Processing method proxy method, device and system |
Cited By (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN108156236A (en) * | 2017-12-22 | 2018-06-12 | 平安养老保险股份有限公司 | Service request processing method, device, computer equipment and storage medium |
| CN108156236B (en) * | 2017-12-22 | 2021-05-25 | 平安养老保险股份有限公司 | Service request processing method and device, computer equipment and storage medium |
| CN111240831A (en) * | 2019-12-31 | 2020-06-05 | 陕西医链区块链集团有限公司 | Method and device for parallel execution of transactions in block chain, electronic equipment and storage medium |
| CN113093958A (en) * | 2021-04-06 | 2021-07-09 | 中国工商银行股份有限公司 | Data processing method and device and server |
| CN113986493A (en) * | 2021-10-26 | 2022-01-28 | 阿波罗智能技术(北京)有限公司 | Service use request processing method, related device and computer program product |
| CN113986493B (en) * | 2021-10-26 | 2023-11-14 | 阿波罗智能技术(北京)有限公司 | Service use request processing method, related device and computer program product |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US20190042659A1 (en) | Data writing and reading and apparatus and cloud storage system | |
| CN103036979B (en) | Server loading balancing method and loading balancer | |
| CN102932413B (en) | A kind of computational resource allocation method, cloud management platform node and computational resource cluster | |
| CN108023967B (en) | Data balancing method and device and management equipment in distributed storage system | |
| US20140047444A1 (en) | Virtual machine managing apparatus, virtual machine managing method, and program thereof | |
| CN104486401A (en) | Partitioned data control method and system | |
| CN101384985A (en) | Sas zone group permission table version identifiers | |
| CN110311831A (en) | System resource monitoring method and relevant device based on container cloud | |
| CN105786405A (en) | Online upgrading method, device and system | |
| CN105808407A (en) | Equipment management method, equipment and equipment management controller | |
| CN105119793A (en) | Identifier distribution method of sensor network CAN bus frame format | |
| CN108683528B (en) | Data transmission method, central server, server and data transmission system | |
| CN103559124A (en) | Fast fault detection method and device | |
| CN103870362A (en) | Data recovery method, data recovery device and backup system | |
| CN104063355A (en) | Method for configuring server cluster and central configuration server | |
| CN107566466A (en) | Load-balancing method and device | |
| CN107168777A (en) | The dispatching method and device of resource in distributed system | |
| CN102801575B (en) | Loopback detecting method and device | |
| CN103455363A (en) | Command processing method, device and physical host of virtual machine | |
| CN103778120A (en) | Global file identification generation method, generation device and corresponding distributed file system | |
| CN102546652B (en) | System and method for server load balancing | |
| CN107483310B (en) | Method and system for networking between terminal and forwarding node | |
| CN103973759A (en) | Load adjusting method and load adjusting device | |
| CN106571935B (en) | Resource scheduling method and equipment | |
| US11309974B2 (en) | Quantum channel routing utilizing a quantum channel measurement service |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| ASS | Succession or assignment of patent right |
Owner name: CHINA RAILWAY TRIP SCIENCE AND TECHNOLOGY CO., LTD Effective date: 20150908 Owner name: CHINA RAILWAY CORPORATION Free format text: FORMER OWNER: CHINA RAILWAY TRIP SCIENCE AND TECHNOLOGY CO., LTD. Effective date: 20150908 |
|
| C41 | Transfer of patent application or patent right or utility model | ||
| TA01 | Transfer of patent application right |
Effective date of registration: 20150908 Address after: 100844 Fuxing Road, Beijing, Haidian District, No. 10 Applicant after: CHINA RAILWAY CORPORATION Applicant after: CHINA RAILWAY TRIP SCIENCE AND TECHNOLOGY CO., LTD. Address before: 100081 Beijing city Haidian District a two or three storey building of Daliushu Road No. 2 Applicant before: CHINA RAILWAY TRIP SCIENCE AND TECHNOLOGY CO., LTD. |
|
| WD01 | Invention patent application deemed withdrawn after publication |
Application publication date: 20150401 |
|
| WD01 | Invention patent application deemed withdrawn after publication |