Methods for managing traffic in a multi-service environment and devices thereof

Description

This application claims priority from U.S. Provisional Application No. 61/360,049, filed Jun. 30, 2010 and hereby incorporates by reference the entirety of that application.

FIELD

This technology generally relates to methods and devices for traffic management and, more particularly, to methods for managing traffic balancing in a multi-service environment and devices thereof.

BACKGROUND

When making load balancing decisions, a traffic management device will determine a global traffic management or capacity score (gtm_score) for the system. Currently, this capacity score is determined by selecting a minimum score among all modules (APM, WOM, WAM and ASM) configured in a virtual service in the device.

Unfortunately, this calculated capacity score only represents the services used by a front virtual service in the device and does not consider any inner virtual services used behind the front virtual service. When the front virtual service uses other inner virtual services, this calculated capacity score is not an accurate representation of capacity resulting in ineffective load balancing.

SUMMARY

A method for managing traffic in a multi-service environment including determining with a traffic management device a self score for a front virtual service which is coupled to one or more inner virtual services. An aggregate score for the front virtual service is determined with the traffic management device based on an aggregate score for each of the one or more inner virtual services and a number of connections between each of the one or more inner virtual services and the front virtual service. An advertised score for the front virtual service for load balancing is obtained with the traffic management device based on the determined self score and the determined aggregate score.

A computer readable medium having stored thereon instructions for managing traffic in a multi-service environment comprising machine executable code which when executed by at least one processor, causes the processor to perform steps including determining a self score for a front virtual service which is coupled to one or more inner virtual services. An aggregate score for the front virtual service is determined based on an aggregate score for each of the one or more inner virtual services and a number of connections between each of the one or more inner virtual services and the front virtual service. An advertised score for the front virtual service for load balancing is obtained based on the determined self score and the determined aggregate score.

A traffic management device includes a memory coupled to one or more processors configured to execute programmed instructions stored in the memory including determining a self score for a front virtual service which is coupled to one or more inner virtual services. An aggregate score for the front virtual service is determined based on an aggregate score for each of the one or more inner virtual services and a number of connections between each of the one or more inner virtual services and the front virtual service. An advertised score for the front virtual service for load balancing is obtained based on the determined self score and the determined aggregate score.

This technology provides a number of advantages including providing more effective methods, computer readable medium and devices for managing traffic when multiple services are being provided. With this technology, a score representative of a current load on a system with multiple layered virtual systems can be determined and provided for load balancing decisions.

BRIEF DESCRIPTION OF THE DRAWINGS

FIG. 1 is an exemplary block diagram of a network environment with an exemplary traffic management device;

FIG. 2 is a functional block diagram of the exemplary traffic management device with multiple virtual services;

FIG. 3 is a flow chart of an exemplary method for managing traffic when multiple services are being provided;

FIG. 4 is an exemplary of virtual service names, service component or inner virtual service names, and component or internal aggregate scores; and

FIG. 5 is an exemplary table of service names, time stamps, self scores, aggregate scores and advertised scores.

DETAILED DESCRIPTION

A network environment 10 with an exemplary traffic management device 12 for managing traffic when multiple services are being provided is illustrated in FIGS. 1 and 2. The exemplary network environment 10 includes the traffic management device 12, client computing devices 14(1)-14(n), server devices 16(1)-16(n), and a communication network 18, although the environment could include other types and numbers of systems, devices, blades, components, elements, and communication networks in other configurations. This technology provides a number of advantages including providing more effective methods, computer readable medium and devices for managing traffic when multiple services are being provided. With this technology a score representative of a current load on a system with multiple layered virtual systems can be determined and provided for load balancing decisions.

Referring more specifically to FIGS. 1 and 2, the traffic management device 12 includes at least one central processing unit (CPU) or processor 20, at least one memory 22, and an interface unit 24 which are coupled together by a bus 26 or other numbers and types of links, although the traffic management device could comprise other numbers and types of systems, devices, blades, components and elements in other configurations could be used. The network traffic management device 12 can implement multiple numbers and layers of virtual services.

The central processing unit (CPU) or processor 20 executes a program of stored instructions for one or more aspects of the technology as described herein. The memory 22 stores these programmed instructions for one or more aspects of the technology as described herein, although some or all of the programmed instructions could be stored and/or executed elsewhere. A variety of different types of memory storage devices, such as a random access memory (RAM) or a read only memory (ROM) in the system or a floppy disk, hard disk, CD ROM, DVD ROM, or other computer readable medium which is read from and/or written to by a magnetic, optical, or other reading and/or writing system that is coupled to the processor 20, can be used for the memory 22. The interface unit 24 is used to operatively couple data communications between one or more of the client computing devices 14(1)-14(n) and one or more of the server devices 16(1)-16(n), although other types and numbers of systems, devices, blades, components, and elements could be coupled together, such as one or more storage devices.

