Priority-based efficient fair queuing for quality of service...

Multiplex communications – Data flow congestion prevention or control – Control of data admission to the network

Reexamination Certificate

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

Reexamination Certificate

active

10281537

ABSTRACT:
In one embodiment, a method comprises recursively selecting a child node of a previously selected node of a port tree and having a highest priority among nodes of a same level within the port tree, until the selected node has associated egress queues of an egress port. The method also includes outputting a number of packets from the associated egress queues of the selected node in a current processing cycle. The number of packets outputted is based on an allocated bandwidth for the associated egress queues, in which the allocated bandwidth accounts for a deficit from a previous processing cycle.

REFERENCES:
patent: 5509006 (1996-04-01), Wilford et al.
patent: 5850399 (1998-12-01), Ganmukhi et al.
patent: 5905730 (1999-05-01), Yang et al.
patent: 6018527 (2000-01-01), Yin et al.
patent: 6091709 (2000-07-01), Harrison et al.
patent: 6104700 (2000-08-01), Haddock et al.
patent: 6134217 (2000-10-01), Stiliadis et al.
patent: 6188698 (2001-02-01), Galand et al.
patent: 6229812 (2001-05-01), Parruck et al.
patent: 6407999 (2002-06-01), Olkkonen et al.
patent: 6408006 (2002-06-01), Wolff
patent: 6463470 (2002-10-01), Mohaban et al.
patent: 6466984 (2002-10-01), Naveh et al.
patent: 6560230 (2003-05-01), Li et al.
patent: 6567415 (2003-05-01), Elwalid et al.
patent: 6606302 (2003-08-01), Delattre et al.
patent: 6625150 (2003-09-01), Yu
patent: 6665301 (2003-12-01), Wu
patent: 6795441 (2004-09-01), Widmer et al.
patent: 6909691 (2005-06-01), Goyal et al.
patent: 6914881 (2005-07-01), Mansfield et al.
patent: 6922732 (2005-07-01), Elmaliach et al.
patent: 6967921 (2005-11-01), Levy et al.
patent: 2002/0122422 (2002-09-01), Kenney et al.
patent: 2004/0042484 (2004-03-01), Widmer et al.
patent: WO 98/26510 (1998-06-01), None
patent: WO 00/08817 (2000-02-01), None
patent: WO 00/11885 (2000-03-01), None
patent: PCT/US03/27206 (2004-05-01), None
Goyal, Pawan et al., Start-Time Fair Queueing: A Scheduling Algorithm for Integrated Services Packet Switching Networks, IEEE/ACM Transactions on Networking, vol. 5 No. 5 Oct. 1997.
McKenney, Paul E., “Stochastic Fairness Queuing” CH2826-5 IEEE, 1990.
Shreedhar, M. et al. “Efficient Fair Queuing using Deficient Round Robin” Washington University in St. Louis, 1995.

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

Priority-based efficient fair queuing for quality of 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 Priority-based efficient fair queuing for quality of service..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Priority-based efficient fair queuing for quality of service... will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-3895749

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