Flow scheduling for network application apparatus

• US 8,046,465 B2
• Filed: 07/01/2005
• Issued: 10/25/2011
• Est. Priority Date: 09/25/2000
• Status: Expired due to Fees

• Current Assignee: CA, Inc. (d/b/a CA Technologies) (Broadcom, Inc.)
• Original Assignee: Crossbeam Systems Incorporated (Gen Digital Inc.)
• Inventors: Ferguson, John C., Korsunsky, Yevgeny
• Primary Examiner(s): Dollinger, Tonia L. M.
• Assistant Examiner(s): COONEY, ADAM A
• Application Number:
  US11/174,181
• Publication Number:
  US 20060143499A1
• Time in Patent Office: 2,307 Days
• Field of Search: 709/226
• US Class Current: 709/226
• CPC Class Codes: G06F 9/5027 the resource being a machine, e.g. CPUs, Servers, Terminals
• CPC Class Codes: G06F 9/5033 considering data affinity
• CPC Class Codes: G06F 9/505 considering the load
• CPC Class Codes: G06F 9/5055 considering software capabilities, i.e. software resources associated or available to the machine
• CPC Class Codes: H04L 63/10 for controlling access to devices or network resources
• CPC Class Codes: H04L 63/1416 Event detection, e.g. attack signature detection
• CPC Class Codes: H04L 63/20 for managing network security; network security policies in general filtering policies H04L63/0227
• CPC Class Codes: H04L 67/10 in which an application is distributed across nodes in the network software deployment G06F8/60; multiprogramming arrangements G06F9/46
• CPC Class Codes: H04L 67/306 User profiles
• CPC Class Codes: H04L 67/34 involving the movement of software or configuration parameters network booting or remote initial program loading [RIPL] G06F9/4416
• CPC Class Codes: H04L 67/62 Establishing a time schedule for servicing the requests
• CPC Class Codes: H04L 67/63 Routing a service request depending on the request content or context
• CPC Class Codes: H04L 69/329 in the application layer [OSI layer 7]
• CPC Class Codes: H04L 9/40 Network security protocols

Abstract

A method and system for distributing flows between a multiple processors. The flows can be received from an external source such as a network, by a front-end processor that recognizes the flow and the associated request, and identifies at least one internal applications processor to process the request/flow. The front-end processor utilizes a flow scheduling vector related to the identified applications processor(s), and the flow scheduling vector can be based on intrinsic data from the applications processor(s) that can include CPU utilization, memory utilization, packet loss, and queue length or buffer occupation. In some embodiments, applications processors can be understood to belong to a group, wherein applications processors within a group can be configured identically. A flow schedule vector can be computed for the different applications processor groups. In some embodiments, a control processor can collect the intrinsic applications processor data, compute the flow scheduling vectors, and transfer the flow scheduling vectors to the front-end processor.

Claims

1. A method for scheduling data flows among processors, comprising,

receiving a request for processing a data flow,

receiving a data flow from a network, the data flow comprising a stream of data packets that contain data, the data including subscriber profile information,

identifying a processor group to process the request by applying a policy to the data, the processor group including at least one processor,

computing a flow schedule for the identified processor group,

consulting the flow schedule associated with the identified processor group, and,

transferring the request for processing the data flow to the at least one processor in the identified processor group based on the flow schedule, the subscriber profile information, and the policy.

2. A method according to claim 1, wherein consulting the flow schedule further comprises consulting a flow schedule vector.

3. A method according to claim 1, wherein transferring the request includes transferring the request based on sequentially moving among processors in the consulted flow schedule.

4. A method according to claim 3, wherein sequentially moving among processors includes returning to the beginning of the consulted flow schedule upon reaching the end of the consulted flow schedule.

5. A method according to claim 1, wherein computing a flow schedule further comprises receiving intrinsic data from the at least one processor in the identified processor group, the intrinsic data comprising packet loss data from the at least one processor.

6. A method according to claim 5, wherein receiving the intrinsic data from the at least one processor further includes receiving intrinsic data at specified intervals.

7. A method according to claim 5, wherein computing a flow schedule further comprises filtering the intrinsic data.

8. A method according to claim 1, further comprising providing processor groups, the processor groups having at least one processor and wherein the processors in a processor group include at least one similar application.

9. A method according to claim 1, further comprising providing processor groups, the processor groups having at least one processor and wherein the processors in a processor group are identically configured.

10. A method according to claim 9, further comprising computing a flow schedule for the processor groups.

11. A method according to claim 1, further comprising providing processor groups wherein the processors in different processor groups include at least one different application.

12. A method according to claim 1, wherein consulting the flow schedule further includes providing an initial flow schedule.

13. A method according to claim 1, wherein identifying a processor group includes identifying an application associated with the request.

14. A method according to claim 1, wherein identifying a processor group includes consulting a hash table.