Multiplex communications – Pathfinding or routing – Switching a message which includes an address header
Reexamination Certificate
2007-12-18
2007-12-18
Kizou, Hassan (Department: 2616)
Multiplex communications
Pathfinding or routing
Switching a message which includes an address header
C370S428000
Reexamination Certificate
active
10002085
ABSTRACT:
A scheduler for a network processor includes one or more scheduling queues. Each scheduling queue defines a respective sequence in which flows are to be serviced. A respective empty indicator is associated with each scheduling queue to indicate whether the respective scheduling queue is empty. By referring to the empty indicators, it is possible to avoid wasting operating cycles of the scheduler on searching scheduling queues that are empty.
REFERENCES:
patent: 4621359 (1986-11-01), McMillen
patent: 5249184 (1993-09-01), Woest et al.
patent: 5363485 (1994-11-01), Nguyen et al.
patent: 5490141 (1996-02-01), Lai et al.
patent: 5548590 (1996-08-01), Grant et al.
patent: 5629928 (1997-05-01), Calvignac et al.
patent: 5650993 (1997-07-01), Lakshman et al.
patent: 5742772 (1998-04-01), Sreenan
patent: 5790545 (1998-08-01), Holt et al.
patent: 5831971 (1998-11-01), Bonomi et al.
patent: 5835494 (1998-11-01), Hughes et al.
patent: 5844890 (1998-12-01), Delp et al.
patent: 5850399 (1998-12-01), Ganmukhi et al.
patent: 5905730 (1999-05-01), Yang et al.
patent: 5926459 (1999-07-01), Lyles et al.
patent: 5926481 (1999-07-01), Wang et al.
patent: 5946297 (1999-08-01), Calvignac et al.
patent: 5999963 (1999-12-01), Bruno et al.
patent: 6014367 (2000-01-01), Joffe
patent: 6018527 (2000-01-01), Yin et al.
patent: 6028842 (2000-02-01), Chapman et al.
patent: 6028843 (2000-02-01), Delp et al.
patent: 6031822 (2000-02-01), Wallmeier
patent: 6038217 (2000-03-01), Lyles
patent: 6041059 (2000-03-01), Joffe et al.
patent: 6052751 (2000-04-01), Runaldue et al.
patent: 6064650 (2000-05-01), Kappler et al.
patent: 6064677 (2000-05-01), Kappler et al.
patent: 6067301 (2000-05-01), Aatresh
patent: 6072772 (2000-06-01), Charny et al.
patent: 6072800 (2000-06-01), Lee
patent: 6078953 (2000-06-01), Vaid et al.
patent: 6081507 (2000-06-01), Chao et al.
patent: 6092115 (2000-07-01), Choudhury et al.
patent: 6094435 (2000-07-01), Hoffman et al.
patent: 6101193 (2000-08-01), Ohba
patent: 6104700 (2000-08-01), Haddock et al.
patent: 6108307 (2000-08-01), McConnell et al.
patent: 6115807 (2000-09-01), Grochowski
patent: 6122673 (2000-09-01), Basak et al.
patent: 6144669 (2000-11-01), Williams et al.
patent: 6157614 (2000-12-01), Pasternak et al.
patent: 6157649 (2000-12-01), Peirce et al.
patent: 6157654 (2000-12-01), Davis
patent: 6160812 (2000-12-01), Bauman et al.
patent: 6169740 (2001-01-01), Morris et al.
patent: 6188698 (2001-02-01), Galand et al.
patent: 6226267 (2001-05-01), Spinney et al.
patent: 6229812 (2001-05-01), Parruck et al.
patent: 6229813 (2001-05-01), Buchko et al.
patent: 6236647 (2001-05-01), Amalfitano
patent: 6246692 (2001-06-01), Dai et al.
patent: 6259699 (2001-07-01), Opalka et al.
patent: 6266702 (2001-07-01), Darnell et al.
patent: 6314478 (2001-11-01), Etcheverry
patent: 6356546 (2002-03-01), Beshai
patent: 6389019 (2002-05-01), Fan et al.
patent: 6389031 (2002-05-01), Chao et al.
patent: 6404768 (2002-06-01), Basak et al.
patent: 6469982 (2002-10-01), Henrion et al.
patent: 6481251 (2002-11-01), Meier et al.
patent: 6563829 (2003-05-01), Lyles et al.
patent: 6608625 (2003-08-01), Chin et al.
patent: 6611522 (2003-08-01), Zheng et al.
patent: 6646986 (2003-11-01), Beshai
patent: 6647505 (2003-11-01), Dangi et al.
patent: 6721325 (2004-04-01), Duckering et al.
patent: 6775287 (2004-08-01), Fukano et al.
patent: 6804249 (2004-10-01), Bass et al.
patent: 6810012 (2004-10-01), Yin et al.
patent: 6810043 (2004-10-01), Naven et al.
patent: 6810426 (2004-10-01), Mysore et al.
patent: 6813274 (2004-11-01), Suzuki et al.
patent: 6832261 (2004-12-01), Westbrook et al.
patent: 6850490 (2005-02-01), Woo et al.
patent: 6885664 (2005-04-01), Ofek et al.
patent: 6888830 (2005-05-01), Snyder, II et al.
patent: 6891835 (2005-05-01), Kalkunte et al.
patent: 7020137 (2006-03-01), Kadambi et al.
patent: 7027394 (2006-04-01), Gupta et al.
patent: 2001/0004363 (2001-06-01), Usukura
patent: 2001/0012294 (2001-08-01), Kadambi et al.
patent: 2002/0003795 (2002-01-01), Oskouy et al.
patent: 2002/0023168 (2002-02-01), Bass et al.
patent: 2002/0024830 (2002-02-01), Yoneda
patent: 2002/0136230 (2002-09-01), Dell et al.
patent: 2002/0163922 (2002-11-01), Dooley et al.
patent: 2002/0181455 (2002-12-01), Norman et al.
patent: 2003/0050954 (2003-03-01), Tayyar et al.
patent: 2003/0058875 (2003-03-01), Arndt et al.
patent: 2003/0058879 (2003-03-01), Rumph
patent: 2003/0079080 (2003-04-01), DeMoney
patent: 0859492 (1998-08-01), None
patent: 0957602 (1999-11-01), None
patent: 0 989 770 (2000-03-01), None
patent: 1 049 352 (2000-11-01), None
patent: 1061763 (2000-12-01), None
patent: 04-094240 (1992-03-01), None
patent: 2000183886 (2000-06-01), None
patent: 2000295247 (2000-10-01), None
patent: 2001007822 (2000-12-01), None
patent: 99/35792 (1999-07-01), None
patent: WO99/53647 (1999-10-01), None
patent: WO99/53648 (1999-10-01), None
patent: WO01/20876 (2001-03-01), None
“Estimating Clock Speeds for the ATMSWITCH Architecture”, Proc. NETWORKS '99 (The Third New Zealand ATM and Broadband Workshop), Jan. 21-22, 1999,pp. 39-53: Lyons, P.J. and Yan, Bo (1999).
Lyons et al. (Third New Zealand ATM and Broadband Workshop: Title- Estimating Clock Speeds for ihe ATMSWITCH Architecture).
Lo Bello, L et al. (A multi-ring scheduling strategy for Profibus networks) Industrial Electronics Society, 2001. IECON '01. The 27th Annual Conference of the IEEE vol. 3, Nov. 29-Dec. 2, 2001 pp. 2144-2148 vol. 3.
Koppelman (Congested Banyan network analysis using congested-queue states and neighboring-queue effects); Networking, IEEE/ACM Transactions on vol. 4, Issue 1, Feb. 1996 pp. 106-111.
Chen et al. (Dynamic queue assignment in a VC queue manager for gigabit ATM networks); ATM Workshop Proceedings, 1998 IEEE May 26-29, 1998 pp. 3-10.
U.S. Appl. No. 10/102,343, filed Mar. 20, 2002, “Network Processor Having Fast Flow Queue Disable Process”.
U.S. Appl. No. 10/102,166, filed Mar. 20, 2002, “Method and Apparatus for Improving the Fairness of New Attaches to a Weighted Fair Queue in a Quality of Service (QoS) Scheduler”.
Abstract of Publication entitled “Design of packet-fair queuing schedulers using a RAM-based searching engine” by HJ Chao et al, IEEE Journal on Selected Areas in Communications, vol. 17, No. 6, pp. 1105-1126, Jun. 1999.
U.S. Appl. No. 10/015,994, filed Nov. 1, 2001, titled “Weighted Fair Queue Serving Plural Output Ports”.
U.S. Appl. No. 10/015,760, filed Nov. 1, 2001, titled “Weighted Fair Queue Having Adjustable Scaling Factor”.
U.S. Appl. No. 10/016,518, filed Nov. 1, 2001, titled “Weighted Fair Queue Having Extended Effective Range”.
U.S. Appl. No. 10/004,373, filed Nov. 1, 2001, titled “QoS Scheduler and Method for Implementing Peak Service Distance Using Next Peak Service Time Violated Indication”.
U.S. Appl. No. 10/002,416, filed Nov. 1, 2001, titled “QoS Scheduler and Method for Implementing Quality of Service with Aging Time Stamps”.
U.S. Appl No. 10/004,440, filed Nov. 1, 2001, titled “QoS Scheduler and Method for Implementing Quality of Service with Cached Status Array”.
U.S. Appl. No. 10/004,217, filed Nov. 1, 2001, titled “QoS Scheduler and Method for Implementing Quality of Service Anticipating the End of a Chain of Flows”.
Goetzinger William John
Handlogten Glen Howard
Mikos James Francis
Norgaard David Alan
Sucher Daniel James
Ahmed Salman
Dugan & Dugan P.C.
Kizou Hassan
LandOfFree
Empty indicators for weighted fair queues does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Empty indicators for weighted fair queues, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Empty indicators for weighted fair queues will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-3872127