This invention relates to systems and methods for balancing load across multiple file servers.
In certain environments, multiple nodes may be used as file servers (e.g., Network File System (NFS) or Common Internet File System (CIFS) file servers) to provide high availability and to balance load across the file servers. In an active-active configuration, when a client node attempts to connect to a file server by requesting a file server address, a domain name system (DNS) server may determine a target file server and provide, to the client node, a virtual IP address associated with the target file server. The client node may then mount the file server associated with the virtual IP address in order to access files thereon. The client node will typically continue to access files on the same file server that is assigned to it by the DNS server until the client node unmounts the file server. At that point, the client node may be assigned the same or a different virtual IP address (corresponding to the same or a different file server) the next time it requests an address from the DNS server.
When a DNS server assigns a virtual IP address to a client node, the DNS server will typically do so in a round-robin manner. That is, the DNS server will assign virtual IP addresses in a particular pre-determined sequence. The DNS server typically does so without considering loads on the file servers. Thus, using the round-robin approach, when a client node requests a virtual IP address associated with a file server, the DNS server may assign a virtual IP address associated with a file server that is experiencing a significant Load, even though there might be another file server that is experiencing a significantly lower Load and would be a better candidate to serve files to the requesting client node.
In view of the foregoing, what are needed are systems and methods to more effectively assign file servers to client nodes. Ideally, such systems and methods will consider the load on file servers in an active-active configuration and take actions to balance the load therebetween.
The invention has been developed in response to the present state of the art and, in particular, in response to the problems and needs in the art that have not yet been fully solved by currently available systems and methods. Accordingly, systems and methods have been developed to more effectively balance load across multiple file servers. The features and advantages of the invention will become more fully apparent from the following description and appended claims, or may be learned by practice of the invention as set forth hereinafter.
Consistent with the foregoing, a method for balancing load across multiple file servers is disclosed. In one embodiment, such a method includes monitoring load experienced by multiple file servers arranged in an active-active configuration. The method receives, from a client node, a request for an address associated with one of the file servers. The method determines a particular file server of the file servers that, if assigned to the client node, would reduce load imbalance between the file servers. In certain embodiments the particular file server is the file server experiencing the least load. The method returns, to the client node in response to the request, an address associated with the particular file server, thereby enabling the client node to mount the particular file server to access files thereon.
A corresponding system and computer program product are also disclosed and claimed herein.
In order that the advantages of the invention will be readily understood, a more particular description of the invention briefly described above will be rendered by reference to specific embodiments illustrated in the appended drawings. Understanding that these drawings depict only typical embodiments of the invention and are not therefore to be considered limiting of its scope, the invention will be described and explained with additional specificity and detail through use of the accompanying drawings, in which:
It will be readily understood that the components of the present invention, as generally described and illustrated in the Figures herein, could be arranged and designed in a wide variety of different configurations. Thus, the following more detailed description of the embodiments of the invention, as represented in the Figures, is not intended to limit the scope of the invention, as claimed, but is merely representative of certain examples of presently contemplated embodiments in accordance with the invention. The presently described embodiments will be best understood by reference to the drawings, wherein like parts are designated by like numerals throughout.
The present invention may be embodied as a system, method, and/or computer program product. The computer program product may include a computer readable storage medium (or media) having computer readable program instructions thereon for causing a processor to carry out aspects of the present invention.
The computer readable storage medium may be a tangible device that can retain and store instructions for use by an instruction execution device. The computer readable storage medium may be, for example, but is not limited to, an electronic storage system, a magnetic storage system, an optical storage system, an electromagnetic storage system, a semiconductor storage system, or any suitable combination of the foregoing. A non-exhaustive list of more specific examples of the computer readable storage medium includes the following: a portable computer diskette, a hard disk, a random access memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or Flash memory), a static random access memory (SRAM), a portable compact disc read-only memory (CD-ROM), a digital versatile disk (DVD), a memory stick, a floppy disk, a mechanically encoded device such as punch-cards or raised structures in a groove having instructions recorded thereon, and any suitable combination of the foregoing. A computer readable storage medium, as used herein, is not to be construed as being transitory signals per se, such as radio waves or other freely propagating electromagnetic waves, electromagnetic waves propagating through a waveguide or other transmission media (e.g., light pulses passing through a fiber-optic cable), or electrical signals transmitted through a wire.
Computer readable program instructions described herein can be downloaded to respective computing/processing devices from a computer readable storage medium or to an external computer or external storage system via a network, for example, the Internet, a local area network, a wide area network and/or a wireless network. The network may comprise copper transmission cables, optical transmission fibers, wireless transmission, routers, firewalls, switches, gateway computers and/or edge servers. A network adapter card or network interface in each computing/processing device receives computer readable program instructions from the network and forwards the computer readable program instructions for storage in a computer readable storage medium within the respective computing/processing device.
Computer readable program instructions for carrying out operations of the present invention may be assembler instructions, instruction-set-architecture (ISA) instructions, machine instructions, machine dependent instructions, microcode, firmware instructions, state-setting data, or either source code or object code written in any combination of one or more programming languages, including an object oriented programming language such as Smalltalk, C++ or the like, and conventional procedural programming languages, such as the āCā programming language or similar programming languages.
The computer readable program instructions may execute entirely on a user's computer, partly on a user's computer, as a stand-alone software package, partly on a user's computer and partly on a remote computer, or entirely on a remote computer or server. In the latter scenario, a remote computer may be connected to a user's computer through any type of network, including a local area network (LAN) or a wide area network (WAN), or the connection may be made to an external computer (for example, through the Internet using an Internet Service Provider). In some embodiments, electronic circuitry including, for example, programmable logic circuitry, field-programmable gate arrays (FPGA), or programmable logic arrays (PLA) may execute the computer readable program instructions by utilizing state information of the computer readable program instructions to personalize the electronic circuitry, in order to perform aspects of the present invention.
Aspects of the present invention may be described herein with reference to flowchart illustrations and/or block diagrams of methods, apparatus (systems), and computer program products according to embodiments of the invention. It will be understood that each block of the flowchart illustrations and/or block diagrams, and combinations of blocks in the flowchart illustrations and/or block diagrams, may be implemented by computer readable program instructions.
These computer readable program instructions may be provided to a processor of a general purpose computer, special purpose computer, or other programmable data processing apparatus to produce a machine, such that the instructions, which execute via the processor of the computer or other programmable data processing apparatus, create means for implementing the functions/acts specified in the flowchart and/or block diagram block or blocks. These computer readable program instructions may also be stored in a computer readable storage medium that can direct a computer, a programmable data processing apparatus, and/or other devices to function in a particular manner, such that the computer readable storage medium having instructions stored therein comprises an article of manufacture including instructions which implement aspects of the function/act specified in the flowchart and/or block diagram block or blocks.
The computer readable program instructions may also be loaded onto a computer, other programmable data processing apparatus, or other device to cause a series of operational steps to be performed on the computer, other programmable apparatus, or other device to produce a computer implemented process, such that the instructions which execute on the computer, other programmable apparatus, or other device implement the functions/acts specified in the flowchart and/or block diagram block or blocks.
Referring to
When a DNS server 106 assigns a virtual IP address to a client node 102, the DNS server 106 conventionally does so in a round-robin manner. That is, the DNS server 106 will assign virtual IP addresses in a particular pre-determined sequence. The DNS server 106 typically does so without considering loads on the file servers 104. Thus, using the round-robin approach, when a client node 102 requests a virtual IP address associated with a file server 104, the DNS server 106 may assign a virtual IP address associated with a file server 104 that is experiencing a significant Load, even though there might be another file server 104 that is experiencing a significantly lower Load and would be a better candidate to serve files to the requesting client node 102. Thus, systems and methods are needed to more effectively assign file servers 104 to client nodes 102. Ideally, such systems and methods will consider the load on the file servers 104 and take actions to reduce load imbalance between the file servers 104.
Referring to
A load monitoring module 204 may also be installed or incorporated into a load balancing server 206 or other load balancing device to monitor the load on each of the components 102, 104. In certain embodiments, the load monitoring module 204 may communicate with the load monitoring agents 200, 202 in each of the components to monitor the load thereon. Using this information, the load balancing server 206 or other load balancing device may take various actions to reduce load imbalance in the environment 100, as will be explained in more detail hereafter.
Referring to
For example, referring to
In certain embodiments, the load monitoring module 204 may maintain various types of information in order to decide how to most effectively reduce load imbalance between the components 104. For example, the load monitoring module 204 may, in certain embodiments, maintain a database of load scores associated with the file servers 104, load scores associated with the client nodes 102, virtual IP addresses associated with each of the file servers 104, client nodes 102 currently assigned to each of the virtual IP addresses, and so forth. The load monitoring module 204 may periodically update these databases as information changes. To accomplish this, the load monitoring module 204 may, for example, periodically poll the components 102, 104 for their load information (e.g., load scores) or information needed to compute their load scores, or the components 102, 104 may periodically or dynamically report load information (e.g., load scores) to the load monitoring module 204.
Referring to
In order to further reduce load imbalance between the file servers 104, systems and methods in accordance with the invention may also reassign virtual IP addresses between the file servers 104. For example, as shown in
In certain embodiments, the reassignment of virtual IP addresses occurs periodically, such as at specific intervals. In other embodiments, the reassignment of virtual IP addresses occurs on an as-need basis, such as when the difference between file server load scores reaches a pre-determined threshold.
Alternatively, or additionally, systems and methods in accordance with the invention may look at the load score of a client node 102 when determining which virtual IP address and associated file server 104 to assign to the client node 102. For example, client nodes 102 with higher load scores (e.g., above a particular threshold) may be assigned to file servers 104 with lower load scores (e.g., below a particular threshold) since the file servers 104 may have greater capacity to service the client nodes 102. The opposite may also be true. That is, client nodes 102 with lower load scores may be assigned to file servers 104 with higher load scores since the client nodes 102 will not place significant additional stress on the file servers 104.
The flowcharts and/or block diagrams in the Figures illustrate the architecture, functionality, and operation of possible implementations of systems, methods, and computer-usable media according to various embodiments of the present invention. In this regard, each block in the flowcharts or block diagrams may represent a module, segment, or portion of code, which comprises one or more executable instructions for implementing the specified logical function(s). It should also be noted that, in some alternative implementations, the functions noted in the block may occur out of the order noted in the Figures. For example, two blocks shown in succession may, in fact, be executed substantially concurrently, or the blocks may sometimes be executed in the reverse order, depending upon the functionality involved. It will also be noted that each block of the block diagrams and/or flowchart illustrations, and combinations of blocks in the block diagrams and/or flowchart illustrations, may be implemented by special purpose hardware-based systems that perform the specified functions or acts, or combinations of special purpose hardware and computer instructions.
Number | Name | Date | Kind |
---|---|---|---|
6412079 | Edmonds | Jun 2002 | B1 |
6473396 | Kumar | Oct 2002 | B1 |
6950848 | Yousefi'zadeh | Sep 2005 | B1 |
7191225 | Borthakur | Mar 2007 | B1 |
7386616 | Henzinger | Jun 2008 | B1 |
7676587 | Faibish | Mar 2010 | B2 |
7743155 | Pisharody | Jun 2010 | B2 |
8243589 | Trost | Aug 2012 | B1 |
8478902 | Holland | Jul 2013 | B1 |
8554918 | Douglis | Oct 2013 | B1 |
8621556 | Bharali | Dec 2013 | B1 |
8804494 | Uberoy | Aug 2014 | B1 |
8819344 | Faibish | Aug 2014 | B1 |
8959173 | Robidoux | Feb 2015 | B1 |
8972657 | Armangau | Mar 2015 | B1 |
9143558 | Blander | Sep 2015 | B2 |
9158714 | Randhawa | Oct 2015 | B2 |
9430480 | Bono | Aug 2016 | B1 |
9495119 | Gong | Nov 2016 | B1 |
9514180 | Cadarette | Dec 2016 | B1 |
9594822 | Natanzon | Mar 2017 | B1 |
9628436 | Britt | Apr 2017 | B1 |
9720601 | Gupta | Aug 2017 | B2 |
9727578 | Eshel et al. | Aug 2017 | B2 |
10009215 | Shorey | Jun 2018 | B1 |
10025873 | Jackson | Jul 2018 | B2 |
10567492 | Natarajan | Feb 2020 | B1 |
10771318 | Haltore | Sep 2020 | B1 |
20020133491 | Sim | Sep 2002 | A1 |
20050172161 | Cruz | Aug 2005 | A1 |
20060092950 | Arregoces | May 2006 | A1 |
20060193252 | Naseh | Aug 2006 | A1 |
20060195607 | Naseh | Aug 2006 | A1 |
20070094361 | Hoynowski | Apr 2007 | A1 |
20070168495 | Rothstein | Jul 2007 | A1 |
20070253328 | Harper | Nov 2007 | A1 |
20090106255 | Lacapra | Apr 2009 | A1 |
20090271472 | Scheitler | Oct 2009 | A1 |
20110078318 | Desai | Mar 2011 | A1 |
20120102192 | Takeshima | Apr 2012 | A1 |
20120240129 | Kanso | Sep 2012 | A1 |
20120303800 | Maldaner | Nov 2012 | A1 |
20130054806 | Francis | Feb 2013 | A1 |
20130103787 | Glover | Apr 2013 | A1 |
20130179876 | Aliminati | Jul 2013 | A1 |
20130297798 | Arisoylu | Nov 2013 | A1 |
20130304904 | Mouline | Nov 2013 | A1 |
20140040479 | Dunn | Feb 2014 | A1 |
20140095582 | Eshel et al. | Apr 2014 | A1 |
20150106420 | Warfield | Apr 2015 | A1 |
20150124622 | Kovvali | May 2015 | A1 |
20150178137 | Gordon | Jun 2015 | A1 |
20150378767 | Tarasuk-Levin | Dec 2015 | A1 |
20160134561 | Jacoby | May 2016 | A1 |
20160315814 | Thirumurthi | Oct 2016 | A1 |
20170048146 | Sane | Feb 2017 | A1 |
20170070419 | Singhal et al. | Mar 2017 | A1 |
20170111457 | Rivera | Apr 2017 | A1 |
20180157521 | Arikatla | Jun 2018 | A1 |
20180157522 | Bafna | Jun 2018 | A1 |
20180157752 | Arikatla | Jun 2018 | A1 |
20180205787 | Ben Dayan et al. | Jul 2018 | A1 |
20180219775 | Jiang | Aug 2018 | A1 |
20180260125 | Botes | Sep 2018 | A1 |
20180302321 | Manthiramoorthy | Oct 2018 | A1 |
20190025903 | Mehta | Jan 2019 | A1 |
20190036848 | Kommula | Jan 2019 | A1 |
20190042325 | Nair | Feb 2019 | A1 |
20190079804 | Thyagarajan | Mar 2019 | A1 |
20190188022 | Jung | Jun 2019 | A1 |
20190327312 | Gupta | Oct 2019 | A1 |
20200028730 | Fan | Jan 2020 | A1 |
20200137157 | Joseph | Apr 2020 | A1 |
20210326223 | Grunwald | Oct 2021 | A1 |
Number | Date | Country | |
---|---|---|---|
20200267211 A1 | Aug 2020 | US |