Servicing output queues dynamically according to bandwidth...

Multiplex communications – Pathfinding or routing – Switching a message which includes an address header

Reexamination Certificate

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

C370S395420, C370S412000

Reexamination Certificate

active

06891835

ABSTRACT:
An adaptive weighted round robin scheduling apparatus and method schedules variable-length frame transmissions from a plurality of output queues having different transmission priorities by first allocating, for each queue, a number of bandwidth segments for a bandwidth cycle and a number of transmission opportunities for a round robin cycle, and then processing the queues consecutively in a round-robin fashion, beginning with a highest priority queue, until none of the queues has any bandwidth remaining. More specifically, during each iteration of a round robin cycle, a queue is permitted to transmit a frame if the queue has at least one remaining transmission opportunity, the queue has a frame ready for transmission, and the queue has at least one remaining bandwidth segment, and furthermore the number of transmission opportunities for the queue is decremented by at least one. Upon transmitting a frame, the number of bandwidth segments for the queue is decreased by the number of bandwidth segments in the frame. If a queue has no frame ready for transmission, then the queue may be either penalized, in which case the number of bandwidth segments for the queue is reduced, or forced to forfeit its bandwidth segments, in which case any remaining bandwidth segments are reallocated to other queues and the number of bandwidth segments and the number of transmission opportunities for the queue are set to zero.

REFERENCES:
patent: 5793747 (1998-08-01), Kline
patent: 5956341 (1999-09-01), Galand et al.
patent: 5999534 (1999-12-01), Kim
patent: 6018527 (2000-01-01), Yin et al.
patent: 6061330 (2000-05-01), Johansson
patent: 6134217 (2000-10-01), Stiliadis et al.
patent: 6188698 (2001-02-01), Galand et al.
patent: 6201793 (2001-03-01), Chen et al.
patent: 6246687 (2001-06-01), Siu
patent: 6304552 (2001-10-01), Chapman et al.
patent: 6438106 (2002-08-01), Pillar et al.
patent: 6470016 (2002-10-01), Kalkunte et al.
patent: 6477144 (2002-11-01), Morris et al.
patent: 6526061 (2003-02-01), Briem
Shreedhar, et al; “Efficient Fair Queuing Using Deficit Round Robin”; pp. 1-22, Oct. 16, 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

Servicing output queues dynamically according to bandwidth... does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Servicing output queues dynamically according to bandwidth..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Servicing output queues dynamically according to bandwidth... will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-3443031

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