Each of the client computing devices 14(1)-14(n) and server devices 16(1)-16(n) include a central processing unit (CPU) or processor, a memory, and an interface or I/O system, which are coupled together by a bus or other link, although other numbers and types of network devices could be used. The client computing devices 14(1)-14(n), in this example, may run interface applications, such as Web browsers, that may provide an interface to make requests for and send data to server devices 16(1)-16(n). Generally, server devices 16(1)-16(n) process requests received from requesting client computing devices 14(1)-14(n). A series of applications may run on the server devices 16(1)-16(n) that allow the transmission of data, such as a data file or metadata, requested by the client computing devices 14(1)-14(n). The server devices 16(1)-16(n) may provide data or receive data in response to requests directed toward the respective applications on the server devices 16(1)-16(n) from the client computing devices 14(1)-14(n). Although server devices 16(1)-16(n) are shown, one or more of the server devices 16(1)-16(n) may be implemented as one or more software modules or other sets of programmed instructions and other types and numbers of devices could be coupled to the traffic management device 12.

The communication network 18 is a communication network which uses TCP/IP over Ethernet and industry-standard protocols, including SOAP, XML, LDAP, and SNMP, although other types and numbers of communication networks, such as a direct connection, a local area network, a wide area network, modems and phone lines, e-mail, and wireless communication technology, each having their own communications protocols, can be used.

Although an exemplary environment with the traffic management device 12, the client computing devices 14(1)-14(n), the server devices 16(1)-16(n), and the communication network 18 are described and illustrated herein, other types and numbers of systems, devices, blades, components, elements and communication networks in other configurations can be used. It is to be understood that the systems of the examples described herein are for exemplary purposes, as many variations of the specific hardware and software used to implement the examples are possible, as will be appreciated by those skilled in the relevant art(s).

Furthermore, each of the systems of the examples may be conveniently implemented using one or more general purpose computer systems, microprocessors, digital signal processors, and micro-controllers, programmed according to the teachings of the examples, as described and illustrated herein, and as will be appreciated by those ordinary skill in the art.

In addition, two or more computing systems or devices can be substituted for any one of the systems in any example. Accordingly, principles and advantages of distributed processing, such as redundancy and replication also can be implemented, as desired, to increase the robustness and performance of the devices and systems of the examples. The examples may also be implemented on computer system or systems that extend across any suitable network using any suitable interface mechanisms and communications technologies, including by way of example only telecommunications in any suitable form (e.g., voice and modem), wireless communications media, wireless communications networks, cellular communications networks, G3 communications networks, Public Switched Telephone Network (PSTNs), Packet Data Networks (PDNs), the Internet, intranets, and combinations thereof.

The examples may also be embodied as a computer readable medium having instructions stored thereon for one or more aspects of the technology as described and illustrated by way of the examples herein, which when executed by a processor, cause the processor to carry out the steps necessary to implement the methods of the examples, as described and illustrated herein.

An exemplary method for managing traffic in a multi-service environment when multiple services are being provided will now be described below with reference to FIGS. 1-5. Referring more specifically to FIG. 2, in this particular example the network traffic management device 12 has a front virtual service (FVS1) coupled to two inner virtual services 1 and 2 (IVS1 and IVS2) with forty connections (C1) between FSV1 and IVS1 and sixty connections (C2) between FSV1 and (IVS2), although other types and numbers of virtual services with other numbers of connections could be implemented. Additionally, in this particular example, inner virtual service 1 (IVS1) is coupled to three service components or modules (APM1, WAM1, and a layering iRule) by fifteen, five, and twenty connections (C3, C4, and C5) respectively, and inner virtual service 2 (IVS2) is coupled to three service components (APM2, WAM2, and compression card) by twenty, ten, and thirty connections (C6, C7, and C8) respectively, although other types, numbers, and layers of virtual services and service components with other numbers of connections can be utilized.

The service components are illustrated by way of example only and other types and numbers of service components could be used, such as WOM, LTM, ASM, a processor, an ASIC/FPGA or any other hardware component. As explained herein, each of these service components can compute its own service specific score in a component specific fashion, although other arrangements could be used such as having the traffic management device 12 programmed with instructions to determine a score for each service component.

In this particular example, the advertised score or global traffic management score (gtm_score) ranges from 0 representing no capacity to 100 representing full capacity, although other ranges and types of scoring or other indicators to identify available capacity could be used. With this technology, the advertised score, which represents available capacity for load balancing, takes into account multiple layered inner virtual services because a self score calculated based on the front virtual service alone would not provide the correct available capacity.

