Flow scheduling for network application apparatus

Details Flow scheduling for network application apparatus Flow scheduling for network application apparatus

2005-07-01

2011-10-25

Dollinger, Tonia L. M. (Department: 2443)

Electrical computers and digital processing systems: multicomput

Computer network managing

Network resource allocating

C709S229000

Reexamination Certificate

active

08046465

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.

REFERENCES:
patent: 5062037 (1991-10-01), Shorter et al.
patent: 5134691 (1992-07-01), Elms
patent: 5276899 (1994-01-01), Neches
patent: 5446680 (1995-08-01), Sekiya et al.
patent: 5522070 (1996-05-01), Sumimoto
patent: 5557742 (1996-09-01), Smaha et al.
patent: 5621889 (1997-04-01), Lermuzeaux et al.
patent: 5675797 (1997-10-01), Chung et al.
patent: 5771234 (1998-06-01), Wu et al.
patent: 5774668 (1998-06-01), Choquier et al.
patent: 5790176 (1998-08-01), Craig
patent: 5867716 (1999-02-01), Morimoto et al.
patent: 5872779 (1999-02-01), Vaudreuil
patent: 5975945 (1999-11-01), Daoud
patent: 5978843 (1999-11-01), Wu et al.
patent: 6006264 (1999-12-01), Colby et al.
patent: 6014700 (2000-01-01), Bainbridge et al.
patent: 6058434 (2000-05-01), Wilt et al.
patent: 6064723 (2000-05-01), Cohn et al.
patent: 6067546 (2000-05-01), Lund
patent: 6088804 (2000-07-01), Hill et al.
patent: 6092218 (2000-07-01), Liddell et al.
patent: 6182123 (2001-01-01), Filepp et al.
patent: 6226700 (2001-05-01), Wandler et al.
patent: 6279028 (2001-08-01), Bradshaw, Jr. et al.
patent: 6314463 (2001-11-01), Abbott et al.
patent: 6317775 (2001-11-01), Coile et al.
patent: 6321338 (2001-11-01), Porras
patent: 6347398 (2002-02-01), Parthasarathy et al.
patent: 6370648 (2002-04-01), Diep
patent: 6393569 (2002-05-01), Orenshteyn
patent: 6405246 (2002-06-01), Hutchison
patent: 6411986 (2002-06-01), Susai et al.
patent: 6430570 (2002-08-01), Judge et al.
patent: 6442599 (2002-08-01), DuLac et al.
patent: 6446109 (2002-09-01), Gupta
patent: 6466965 (2002-10-01), Chessell et al.
patent: 6519703 (2003-02-01), Joyce
patent: 6578066 (2003-06-01), Logan et al.
patent: 6597684 (2003-07-01), Gulati et al.
patent: 6708212 (2004-03-01), Porras et al.
patent: 6728808 (2004-04-01), Brown
patent: 6735206 (2004-05-01), Oki et al.
patent: 6769066 (2004-07-01), Botros et al.
patent: 6816903 (2004-11-01), Rakoshitz et al.
patent: 6999952 (2006-02-01), Pham
patent: 7013333 (2006-03-01), Skells
patent: 7023825 (2006-04-01), Haumont et al.
patent: 7062556 (2006-06-01), Chen et al.
patent: 7069293 (2006-06-01), Cox et al.
patent: 7237264 (2007-06-01), Graham et al.
patent: 0262990 (2008-10-01), Kapoor et al.
patent: 7577623 (2009-08-01), Genty et al.
patent: 7836443 (2010-11-01), Akerman et al.
patent: 2001/0003831 (2001-06-01), Boland
patent: 2002/0165947 (2002-11-01), Akerman et al.
patent: 2003/0051026 (2003-03-01), Carter et al.
patent: 2004/0025044 (2004-02-01), Day
patent: 2004/0225895 (2004-11-01), Mukherjee et al.
patent: 2005/0076228 (2005-04-01), Davis
patent: 2005/0081058 (2005-04-01), Chang et al.
patent: 2006/0020595 (2006-01-01), Norton et al.
patent: 2007/0192863 (2007-08-01), Kapoor et al.
patent: 2008/0133517 (2008-06-01), Kapoor
patent: 2008/0133518 (2008-06-01), Kapoor et al.
patent: 2008/0134330 (2008-06-01), Kapoor et al.
patent: 2008/0162390 (2008-07-01), Kapoor et al.
patent: 2008/0229415 (2008-09-01), Kapoor et al.
patent: 2008/0262991 (2008-10-01), Kapoor et al.
patent: 2010/0042565 (2010-02-01), Akerman
patent: 0648038 (1995-12-01), None
patent: 0690376 (1996-03-01), None
patent: WO-2007070838 (2007-06-01), None
patent: WO-2007070838 (2007-06-01), None
“ISR for PCT/US01/29885”, related matter.
Lan, Youran “A Dynamic Central Scheduler Load Balancing Mechanism”,Computers and Communications, 1995, Conference Proceedings of the 1995 IEEE Fourteenth Annual International Phoenix conference in Scottsdale, AZ, USA, (Mar. 28-31, 1995),734-740.
Mourad, Antoine “Scalable web Server Architectures”,Computers and Communications, 1997 Proceedings., Second IEEE Symposium in Alexandria, Egypt & Los Angeles, CA, USA, IEEE Computer Society, US Jul. 1, 1997, pp. 12-16.
“U.S. Appl. No. 11/173,923, Non-Final Office Action mailed Jun. 23, 2008.”, OARN,22 pgs.
TSAI, et al., “Complexity of gradient projection method for optimal routing in data networks”,IEEE Press, vol. 7, Issue 6, (1999)897-905.
“U.S. Appl. No. 11/173,923), Non-Final Office Action mailed Feb. 19, 2009”, 25 pgs.
“AU.S. Appl. no. 11/173,923, Final Office Action mailed Jan. 13, 2010” 32 Pgs.
“U.S. Appl. No. 11/173,923, Notice of Allowance mailed Sep. 7, 2010”, 25.
“U.S. Appl. No. 11/610,296, Non-Final Office Action mailed Jun. 10, 2010”, 16.
“U.S. Appl. No. 11/877,792, Non-Final Office Action mailed Mar. 12, 2010”, 12.
“U.S. Appl. No. 11/877813 , Non-Final Office Action mailed Mar. 11, 2010”, Redundant to this case—same application. No. need to cite )pel) , 13.
“European Search Report”, Application# 01971331.2 Jul. 28, 2010 , all.
“U.S. Appl. No. 11/877,819, Non-Final Office Action mailed Oct. 13, 2010”, 22 pgs.
“U.S. Appl. No. 11/877,801, Non-Final Office Action mailed Oct. 12, 2010”, 19 pgs.
“U.S. Appl. No. 11/877,813, Final Office Action mailed Nov. 17, 2010”, 14.
Lee, “A framework for constructing features and models for intrusion detection systems ACM Transactions on Information and System Security (TISSEC)”, vol. 3 , Issue 4 Nov. 2000 , 227-261.
Lei, J. Z. “Network intrusion detection using an improved competitive learning neural network”, Communication Networks and Services Research , 2004 . Proceedings . Second, D Annual Conference on FREEERICTON May 19, 2004 , 190-197 pgs.
Huff, J. “Hierarchical Kohonenen Net for Anomaly Detection in Network Security”, IE EE Transactions on Systems , Man and Cybernetics. Part B:Cybernetics , IEEE, Service Center, vol . 35 , No . 2, Apr. 1, 2005.
Debar, H. B. “A Neutral Network Component for an intrusion Detection System”, IEEE Computer Society 1992 , 240.
Intl. Searching Authority, “PCT Search Report”, for US Patent Application No. PCT/US06/62053 Jan. 26, 2008.
“U.S. Appl. No. 11/610,296, Final Office Action mailed Feb. 17, 2011”, 14.
“U.S. Appl. No. 11/877,792, Non-Final Office Action mailed Mar. 14, 2011”, 11.
“U.S. Appl. No. 11/926,292, Non-Final Office Action mailed Jul. 8, 2010”, 17 Pgs.
“U.S. Appl. No. 11/926,311, Non-Final Office Action mailed Sep. 20, 2010”, 8.
“U.S. Appl. No. 11/877,801, Final Office Action mailed Mar. 4, 2011”, 15.
“U.S. Appl. No. 11/877,819, Final Office Action mailed Feb. 28, 2011”, 19.
“U.S. Appl. No. 11/926,307, Non-Final Office Action mailed Jun. 23, 2010”, 24 Pgs.

Affiliated with

Also associated with

Rating

Flow scheduling for network application apparatus does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Flow scheduling for network application apparatus, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Flow scheduling for network application apparatus will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-4267593