IP Library Granted Patent US 7,464,156
Granted Patent B2
US 7,464,156 · App. 10/488,491 · Granted Dec 9, 2008

Load balancing method for exchanging data between multiple hosts and storage entities, in IP based storage area network

View Patent ↗
Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US 7,464,156
App. No.
10/488,491
Granted
Dec 9, 2008
Kind
B2
Abstract

The present invention achieves load balancing of activities on storage entities, operating in a storage area network (SAN) by assignment of address to each storage entity. The storage traffic is monitored and statistics are accumulated over an interval and then used to obtain the traffic pattern of each host-storage entity link. A statistical analysis is used to determine the optimal routing map from hosts to storage entity. Other heuristics including genetic algorithms many also be used. This mapping is set on the network by assigning the entities' addresses to the storage gateways, thus does not impose any process on the hosts or the disks.

Claims (18)

1. A method for balancing storage traffic in a storage area network (SAN), including at least a plurality of host computers, at least one storage gateway, and a plurality of storage entities, wherein the host computers are coupled to the storage gateway through a network and the storage entities are coupled to the storage gateway through a communication means, said method comprising:

accumulating, over a time interval, statistical readings on the storage traffic for all routes in the SAN, wherein a route is established between each a host computer and a storage entity through the at least one gateway;

determining a routing map using the statistical readings and a cost function, wherein the cost function is min (w variance *variance(GatewayTraffic)+w change *change), where the change value is a number of changes from a previous routing map, w variance is a weight assigned to the variance, the W change is a weight assigned to the change value, and the GatewayTraffic is the statistical readings on the storage traffic; said cost function is computed for all combinations of routes in the SAN; and

using the routing map to assign new routes between the plurality of host computers and the plurality of storage entities through the at least one storage gateway;

whereby the new routes allow to balance the storage traffic in the SAN.

2. The method of claim 1 , wherein the routes for which statistical readings are accumulated are pre-assigned.

3. The method of claim 2 , wherein the pre-assignment of routes is performed a-priori by a network manager.

4. The method of claim 2 , wherein the pre-assignment of routes is performed by the steps of:

selecting a unique storage gateway from the at least one storage gateway for connecting between a host computer and a storage entity; and

assigning an Internet protocol (IP) address to the storage entity such that the host computer recognizes the storage entity by the IP address.

5. The method of claim 1 , wherein the routing map includes a set of routes that minimizes the cost function.

6. The method of claim 1 , wherein the routing map may be computed using a heuristic algorithm including at least one of: a simulated annealing algorithm, a greedy algorithm, a economic optimization algorithm, and a search algorithm.

7. The method of claim 1 , wherein the assignment of new routes is performed by a storage name server (SNS).

8. The method of claim 7 , further comprising:

periodically querying, by a host computer, the SNS for an IP address of a storage entity; and

granting the IP address of the storage entity to the host computer according to the routing map.

9. The method of claim 1 , wherein the network is an IP network.

10. The method of claim 1 , wherein the storage entity is at least one of: a physical disk, a virtual disk, a cluster of physical disks, a cluster of virtual disks, and a cluster of virtual disks and physical disks.

Assignments (8)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Jul 31, 2014
From: OCZ STORAGE SOLUTIONS, INC.
To: OCZ ISRAEL LTD.
Reel/Frame 033437/0791 →
RELEASE OF SECURITY INTEREST BY BANKRUPTCY COURT ORDER (RELEASES REEL/FRAME 030092/0739) Recorded Apr 8, 2014
From: HERCULES TECHNOLOGY GROWTH CAPITAL, INC.
To: OCZ TECHNOLOGY GROUP, INC.
Reel/Frame 032640/0284 →
RELEASE OF SECURITY INTEREST BY BANKRUPTCY COURT ORDER (RELEASES REEL/FRAME 031611/0168) Recorded Apr 8, 2014
From: COLLATERAL AGENTS, LLC
To: OCZ TECHNOLOGY GROUP, INC.
Reel/Frame 032640/0455 →
CORRECTIVE ASSIGNMENT TO CORRECT THE EXECUTION DATE AND ATTACH A CORRECTED ASSIGNMENT DOCUMENT PREVIOUSLY RECORDED ON REEL 032365 FRAME 0920. ASSIGNOR(S) HEREBY CONFIRMS THE THE CORRECT EXECUTION DATE IS JANUARY 21, 2014. Recorded Mar 18, 2014
From: OCZ TECHNOLOGY GROUP, INC.
To: TAEC ACQUISITION CORP.
Reel/Frame 032461/0486 →
CHANGE OF NAME Recorded Feb 27, 2014
From: TAEC ACQUISITION CORP.
To: OCZ STORAGE SOLUTIONS, INC.
Reel/Frame 032365/0945 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Feb 27, 2014
From: OCZ TECHNOLOGY GROUP, INC.
To: TAEC ACQUISITION CORP.
Reel/Frame 032365/0920 →
SECURITY AGREEMENT Recorded Nov 11, 2013
From: OCZ TECHNOLOGY GROUP, INC.
To: COLLATERAL AGENTS, LLC
Reel/Frame 031611/0168 →
MERGER Recorded Jul 2, 2013
From: SANRAD INC.
To: OCZ TECHNOLOGY GROUP, INC.
Reel/Frame 030729/0248 →