Referring to FIGS. 1-5, in step 100, the traffic management device 12 obtains a request for the advertised score for a front virtual service (FVS1) for load balancing, although the request could be for other types and numbers of scores and other data. In response to this received request, the traffic management device 12 obtains the advertised score for the front virtual service (FVS1) and for the next layer of inner virtual services 1 and 2 (IVS1 and IVS2) from a stored table illustrated in FIG. 5, although the advertised score can be obtained from other sources in other manners.

In step 102, the traffic management device 12 determines whether a first set period of time starting from any of the obtained time stamps for the requested advertised scores for the front virtual service (FVS1) and for the inner virtual services 1 and 2 (IVS1 and IVS2) from table 5 in memory in the traffic management device 12 has expired. In this particular example, the table illustrated in FIG. 5 includes the recorded time stamp comprising the time and date when each of the advertised scores was last determined by the traffic management device 12 for the front virtual service (FVS1) and for the inner virtual services 1 and 2 (IVS1 and IVS2). This first set time period can be adjusted by the traffic management device 12 as needed. If in step 102, the traffic management device 12 determines the first set time period from the time stamp for any of the requested advertised scores for the front virtual service (FVS1) and the inner virtual services 1 and 2 (IVS1 and IVS2) has expired based, then the Yes branch is taken to step 104, although other manners for triggering this path can be used.

In step 104, the traffic management device 12 determines the self score for each of the front virtual service (FVS1) and the inner virtual services 1 and 2 (IVS1 and IVS2) based on the minimum self score for each of the inner virtual services and/or service components respectively coupled to each of the front virtual service (FVS1), the inner virtual service 1 (IVS1), and the inner virtual service 2 (IVS2).

In this particular example, the inner virtual service 1 (IVS1) is coupled to three service components or modules (APM1, WAM1, and a layering iRule) which each have their own criteria and mechanism to set their own service self score, although other types and numbers of service components or inner virtual services and other manners for determining the service self scores could be used. Similarly, the inner virtual service IVS2 is coupled to three service components or modules (APM2, WAM2, and a compression card) which also each have their own criteria and mechanism to set their own service self score, although again other types and numbers of service components or inner virtual services and other manners for determining the service self scores could be used. For example, the APM1 and APM2 service components each could use the active user sessions count to determine their service self score while the WAM1 and WAM2 service components uses the current transactions count to determine their service self score. The table shown in FIG. 4 and stored in memory in the traffic management device 12 provides examples of service score values for each of these service components.

Next, the inner virtual service 1 (IVS1) selects the minimum value from the service self scores for the APM1, WAM1, and a layering iRule as the self score for the inner virtual service 1 (IVS1), although other manners for obtaining the self score for the inner virtual service 1 (IVS1), such as taking the average of the service self scores could be used. In this example, the minimum value is the service self score “15” for the APM1 as shown in the table in FIG. 4 which is selected by the traffic management device 12 as the self score for the inner virtual service 1 (IVS1). Similarly, the inner virtual service 2 (IVS2) selects the minimum value from the service self scores for the APM2, WAM2, and the compression card service components as the self score for the inner virtual service 2 (IVS2), although again other manners for obtaining the service self score for the inner virtual service 1 (IVS1), such as taking the average of the self scores could be used. Additionally in this example, the minimum value is the service self score “5” for the WAM2 as shown in the table in FIG. 4 which is selected by the traffic management device 12 as the self score of the inner virtual service 2 (IVS2).

Next, the front virtual service (FVS1) is coupled to the layer below comprising inner virtual service 1 (IVS1) and the inner virtual service 2 (IVS2), although the front virtual service (FSV1) could be coupled to other types and numbers of inner virtual services and/or service components. In this example, the front virtual service (FSV1) selects the minimum value of the self scores for the inner virtual service 1 (IVS1) and the inner virtual service 2 (IVS2) as its self score, although other manners for obtaining the self score of the front virtual service (FSV1) can be used, such as taking an average of the self scores of the inner virtual service 1 (IVS1) and the inner virtual service 2 (IVS2). In this example, the minimum value is the self score “5” for the inner virtual service (ISV2) in the table in FIG. 4 which is selected by the traffic management device 12 as the self score of the front virtual service (FVS1). In this example, the traffic management device 12 also populates the self score column of the table shown in FIG. 5 with these obtained self scores for the inner virtual service (ISV1), inner virtual service (ISV2), or the front virtual service (FSV1).

In step 106, the traffic management device 12 determines an aggregate score for each of the inner virtual service (ISV1), the inner virtual service (ISV2), and the front virtual service (FSV1) based on the determined self score and number of active connections or flows to each service component and/or inner virtual service coupled to the inner virtual service (ISV1), the inner virtual service (ISV2), and the front virtual service (FSV1), respectively. More specifically, an example of determining the aggregate or layered score for each of the inner virtual service (ISV1), the inner virtual service (ISV2), and the front virtual service (FSV1) with the traffic management device 12 is set forth below.

