QoS scheduler and method for implementing peak service...

Multiplex communications – Data flow congestion prevention or control – Flow control of data transmission through a network

Reexamination Certificate

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

C370S395400, C370S462000, C709S234000

Reexamination Certificate

active

06973036

ABSTRACT:
A scheduler and scheduling method implement peak service distance using a next peak service time violated (NPTV) indication. A flow scheduled on a best effort or weighted fair queue (WFQ) is identified for servicing and a frame is dispatching from the identified flow. A next PSD time (NPT) being violated is checked for the flow. Responsive to identifying the next PSD time (NPT) being violated for the identified flow, a NPTV indicator is set. Alternatively, responsive to identifying the next PSD time (NPT) not being violated for the identified flow, the NPTV indicator is reset. A next PSD time (NPT) value is calculated for the flow. Checking for more frames to be dispatched from the flow is performed. Responsive to identifying no more frames to be dispatched from the flow, the NPTV indicator is utilized to identify a calendar for attaching the flow upon a new frame arrival for the flow. If the NPTV indicator is not set when the flow goes empty, upon a new frame arrival for the flow, the flow is attached to a weighted fair queue (WFQ) ring using a queue distance calculation. If the NPTV indicator is set when the flow goes empty, upon a new frame arrival for the flow, then it is determined if the next PSD time (NPT) value for the flow has been passed. If the next PSD time (NPT) value has been passed, then the flow is attached to the weighted fair queue (WFQ) ring using the queue distance calculation. If the next PSD time (NPT) value has not been passed, then the flow is attached to a peak bandwidth service (PBS) calendar using the next PSD time (NPT) value.

REFERENCES:
patent: 5249184 (1993-09-01), Woeste 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: 5742772 (1998-04-01), Sreenan
patent: 5790545 (1998-08-01), Holt et al.
patent: 5831971 (1998-11-01), Bonomi et al.
patent: 5844890 (1998-12-01), Delp et al.
patent: 5850399 (1998-12-01), Ganmukhi 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: 6064650 (2000-05-01), Kappler et al.
patent: 6064677 (2000-05-01), Kappler et al.
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: 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: 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: 6469982 (2002-10-01), Henrion et al.
patent: 6646986 (2003-11-01), Beshai
patent: 6721325 (2004-04-01), Duckering et al.
patent: 6804249 (2004-10-01), Bass et al.
patent: 6810012 (2004-10-01), Yin et al.
patent: 6888830 (2005-05-01), Snyder II et al.
patent: 2002/0023168 (2002-02-01), Bass et al.
patent: 2003/0588798 (2003-03-01), Rumph
patent: 0859492 (1998-08-01), None
patent: 0957602 (1999-11-01), None
patent: 0989770 (2000-03-01), None
patent: 1049352 (2000-11-01), None
patent: 1061763 (2000-12-01), None
patent: 2000183886 (2000-06-01), None
patent: 2000295247 (2000-10-01), None
patent: 2001007822 (2000-12-01), None
patent: WO99/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
U.S. Appl. No. 10/002,416, filed Nov. 1, 2001, by William John Goetzinger, Glen Howard Handlogten, James Francis Mikos, and David Alan Norgaard entitled “QoS Scheduler and Method for Implementing Quality of Service With Aging Time Stamps”.
U.S. Appl. No. 10/004,440, filed Nov. 1, 2001, by William John Goetzinger, Glen Howard Handlogten, James Francis Mikos, and David Alan Norgaard entitled “QoS Scheduler and Method for Implementing Quality of Service With Cached Status Array”.
U.S. Appl. No. 10/004,217, filed Nov. 1, 2001, by William John Goetzinger, Glen Howard Handlogten, James Francis Mikos, and David Alan Norgaard entitled “QoS Scheduler and Method for Implementing Quality of Service Anticipating the End of a Chain of Flows”.
U.S. Appl. No. 10/016,518, filed Nov. 1, 2001, by William John Goetzinger, Glen Howard Handlogten, James Francis Mikos, and David Alan Norgaard entitled “Weighted Fair Queue Having Extended Effective Range”.
U.S. Appl. No. 10/015,994, filed Nov. 1, 2001, by William John Goetzinger, Glen Howard Handlogten, James Francis Mikos, and David Alan Norgaard entitled “Weighted Fair Queue Serving Plural Output Ports”.
U.S. Appl. No. 10/015,760, filed Nov. 1, 2001, by William John Goetzinger, Glen Howard Handlogten, James Francis Mikos, and David Alan Norgaard entitled “Weighted Fair Queue Having Adjustable Scaling Factor”.
U.S. Appl. No. 10/002,085, filed Nov. 1, 2001, by William John Goetzinger, Glen Howard Handlogten, James Francis Mikos, and David Alan Norgaard entitled “Empty Indicators for Weighted Fair Queues”.
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/102,343, filed Mar. 20, 2002, “Network Processor Having Fast Flow Queue Disable Process”.

LandOfFree

Say what you really think

Search LandOfFree.com for the USA inventors and patents. Rate them and share your experience with other people.

Rating

QoS scheduler and method for implementing peak service... does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with QoS scheduler and method for implementing peak service..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and QoS scheduler and method for implementing peak service... will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-3487135

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.