Buffer management policy for shared memory switches
OwnerYishay Mansour, Alexander Kesselmaninventors
Life of this patent
Estimating the term…
Loading patent…
OwnerYishay Mansour, Alexander Kesselmaninventors
Estimating the term…
A method for allocating space among a plurality of queues in a buffer includes sorting all the queues of the buffer according to size, thereby to establish a sorted order of the queues. At least one group of the queues is selected, consisting of a given number of the queues in accordance with the sorted order. A portion of the space in the buffer is allocated to the group, responsive to the number of the queues in the group. A data packet is accepted into one of the queues in the group responsive to whether the data packet will cause the space occupied in the buffer by the queues in the group to exceed the allocated portion of the space.
A method for allocating space among a plurality of queues in a buffer, comprising:
A method for allocating space among N output queues in a buffer of size M, which comprises:
16 A method according to claim 15, wherein said known buffer management policy is chosen from a group consisting of complete partitioning (CP), sharing with maximum queue lengths (SMXQ), sharing with minimum allocation (SMA), sharing with maximum queue length and minimum allocation (SMQMA), and dynamic threshold (DT).
A shared memory switch comprising:
Dependencies are inferred from the claim text.