This invention relates to systems and methods for responding to requests made across a data network for data and services, and more particularly to systems and methods that more efficiently address requests from a client for access to data or services.
As companies rely more and more on e-commerce, online transaction processing, and databases, the amount of information that needs to be managed and stored can intimidate even the most seasoned of network managers.
While servers do a good job of storing data, their capacity is limited, and they can become a bottleneck if too many users try to access the same information. Instead, most companies rely on peripheral storage devices such as tape libraries, RAID disks, and even optical storage systems. These storage devices are effective for backing up data online and storing large amounts of information. By hanging a number of such devices off of a server, a network administrator can create a server farm that can store a substantial amount of data for the enterprise.
But as server farms increase in size, and as companies rely more heavily on data-intensive applications such as multimedia, this traditional storage model is not quite as useful. This is because access to these peripheral devices can be slow, and it might not always be possible for every user to easily and transparently access each storage device.
Recently, a number of vendors have been developing Storage Area Network (SAN). SANs provide more options for network storage, including much faster access than the peripheral devices that operate as Network Attached Storage (NAS) and SANs further provide flexibility to create separate networks to handle large volumes of data.
A SAN is a high-speed special-purpose network or subnetwork that interconnects different kinds of data storage devices with associated data servers on behalf of a larger network of users. Typically, a storage area network is part of the overall network of computing resources for an enterprise. A SAN is usually clustered in close proximity to other computing resources such as IBM S/390 mainframes but may also extend to remote locations for backup and archival storage, using wide area network carrier technologies such as ATM or Synchronous Optical Networks. A SAN can use existing communication technology such as optical fiber ESCON or Fibre Channel technology.
SANs support disk mirroring, backup, restore, archival, and retrieval of archived data, data migration from one storage device to another, and the sharing of data among different servers in a network. SANs can incorporate subnetworks with network-attached storage systems.
Although SANs hold much promise, they face a significant challenge. Bluntly, consumers expect a lot of their data storage systems. Specifically, consumers demand that SANs provide network type scalability, service, and flexibility, while at the same time providing data access at speeds that compete with server farms. This can be quite a challenge, particularly in multi-server environments. In these environments, a client wishing to access specific information or a specific file is redirected to a server that has the piece of the requested information or file. The client then establishes a new connection to the other server upon redirect and severs the connection to the originally contacted server. However, this approach defeats the benefit of maintaining a long-lived connection between the client and the initial server.
Another approach is “storage virtualization” where an intermediary device is placed between the client and the servers, with the intermediary device providing the request routing. None of the servers is hereby aware that it is providing only a portion of the entire partitioned service. Adding the intermediary device adds complexity to the system.
It would therefore be desirable to provide a method and system that allows a client to contact any server in a multi-server environment and to access resources distributed with a reduced reliance on an intermediary device or server.
Other objects of the invention will, in part, be obvious, and, in part, be shown from the following description of the systems and methods shown herein.
The systems and methods described herein include methods for providing resources over a data network. The methods may be embodied as processes operating on a computer server, wherein that server comprises a plurality of server platforms, each of which is truly equivalent in that each provides a functionally equivalent interface to a client. In one practice of the invention, a method responds to client requests by detecting a request from a client for access to a resource and by establishing a connection for communicating with the client. The method then identifies a server available for servicing the detected request, and determines whether state information is associated with the connection. The method then, grants the identified server with access to the state information and allows the identified server to create and transmit a response to the client, also allowing the identified server to update the state information.
The foregoing and other objects and advantages of the invention will be appreciated more fully from the following further description thereof, with reference to the accompanying drawings wherein;
To provide an overall understanding of the invention, certain illustrative embodiments will now be described, including a system that provides a storage area network that more efficiently responds to requests from clients. However, it will be understood by one of ordinary skill in the art that the systems and methods described herein can be adapted and modified for other applications, such as distributed file systems, database applications and other applications where resources are partitioned or distributed. Moreover, such other additions and modifications fall within the scope hereof will not and do not depart from the scope of the invention.
In
Although a LAN is described, those skilled in the art will realize that networks other than a LAN can be used, such as a metropolitan area network (MAN), an wide area network (WAN), a campus network, or a network of networks, such as the Internet. Accordingly, the invention is not limited to any particular type of network.
As further depicted by
Turning to
Server group 30, configured as a storage area network, may comprise a plurality of equivalent servers 32A through 32N. Each of these servers has a separate IP address and thus the server group 30 appears as a SAN that includes a plurality of different IP addresses, each of which may be employed by the clients 12 for accessing storage resources maintained by the SAN. Furthermore, the depicted server group/SAN 30 may employ the plurality of servers 32A though 32N to partition resources across the storage area network. Thus, each of the individual servers may be responsible for a portion of the resources maintained by the server group/SAN 30.
In operation, the client request 34 received by the server 32B is processed by the server 32B to determine the resource of interest to that client 12 and to determine which of the plurality of servers 32A through 32N is responsible for that particular resource. In the example depicted in
As discussed above, the storage area network 30 depicted in
Each server 32 may maintain its own storage resources or, as further shown in
It will be understood that those of ordinary skill in the art that the systems and methods of the invention are not limited to storage area network applications and may be applied to other applications where it may be more efficient for a first server to receive a request and a second server to generate and send a response to that request. Other applications may include distributed file systems, database applications, application service provider applications, or any other application that may benefit from this short-cut response technique.
Under the short-cut response process described herein, the server generating and transmitting the response may be different from the server that received the request 34 and set up the connection. Accordingly, the server generating the response 38 may need to access the connection information residing on the receiving server in order to be able to directly respond to the client 12. This situation is depicted at a high level in
On example of a short-cut response is depicted in
As depicted in
As further shown in
At the TCP layer, connection information 58 may be established that includes information such as the number of datagrams or packets received or other kinds of similar information.
After the TCP layer 50, the request 34 may travel to the application layer (i.e., the “upper layers” in the OSI model) 52. In the depicted embodiment, the application layer is the Internet Small Computer System Interface (iSCSI) protocol that may be employed as part of the storage area network. At the application layer, connection information 60 may be stored where this connection information is representative of application level connection information that is relevant to the proper functioning of the iSCSI application program. In addition to connection information, it will also be understood that state information, such as HTTP cookies, TCP and/or iSCSI sequence numbers, and other similar information may be maintained and stored.
In either case, it will be seen that at different levels of the network protocol information is generated that is relevant to generating a response to the client 12. In the shortcut response process described herein, the connection and state information maintained at the different layers 54, 58 and 60 of the protocol stack are shared with the responding server 32B. As shown in
In responding to the request 34, the receiving server 32A has the request 34 travel up through the protocol stack, passing through each layer, as denoted by dashed line 81. As is known to those of ordinary skill in the art, as the request 34 travels through the protocol stack, each layer processes the request, unpacking information, reviewing header information in the request, and performing other functions including setting up and updating connection information that may be employed when responding to the request 34.
As further shown in
Turning to
As shown in
Upon processing the request, the server 32B determines that the connection and state information for generating the response (not shown) is stored at server 32A. Accordingly, the application 70 can direct the socket server 85 to request connection and state information from the socket server 84. The socket server 84 is in communication with each layer 46, 48, 50, and 52 of the protocol stack. Accordingly, the socket server 84 can gather the appropriate connection and state information from the different layers of the protocol stack and transfer the collected connection and state information to the socket server 85 via communication 88. The socket server 85 can store or establish the appropriate information at the appropriate protocol layers 64, 68 and 70. After server 32B generates the response, its socket server 85 sends any necessary changes in the connection state back to socket server 84 in server 32A. Accordingly, the distributed socket server 85 configures the server 32B to generate the response 38 (not shown).
Turning to
At block 100, the responding server can process the forwarded request to determine the server that has the connection and state information necessary for generating the short-cut response (i.e., the receiving server). In an alternative practice, the forwarded request may also contain the connection state information necessary for having the identified responding server, such as server 32B, generate the appropriate response for the client. In either case, the server that has been identified as being responsible for the resource requested by the client now has the request from the client as well as the connection state information necessary to respond to that request. In block 102 the responding server can create the response through the layers of the protocol stack on that server and to the client. The distributed socket server can then update the connection and state information on the appropriate server and in the process may terminate.
The above description, with reference to
Moreover, the depicted system and methods may be constructed from conventional hardware systems and specially developed hardware is not necessary. For example, the depicted server group 30, the client systems 12 can be any suitable computer system such as a PC workstation, a handheld computing device, a wireless communication device, or any other such device equipped with a network client capable of accessing a network server and interacting with the server to exchange information with the server. Optionally, the client and the server can rely on an unsecured communication path for accessing services on the remote server. To add security to such a communication path, the client and the server can employ a security system, such as any of the conventional security systems that have been developed to provide to the remote user a secured channel for transmitting data over the Internet. The servers may be supported by a commercially available server platform such as a Sun Sparc™ system running a version of the Unix operating system and running a server capable of connecting with, or exchanging data with, one of the clients 12.
As discussed above, the short-cut response mechanism can be realized as a software component operating on a conventional data processing system such as a UNIX workstation. In that embodiment, the short-cut response mechanism can be implemented as a C language computer program, or a computer program written in any high level language including C++, C Pascal, FORTRAN, Java, or basic. Additionally, in an embodiment where microcontrollers or DSPs are employed, the short-cut response mechanism can be realized as a computer program written in microcode or written in a high level language and compiled down to microcode that can be executed on the platform employed. The development of such code is known to those of skill in the art, and such techniques are set forth in Digital Signal Processing Applications with the TMS320 Family, Volumes I, II, and III, Texas Instruments (1990). Additionally, general techniques for high level programming are known, and set forth in, for example, Stephen G. Kochan, Programming in C, Hayden Publishing (1983).
Those skilled in the art will know or be able to ascertain using no more than routine experimentation, many equivalents to the embodiments and practices described herein.
Accordingly, it will be understood that the invention is not to be limited to the embodiments disclosed herein, but is to be understood from the following claims, which are to be interpreted as broadly as allowed under the law.
Number | Name | Date | Kind |
---|---|---|---|
5392244 | Jacobson et al. | Feb 1995 | A |
5774660 | Brendel et al. | Jun 1998 | A |
5774668 | Choquier et al. | Jun 1998 | A |
5978844 | Tsuchiya et al. | Nov 1999 | A |
6070191 | Narendran et al. | May 2000 | A |
6108727 | Boals et al. | Aug 2000 | A |
6122681 | Aditya et al. | Sep 2000 | A |
6128279 | O'Neil et al. | Oct 2000 | A |
6141688 | Bi et al. | Oct 2000 | A |
6144848 | Walsh et al. | Nov 2000 | A |
6148414 | Brown et al. | Nov 2000 | A |
6189079 | Micka et al. | Feb 2001 | B1 |
6195682 | Ho et al. | Feb 2001 | B1 |
6199112 | Wilson | Mar 2001 | B1 |
6212565 | Gupta | Apr 2001 | B1 |
6212606 | Dimitroff | Apr 2001 | B1 |
6226684 | Sung et al. | May 2001 | B1 |
6292181 | Banjerjee et al. | Sep 2001 | B1 |
6341311 | Smith et al. | Jan 2002 | B1 |
6360262 | Guenthner et al. | Mar 2002 | B1 |
6421723 | Tawil | Jul 2002 | B1 |
6434683 | West et al. | Aug 2002 | B1 |
6460083 | Niwa et al. | Oct 2002 | B1 |
6473791 | Al-Ghosein et al. | Oct 2002 | B1 |
6498791 | Pickett et al. | Dec 2002 | B2 |
6598134 | Ofek et al. | Jul 2003 | B2 |
6687731 | Kavak | Feb 2004 | B1 |
6725253 | Okano et al. | Apr 2004 | B1 |
6732171 | Hayden | May 2004 | B2 |
6742059 | Todd et al. | May 2004 | B1 |
6766348 | Combs et al. | Jul 2004 | B1 |
6813635 | Jorgenson | Nov 2004 | B1 |
6850982 | Siegel | Feb 2005 | B1 |
6859834 | Arora et al. | Feb 2005 | B1 |
6886035 | Wolff | Apr 2005 | B2 |
6910150 | Mashayekhi et al. | Jun 2005 | B2 |
6944777 | Belani et al. | Sep 2005 | B1 |
6950848 | Yousefi'zadeh | Sep 2005 | B1 |
6957433 | Umberger et al. | Oct 2005 | B2 |
6985956 | Luke et al. | Jan 2006 | B2 |
7043564 | Cook et al. | May 2006 | B1 |
7076555 | Orman et al. | Jul 2006 | B1 |
7085829 | Wu et al. | Aug 2006 | B2 |
7089293 | Grosner et al. | Aug 2006 | B2 |
7127577 | Koning et al. | Oct 2006 | B2 |
20010039581 | Deng et al. | Nov 2001 | A1 |
20020008693 | Banerjee et al. | Jan 2002 | A1 |
20020009079 | Jungck et al. | Jan 2002 | A1 |
20020010783 | Primak et al. | Jan 2002 | A1 |
20020035667 | Brunning | Mar 2002 | A1 |
20020059451 | Haviv | May 2002 | A1 |
20020065799 | West et al. | May 2002 | A1 |
20020138551 | Erickson | Sep 2002 | A1 |
20020194324 | Guha | Dec 2002 | A1 |
20030005119 | Mercier et al. | Jan 2003 | A1 |
20030074596 | Mashayekhi et al. | Apr 2003 | A1 |
20030117954 | De Neve et al. | Jun 2003 | A1 |
20030225884 | Hayden | Dec 2003 | A1 |
20040030755 | Koning et al. | Feb 2004 | A1 |
20040044771 | Allred et al. | Mar 2004 | A1 |
20040049564 | Ng et al. | Mar 2004 | A1 |
20040080558 | Blumenau et al. | Apr 2004 | A1 |
20040083345 | Kim et al. | Apr 2004 | A1 |
20040103104 | Hara et al. | May 2004 | A1 |
20040128442 | Hinshaw et al. | Jul 2004 | A1 |
20040143637 | Koning et al. | Jul 2004 | A1 |
20040153606 | Schott | Aug 2004 | A1 |
20040210724 | Koning et al. | Oct 2004 | A1 |
20040215792 | Koning et al. | Oct 2004 | A1 |
20050010618 | Hayden | Jan 2005 | A1 |
20050144199 | Hayden | Jun 2005 | A2 |
20070106857 | Koning et al. | May 2007 | A1 |
Number | Date | Country |
---|---|---|
WO 9953415 | Oct 1999 | WO |
WO 0138983 | May 2001 | WO |
WO 0237943 | May 2002 | WO |
WO 0244885 | Jun 2002 | WO |
WO 02056182 | Jul 2002 | WO |
Number | Date | Country | |
---|---|---|---|
20040143648 A1 | Jul 2004 | US |