In this example, the aggregate or layered score of the inner virtual service (ISV1), is calculated by the traffic management device 12 as follows:
((Self Score for APM1*C3)+(Self Score for WAM1*C4)+(Self Score for Layering iRule*C5))/(C3+C4+C5)

Additionally, the aggregate or layered score of the inner virtual service (ISV2), is calculated by the traffic management device 12 as follows:
((Self Score for APM2*C6)+(Self Score for WAM2*C7)+(Self Score for Layering iRule*C8))/(C6+C7+C8).

Further, the aggregate or layered score of the front virtual service (FSV1), is calculated by the traffic management device 12 as follows:
((Self Score for IVS1*C1)+(Self Score for IVS2*C2))/(C1+C2).

By way of example only, using the numbers in the table illustrated in FIG. 5, the traffic management device 12 would determine the aggregate score for the inner virtual service 1 (IVS1) to be “20.625”, the aggregate score for the inner virtual service 2 (IVS2) to be “11.67” and the aggregate score for the front virtual service (FVS1) to be “20”. The determined aggregate scores along with the time and date when they were determined, i.e. the time stamps, are recorded and stored in the table shown in FIG. 5 in memory in the traffic management device 12, although other manners and locations for storing this data can be used.

As illustrated in the example above, the service components or layered inner virtual services with a high number of connections/flows to either an inner virtual service or the front virtual service (FVS1) at the next level contribute more to the weighted average. This approach also can be used recursively to calculate the aggregate score of additional inner layered virtual services (not shown). Further, checks may be added in this implementation in the traffic management device 12 to prevent loops.

This example also assumes the relationship between the front virtual FV1 and the inner layered virtuals (IVS1 and IVS2) and the relationship between the inner layered virtuals (IVS1 and IVS2) and the service components as shown in FIG. 2 is dynamically determined by the traffic management device 12. By way of example only, in the case of APM, the traffic management device 12 can use the connectivity profile setting in the front virtual service (FVS1) to detect the layered inner virtual services 1 and 2 (IVS1 and IVS2) using the tunnel and the VLAN settings.

In step 108, the traffic management device 12 determines the advertised score for the front virtual service (FVS1) by selecting the minimum of the aggregate scores for the inner virtual services 1 and 2 (IVS1 and IVS2), although other manners for determining an advertised score can be used, such as taking the average of the aggregate scores for the inner virtual services 1 and 2 (IVS1 and IVS2). In this particular example using the values in the table illustrated in FIG. 5, the advertised score for the front virtual service (FVS1) is determined by the traffic management device 12 to be “5” by selecting the minimum value of the aggregate scores for the inner virtual services 1 and 2 (IVS1 and IVS2) and the self score for the front virtual service, which was determined as described and illustrated earlier with reference to step 104.

In step 110, the traffic management device 12 updates the time stamp for the obtained advertised score for the front virtual service (FVS1) and for the obtained advertised score for the inner virtual services (ISV1 and ISV2) which are stored in the table shown in FIG. 5 in memory in the traffic management device 12.

Following step 110, the process again returns to step 102 as described earlier. If in step 102, the traffic management device 12 determines the time stamps for the requested advertised scores for the front virtual service (FSV1) and for the inner virtual services 1 and 2 (IVS1 and IVS2) have not expired, then the No branch is taken to step 112, although other manners for triggering the No branch can be used, such as just the time stamps for the requested advertised scores for the front virtual service (FSV1) still being within the set time period and thus valid.

In step 112, the traffic management device 12 provides the requested advertised score in response to the initial received request to the load balancing module (not shown) in the traffic management device 12, although the requested advertised scored can be provided to other modules and applications. In step 114, the traffic management device 12 utilizes the advertised score with the load balancing module to make more accurate load balancing decisions because the load on the layered inner virtual services is taken into account.

Accordingly, as illustrated and described herein this technology provides a number of advantages including providing more effective methods and devices to manage traffic when multiple services are being provided. With this technology, a score representative of a current load on a system with multiple layered virtual systems can be determined and provided for load balancing decisions.

Having thus described the basic concept of the invention, it will be rather apparent to those skilled in the art that the foregoing detailed disclosure is intended to be presented by way of example only, and is not limiting. Various alterations, improvements, and modifications will occur and are intended to those skilled in the art, though not expressly stated herein. These alterations, improvements, and modifications are intended to be suggested hereby, and are within the spirit and scope of the invention. Additionally, the recited order of processing elements or sequences, or the use of numbers, letters, or other designations therefore, is not intended to limit the claimed processes to any order except as may be specified in the claims. Accordingly, the invention is limited only by the following claims and equivalents thereto.