CN106375427A - Link redundancy optimization method for distributed SAN (Storage Area Network) storage system - Google Patents
Link redundancy optimization method for distributed SAN (Storage Area Network) storage system Download PDFInfo
- Publication number
- CN106375427A CN106375427A CN201610791093.3A CN201610791093A CN106375427A CN 106375427 A CN106375427 A CN 106375427A CN 201610791093 A CN201610791093 A CN 201610791093A CN 106375427 A CN106375427 A CN 106375427A
- Authority
- CN
- China
- Prior art keywords
- memory node
- client
- san
- high availabitity
- configuration
- 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
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/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
- H04L1/00—Arrangements for detecting or preventing errors in the information received
- H04L1/22—Arrangements for detecting or preventing errors in the information received using redundant apparatus to increase reliability
-
- 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
Abstract
The invention discloses a link redundancy optimization method for a distributed SAN storage system. The method comprises the steps of configuring an SAN service on each storage node; adding high-available configuration to each storage node; randomly allocating multiple connection requests to the storage nodes through utilization of the high-available configuration when the multiple connection requests are received, thereby finishing the butt joint between a client and the storage nodes; and providing a new connection link for the client through adoption of the high-available configuration when a fault occurs at a storage node. According to the method, the high-available configuration is added to original multipath link redundancy, the reliability of the SAN is ensured, network loads of the storage nodes are balanced, and a bandwidth utilization rate of a storage cluster is improved.
Description
Technical field
The present invention relates to memory system technologies field, more particularly to a kind of distributed san storage system link redundancy is excellent
Change method.
Background technology
At present, existing distributed memory system has very high requirement to reliability and handling capacity.When storage system is gathered around
When having a large amount of memory node, the probability that memory node breaks down can greatly increase, and after memory node breaks down, still protects
The card client reading and writing data lasting to storage system is most important.When there being a large amount of client hosts to access storage system, deposit
Storage system needs to provide sufficiently large bandwidth for user rs host, makes full use of the bandwidth of each memory node, thus improving whole
The bandwidth availability ratio of storage system is extremely important.San (storage area network, storage area network) adopts netted logical
Road technology, connects storage array server main frame by fc switch, sets up the Local Area Network being exclusively used in data storage.
General san design of memory systems scheme is as service providing end using a few node, joins in client
Put multipath strategy, but under large-scale distributed san storage system scene, the link redundancy that traditional multipath strategy provides
Limited, redundant link is less, and two service nodes are not enough to support the bandwidth of whole distributed storage cluster simultaneously, and bandwidth uses
Unbalanced, so distributed san storage system link reliability is relatively low, and storage cluster bandwidth availability ratio is relatively low.
Content of the invention
It is an object of the invention to provide a kind of distributed san storage system link redundancy optimization method, divided with realizing improving
Cloth san storage system link reliability, lifts storage cluster bandwidth availability ratio.
For solving above-mentioned technical problem, the present invention provides a kind of distributed san storage system link redundancy optimization method, bag
Include:
Configuration san service on each memory node；
Each memory node is added with High Availabitity configuration；
When receiving multiple connection request, using High Availabitity configuration, the plurality of connection request is randomly assigned to respectively depositing
Storage node, completes docking of client and memory node；
When a memory node breaks down, being configured to client using High Availabitity provides new connecting link.
Preferably, described san services the connection request for processing client；Described High Availabitity configuration includes High Availabitity machine
System and High Availabitity allocation strategy.
Preferably, after described configuration san service on each memory node, also include: will be initial for each memory node
Change to same state.
Preferably, described configuration san service on each memory node, comprising:
San memory interface towards client layer is set in each memory node.
Preferably, described when receiving multiple connection request, using High Availabitity configuration by the plurality of connection request with
Machine distributes to each memory node, comprising:
When there being multiple client to access storage system, receive the connection request of multiple client, joined using High Availabitity
Put and the connection request of multiple client is connect according to the san storage that High Availabitity allocation strategy uniformly distributes to each memory node
Mouthful.
Preferably, after the described interpolation High Availabitity configuration to each memory node, also include: configure multipath in client
Strategy, storage link is assigned to different virtual ip addresses.
Preferably, described it is configured to client using High Availabitity new connecting link is provided, comprising:
Find, using High Availabitity configuration, the memory node that new memory node replacement breaks down, set up client with described
Connecting link between new memory node.
A kind of distributed san storage system link redundancy optimization method provided by the present invention, on each memory node
Configuration san service；Each memory node is added with High Availabitity configuration；When receiving multiple connection request, joined using High Availabitity
Put and the plurality of connection request is randomly assigned to each memory node, complete docking of client and memory node；When one is deposited
During storage nodes break down, being configured to client using High Availabitity provides new connecting link.It can be seen that, when there being a large amount of connection requests
During arrival, multiple connection requests can be randomly assigned to each memory node for High Availabitity configuration, complete client and memory node
Docking, provides service for user rs host, realizes the load balancing in bandwidth aspect for each memory node, improves distributed san storage
System link reliability, when certain memory node breaks down, being configured to client by High Availabitity provides a new connection
Path, realizes the redundancy scheme more relatively reliable than traditional multipath, so with the addition of height on original multipath link redundancy can
With configuration, the offered load of each memory node, the bandwidth of lifting storage cluster while ensureing san reliability, can be equalized
Utilization rate.
Brief description
In order to be illustrated more clearly that the embodiment of the present invention or technical scheme of the prior art, below will be to embodiment or existing
Have technology description in required use accompanying drawing be briefly described it should be apparent that, drawings in the following description be only this
Inventive embodiment, for those of ordinary skill in the art, on the premise of not paying creative work, can also basis
The accompanying drawing providing obtains other accompanying drawings.
Fig. 1 is a kind of flow chart of distributed san storage system link redundancy optimization method provided by the present invention；
Fig. 2 is storage system link redundancy structural representation.
Specific embodiment
The core of the present invention is to provide a kind of distributed san storage system link redundancy optimization method, is divided with realizing improving
Cloth san storage system link reliability, lifts storage cluster bandwidth availability ratio.
In order that those skilled in the art more fully understand the present invention program, below in conjunction with the embodiment of the present invention
Accompanying drawing, is clearly and completely described to the technical scheme in the embodiment of the present invention it is clear that described embodiment is only
The a part of embodiment of the present invention, rather than whole embodiments.Based on the embodiment in the present invention, those of ordinary skill in the art
The every other embodiment being obtained under the premise of not making creative work, broadly falls into the scope of protection of the invention.
Refer to Fig. 1, Fig. 1 is a kind of distributed san storage system link redundancy optimization method provided by the present invention
Flow chart, the method includes:
S11: configuration san service on each memory node；
S12: each memory node is added with High Availabitity configuration；
S13: when receiving multiple connection request, using High Availabitity configuration, multiple connection requests are randomly assigned to respectively depositing
Storage node, completes docking of client and memory node；
S14: when a memory node breaks down, being configured to client using High Availabitity provides new connecting link.
It can be seen that, when there being a large amount of connection requests to reach, multiple connection requests can be randomly assigned to respectively depositing for High Availabitity configuration
Storage node, completes docking of client and memory node, provides for user rs host and services, realizes each memory node in bandwidth aspect
Load balancing, improve distributed san storage system link reliability, when certain memory node breaks down, by High Availabitity
Being configured to client provides a new access path, realizes the redundancy scheme more relatively reliable than traditional multipath, so former
Have on multipath link redundancy and with the addition of High Availabitity configuration, each memory node can be equalized while ensureing san reliability
Offered load, the bandwidth availability ratio of lifting storage cluster.
Based on said method, specifically, san services the connection request for processing client.High Availabitity configuration includes height
Available mechanism and High Availabitity allocation strategy, that is, when receiving multiple connection request, using high availability mechanism and High Availabitity strategy
Multiple connection requests are randomly assigned to each memory node, complete docking of client and memory node.Using High Availabitity distribution
Strategy can equalize the bandwidth load of each memory node, is easy to the unified configuration management of each memory node san service.
Further, after step s11, also include: each memory node is initialised to same state.
Wherein, the process of step s11 is particularly as follows: arrange the san memory interface towards client layer in each memory node.
In step s13, when receiving multiple connection request, using High Availabitity configuration, multiple connection requests are randomly assigned
To each memory node process particularly as follows: when have multiple client access storage system when, receive the connection of multiple client
The connection request of multiple client is uniformly distributed to each according to High Availabitity allocation strategy using High Availabitity configuration and is deposited by request
The san memory interface of storage node.
Wherein, after step s12, also include: configure multipath strategy in client, storage link is assigned to different
Virtual ip address.
In step s14, being configured to client using High Availabitity provides the process of new connecting link particularly as follows: can using height
Find, with configuration, the memory node that new memory node replacement breaks down, set up the company between client and new memory node
Chain link road.
Specifically, in large-scale distributed storage system, the san providing user oriented layer in each memory node deposits
The access of client, when there being a large amount of external client to access storage system, is connected using High Availabitity configuration and issues by storage interface
To the san memory interface of each memory node, when the san service fault of certain memory node, it is client by high availability mechanism
End provides a new access path, is achieved in that the redundancy scheme more relatively reliable than traditional multipath.
When there being a large amount of connection requests to reach, high availability mechanism can exclude event first according to a set allocative decision
Barrier node, then the memory node of prioritizing selection relative free is client offer service, realizes each memory node in bandwidth layer
The load balancing in face.This method solves the weak point of original san deployment scheme, adds after original multipath link redundancy
One floor height available policies, while ensureing san reliability, can equalize the offered load of each memory node, lifting storage
The bandwidth availability ratio of cluster.
This method is mainly for redundant link present in traditional san storage scheme is less, bandwidth is asked using unbalanced
Topic, realizes improving distributed san storage link reliability, optimizes the load balancing in bandwidth aspect for each memory node.Specifically come
Say i.e. deployment san service on each node of cluster, and be initialised to same state；It is that storage system configuration is multigroup high on demand
Available solutions, for providing san service to client；When High Availabitity configuration receives multiple connection request, by connection request
It is that High Availabitity allocation strategy is randomly assigned to each memory node according to certain strategy, complete client and deposit with memory node san
The docking of storage node；When certain memory node breaks down, High Availabitity configuration will provide fault-free for new client request
Path connect, and preferentially provide relative free memory node；Meanwhile, the client to Connection Service, on the one hand enables
Multipath link provides service, on the other hand by High Availabitity strategy, failure path is replaced with active path.
Storage system link redundancy structure as shown in Fig. 2 first, services in each memory node configuration san, for processing
The request of client；Then, carry out High Availabitity configuration in memory node, when client accesses the virtual ip of High Availabitity, virtual
Client connection is uniformly distributed to each memory node by dividing equally strategy by ip；Finally, configure multipath plan in client
Slightly, storage link is separately assigned to different virtual ip, finally realizes client to the configuration of memory node redundant link.All
Strategy is divided to belong to High Availabitity allocation strategy.
Taking the scene in Fig. 2 as a example, when client 1 needs san storage service, configure multipath strategy first, respectively
Being assigned to two virtual ip is the virtual ip of the High Availabitity 1 and virtual ip of High Availabitity 2, then is divided for client by High Availabitity allocation strategy
Join memory node, this allocation strategy will be fixed a breakdown node first, then preferentially the memory node of distribution relative free is client
Main frame provides service, such as memory node 1 and memory node 3.During providing service, when memory node 1 breaks down
When, due to the presence of multipath, memory node 3 will be had to provide service, High Availabitity strategy can be found new memory node and replace simultaneously
The node that generation breaks down.Compare traditional san link redundancy scheme, the present invention has more reliable link redundancy strategy, utilize
High Availabitity allocation strategy equalizes the bandwidth load of each memory node, is easy to unified configuration and the management of each memory node san service.
Client in literary composition is client host.
To sum up, a kind of distributed san storage system link redundancy optimization method provided by the present invention, in each storage section
Configuration san service on point；Each memory node is added with High Availabitity configuration；When receiving multiple connection request, can using height
With configuration, multiple connection requests are randomly assigned to each memory node, complete docking of client and memory node；When one is deposited
During storage nodes break down, being configured to client using High Availabitity provides new connecting link.It can be seen that, when there being a large amount of connection requests
During arrival, multiple connection requests can be randomly assigned to each memory node for High Availabitity configuration, complete client and memory node
Docking, provides service for user rs host, realizes the load balancing in bandwidth aspect for each memory node, improves distributed san storage
System link reliability, when certain memory node breaks down, being configured to client by High Availabitity provides a new connection
Path, realizes the redundancy scheme more relatively reliable than traditional multipath, so with the addition of height on original multipath link redundancy can
With configuration, the offered load of each memory node, the bandwidth of lifting storage cluster while ensureing san reliability, can be equalized
Utilization rate.
Above detailed Jie is carried out to a kind of distributed san storage system link redundancy optimization method provided by the present invention
Continue.Specific case used herein is set forth to the principle of the present invention and embodiment, and the explanation of above example is only
It is to be used to help understand the method for the present invention and its core concept.It should be pointed out that for those skilled in the art
For, under the premise without departing from the principles of the invention, the present invention can also be carried out with some improvement and modify, these improve and repair
Decorations also fall in the protection domain of the claims in the present invention.
Claims (7)
1. a kind of distributed san storage system link redundancy optimization method is it is characterised in that include:
Configuration san service on each memory node；
Each memory node is added with High Availabitity configuration；
When receiving multiple connection request, using High Availabitity configuration, the plurality of connection request is randomly assigned to each storage section
Point, completes docking of client and memory node；
When a memory node breaks down, being configured to client using High Availabitity provides new connecting link.
2. the method for claim 1 is it is characterised in that described san services the connection request for processing client；Institute
State High Availabitity configuration and include high availability mechanism and High Availabitity allocation strategy.
3. the method for claim 1 is it is characterised in that after described configuration san service on each memory node, go back
Including: each memory node is initialised to same state.
4. the method for claim 1 is it is characterised in that described configure san service on each memory node, comprising:
San memory interface towards client layer is set in each memory node.
5. method as claimed in claim 4 it is characterised in that described when receiving multiple connection request, using High Availabitity
The plurality of connection request is randomly assigned to each memory node for configuration, comprising:
When there being multiple client to access storage system, receive the connection request of multiple client, configuring using High Availabitity will
The connection request of multiple client uniformly distributes to the san memory interface of each memory node according to High Availabitity allocation strategy.
6. the method for claim 1 it is characterised in that described to each memory node add High Availabitity configuration after,
Also include: configure multipath strategy in client, storage link is assigned to different virtual ip addresses.
7. the method as described in any one in claim 1 to 6 is it is characterised in that described be configured to client using High Availabitity
End provides new connecting link, comprising:
Find, using High Availabitity configuration, the memory node that new memory node replacement breaks down, set up client new with described
Connecting link between memory node.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201610791093.3A CN106375427A (en) | 2016-08-31 | 2016-08-31 | Link redundancy optimization method for distributed SAN (Storage Area Network) storage system |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201610791093.3A CN106375427A (en) | 2016-08-31 | 2016-08-31 | Link redundancy optimization method for distributed SAN (Storage Area Network) storage system |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN106375427A true CN106375427A (en) | 2017-02-01 |
Family
ID=57899669
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201610791093.3A Pending CN106375427A (en) | 2016-08-31 | 2016-08-31 | Link redundancy optimization method for distributed SAN (Storage Area Network) storage system |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN106375427A (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111866210A (en) * | 2020-07-08 | 2020-10-30 | 苏州浪潮智能科技有限公司 | Virtual IP balance distribution method, system, terminal and storage medium |
Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1358287A (en) * | 1999-06-11 | 2002-07-10 | 存储技术公司 | Intelligent storage area network |
| CN1434393A (en) * | 2003-02-24 | 2003-08-06 | 武汉大学 | Dynamic loading balance method for cluster server |
| CN101232422A (en) * | 2008-01-18 | 2008-07-30 | 北京交通大学 | Network storage system based on graticule technique |
| CN101815095A (en) * | 2010-03-26 | 2010-08-25 | 山东高效能服务器和存储研究院 | SAN stored resource unified management and distribution method |
| CN104715044A (en) * | 2011-12-28 | 2015-06-17 | 北京奇虎科技有限公司 | Distributed system and data manipulation method thereof |
| CN105657066A (en) * | 2016-03-23 | 2016-06-08 | 天津书生云科技有限公司 | Load rebalance method and device used for storage system |
-
2016
- 2016-08-31 CN CN201610791093.3A patent/CN106375427A/en active Pending
Patent Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1358287A (en) * | 1999-06-11 | 2002-07-10 | 存储技术公司 | Intelligent storage area network |
| CN1434393A (en) * | 2003-02-24 | 2003-08-06 | 武汉大学 | Dynamic loading balance method for cluster server |
| CN101232422A (en) * | 2008-01-18 | 2008-07-30 | 北京交通大学 | Network storage system based on graticule technique |
| CN101815095A (en) * | 2010-03-26 | 2010-08-25 | 山东高效能服务器和存储研究院 | SAN stored resource unified management and distribution method |
| CN104715044A (en) * | 2011-12-28 | 2015-06-17 | 北京奇虎科技有限公司 | Distributed system and data manipulation method thereof |
| CN105657066A (en) * | 2016-03-23 | 2016-06-08 | 天津书生云科技有限公司 | Load rebalance method and device used for storage system |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111866210A (en) * | 2020-07-08 | 2020-10-30 | 苏州浪潮智能科技有限公司 | Virtual IP balance distribution method, system, terminal and storage medium |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US10581674B2 (en) | Method and apparatus for expanding high-availability server cluster | |
| CN1554055B (en) | High-availability cluster virtual server system | |
| CN102075556B (en) | Method for designing service architecture with large-scale loading capacity | |
| CN104954182B (en) | A kind of method and apparatus for configuring Virtual Server Cluster | |
| CN104468151B (en) | A kind of system and method for keeping TCP sessions during cluster switching | |
| US11669360B2 (en) | Seamless virtual standard switch to virtual distributed switch migration for hyper-converged infrastructure | |
| CN105337780B (en) | A kind of server node configuration method and physical node | |
| CN112671882A (en) | Same-city double-activity system and method based on micro-service | |
| CN102594861A (en) | Cloud storage system with balanced multi-server load | |
| US10320905B2 (en) | Highly available network filer super cluster | |
| CN108924272A (en) | A kind of port resource distribution method and device | |
| CN102437933A (en) | Fault tolerance system and method of server | |
| CN104135514B (en) | Fusion type virtual storage system | |
| JP2004508616A (en) | Method and apparatus for controlling an extensible computing system | |
| US20140056121A1 (en) | System and method for supporting high available (ha) network communication in a middleware machine environment | |
| CN105847391A (en) | Distributed cloud data central structure | |
| WO2021004385A1 (en) | Service unit switching method, system and apparatus | |
| CN105162824A (en) | Host multi-path disposition method in cloud storage system, and system | |
| CN105635310B (en) | A kind of access method and device of storage resource | |
| CN106844052A (en) | A kind of method and device that fusion cluster is built based on Windows Server | |
| CN104243304B (en) | The data processing method of non-full-mesh topological structure, equipment and system | |
| CN106375427A (en) | Link redundancy optimization method for distributed SAN (Storage Area Network) storage system | |
| CN105847143A (en) | VRRP (virtual router redundancy protocol)-based load balancing method and system | |
| CN103414588B (en) | VTL backup method and VTL nodes | |
| CN114338670B (en) | Edge cloud platform and network-connected traffic three-level cloud control platform with same |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| RJ01 | Rejection of invention patent application after publication |
Application publication date: 20170201 |
|
| RJ01 | Rejection of invention patent application after publication |