Methods and apparatus for shaping queued packets using a two-dimensional RAM-based search engine
Number of patents in Portfolio can not be more than 2000
United States of America Patent
Stats
-
Apr 9, 2002
Grant Date -
N/A
app pub date -
Nov 4, 1998
filing date -
Nov 5, 1997
priority date (Note) -
In Force
status (Latency Note)
Importance
Abstract
A two (2) dimensional shaper uses a hierarchical searching technique to find the first memory location of the calendar queue with a validity bit of '1' (that is, the lowest time stamp). The bit string at any level l (l.noteq.0) can be stored in a RAM of size g.sub.l M.sub.l-1. The string at the highest level in the hierarchy (l=0) can be stored in an M.sub.0 bit register. The number of address bits needed to address any bit at a level l may be expressed as: ##EQU1## In this way, the search time depends on the number L of levels. Such a scheduler can schedule large numbers of flows to be placed on a high-speed data link (that is, with a small time slot).
First Claim
Family
International Classification(s)
Cited Art Landscape
Patent Citation Ranking
Advertisement
Advertisement
Advertisement
Recipient Email Address
Recipient Email Address
Comment
Recipient Email Address
Add to Portfolio(s)
To add this patent to one, or more, of your portfolios, simply click the add button.
This Patent is in these Portfolios:
Add to additional portfolios:
Last Refreshed On:
Changes done successfully