CN108111628B - Dynamic capacity-expansion storage method and system - Google Patents
Dynamic capacity-expansion storage method and system Download PDFInfo
- Publication number
- CN108111628B CN108111628B CN201810049360.9A CN201810049360A CN108111628B CN 108111628 B CN108111628 B CN 108111628B CN 201810049360 A CN201810049360 A CN 201810049360A CN 108111628 B CN108111628 B CN 108111628B
- Authority
- CN
- China
- Prior art keywords
- storage
- server
- registration
- capacity
- uid
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L67/00—Network arrangements or protocols for supporting network services or applications
- H04L67/50—Network services
- H04L67/56—Provisioning of proxy services
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F3/00—Input arrangements for transferring data to be processed into a form capable of being handled by the computer; Output arrangements for transferring data from processing unit to output unit, e.g. interface arrangements
- G06F3/06—Digital input from, or digital output to, record carriers, e.g. RAID, emulated record carriers or networked record carriers
- G06F3/0601—Interfaces specially adapted for storage systems
- G06F3/0668—Interfaces specially adapted for storage systems adopting a particular infrastructure
- G06F3/067—Distributed or networked storage systems, e.g. storage area networks [SAN], network attached storage [NAS]
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L67/00—Network arrangements or protocols for supporting network services or applications
- H04L67/01—Protocols
- H04L67/10—Protocols in which an application is distributed across nodes in the network
- H04L67/1001—Protocols in which an application is distributed across nodes in the network for accessing one among a plurality of replicated servers
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L67/00—Network arrangements or protocols for supporting network services or applications
- H04L67/01—Protocols
- H04L67/10—Protocols in which an application is distributed across nodes in the network
- H04L67/1097—Protocols in which an application is distributed across nodes in the network for distributed storage of data in networks, e.g. transport arrangements for network file system [NFS], storage area networks [SAN] or network attached storage [NAS]
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L67/00—Network arrangements or protocols for supporting network services or applications
- H04L67/50—Network services
- H04L67/56—Provisioning of proxy services
- H04L67/568—Storing data temporarily at an intermediate stage, e.g. caching
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Theoretical Computer Science (AREA)
- Human Computer Interaction (AREA)
- Physics & Mathematics (AREA)
- General Engineering & Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
Abstract
The invention belongs to the technical field of data storage, and particularly relates to a dynamic capacity expansion storage method and a dynamic capacity expansion storage system, which comprise the following steps: the method comprises the steps that a registration server receives a registration request sent by a user side, distributes a registration UID for the registration request, and sends the registration request and the registration UID to a storage proxy server through a load balancing server; the storage proxy server sends the registration request and the registration UID to a database server for storage through a storage route, and reports the registration UID to a storage management center; and the storage management center calculates the residual storage capacity of the database after receiving the registered UID, applies for a storage node to the operation and maintenance end to enlarge the capacity of the database server when the residual storage capacity is smaller than the threshold capacity, and adds the applied storage node to a storage route. The invention can dynamically expand the storage capacity, not only meets the increasing user data storage requirement, but also saves the labor cost, avoids the error of manual expansion and ensures that the storage is more efficient.
Description
Technical Field
The invention belongs to the technical field of data storage, and particularly relates to a dynamic capacity expansion storage method and system.
Background
With the development of the internet, the internet has entered into the aspects of people's lives, various apps applied to lives appear in succession, registered user data is increasingly expanded, the newly added registration amount per day can reach tens of millions, and therefore the storage requirement on the data is higher originally.
In the traditional storage scheme, the storage service is difficult to expand, sufficient storage needs to be provided very early, capacity expansion is carried out at one time, and follow-up change is avoided as much as possible. The capacity expansion is generally performed through manual operation, and excessive manual intervention not only increases the labor cost, but also inevitably causes some problems due to human factors. For these problems, it takes a long time to locate the troubleshooting on a light basis, and data loss may result on a heavy basis.
Disclosure of Invention
Compared with the traditional storage scheme, the dynamic capacity expansion storage method and system provided by the invention can dynamically expand the storage capacity, not only meet the increasing user data storage requirements, but also save the labor cost, avoid the fault of manual capacity expansion and enable the storage to be more efficient.
In a first aspect, the present invention provides a dynamic capacity expansion storage method, including the following steps:
the method comprises the steps that a registration server receives a registration request sent by a user side, distributes a registration UID for the registration request, and sends the registration request and the registration UID to a storage proxy server through a load balancing server;
the storage proxy server sends the registration request and the registration UID to a database server for storage through a storage route, and reports the registration UID to a storage management center;
and the storage management center calculates the residual storage capacity of the database after receiving the registered UID, applies for a storage node to the operation and maintenance end to enlarge the capacity of the database server when the residual storage capacity is smaller than the threshold capacity, and adds the applied storage node to a storage route.
Preferably, the registration server receives a registration request sent by the user side, and sends the registration request to the storage proxy server through the load balancing server, specifically:
the registration server receives a registration request sent by a user side, sends the registration request to the cache server, and receives a new user judgment result fed back by the cache server;
and after determining that the new user is the registration server according to the judgment result of the new user, the registration server sends the registration request to the storage proxy server through the load balancing server.
Preferably, the storage management center calculates the remaining storage capacity and the threshold capacity of the database after receiving the registered UID, applies for a storage node to the operation and maintenance end to expand the capacity of the database server and add the applied storage node to the storage route when the remaining storage capacity is smaller than the threshold capacity, specifically:
after receiving the registered UID, the storage management center calculates the occupied storage capacity of the database server;
the storage management center subtracts the occupied storage capacity according to the total storage capacity of the database server to obtain the residual storage capacity;
the storage management center judges whether the residual storage capacity is smaller than the threshold capacity, if so, the storage management center sends a storage node application to the operation and maintenance end and receives storage node distribution information fed back by the operation and maintenance end;
the storage management center performs base table initialization operation on the newly distributed data equipment according to the storage node distribution information, and adds the initialized base table information as a storage node to a storage route;
and the storage management center obtains the newly added storage capacity according to the storage node distribution information and updates the total storage capacity according to the newly added storage capacity.
In a second aspect, the present invention provides a dynamic capacity-expansion storage system, which is suitable for the dynamic storage method in the first aspect, and includes a registration server, a load balancing server, a storage proxy server, a storage router, a database server, and a storage management center;
the system comprises a registration server, a storage proxy server and a load balancing server, wherein the registration server is used for receiving a registration request sent by a user side, distributing a registration UID for the registration request, and sending the registration request and the registration UID to the storage proxy server through the load balancing server;
the storage proxy server is used for sending the registration request and the registration UID to the database server for storage through the storage route and reporting the registration UID to the storage management center;
and the storage management center is used for calculating the residual storage capacity of the database after receiving the registered UID, applying for a storage node from the operation and maintenance end to enlarge the capacity of the database server when the residual storage capacity is smaller than the threshold capacity, and adding the applied storage node to a storage route.
Preferably, the registration server is specifically configured to:
receiving a registration request sent by a user side, sending the registration request to a cache server, and receiving a new user judgment result fed back by the cache server;
distributing a registration UID for the registration request after determining that the new user is the new user according to the judgment result of the new user;
the registration request and the registration UID are sent to the storage proxy server by the load balancing server.
Preferably, the storage management center is specifically configured to:
after receiving the registered UID, calculating the occupied storage capacity of the database server;
subtracting the occupied storage capacity according to the total storage capacity of the database server to obtain the residual storage capacity;
judging whether the residual storage capacity is smaller than the threshold capacity, if so, sending a storage node application to an operation and maintenance end, and receiving storage node distribution information fed back by the operation and maintenance end;
according to the storage node distribution information, performing base table initialization operation on newly distributed data equipment, and adding initialized base table information serving as a storage node to a storage route;
and obtaining the newly added storage capacity according to the storage node distribution information, and updating the total storage capacity according to the newly added storage capacity.
The invention has the beneficial effects that: compared with the traditional storage scheme, the storage capacity can be dynamically expanded, the increasing user data storage requirements are met, the labor cost is saved, the error of manual expansion is avoided, and the storage is more efficient.
Drawings
In order to more clearly illustrate the detailed description of the invention or the technical solutions in the prior art, the drawings that are needed in the detailed description of the invention or the prior art will be briefly described below. Throughout the drawings, like elements or portions are generally identified by like reference numerals. In the drawings, elements or portions are not necessarily drawn to scale.
Fig. 1 is a flowchart of a dynamic flash storage method in this embodiment;
fig. 2 is a block diagram of the dynamic flash memory system in this embodiment.
Detailed Description
The technical solutions in the embodiments of the present invention will be clearly and completely described below with reference to the drawings in the embodiments of the present invention, and it is obvious that the described embodiments are some, not all, embodiments of the present invention. All other embodiments, which can be derived by a person skilled in the art from the embodiments given herein without making any creative effort, shall fall within the protection scope of the present invention.
It will be understood that the terms "comprises" and/or "comprising," when used in this specification and the appended claims, specify the presence of stated features, integers, steps, operations, elements, and/or components, but do not preclude the presence or addition of one or more other features, integers, steps, operations, elements, components, and/or groups thereof.
It is also to be understood that the terminology used in the description of the invention herein is for the purpose of describing particular embodiments only and is not intended to be limiting of the invention. As used in the specification of the present invention and the appended claims, the singular forms "a," "an," and "the" are intended to include the plural forms as well, unless the context clearly indicates otherwise.
It should be further understood that the term "and/or" as used in this specification and the appended claims refers to and includes any and all possible combinations of one or more of the associated listed items.
The first embodiment is as follows:
the embodiment provides a dynamic capacity-expansion storage method, which operates based on a dynamic capacity-expansion storage system, where the dynamic capacity-expansion storage system includes a registration server, a load balancing server, a storage proxy server, a storage router, a database server, and a storage management center. As shown in fig. 1, the method comprises the following steps:
and S1, the register server receives the register request sent by the user terminal, distributes the register UID for the register request, and sends the register request and the register UID to the storage proxy server through the load balancing server. The load balancing server is used for carrying out load balancing distribution and distributing the registration request and the registration UID of the user to the storage proxy server in a balancing way, so that the response speed of the whole system is ensured.
The step S1 specifically includes:
the registration server receives a registration request sent by a user side, sends the registration request to the cache server, and receives a new user judgment result fed back by the cache server; the cache server is part of the database server and stores part of the user information, such as the user ID. The cache server is used for identifying whether the user side sending the registration request is a new user, if the user ID of the user side is stored, the user side is registered, and if the user ID of the user side is not stored, the user side is not registered.
And after determining that the new user is the registered user according to the judgment result of the new user, the registration server sends the registration request and the registration UID to the storage proxy server through the load balancing server, the storage proxy server sends the registration request and the registration UID to the rear end for storage, and if the new user is not the registered user, the registered information is fed back to the user side. Therefore, the storage space waste caused by repeated storage of user registration data is avoided.
And S2, the storage proxy server sends the registration request and the registration UID to the database server for storage through the storage route, and reports the registration UID to the storage management center. The database server comprises a plurality of data devices for storing data, a storage node corresponding to each data device is arranged in the storage route, and the storage route sends the registration request to the data devices for storage according to the storage nodes. The registration UID is identity information distributed by the system for the registration request.
And S3, calculating the residual storage capacity of the database after the storage management center receives the registered UID, applying for a storage node from the operation and maintenance terminal to enlarge the capacity of the database server when the residual storage capacity is smaller than the threshold capacity, and adding the applied storage node to the storage route.
The step S3 specifically includes:
and after receiving the registered UID, the storage management center calculates the occupied storage capacity of the database server.
And the storage management center subtracts the occupied storage capacity according to the total storage capacity of the database server to obtain the residual storage capacity. For example, if the total allocated storage capacity of the database server is 100 billion and the currently allocated uid is 90 billion, the management center can calculate the remaining 10 billion storage space.
The storage management center judges whether the residual storage capacity is smaller than the threshold capacity, if so, the storage management center sends a storage node application to the operation and maintenance end and receives storage node distribution information fed back by the operation and maintenance end; after receiving the storage node application, the operation and maintenance terminal allocates the redundant data equipment to the database server to enlarge the capacity of the database server, and then transmits the storage node allocation information of the data equipment to the storage management center.
The storage management center performs base table initialization operation on the newly distributed data equipment according to the storage node distribution information, and adds the initialized base table information as a storage node to a storage route; after the storage node of the newly added data device is added to the storage route, the storage proxy server can store the data to the newly added data device through the storage route.
And the storage management center obtains the newly added storage capacity according to the storage node distribution information and updates the total storage capacity according to the newly added storage capacity. And adding the previous total storage capacity to the newly added storage capacity to obtain a new total storage capacity so as to carry out calculation next time.
In summary, the present embodiment has the following advantages compared to the conventional storage scheme:
firstly, manual expansion is not needed, and the method is more efficient. The labor cost is saved, the error of manual expansion is avoided, and the storage is more efficient.
And secondly, the utilization value of the hardware is improved, and the early waste of the hardware is avoided. The traditional manual capacity expansion needs to provide sufficient storage very early, and the capacity expansion is carried out once, so that early-stage hardware is idle; the dynamic capacity expansion processing is to apply for storage immediately before the storage reaches the maximum storage, and to put the storage into use after necessary initialization, thereby bringing about full use of hardware.
Example two:
the embodiment provides a dynamic capacity expansion storage system, which is suitable for the dynamic storage method described in the first embodiment, and as shown in fig. 2, the system includes a registration server, a load balancing server, a storage proxy server, a storage router, a database server, and a storage management center;
and the registration server is used for receiving the registration request sent by the user side, distributing the registration UID for the registration request, and sending the registration request and the registration UID to the storage proxy server through the load balancing server. The load balancing server is used for carrying out load balancing distribution and distributing the registration request of the user to the storage proxy server in a balancing manner, so that the response speed of the whole system is ensured.
Specifically, a registration server receives a registration request sent by a user side, sends the registration request to a cache server, and receives a new user judgment result fed back by the cache server; the cache server is part of the database server and stores part of the user information, such as the user ID. The cache server is used for identifying whether the user side sending the registration request is a new user, if the user ID of the user side is stored, the user side is registered, and if the user ID of the user side is not stored, the user side is not registered.
And after determining that the new user is the registered user according to the judgment result of the new user, the registration server sends the registration request and the registration UID to the storage proxy server through the load balancing server, the storage proxy server sends the registration request and the registration UID to the rear end for storage, and if the new user is not the registered user, the registered information is fed back to the user side. Therefore, the storage space waste caused by repeated storage of user registration data is avoided.
And the storage proxy server is used for sending the registration request and the registration UID to the database server for storage through the storage route and reporting the registration UID to the storage management center. The database server comprises a plurality of data devices for storing data, a storage node corresponding to each data device is arranged in the storage route, and the storage route sends the registration request to the data devices for storage according to the storage nodes. The registration UID is identity information distributed by the system for the registration request.
And the storage management center is used for calculating the residual storage capacity of the database after receiving the registered UID, applying for a storage node from the operation and maintenance end to enlarge the capacity of the database server when the residual storage capacity is smaller than the threshold capacity, and adding the applied storage node to a storage route.
Specifically, after receiving the registered UID, the storage management center calculates the occupied storage capacity of the database server.
And the storage management center subtracts the occupied storage capacity according to the total storage capacity of the database server to obtain the residual storage capacity. For example, if the total allocated storage capacity of the database server is 100 billion and the currently allocated uid is 90 billion, the management center can calculate the remaining 10 billion storage space.
The storage management center judges whether the residual storage capacity is smaller than the threshold capacity, if so, the storage management center sends a storage node application to the operation and maintenance end and receives storage node distribution information fed back by the operation and maintenance end; .
And the storage management center performs base table initialization operation on the newly distributed data equipment according to the storage node distribution information, and adds the initialized base table information serving as the storage node to the storage route. After the storage node of the newly added data device is added to the storage route, the storage proxy server can store the data to the newly added data device through the storage route.
And the storage management center obtains the newly added storage capacity according to the storage node distribution information and updates the total storage capacity according to the newly added storage capacity. And adding the previous total storage capacity to the newly added storage capacity to obtain a new total storage capacity so as to carry out calculation next time.
In summary, the present embodiment has the following advantages compared to the conventional storage scheme:
firstly, manual expansion is not needed, and the method is more efficient. The labor cost is saved, the error of manual expansion is avoided, and the storage is more efficient.
And secondly, the utilization value of the hardware is improved, and the early waste of the hardware is avoided. The traditional manual capacity expansion needs to provide sufficient storage very early, and the capacity expansion is carried out once, so that early-stage hardware is idle; the dynamic capacity expansion processing is to apply for storage immediately before the storage reaches the maximum storage, and to put the storage into use after necessary initialization, thereby bringing about full use of hardware.
Those of ordinary skill in the art will appreciate that the elements and method steps of the examples described in connection with the embodiments disclosed herein may be embodied in electronic hardware, computer software, or combinations of both, and that the components and steps of the examples have been described in a functional general in the foregoing description for the purpose of clearly illustrating the interchangeability of hardware and software. Whether such functionality is implemented as hardware or software depends upon the particular application and design constraints imposed on the implementation. Skilled artisans may implement the described functionality in varying ways for each particular application, but such implementation decisions should not be interpreted as causing a departure from the scope of the present invention.
In the several embodiments provided in the present application, it should be understood that the disclosed method and system may be implemented in other ways. For example, the above described division of elements is merely a logical division, and other divisions may be realized, for example, multiple elements or components may be combined or integrated into another system, or some features may be omitted, or not executed. The units may or may not be physically separate, and components displayed as units may or may not be physical units, that is, may be located in one place, or may be distributed on a plurality of network units. Some or all of the units can be selected according to actual needs to achieve the purpose of the solution of the embodiment of the present invention.
In addition, functional units in the embodiments of the present invention may be integrated into one processing unit, or each unit may exist alone physically, or two or more units are integrated into one unit. The integrated unit can be realized in a form of hardware, and can also be realized in a form of a software functional unit.
Finally, it should be noted that: the above embodiments are only used to illustrate the technical solution of the present invention, and not to limit the same; while the invention has been described in detail and with reference to the foregoing embodiments, it will be understood by those skilled in the art that: the technical solutions described in the foregoing embodiments may still be modified, or some or all of the technical features may be equivalently replaced; such modifications and substitutions do not depart from the spirit and scope of the present invention, and they should be construed as being included in the following claims and description.
Claims (4)
1. A dynamic capacity expansion storage method is characterized by comprising the following steps:
the method comprises the steps that a registration server receives a registration request sent by a user side, distributes a registration UID for the registration request, and sends the registration request and the registration UID to a storage proxy server through a load balancing server; the load balancing server is used for carrying out load balancing distribution;
the storage proxy server sends the registration request and the registration UID to a database server for storage through a storage route, and reports the registration UID to a storage management center;
the method comprises the following steps that after receiving a registered UID, a storage management center calculates the residual storage capacity of a database, when the residual storage capacity is smaller than a threshold capacity, the storage management center applies for a storage node to an operation and maintenance end to enlarge the capacity of a database server, and the applied storage node is added to a storage route, and specifically comprises the following steps:
after receiving the registered UID, the storage management center calculates the occupied storage capacity of the database server;
the storage management center subtracts the occupied storage capacity according to the total storage capacity of the database server to obtain the residual storage capacity;
the storage management center judges whether the residual storage capacity is smaller than the threshold capacity, if so, the storage management center sends a storage node application to the operation and maintenance end and receives storage node distribution information fed back by the operation and maintenance end;
the storage management center performs base table initialization operation on the newly distributed data equipment according to the storage node distribution information, and adds the initialized base table information as a storage node to a storage route;
the storage management center obtains a newly-added storage capacity according to the storage node distribution information, and updates the total storage capacity according to the newly-added storage capacity; the database server comprises a plurality of data devices for storing data, and the storage route is provided with a storage node corresponding to each data device.
2. The dynamic flash memory method according to claim 1, wherein the registration server receives a registration request sent by a user side, allocates a registration UID to the registration request, and sends the registration request and the registration UID to the memory agent server through the load balancing server, specifically:
the registration server receives a registration request sent by a user side, sends the registration request to the cache server, and receives a new user judgment result fed back by the cache server;
after determining that the new user is the new user according to the judgment result of the new user, the registration server distributes a registration UID for the registration request;
the registration server sends a registration request and a registration UID to the storage proxy server through the load balancing server.
3. A dynamic capacity-expansion storage system is suitable for the dynamic capacity-expansion storage method of claim 1, and is characterized by comprising a registration server, a load balancing server, a storage proxy server, a storage route, a database server and a storage management center;
the system comprises a registration server, a storage proxy server and a load balancing server, wherein the registration server is used for receiving a registration request sent by a user side, distributing a registration UID for the registration request, and sending the registration request and the registration UID to the storage proxy server through the load balancing server; the load balancing server is used for carrying out load balancing distribution;
the storage proxy server is used for sending the registration request and the registration UID to the database server for storage through the storage route and reporting the registration UID to the storage management center;
the storage management center is used for calculating the residual storage capacity of the database after receiving the registered UID, applying for a storage node from the operation and maintenance end to enlarge the capacity of the database server when the residual storage capacity is smaller than the threshold capacity, and adding the applied storage node to a storage route, and specifically comprises the following steps:
after receiving the registered UID, calculating the occupied storage capacity of the database server;
subtracting the occupied storage capacity according to the total storage capacity of the database server to obtain the residual storage capacity;
judging whether the residual storage capacity is smaller than the threshold capacity, if so, sending a storage node application to an operation and maintenance end, and receiving storage node distribution information fed back by the operation and maintenance end;
according to the storage node distribution information, performing base table initialization operation on newly distributed data equipment, and adding initialized base table information serving as a storage node to a storage route;
acquiring newly-increased storage capacity according to the storage node distribution information, and updating the total storage capacity according to the newly-increased storage capacity; the database server comprises a plurality of data devices for storing data, and the storage route is provided with a storage node corresponding to each data device.
4. The dynamic flash storage system of claim 3, wherein the registry server is specifically configured to:
receiving a registration request sent by a user side, sending the registration request to a cache server, and receiving a new user judgment result fed back by the cache server;
distributing a registration UID for the registration request after determining that the new user is the new user according to the judgment result of the new user;
the registration request and the registration UID are sent to the storage proxy server by the load balancing server.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810049360.9A CN108111628B (en) | 2018-01-18 | 2018-01-18 | Dynamic capacity-expansion storage method and system |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810049360.9A CN108111628B (en) | 2018-01-18 | 2018-01-18 | Dynamic capacity-expansion storage method and system |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN108111628A CN108111628A (en) | 2018-06-01 |
| CN108111628B true CN108111628B (en) | 2021-08-17 |
Family
ID=62218648
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201810049360.9A Active CN108111628B (en) | 2018-01-18 | 2018-01-18 | Dynamic capacity-expansion storage method and system |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN108111628B (en) |
Families Citing this family (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109085999B (en) * | 2018-06-15 | 2022-04-22 | 华为技术有限公司 | Data processing method and processing system |
| CN110825308B (en) * | 2018-08-07 | 2023-12-26 | 北京国双科技有限公司 | Data space management method and device |
| CN111796768B (en) * | 2020-06-30 | 2023-08-22 | 中国工商银行股份有限公司 | Distributed service coordination method, device and system |
| CN114640607B (en) * | 2022-05-12 | 2022-08-12 | 武汉四通信息服务有限公司 | Monitoring service registration method and device, computer equipment and storage medium |
| CN117082068B (en) * | 2023-08-25 | 2024-03-29 | 北京神州云合数据科技发展有限公司 | Elastic expansion method and system for tax return server |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105162859A (en) * | 2015-08-20 | 2015-12-16 | 湖南亿谷科技发展股份有限公司 | Dynamic server dilatation system and method |
| CN105847352A (en) * | 2016-03-22 | 2016-08-10 | 青岛海信传媒网络技术有限公司 | Distributed cache system-based capacity expansion method, device and distributed cache system |
Family Cites Families (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102222107A (en) * | 2011-06-28 | 2011-10-19 | 中国联合网络通信集团有限公司 | Data access system and method |
| CN102508693A (en) * | 2011-09-29 | 2012-06-20 | 华中科技大学 | Web server capacity expansion system based on virtual machine |
| US10019763B2 (en) * | 2015-06-17 | 2018-07-10 | Sap Se | Extension ledger |
| CN105391695B (en) * | 2015-10-20 | 2018-12-14 | 山东泰信电子股份有限公司 | A kind of terminal registration method and method of calibration |
-
2018
- 2018-01-18 CN CN201810049360.9A patent/CN108111628B/en active Active
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105162859A (en) * | 2015-08-20 | 2015-12-16 | 湖南亿谷科技发展股份有限公司 | Dynamic server dilatation system and method |
| CN105847352A (en) * | 2016-03-22 | 2016-08-10 | 青岛海信传媒网络技术有限公司 | Distributed cache system-based capacity expansion method, device and distributed cache system |
Also Published As
| Publication number | Publication date |
|---|---|
| CN108111628A (en) | 2018-06-01 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN108111628B (en) | Dynamic capacity-expansion storage method and system | |
| US9911148B2 (en) | Querying for business service processing status information | |
| CN102137014B (en) | Resource management method, system and resource manager | |
| CN105830394B (en) | Configuration method, system and its Virtual NE and network management system of virtual network strategy | |
| CN103078965B (en) | The IP address management method of virtual machine | |
| CN105242957A (en) | Method and system for cloud computing system to allocate GPU resources to virtual machine | |
| CN101984632A (en) | Load distributing method, device and server in distributed cache system | |
| CN104683161B (en) | Network management and device based on SaaS | |
| CN111092921B (en) | Data acquisition method, device and storage medium | |
| CN111585887B (en) | Communication method and device based on multiple networks, electronic equipment and storage medium | |
| CN110795120B (en) | Software upgrading method and related device | |
| CN109582439B (en) | DCN deployment method, device, equipment and computer readable storage medium | |
| CN109471725A (en) | Resource allocation methods, device and server | |
| CN112751761A (en) | Transaction routing switching method, intermediate system and service processing system | |
| EP3319270B1 (en) | Service registration method, usage method and relevant apparatus | |
| CN112953982A (en) | Service processing method, service configuration method and related device | |
| CN109743357A (en) | A kind of successional implementation method of business access and device | |
| CN104901999A (en) | Method for reliability perceptive cross-domain mapping of virtual data center | |
| CN106412075A (en) | Resource allocation method and device based on cloud computing | |
| CN106254516B (en) | Load balancing method and device | |
| CN104852964A (en) | Multifunctional server scheduling method | |
| CN110782211A (en) | Data processing method and device, electronic equipment and storage medium | |
| CN111491039A (en) | IP distribution method, system, terminal and storage medium for distributed file system | |
| CN115438021A (en) | Resource allocation method and device for database server | |
| CN114785745A (en) | Method for configuring equipment resources and switch |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |