×

Flexible and hierarchical dynamic buffer allocation

  • US 8,149,710 B2
  • Filed: 07/05/2007
  • Issued: 04/03/2012
  • Est. Priority Date: 07/05/2007
  • Status: Active Grant
First Claim
Patent Images

1. A method, comprising:

  • receiving a first set of inputs indicating a first plurality of entities and a first traffic behavior implemented by each of the first plurality of entities;

    determining a first region of a buffer corresponding to the first traffic behavior;

    assigning the first plurality of entities to the first region;

    determining hierarchical relationships among the first plurality of entities implementing the first traffic behavior, wherein the hierarchical relationships are defined via a tree data structure;

    determining a first shared buffer space of the first region;

    assigning at least one threshold for each of the first plurality of entities, the threshold comprising a maximum amount of the first shared buffer space that may be allocated to an entity; and

    configuring a logic device to allocate the first shared buffer space dynamically according to the hierarchical relationships and the thresholds.

View all claims
  • 1 Assignment
Timeline View
Assignment View
    ×
    ×