Aspects described herein relate to configuration of network features, including features of a network offering elastic bandwidth allocation capabilities. Bandwidth is conventionally provisioned to meet a projected peak data demand and paid for over the course of a contract that may stretch for several years. Peak demand may occur relatively infrequently, resulting in over-provisioning for a significant amount of time. This over-provisioning of the bandwidth results in excess costs to a customer who is paying for unused bandwidth over the course of the contract.
An attempt to lower costs by provisioning less bandwidth over the course of the contract is largely ineffective because of expensive overcharges when peak demand exceeds the amount of bandwidth provisioned. Bandwidth considerations and costs are especially important in large data center applications, such as data mirroring or backup, where the amount of data being transferred, and therefore the resulting bandwidth consumption, is potentially massive.
Meanwhile, network edge appliances, such as customer premise equipment, has traditionally been static equipment providing fixed functionality, and therefore flexibility in the equipment and its functioning was hindered.
Shortcomings of the prior art are overcome and additional advantages are provided through the provision of a computer-implemented method that includes performing, by an edge appliance configured to access an elastic cloud computing network, real-time traffic analysis on network traffic flowing between the elastic cloud computing network and the edge appliance, the real-time traffic analysis comprising analysis of application data transported as part of the network traffic; evaluating an effect of modifying elastic network bandwidth allocation from a network service provider of the elastic cloud computing network, and an effect of applying network traffic optimizations in routing traffic flowing between the elastic cloud computing network and the edge appliance; and dynamically configuring, based on the real-time traffic analysis and on the evaluating, one or more of (i) elastic network bandwidth allocation from the network service provider or (ii) at least one network traffic optimization, of the network traffic optimizations, for performance by the edge appliance in routing traffic flowing between the elastic cloud computing network and the edge appliance.
Further, a computer program product including a computer readable storage medium readable by a processor and storing instructions for execution by the processor is provided for performing a method that includes: performing real-time traffic analysis on network traffic flowing between an elastic cloud computing network and an edge appliance configured to access the elastic cloud computing network, the real-time traffic analysis comprising analysis of application data transported as part of the network traffic; evaluating an effect of modifying elastic network bandwidth allocation from a network service provider of the elastic cloud computing network, and an effect of applying network traffic optimizations in routing traffic flowing between the elastic cloud computing network and the edge appliance; and dynamically configuring, based on the real-time traffic analysis and on the evaluating, one or more of (i) elastic network bandwidth allocation from the network service provider or (ii) at least one network traffic optimization, of the network traffic optimizations, for performance by the edge appliance in routing traffic flowing between the elastic cloud computing network and the edge appliance.
Yet further, a computer system is provided that includes a memory and a processor in communications with the memory, wherein the computer system is configured to perform a method including: performing real-time traffic analysis on network traffic flowing between an elastic cloud computing network and an edge appliance configured to access the elastic cloud computing network, the real-time traffic analysis comprising analysis of application data transported as part of the network traffic; evaluating an effect of modifying elastic network bandwidth allocation from a network service provider of the elastic cloud computing network, and an effect of applying network traffic optimizations in routing traffic flowing between the elastic cloud computing network and the edge appliance; and dynamically configuring, based on the real-time traffic analysis and on the evaluating, one or more of (i) elastic network bandwidth allocation from the network service provider or (ii) at least one network traffic optimization, of the network traffic optimizations, for performance by the edge appliance in routing traffic flowing between the elastic cloud computing network and the edge appliance.
Aspects of the above have advantages in that dynamic configuration and control of network features including elastic network bandwidth allocation and network traffic optimizations is provided to yield an optimized set of network feature configurations. Decisions are made in real-time about the dynamic configurations and can be made on an application-by-application basis.
The evaluating the effect of modifying the elastic network bandwidth allocation can include a consideration of bandwidth costs for different available bandwidth levels at different times of day, which has an advantage of enabling the system to determine how to minimize bandwidth costs by tailoring bandwidth levels for the different times of day.
The evaluating the effect of applying network traffic optimizations can include evaluating an effect of applying TCP optimization, including local acknowledgements of traffic receipt, and an effect of applying data compression. The dynamically configuring can include dynamically configuring the at least one network traffic optimization, the at least one network traffic optimization including one or more of the TCP optimization or the data compression. By considering both of these options (and possibly others), different possibilities are advantageously considered for the optimization(s) to put in place.
Evaluating the effect of applying the data compression can include a consideration of one or more of data rate or amount of time to compress data. This can inform whether it would be efficient to implement data compression given the latency added in doing so.
The application data may be exchanged as part of several distinct application data flows for several applications, where the real-time traffic analysis can include applying analytics against the several distinct application data flows in the network traffic flowing between the elastic cloud computing network and the edge appliance, and where the dynamically configuring can include determining one or more of the several distinct application data flows that would benefit from optimization and applying the one or more of TCP optimization or data compression to the one or more of the several distinct application data flows. This has an advantage of allowing network features to be adjusted on a per-application-flow basis, where particular configurations apply to particular application flows.
The dynamically configuring may be performed according to edge appliance policies configured by a user, the edge appliance policies setting parameters on determinations to configure the elastic network bandwidth allocation and the network traffic optimizations. This has an advantage of enabling users to apply prioritizations, thresholds, and the like in dictating when network features are to be adjusted and the adjustments to make for those features.
The performing real-time traffic analysis, the evaluating, and the dynamically configuring may be delivered as one or more virtualized processes executing on the edge appliance, which has an advantage of providing flexibility and re-configurability at the edge appliance rather than relying on static devices.
The performing real-time traffic analysis and the evaluating may be repeated periodically or aperiodically to dynamically determine and apply reconfigurations of one or more of the elastic network bandwidth allocation or network traffic optimization. The repeating has an advantage of providing for ongoing dynamic, real-time, automated adjustments to network features.
Additional features and advantages are realized through the concepts described herein.
Aspects described herein are particularly pointed out and distinctly claimed as examples in the claims at the conclusion of the specification. The foregoing and other objects, features, and advantages of the invention are apparent from the following detailed description taken in conjunction with the accompanying drawings in which:
Aspects described herein leverage elastic network technologies that provide for dynamic provisioning of wide area network bandwidth and transfer capability between sites. More particularly, aspects described herein facilitate dynamic configuration and control of network features including elastic network bandwidth allocation and network traffic optimizations to yield an optimized set of network feature configurations. The effects of elastic network bandwidth allocation modifications (bandwidth amount and timing of allocation) and different traffic optimizations, such as TCP optimization and network packet data compression, are evaluated and may be dynamically configured where appropriate in order to promote efficiency and minimize costs.
First site 102 includes a first application server 108 (i.e. a computer) hosting one or more applications, a first application database 110, a first storage area network (SAN) volume controller (SVC) 112 (i.e., a first storage resource), a first SAN switch 114 and a first edge appliance 116, which may be a router or other edge device, for example. In one embodiment, application server 108 or SVC 112 runs a data replication application that replicates data in first application database 110 from first SVC 112 via first SAN switch 114 and first edge appliance 116.
Management of elastic network bandwidth allocation is provided in the environment. A feature of the environment 100 is that one or more processes can determine and inform a dynamic network control application programming interface (API) 118 of the network service provider about when and how much bandwidth of an elastic cloud computing network 120 should be allocated for transfer of data, which transfer may utilize a dedicated channel to the second site 104 via network 120. In this example, network 120 is an optical network provided by network service provider 106. In one embodiment, optical network 120 is used as a WAN. In another embodiment, optical network 120 is a Multiprotocol Label Switching (MPLS) network and application server 108 utilizes a Fiber Channel over Ethernet EDU01 network interface to connect first SAN switch 114 and first edge appliance 116 to the MPLS network.
Dynamic network control API 118 is executed, in one example, by a transport device (not shown), that is managed by network service provider 106. Dynamic network control API 118 allows first SVC 112, second SVC 128, an edge appliance (116, 132), a PC 140, or any other component at site 102, 104, or another site to dynamically change bandwidth allocation from network service provider 106. This is leveraged in accordance with aspects described herein to optimize bandwidth allocation and usage, and therefore decrease the cost associated with transferring data using that bandwidth.
Second site 104 can include components similar to those of first site 102. Thus, in this example, second site similarly includes a second application server 122 (i.e., a computer), second application database 126, second SVC 128 (i.e., a second storage resource), second SAN switch 130, and a second edge appliance 132. In one embodiment, data is transferred from first site 102 to second site 104, i.e. from first SVC 112 via first SAN switch 114 and first edge appliance 116 over optical network 120 to second SVC 128 via second edge appliance 132 and second SAN switch 130. Data may be transferred similarly from second site 104 to first site 102.
Example edge appliances 116 and/or 132 include customer premise equipment (CPE), which may or may not be provided, owned, and/or managed by a provider of telecommunications services, e.g. network service provider 106, to sites 102 and 104. As noted previously, CPE has traditionally been static equipment providing fixed functionality. This hinders flexibility in the equipment and its functioning.
In accordance with aspects described herein, edge appliances such as CPE provide not only functionality for dynamic bandwidth control but also virtualized and programmable additional functions described herein to facilitate transfer of data and routing of traffic between the edge appliances and elastic networks. This can be leveraged to advantageously reduce or minimize bandwidth costs for data transfer.
Network bandwidth is controlled to optimize bandwidth use, lower bandwidth costs, and enhance productivity in terms of data transfer. This is done at least in part based on leveraging facilities disposed within edge appliance(s), such as CPE. As an example, edge appliance 132 in
The added flexibility of an elastic network advantageously allows processes described herein to consider potential bandwidth modifications and whether, based on some parameters, it would be most beneficial to dynamically provision additional bandwidth and/or implement network traffic optimizations, such as data compression or TCP optimizations. These dynamic configurations may be performed according to CPE policies specified by administrators or users that guide the determination about whether to invoke optimizations and/or change elastic bandwidth capability.
In a specific example, traffic analysis assesses data rates of application-specific traffic to determine whether one or more adjustments are to be made. If data rate is below a threshold, allocation of additional bandwidth, application of TCP optimizations, and compression of data each offer a potential to improve data rate. However, it may be best (most cost-efficient while keeping with quality of service specifications) to invoke only one such change instead of all of them. The edge appliance can include facilities for both evaluating the effects of modifying bandwidth allocation and applying network traffic optimization(s), and for dynamically configuring the bandwidth allocation and/or network traffic optimizations, if it is determined that one or more are to be applied.
In the specific example of
Edge appliance 132 (e.g. CPE) of enterprise site 104 is, in one example, owned or provided by network service provider 106, and in another example provided by another entity, such as another cloud services provider. CPE 132 includes virtualized processes for firewall, routing, bandwidth control, data compression, and traffic analysis. CPE 132 also includes CPE policies defined by a user directly or via another component, such as PC 140.
Dynamic bandwidth control functionality of CPE 132 configures elastic network bandwidth allocation via API 118. Input from the traffic analyzer component of CPE 132 is used in conjunction with the CPE policies to control one or more of bandwidth or traffic optimizations.
Accordingly, performance and analysis capabilities are incorporated into customer premise virtual appliance(s) to exploit dynamic network capabilities, such as dynamic elastic network control and dynamically implemented traffic optimizations. Features include:
In some examples, an edge appliance performs real-time traffic analysis on network traffic flowing between the elastic network and the edge appliance to determine one or more application data flows to which dynamic network configuration(s) are to be applied. The analysis can analyze the application data being transported as part of the network traffic, and more specifically as part of each distinct application flow, and also analyze the properties of the transfers of that application data, such as latency and other properties of the network traffic transporting the application data. Typical conventional routers focus on Internet Protocol (IP) header information to make routing decisions. Aspects described herein advantageously also examine application data payload (e.g. user data) to make optimization decisions. This also distinguishes from content-based routing that considers payload in the context determining a destination for the traffic, rather than determinations about optimization(s) to implement.
One type of dynamic network configuration is TCP optimization, which is an example network traffic optimization. Most applications rely on coordination through TCP-level responses. This works satisfactorily for some types of relatively short-session, interactive traffic. For other types of traffic, delay in receiving TCP-level responses has a significant impact on performance of the application because a lot of time is spent waiting for the responses to arrive. This is particularly detrimental to applications that rely on a significant amount of interaction. Some applications rely on hundreds of these line turnarounds for a single end user transaction, impacting the user's perception of performance when there is a wait for each response.
TCP optimization provides a local response. Referring to
A CPE in accordance with aspects described herein analyzes network traffic flowing through the CPE to identify the distinct application flows, dynamically determines based on this analysis which application flow(s), if any, to optimize with TCP optimization, and automatically configures the TCP optimization for those application flow(s). TCP optimization configurations can be automatically and periodically, based on a policy, reexamined and adjusted if desired. This is in contrast to, and offers advantages over, a user/administrator statically programming an optimization system to issue local responses based on user-recognized significant events.
Another form of network traffic optimization is data compression, which involves compressing data flowing across the CPE to reduce its size and therefore reduce total resources consumed in transferring the data. The data is decompressed on the receiving end. A cost of compressing/decompressing data is the additional time is takes to perform this processing, but the goal is for this added latency to cost less overall than transferring uncompressed data.
The real-time traffic analysis applied by the CPE as described herein can examine a plurality of application flows flowing through the CPE and use analytics to determine which (if any) of those flows would benefit from network traffic optimization—either TCP optimization and/or data compression in the examples described herein. Whether a particular transfer would benefit from network traffic optimization can consider the added cost of performing optimization against a measure of the cost associated with not invoking each optimization—for instance the cost of the latency in response time (when considering whether apply TCP optimization) or the cost of the added resource consumption to transfer uncompressed data (when considering whether to apply data compression). In addition, and based on that determination, the CPE can dynamically configure itself to perform TCP optimization and/or compression if it makes sense, in order to implement application flow optimization in real-time as the traffic flows over the network. Once an optimization is implemented, the application to the network traffic is accomplished via lower level analysis done packet-by-packet in real time to determine whether to send a response (in the case of TCP optimization) or compress/decompress the data of the packet (if data compression/decompression) is configured.
It is noted that the above functionality may be implemented at both ends of the traffic exchange, e.g. sites 102 and 104. In this regard, edge appliance 116 may incorporate the same or similar capabilities as described above with reference to edge appliance 132.
According to the above, real-time traffic analysis is used to evaluate the effects of implementing, removing, or tuning one or more network optimizations. There is an additional/alternative possibility of increasing/decreasing network bandwidth to address network throughput/efficiency. Like traffic optimizations, an increase in bandwidth can increases cost in one aspect (cost of additional bandwidth) but potentially decreases cost in another aspect (faster transfer times mean bandwidth is requested for a shorter duration of time). Thus, in addition to considering network traffic optimizations, an effect of modifying elastic network bandwidth allocation is also evaluated to determine whether it would be most cost effective to (at least temporarily) adjust bandwidth as an alternative to, or in conjunction with, an adjustment to network traffic optimization(s). It may be efficient to incur added costs of temporarily increasing bandwidth to complete a data transfer sooner, for instance, or it may be acceptable to increase latency by decreasing bandwidth if the cost saved by doing so outweighs the impact (if any) on application usage. As another example, data compression and/or TCP optimization may not sufficiently address a traffic concern, necessitating a bandwidth adjustment. Certain forms of traffic (some video files, voice data that is already compressed using a codec, encrypted data, unstructured data) may not compress well and therefore compression may not provide any benefit.
Accordingly, an optimum or desirable configuration across the available network traffic optimization(s) (on, off, and/or parameters tuned) and bandwidth level utilized for data transfer is sought. If during an off-peak period when bandwidth cost is lower, it may be more efficient to increase elastic bandwidth allocation instead of performing network traffic optimization(s) that add latency. The available configurations for each of these optimizations and bandwidth allocation (bandwidth levels and different times of day) may be periodically or aperiodically considered, and a set of configurations implemented. Traffic analysis is performed and decisions are made as to whether to apply zero or more of, e.g., TCP optimizations, data compression, or bandwidth allocation adjustment. Although it may be decided to not implement each or even any of these, at least an evaluation of each (e.g. the costs associated with each) is considered to determine the proper mix. More generally, the traffic is examined and the best method for utilizing the link is determined.
As noted above, some or all functioning of the CPE described herein may be implemented as virtualized processes rather than one or more discrete pieces of static equipment. This provides flexibly over conventional approaches. The functioning can be incorporated into common hardware serving as an edge appliance. Virtualizing these functions also provides flexibility for reconfiguration by PC 140 or another device. PC 140 may therefore be in communication with not only the network service provider 106 via API 118 to adjust bandwidth allocation in some examples, but also with CPE 132. PC 140 can also be used to set the CPE policy for controlling the network traffic and bandwidth optimizations described herein. The CPE policies can dictate the decision making about what traffic and bandwidth optimizations to apply to given circumstances. Different sites may have different priorities, capabilities, network fee schedules, and the like. One site might emphasize transfer speed in which increased bandwidth allocation is highly prioritized over network traffic optimization. Another site might be subject to very high bandwidth rates and therefore include policies that cap bandwidth at a given Mbps in favor of traffic optimizations. Policies can dictate optimizations based on thresholds, for example a policy can dictate that bandwidth is to be increased when the added cost falls below a particular cost per gigabit. The policies can be specified and modified by an administrator or user, as an example. Additionally or alternatively, a policy may be automatically tuned based on machine learning, for instance historical trends on bandwidth usage and bandwidth pricing, data compression ratios experienced for given types of data, or response times associated with TCP, as examples. In this manner, the appliance can train itself to recognize which optimizations/bandwidth levels are beneficial given the circumstances.
In some examples, the data being transferred from a site (102 or 104) is transferred to another site (102 or 104) as part of a backup or disaster recovery process. In other examples, the data being transferred from a site across the network is application traffic to one or more sites/destinations, though it is recognized that aspects described herein apply more generally to any type of traffic that traverses an elastic network.
Prior to or after deploying the CPE hardware, the CPE software is deployed, an example process for which is presented with reference to
An example of traffic analysis (
The process continues with the edge appliance evaluating effect(s) of network feature adjustments (604), for instance an effect of modifying elastic network bandwidth allocation from a network service provider of the elastic cloud computing network, and an effect of applying network traffic optimizations in routing traffic flowing between the elastic cloud computing network and the edge appliance. Evaluating the effect of modifying the elastic network bandwidth allocation can include a consideration of bandwidth costs for different available bandwidth levels at different times of day. This can be used in conjunction with scheduling and other considerations to decide whether it would be advantageous to delay/schedule a transfer for a later time. There are tradeoffs between transferring at an earlier time (i.e. at a higher cost) versus transferring at a later time (i.e. off-peak, at a lower cost). Edge appliance policies can specify how those factors weigh against each other to inform the decision about what to do. This has an advantage of enabling the system to determine how to minimize bandwidth costs by tailoring bandwidth levels for the different times of day.
Evaluating the effect of applying network traffic optimizations can include evaluating an effect of applying the TCP optimization and an effect of applying the data compression. By considering both of these options (and possibly others), the process advantageously considers different possibilities for optimization(s) to put in place. In the specific example of evaluating the effect of applying the data compression, this can include a consideration of one or more of data rate or amount of time to compress data. This can inform whether it would be efficient to implement data compression given the latency added in doing so.
The process continues with the edge appliance dynamically configuring, based on the real-time traffic analysis and on the evaluating, one or more of (i) elastic network bandwidth allocation from the network service provider or (ii) at least one network traffic optimization, of the network traffic optimizations, for performance by the edge appliance in routing traffic flowing between the elastic cloud computing network and the edge appliance (606). Thus, one or more of the considered network feature adjustments are dynamically configured. In an example where the dynamically configuring includes dynamically configuring the elastic network bandwidth allocation, this configuring increases bandwidth of the elastic network. Additionally or alternatively, the dynamically configuring can include dynamically configuring the at least one network traffic optimization, including one or more of TCP optimization, including local acknowledgements of traffic receipt, or data compression.
As noted, the dynamically configuring can be performed according to edge appliance policies configured by a user and that set parameters on the determinations about whether to configure the elastic network bandwidth allocation and the network traffic optimizations. In this manner, users can advantageously apply prioritizations, thresholds, and the like in dictating when network features are to be adjusted and the adjustments to make for those features.
Periodically or aperiodically, the edge appliance can repeat the performing real-time traffic analysis and the evaluating to dynamically determine and apply reconfigurations of one or more of the elastic network bandwidth allocation or network traffic optimization. Thus, the edge appliance determines whether the process is to continue with such an iteration (608), and returns to 602 if so, otherwise the process ends. The repeating has an advantage of providing for ongoing dynamic, real-time, automated adjustments to network features.
In one embodiment, the application data is exchanged as part of several distinct application data flows for several applications and the real-time traffic analysis includes the edge appliance applying analytics against the several distinct application data flows in the network traffic flowing between the elastic cloud computing network and the edge appliance. In this manner, the traffic optimization(s) performed for one application flow may vary from the optimization(s) performed for another application flow. Thus, the dynamically configuring can include determining one or more of the several distinct application data flows that would benefit from optimization and applying the one or more of TCP optimization or data compression to the one or more of the several distinct application data flows. This advantageously allows network features to be adjusted on a per-application-flow basis, where particular configurations apply to particular application flows. A higher priority application flow can be given priority through adjustments being applied to traffic of that application flow, for example.
Performance of the real-time traffic analysis, the evaluating, and the dynamically configuring may be delivered as one or more virtualized processes executing on the edge appliance. This has an advantage of providing flexibility and re-configurability at the edge appliance rather than relying on static devices. In some examples, the edge appliance includes additional virtualized processes for firewall functionality and routing functionality.
Processes described herein may be performed singly or collectively by one or more computer systems, such as computer system(s) described below with reference to
Computer system 700 is suitable for storing and/or executing program code and includes at least one processor 702 coupled directly or indirectly to memory 704 through, e.g., a system bus 720. In operation, processor(s) 702 obtain from memory 704 one or more instructions for execution by the processors. Memory 704 may include local memory employed during actual execution of the program code, bulk storage, and cache memories which provide temporary storage of at least some program code in order to reduce the number of times code must be retrieved from bulk storage during program code execution. A non-limiting list of examples of memory 704 includes a hard disk, a random access memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or Flash memory), an optical fiber, a portable compact disc read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the foregoing. Memory 704 includes an operating system 705 and one or more computer programs 706, for instance programs to perform aspects described herein.
Input/Output (I/O) devices 712, 714 (including but not limited to displays, microphones, speakers, accelerometers, gyroscopes, magnetometers, light sensors, proximity sensors, GPS devices, cameras, etc.) may be coupled to the system either directly or through I/O controllers 710.
Network adapters 708 may also be coupled to the system to enable the computer system to become coupled to other computer systems, storage devices, or the like through intervening private or public networks. Ethernet-based (such as Wi-Fi) interfaces and Bluetooth® adapters are just examples of the currently available types of network adapters 708 used in computer system.
Computer system 700 may be coupled to storage 716 (e.g., a non-volatile storage area, such as magnetic disk drives, optical disk drives, a tape drive, etc.), having one or more databases. Storage 716 may include an internal storage device or an attached or network accessible storage. Computer programs in storage 716 may be loaded into memory 704 and executed by a processor 702 in a manner known in the art.
The computer system 700 may include fewer components than illustrated, additional components not illustrated herein, or some combination of the components illustrated and additional components. Computer system 700 may include any computing device known in the art, such as a mainframe, server, personal computer, workstation, laptop, handheld or mobile computer, tablet, wearable device, telephony device, network appliance (such as an edge appliance), virtualization device, storage controller, etc.
Referring to
The present invention may be a system, a method, and/or a 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 can 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 device, a magnetic storage device, an optical storage device, an electromagnetic storage device, a semiconductor storage device, 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 device 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 the user's computer, partly on the user's computer, as a stand-alone software package, partly on the user's computer and partly on a remote computer or entirely on the remote computer or server. In the latter scenario, the remote computer may be connected to the 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 are 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, can 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.
The flowchart and block diagrams in the Figures illustrate the architecture, functionality, and operation of possible implementations of systems, methods, and computer program products according to various embodiments of the present invention. In this regard, each block in the flowchart or block diagrams may represent a module, segment, or portion of instructions, which comprises one or more executable instructions for implementing the specified logical function(s). 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 illustration, and combinations of blocks in the block diagrams and/or flowchart illustration, can be implemented by special purpose hardware-based systems that perform the specified functions or acts or carry out combinations of special purpose hardware and computer instructions.
The terminology used herein is for the purpose of describing particular embodiments only and is not intended to be limiting. As used herein, the singular forms “a”, “an” and “the” are intended to include the plural forms as well, unless the context clearly indicates otherwise. It will be further understood that the terms “comprises” and/or “comprising”, when used in this specification, 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.
The corresponding structures, materials, acts, and equivalents of all means or step plus function elements in the claims below, if any, are intended to include any structure, material, or act for performing the function in combination with other claimed elements as specifically claimed. The description of one or more embodiments has been presented for purposes of illustration and description, but is not intended to be exhaustive or limited to in the form disclosed. Many modifications and variations will be apparent to those of ordinary skill in the art. The embodiment was chosen and described in order to best explain various aspects and the practical application, and to enable others of ordinary skill in the art to understand various embodiments with various modifications as are suited to the particular use contemplated.
Number | Name | Date | Kind |
---|---|---|---|
4144414 | Nicholas | Mar 1979 | A |
5689508 | Lyles | Nov 1997 | A |
5917822 | Lyles et al. | Jun 1999 | A |
6118764 | Depelteau et al. | Sep 2000 | A |
6205477 | Johnson et al. | Mar 2001 | B1 |
6389432 | Srinivas et al. | May 2002 | B1 |
6418139 | Akhtar | Jul 2002 | B1 |
6438581 | Neuhauser et al. | Aug 2002 | B1 |
6456630 | Packer et al. | Sep 2002 | B1 |
6563829 | Lyles et al. | May 2003 | B1 |
6594279 | Nguyen et al. | Jul 2003 | B1 |
6738348 | Rollins | May 2004 | B1 |
6788646 | Fodor et al. | Sep 2004 | B1 |
6937566 | Forslow | Aug 2005 | B1 |
7089294 | Baskey et al. | Aug 2006 | B1 |
7103906 | Katz | Sep 2006 | B1 |
7225223 | McCarthy et al. | May 2007 | B1 |
7317684 | Fodor et al. | Jan 2008 | B2 |
7542420 | Mokhtar et al. | Jun 2009 | B1 |
7590746 | Slater | Sep 2009 | B2 |
7685310 | Ueoka et al. | Mar 2010 | B2 |
7808918 | Bugenhagen | Oct 2010 | B2 |
7844967 | Kelly | Nov 2010 | B2 |
7983299 | Ma | Jul 2011 | B1 |
8412824 | Schiff | Apr 2013 | B1 |
8464335 | Sinha et al. | Jun 2013 | B1 |
8660008 | Babiarz et al. | Feb 2014 | B2 |
8762505 | Kutan et al. | Jun 2014 | B2 |
8767547 | Adams | Jul 2014 | B2 |
8788690 | Short et al. | Jul 2014 | B2 |
8793343 | Sorenson, III et al. | Jul 2014 | B1 |
8799320 | Chan et al. | Aug 2014 | B2 |
8873753 | Parker | Oct 2014 | B2 |
8937865 | Kumar et al. | Jan 2015 | B1 |
9026671 | Gillies et al. | May 2015 | B2 |
9065752 | Chetlur et al. | Jun 2015 | B2 |
9172771 | Gross et al. | Oct 2015 | B1 |
9188744 | Peng et al. | Nov 2015 | B1 |
9207993 | Jain | Dec 2015 | B2 |
9330156 | Satapathy | May 2016 | B2 |
9495251 | Kottomtharayil | Nov 2016 | B2 |
9535776 | Klose | Jan 2017 | B2 |
9596144 | Anderson | Mar 2017 | B2 |
10148579 | Adams | Dec 2018 | B2 |
20020049841 | Johnson | Apr 2002 | A1 |
20020101869 | Garcia-Luna-Aceves et al. | Aug 2002 | A1 |
20020112113 | Karpoff et al. | Aug 2002 | A1 |
20020124262 | Basso et al. | Sep 2002 | A1 |
20020133613 | Teng et al. | Sep 2002 | A1 |
20020144174 | Nwabueze | Oct 2002 | A1 |
20020181394 | Partain et al. | Dec 2002 | A1 |
20020194324 | Guha | Dec 2002 | A1 |
20030021338 | Mazzoni | Jan 2003 | A1 |
20030037061 | Sastri et al. | Feb 2003 | A1 |
20030069963 | Jayant et al. | Apr 2003 | A1 |
20030069972 | Yoshimura et al. | Apr 2003 | A1 |
20030072327 | Fodor et al. | Apr 2003 | A1 |
20030110263 | Shillo | Jun 2003 | A1 |
20030120666 | Tacaille et al. | Jun 2003 | A1 |
20030126132 | Kavuri et al. | Jul 2003 | A1 |
20030142692 | Shimada | Jul 2003 | A1 |
20030161300 | Malik | Aug 2003 | A1 |
20030172130 | Fruchtman et al. | Sep 2003 | A1 |
20030202477 | Zhen et al. | Oct 2003 | A1 |
20040030620 | Benjamin et al. | Feb 2004 | A1 |
20040098671 | Graham et al. | May 2004 | A1 |
20040136379 | Liao et al. | Jul 2004 | A1 |
20040198360 | Kotzin | Oct 2004 | A1 |
20040199566 | Carlson et al. | Oct 2004 | A1 |
20040215644 | Edwards, Jr. et al. | Oct 2004 | A1 |
20040215749 | Tsao | Oct 2004 | A1 |
20040246972 | Wang et al. | Dec 2004 | A1 |
20040267897 | Hill et al. | Dec 2004 | A1 |
20050033935 | Manbert et al. | Feb 2005 | A1 |
20050125593 | Karpoff et al. | Jun 2005 | A1 |
20050129000 | Sivakumar et al. | Jun 2005 | A1 |
20050154841 | Sastri et al. | Jul 2005 | A1 |
20050262509 | Kelly | Nov 2005 | A1 |
20050027345 | Clark et al. | Dec 2005 | A1 |
20050289618 | Hardin | Dec 2005 | A1 |
20060039381 | Anschutz et al. | Feb 2006 | A1 |
20060120282 | Carlson et al. | Jun 2006 | A1 |
20060129562 | Pulamarasetti et al. | Jun 2006 | A1 |
20060153070 | DelRegno et al. | Jul 2006 | A1 |
20060171390 | LaJoie | Aug 2006 | A1 |
20060206682 | Manbert et al. | Sep 2006 | A1 |
20060209856 | Tojo et al. | Sep 2006 | A1 |
20060218369 | Fujino | Sep 2006 | A1 |
20060248231 | O'Rourke et al. | Nov 2006 | A1 |
20060265558 | Fujino | Nov 2006 | A1 |
20070022264 | Bromling et al. | Jan 2007 | A1 |
20070065078 | Jiang | Mar 2007 | A1 |
20070106798 | Masumitsu | May 2007 | A1 |
20070195765 | Heissenbuttel et al. | Aug 2007 | A1 |
20070198627 | Bozionek et al. | Aug 2007 | A1 |
20080109450 | Clark et al. | May 2008 | A1 |
20080115144 | Tsao | May 2008 | A1 |
20080126525 | Ueoka et al. | May 2008 | A1 |
20080140850 | Gade et al. | Jun 2008 | A1 |
20080189718 | Gulley et al. | Aug 2008 | A1 |
20080259798 | Loh | Oct 2008 | A1 |
20080320097 | Sawicki et al. | Dec 2008 | A1 |
20090007199 | JaJoie | Jan 2009 | A1 |
20090061853 | Anschutz | Mar 2009 | A1 |
20090100163 | Tsao | Apr 2009 | A1 |
20090172782 | Taglienti et al. | Jul 2009 | A1 |
20090187668 | Arendt et al. | Jul 2009 | A1 |
20090204711 | Binyamin | Aug 2009 | A1 |
20090217326 | Hasek | Aug 2009 | A1 |
20090240867 | Shibayama et al. | Sep 2009 | A1 |
20090271589 | Karpoff et al. | Oct 2009 | A1 |
20100118883 | Jones et al. | May 2010 | A1 |
20100257602 | Kettler et al. | Oct 2010 | A1 |
20100268632 | Rosenthal | Oct 2010 | A1 |
20100274656 | Genschel | Oct 2010 | A1 |
20100306382 | Cardosa | Dec 2010 | A1 |
20100306445 | Dake | Dec 2010 | A1 |
20100332401 | Prahlad et al. | Dec 2010 | A1 |
20110004550 | Giordano et al. | Jan 2011 | A1 |
20110022697 | Huh | Jan 2011 | A1 |
20110078227 | McAloon et al. | Mar 2011 | A1 |
20110083037 | Bocharov et al. | Apr 2011 | A1 |
20110125889 | Tsao | May 2011 | A1 |
20110149972 | Hori et al. | Jun 2011 | A1 |
20110158653 | Mazed | Jun 2011 | A1 |
20110208710 | Lesavich | Aug 2011 | A1 |
20110218770 | Li | Sep 2011 | A1 |
20110282928 | Ball et al. | Nov 2011 | A1 |
20110293278 | Mazed | Dec 2011 | A1 |
20120023545 | Qu | Jan 2012 | A1 |
20120063353 | Schlenk | Mar 2012 | A1 |
20120072600 | Richardson et al. | Mar 2012 | A1 |
20120109705 | Belady et al. | May 2012 | A1 |
20120131309 | Johnson | May 2012 | A1 |
20120137173 | Burshan et al. | May 2012 | A1 |
20120180080 | LaJoie | Jul 2012 | A1 |
20120201130 | Liv et al. | Aug 2012 | A1 |
20120210381 | Ozawa | Aug 2012 | A1 |
20120216259 | Okamoto et al. | Aug 2012 | A1 |
20120246638 | He et al. | Sep 2012 | A1 |
20120275428 | Feng et al. | Nov 2012 | A1 |
20120331221 | Cho | Dec 2012 | A1 |
20130003538 | Greenberg et al. | Jan 2013 | A1 |
20130007254 | Fries | Jan 2013 | A1 |
20130031258 | Mukai et al. | Jan 2013 | A1 |
20130081014 | Kadatch | Mar 2013 | A1 |
20130117766 | Bax et al. | May 2013 | A1 |
20130121268 | Li et al. | May 2013 | A1 |
20130136101 | Guo | May 2013 | A1 |
20130185404 | Patel et al. | Jul 2013 | A1 |
20130204963 | Boss et al. | Aug 2013 | A1 |
20130205002 | Wang et al. | Aug 2013 | A1 |
20130212282 | Puller | Aug 2013 | A1 |
20130212422 | Bauer et al. | Aug 2013 | A1 |
20130227009 | Padmanaban et al. | Aug 2013 | A1 |
20130242903 | Narkar | Sep 2013 | A1 |
20130254383 | Wray | Sep 2013 | A1 |
20130254407 | Pijewski | Sep 2013 | A1 |
20130268672 | Justafort | Oct 2013 | A1 |
20130268799 | Mestery et al. | Oct 2013 | A1 |
20130282795 | Tsao | Oct 2013 | A1 |
20140040343 | Nickolov et al. | Feb 2014 | A1 |
20140056371 | Ji et al. | Feb 2014 | A1 |
20140057592 | Chetlur | Feb 2014 | A1 |
20140068076 | Dasher et al. | Mar 2014 | A1 |
20140075029 | Lipchuk | Mar 2014 | A1 |
20140082301 | Barton et al. | Mar 2014 | A1 |
20140082681 | Brown et al. | Mar 2014 | A1 |
20140089510 | Hao et al. | Mar 2014 | A1 |
20140098685 | Shattil | Apr 2014 | A1 |
20140101316 | Lee et al. | Apr 2014 | A1 |
20140115189 | Ao et al. | Apr 2014 | A1 |
20140129819 | Huang et al. | May 2014 | A1 |
20140164641 | Ye et al. | Jun 2014 | A1 |
20140180664 | Kochunni et al. | Jun 2014 | A1 |
20140188801 | Ramakrishnan et al. | Jul 2014 | A1 |
20140207968 | Kumar et al. | Jul 2014 | A1 |
20140233587 | Liv et al. | Aug 2014 | A1 |
20140244835 | Lopez Alvarez | Aug 2014 | A1 |
20140258535 | Zhang | Sep 2014 | A1 |
20140281015 | Orona et al. | Sep 2014 | A1 |
20140289205 | Soichi | Sep 2014 | A1 |
20140344879 | Phillips et al. | Nov 2014 | A1 |
20140365658 | Lang et al. | Dec 2014 | A1 |
20150006614 | Suryanarayanan | Jan 2015 | A1 |
20150019740 | Zhao | Jan 2015 | A1 |
20150026793 | Li | Jan 2015 | A1 |
20150046960 | Hardin | Feb 2015 | A1 |
20150067093 | Sawicki et al. | Mar 2015 | A1 |
20150067744 | Furtwangler | Mar 2015 | A1 |
20150082362 | Hasek | Mar 2015 | A1 |
20150092590 | Zhu et al. | Apr 2015 | A1 |
20150117198 | Menezes et al. | Apr 2015 | A1 |
20150127805 | Htay et al. | May 2015 | A1 |
20150134731 | Wang et al. | May 2015 | A1 |
20150134830 | Popa | May 2015 | A1 |
20150156204 | Resch | Jun 2015 | A1 |
20150172070 | Csaszar | Jun 2015 | A1 |
20150195173 | Gupta et al. | Jul 2015 | A1 |
20150222445 | Iyer et al. | Aug 2015 | A1 |
20150234636 | Barnes, Jr. | Aug 2015 | A1 |
20150235308 | Mick et al. | Aug 2015 | A1 |
20150256654 | Oguchi | Sep 2015 | A1 |
20150288919 | Labosco | Oct 2015 | A1 |
20150339169 | Siddiqui et al. | Nov 2015 | A1 |
20160066261 | Nasielski et al. | Mar 2016 | A1 |
20160110132 | Wei et al. | Apr 2016 | A1 |
20160112327 | Morris et al. | Apr 2016 | A1 |
20160156538 | Yalagandula et al. | Jun 2016 | A1 |
20160197835 | Luft | Jul 2016 | A1 |
20160197848 | Bhide | Jul 2016 | A1 |
20160212063 | Calvo | Jul 2016 | A1 |
20160231948 | Gupta et al. | Aug 2016 | A1 |
20160256775 | Gustafson et al. | Sep 2016 | A1 |
20160277468 | Rodbro et al. | Sep 2016 | A1 |
20160316379 | Ottur et al. | Oct 2016 | A1 |
20170076057 | Burton | Mar 2017 | A1 |
20170090773 | Vijayan | Mar 2017 | A1 |
20170093639 | Dabbagh | Mar 2017 | A1 |
20170099211 | Iovanna et al. | Apr 2017 | A1 |
20180062943 | Djukic et al. | Mar 2018 | A1 |
Number | Date | Country |
---|---|---|
103747023 | Apr 2014 | CN |
2014021839 | Feb 2014 | WO |
Entry |
---|
Office Action in U.S. Appl. No. 14/731,834, dated Apr. 19, 2017, pp. 1-22. |
Office Action in U.S. Appl. No. 14/952,466, dated Jun. 26, 2017, pp. 1-35. |
Hwang et al., “Design and Implementation of an iLVM Mechanism for Remote Mirror”, Kuasir College of Electrical Engineering and Computer Science, Department of Electrical Engineering, Journal of Internet Technology, 7(2), Apr. 2006, pp. 169-176. |
XRoads Networks, “Dynamic Bandwidth Management”, retrieved from internet Nov. 11, 2014, http://dualwanfirewalls.com/ubm/solutions/dynamic_bandwidth_control.xrn, pp. 1-4. |
IBM, Internal Model for Dynamically-Virtualizing the Storage of Data Between a RAID-6 and a Mirror, IP.com, No. 000160533, Nov. 19, 2007, pp. 1-5. |
Weil, Reliable, Scalable, and High-Performance Distributed Storage: Distributed Object Storage, IP.com, No. 000234957, Feb. 19, 2014, pp. 1-11. |
List of IBM Patents or Patent Applications Treated as Related, Dec. 1, 2015, pp. 1-2. |
Notice of Allowance in U.S. Appl. No. 14/952,456, dated Sep. 15, 2017, pp. 1-14. |
Office Action in U.S. Appl. No. 14/952,469, dated Oct. 3, 2017, pp. 1-51. |
List of IBM Patents or Patent Applications Treated as Related, Dec. 14, 2017, pp. 1-2. |
Elali, H., San Zone Reuse in Port Allocation, https://coprhd.atlassian.net/wiki/spaces/COP/pages/8618000/SAN+Zone+Reuse+in+Port+Allocation, Oct. 15, 2015 (6 pages). |
Office Action in U.S. Appl. No. 14/952,449, dated Jul. 25, 2017, pp. 1-41. |
Office Action in U.S. Appl. No. 14/952,456, dated May 17, 2017, pp. 1-25. |
Office Action in U.S. Appl. No. 14/952,463, dated May 22, 2017, pp. 1-27. |
Number | Date | Country | |
---|---|---|---|
20170149608 A1 | May 2017 | US |